./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_1+newton_3_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea3c24aa-666f-4093-be40-70cff6fa4f5a/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea3c24aa-666f-4093-be40-70cff6fa4f5a/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea3c24aa-666f-4093-be40-70cff6fa4f5a/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea3c24aa-666f-4093-be40-70cff6fa4f5a/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_1+newton_3_1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea3c24aa-666f-4093-be40-70cff6fa4f5a/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea3c24aa-666f-4093-be40-70cff6fa4f5a/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 353cc018d334cc7a981957992a6877492a13119a8e3524540eab203ce1072cbf --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:08:38,786 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:08:38,846 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea3c24aa-666f-4093-be40-70cff6fa4f5a/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 04:08:38,851 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:08:38,851 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:08:38,875 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:08:38,875 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:08:38,876 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:08:38,876 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:08:38,877 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:08:38,877 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:08:38,878 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:08:38,879 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:08:38,879 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:08:38,880 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:08:38,880 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:08:38,881 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:08:38,881 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:08:38,882 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:08:38,882 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:08:38,883 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:08:38,883 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:08:38,884 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:08:38,884 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:08:38,885 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:08:38,885 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:08:38,886 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:08:38,886 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:08:38,886 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:08:38,887 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:08:38,887 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:08:38,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:08:38,888 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:08:38,888 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:08:38,888 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:08:38,888 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:08:38,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:08:38,889 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:08:38,889 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:08:38,889 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:08:38,889 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:08:38,890 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:08:38,890 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea3c24aa-666f-4093-be40-70cff6fa4f5a/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea3c24aa-666f-4093-be40-70cff6fa4f5a/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 353cc018d334cc7a981957992a6877492a13119a8e3524540eab203ce1072cbf [2023-11-29 04:08:39,085 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:08:39,104 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:08:39,106 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:08:39,107 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:08:39,107 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:08:39,109 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea3c24aa-666f-4093-be40-70cff6fa4f5a/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/combinations/gcd_1+newton_3_1.i [2023-11-29 04:08:41,865 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:08:42,023 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:08:42,023 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea3c24aa-666f-4093-be40-70cff6fa4f5a/sv-benchmarks/c/combinations/gcd_1+newton_3_1.i [2023-11-29 04:08:42,030 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea3c24aa-666f-4093-be40-70cff6fa4f5a/bin/uautomizer-verify-BQ2R08f2Ya/data/65ed0ae7b/33a7354020be48a8aa9c015087e2f8c0/FLAGad4927c25 [2023-11-29 04:08:42,043 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea3c24aa-666f-4093-be40-70cff6fa4f5a/bin/uautomizer-verify-BQ2R08f2Ya/data/65ed0ae7b/33a7354020be48a8aa9c015087e2f8c0 [2023-11-29 04:08:42,045 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:08:42,047 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:08:42,048 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:08:42,048 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:08:42,052 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:08:42,053 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:08:42" (1/1) ... [2023-11-29 04:08:42,054 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@611a4b07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:08:42, skipping insertion in model container [2023-11-29 04:08:42,054 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:08:42" (1/1) ... [2023-11-29 04:08:42,074 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:08:42,195 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea3c24aa-666f-4093-be40-70cff6fa4f5a/sv-benchmarks/c/combinations/gcd_1+newton_3_1.i[1226,1239] [2023-11-29 04:08:42,218 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea3c24aa-666f-4093-be40-70cff6fa4f5a/sv-benchmarks/c/combinations/gcd_1+newton_3_1.i[2828,2841] [2023-11-29 04:08:42,219 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:08:42,229 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:08:42,240 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea3c24aa-666f-4093-be40-70cff6fa4f5a/sv-benchmarks/c/combinations/gcd_1+newton_3_1.i[1226,1239] [2023-11-29 04:08:42,251 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea3c24aa-666f-4093-be40-70cff6fa4f5a/sv-benchmarks/c/combinations/gcd_1+newton_3_1.i[2828,2841] [2023-11-29 04:08:42,252 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:08:42,267 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:08:42,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:08:42 WrapperNode [2023-11-29 04:08:42,267 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:08:42,269 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:08:42,269 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:08:42,269 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:08:42,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:08:42" (1/1) ... [2023-11-29 04:08:42,282 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:08:42" (1/1) ... [2023-11-29 04:08:42,306 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 93 [2023-11-29 04:08:42,307 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:08:42,307 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:08:42,307 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:08:42,308 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:08:42,317 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:08:42" (1/1) ... [2023-11-29 04:08:42,317 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:08:42" (1/1) ... [2023-11-29 04:08:42,319 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:08:42" (1/1) ... [2023-11-29 04:08:42,331 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2023-11-29 04:08:42,332 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:08:42" (1/1) ... [2023-11-29 04:08:42,332 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:08:42" (1/1) ... [2023-11-29 04:08:42,338 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:08:42" (1/1) ... [2023-11-29 04:08:42,341 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:08:42" (1/1) ... [2023-11-29 04:08:42,343 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:08:42" (1/1) ... [2023-11-29 04:08:42,344 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:08:42" (1/1) ... [2023-11-29 04:08:42,347 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:08:42,348 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:08:42,348 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:08:42,348 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:08:42,349 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:08:42" (1/1) ... [2023-11-29 04:08:42,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:08:42,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea3c24aa-666f-4093-be40-70cff6fa4f5a/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:08:42,376 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea3c24aa-666f-4093-be40-70cff6fa4f5a/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:08:42,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea3c24aa-666f-4093-be40-70cff6fa4f5a/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:08:42,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:08:42,406 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2023-11-29 04:08:42,406 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2023-11-29 04:08:42,406 INFO L130 BoogieDeclarations]: Found specification of procedure f [2023-11-29 04:08:42,406 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2023-11-29 04:08:42,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 04:08:42,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 04:08:42,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:08:42,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:08:42,470 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:08:42,472 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:08:42,621 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:08:42,650 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:08:42,651 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 04:08:42,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:08:42 BoogieIcfgContainer [2023-11-29 04:08:42,651 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:08:42,654 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:08:42,654 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:08:42,657 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:08:42,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:08:42" (1/3) ... [2023-11-29 04:08:42,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d0881c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:08:42, skipping insertion in model container [2023-11-29 04:08:42,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:08:42" (2/3) ... [2023-11-29 04:08:42,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d0881c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:08:42, skipping insertion in model container [2023-11-29 04:08:42,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:08:42" (3/3) ... [2023-11-29 04:08:42,659 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_1+newton_3_1.i [2023-11-29 04:08:42,674 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:08:42,674 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-29 04:08:42,716 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:08:42,721 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@517b9cf9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:08:42,721 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-29 04:08:42,725 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 22 states have (on average 1.5) internal successors, (33), 24 states have internal predecessors, (33), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 04:08:42,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 04:08:42,731 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:08:42,731 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:08:42,732 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:08:42,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:08:42,736 INFO L85 PathProgramCache]: Analyzing trace with hash 117379001, now seen corresponding path program 1 times [2023-11-29 04:08:42,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:08:42,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995850394] [2023-11-29 04:08:42,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:08:42,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:08:42,824 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 04:08:42,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1890778944] [2023-11-29 04:08:42,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:08:42,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:08:42,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea3c24aa-666f-4093-be40-70cff6fa4f5a/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:08:42,827 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea3c24aa-666f-4093-be40-70cff6fa4f5a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:08:42,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea3c24aa-666f-4093-be40-70cff6fa4f5a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 04:08:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:42,901 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 04:08:42,905 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:08:42,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:08:42,924 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:08:42,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:08:42,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995850394] [2023-11-29 04:08:42,925 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 04:08:42,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890778944] [2023-11-29 04:08:42,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890778944] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:08:42,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:08:42,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:08:42,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530996879] [2023-11-29 04:08:42,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:08:42,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 04:08:42,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:08:42,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 04:08:42,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 04:08:42,965 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.5) internal successors, (33), 24 states have internal predecessors, (33), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:42,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:08:42,999 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2023-11-29 04:08:43,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 04:08:43,001 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-29 04:08:43,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:08:43,008 INFO L225 Difference]: With dead ends: 59 [2023-11-29 04:08:43,009 INFO L226 Difference]: Without dead ends: 28 [2023-11-29 04:08:43,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 04:08:43,015 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:08:43,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:08:43,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-29 04:08:43,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-11-29 04:08:43,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 04:08:43,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2023-11-29 04:08:43,085 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 9 [2023-11-29 04:08:43,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:08:43,085 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2023-11-29 04:08:43,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:43,086 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2023-11-29 04:08:43,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 04:08:43,087 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:08:43,087 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:08:43,093 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea3c24aa-666f-4093-be40-70cff6fa4f5a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 04:08:43,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea3c24aa-666f-4093-be40-70cff6fa4f5a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-11-29 04:08:43,288 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:08:43,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:08:43,289 INFO L85 PathProgramCache]: Analyzing trace with hash 117259837, now seen corresponding path program 1 times [2023-11-29 04:08:43,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:08:43,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534067248] [2023-11-29 04:08:43,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:08:43,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:08:43,315 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 04:08:43,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1551663344] [2023-11-29 04:08:43,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:08:43,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:08:43,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea3c24aa-666f-4093-be40-70cff6fa4f5a/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:08:43,317 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea3c24aa-666f-4093-be40-70cff6fa4f5a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:08:43,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea3c24aa-666f-4093-be40-70cff6fa4f5a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 04:08:43,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:43,379 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:08:43,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:08:43,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:08:43,417 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:08:43,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:08:43,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534067248] [2023-11-29 04:08:43,418 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 04:08:43,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551663344] [2023-11-29 04:08:43,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551663344] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:08:43,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:08:43,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:08:43,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788804504] [2023-11-29 04:08:43,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:08:43,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:08:43,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:08:43,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:08:43,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:08:43,421 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:43,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:08:43,443 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2023-11-29 04:08:43,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:08:43,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-29 04:08:43,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:08:43,445 INFO L225 Difference]: With dead ends: 34 [2023-11-29 04:08:43,445 INFO L226 Difference]: Without dead ends: 29 [2023-11-29 04:08:43,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:08:43,447 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:08:43,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 50 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:08:43,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-29 04:08:43,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-11-29 04:08:43,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 04:08:43,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2023-11-29 04:08:43,455 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 9 [2023-11-29 04:08:43,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:08:43,456 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2023-11-29 04:08:43,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:43,456 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2023-11-29 04:08:43,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 04:08:43,457 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:08:43,457 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:08:43,462 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea3c24aa-666f-4093-be40-70cff6fa4f5a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-29 04:08:43,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea3c24aa-666f-4093-be40-70cff6fa4f5a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:08:43,662 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:08:43,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:08:43,663 INFO L85 PathProgramCache]: Analyzing trace with hash -603037507, now seen corresponding path program 1 times [2023-11-29 04:08:43,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:08:43,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742935897] [2023-11-29 04:08:43,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:08:43,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:08:43,673 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 04:08:43,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2109994811] [2023-11-29 04:08:43,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:08:43,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:08:43,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea3c24aa-666f-4093-be40-70cff6fa4f5a/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:08:43,674 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea3c24aa-666f-4093-be40-70cff6fa4f5a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:08:43,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea3c24aa-666f-4093-be40-70cff6fa4f5a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 04:08:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:08:43,732 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 04:08:43,734 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:08:43,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:08:43,777 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:08:43,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:08:43,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:08:43,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742935897] [2023-11-29 04:08:43,806 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 04:08:43,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109994811] [2023-11-29 04:08:43,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109994811] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:08:43,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:08:43,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2023-11-29 04:08:43,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474407874] [2023-11-29 04:08:43,807 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:08:43,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:08:43,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:08:43,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:08:43,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:08:43,809 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:43,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:08:43,854 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2023-11-29 04:08:43,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:08:43,855 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-29 04:08:43,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:08:43,856 INFO L225 Difference]: With dead ends: 34 [2023-11-29 04:08:43,856 INFO L226 Difference]: Without dead ends: 30 [2023-11-29 04:08:43,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:08:43,858 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:08:43,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 98 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:08:43,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-29 04:08:43,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-11-29 04:08:43,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 04:08:43,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2023-11-29 04:08:43,865 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 10 [2023-11-29 04:08:43,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:08:43,866 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2023-11-29 04:08:43,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:08:43,866 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2023-11-29 04:08:43,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 04:08:43,867 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:08:43,867 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:08:43,873 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea3c24aa-666f-4093-be40-70cff6fa4f5a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 04:08:44,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea3c24aa-666f-4093-be40-70cff6fa4f5a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:08:44,068 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:08:44,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:08:44,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1514676993, now seen corresponding path program 2 times [2023-11-29 04:08:44,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:08:44,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602920784] [2023-11-29 04:08:44,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:08:44,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:08:44,080 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 04:08:44,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1893953835] [2023-11-29 04:08:44,080 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:08:44,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:08:44,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea3c24aa-666f-4093-be40-70cff6fa4f5a/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:08:44,082 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea3c24aa-666f-4093-be40-70cff6fa4f5a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:08:44,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea3c24aa-666f-4093-be40-70cff6fa4f5a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 04:08:47,701 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 04:08:47,701 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:08:47,704 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-29 04:08:47,707 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:09:19,328 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:09:52,000 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:10:04,886 WARN L854 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int) (|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (v_y_1 Int)) (let ((.cse0 (* 256 v_y_1)) (.cse1 (* 255 |v_ULTIMATE.start_gcd_test_~a#1_19|))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_19|) (<= (+ .cse0 .cse1 1) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |v_ULTIMATE.start_gcd_test_~a#1_20|) 256)) (<= 0 (+ .cse0 .cse1 128)) (<= 1 |v_ULTIMATE.start_gcd_test_~a#1_20|) (= 0 (mod (+ .cse0 .cse1) |v_ULTIMATE.start_gcd_test_~a#1_20|)) (<= |v_ULTIMATE.start_gcd_test_~a#1_19| 127) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|) 256) |c_ULTIMATE.start_gcd_test_~b#1|)))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2023-11-29 04:10:10,582 WARN L293 SmtUtils]: Spent 5.68s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:10:18,590 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:10:32,308 WARN L293 SmtUtils]: Spent 5.60s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:10:48,573 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int) (|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (v_y_1 Int)) (let ((.cse0 (* 256 v_y_1)) (.cse1 (* 255 |v_ULTIMATE.start_gcd_test_~a#1_19|))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_19|) (<= (+ .cse0 .cse1 1) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |v_ULTIMATE.start_gcd_test_~a#1_20|) 256)) (<= 0 (+ .cse0 .cse1 128)) (<= 1 |v_ULTIMATE.start_gcd_test_~a#1_20|) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|) 256) 0) (= 0 (mod (+ .cse0 .cse1) |v_ULTIMATE.start_gcd_test_~a#1_20|)) (<= |v_ULTIMATE.start_gcd_test_~a#1_19| 127)))) (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2023-11-29 04:10:52,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-29 04:10:52,230 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:11:27,230 WARN L293 SmtUtils]: Spent 5.00s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:11:33,044 WARN L293 SmtUtils]: Spent 5.29s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:11:45,675 WARN L293 SmtUtils]: Spent 5.20s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:11:51,808 WARN L293 SmtUtils]: Spent 5.36s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:12:20,992 WARN L293 SmtUtils]: Spent 6.76s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:12:43,769 WARN L293 SmtUtils]: Spent 5.53s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:13:04,832 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:14:42,488 WARN L293 SmtUtils]: Spent 5.22s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:14:50,801 WARN L293 SmtUtils]: Spent 5.17s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:15:02,910 WARN L876 $PredicateComparison]: unable to prove that (or (let ((.cse26 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse25 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1)) (.cse28 (mod (+ .cse26 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256)) (.cse27 (mod (+ .cse26 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse19 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse27) 256) 0))) (.cse21 (= .cse27 0)) (.cse23 (= .cse28 0)) (.cse24 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse28) 256) 0))) (.cse9 (< 0 .cse25))) (let ((.cse8 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse28)) 256) 0))) (.cse0 (< .cse28 128)) (.cse10 (< 127 .cse28)) (.cse5 (< .cse27 128)) (.cse6 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse12 (or .cse23 .cse24 .cse9)) (.cse13 (or .cse19 .cse21 .cse9)) (.cse1 (< 127 .cse27)) (.cse14 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse15 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse27)) 256) 0))) (.cse16 (mod .cse26 256))) (and (or (let ((.cse7 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse16)) 256) 0)) (< |c_ULTIMATE.start_gcd_test_~a#1| 0)))) (let ((.cse4 (or .cse14 (and (or .cse15 .cse9) .cse7))) (.cse3 (or (and .cse7 .cse13) .cse14))) (and (or .cse0 (let ((.cse2 (or .cse6 (and .cse7 (or .cse8 .cse9))))) (and (or .cse1 (and .cse2 .cse3)) (or (and .cse4 .cse2) .cse5)))) (or .cse10 (let ((.cse11 (or (and .cse7 .cse12) .cse6))) (and (or .cse5 (and .cse11 .cse4)) (or (and .cse11 .cse3) .cse1))))))) (< .cse16 128)) (or (< 127 .cse16) (let ((.cse20 (= .cse26 0))) (let ((.cse18 (or (and (<= .cse25 0) (not .cse20)) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse16) 256) 0)) (= .cse16 0)))) (let ((.cse22 (or .cse14 (and .cse18 (or .cse20 .cse15 .cse9))))) (and (or (let ((.cse17 (or (and .cse18 (or .cse20 .cse8 .cse9)) .cse6))) (and (or .cse1 (and .cse17 (or .cse14 (and .cse18 (or .cse19 .cse20 .cse21 .cse9))))) (or (and .cse17 .cse22) .cse5))) .cse0) (or .cse10 (and (or (and (or (and (or .cse20 .cse23 .cse24 .cse9) .cse18) .cse6) .cse22) .cse5) (or (and (or .cse6 (and .cse18 .cse12)) (or (and .cse13 .cse18) .cse14)) .cse1))))))))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) is different from true [2023-11-29 04:16:10,750 WARN L293 SmtUtils]: Spent 36.37s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 04:16:42,395 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:17:04,222 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:18:02,824 WARN L293 SmtUtils]: Spent 27.10s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 04:18:14,859 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:18:51,736 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:19:25,058 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main1_~y~0#1_11| Int) (v_z_7 Int) (v_y_7 Int)) (let ((.cse0 (mod (mod v_z_7 |v_ULTIMATE.start_main1_~y~0#1_11|) 256)) (.cse1 (* 255 v_z_7)) (.cse2 (* 256 v_y_7))) (or (= .cse0 0) (not (= (mod (mod |v_ULTIMATE.start_main1_~y~0#1_11| .cse0) 256) 0)) (< v_z_7 0) (< (+ .cse1 128 .cse2) 0) (< 0 (+ .cse1 .cse2 1)) (< |v_ULTIMATE.start_main1_~y~0#1_11| 1) (not (= (mod (+ .cse1 .cse2) |v_ULTIMATE.start_main1_~y~0#1_11|) 0)) (< 127 v_z_7)))) is different from false [2023-11-29 04:19:29,063 WARN L876 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main1_~y~0#1_11| Int) (v_z_7 Int) (v_y_7 Int)) (let ((.cse0 (mod (mod v_z_7 |v_ULTIMATE.start_main1_~y~0#1_11|) 256)) (.cse1 (* 255 v_z_7)) (.cse2 (* 256 v_y_7))) (or (= .cse0 0) (not (= (mod (mod |v_ULTIMATE.start_main1_~y~0#1_11| .cse0) 256) 0)) (< v_z_7 0) (< (+ .cse1 128 .cse2) 0) (< 0 (+ .cse1 .cse2 1)) (< |v_ULTIMATE.start_main1_~y~0#1_11| 1) (not (= (mod (+ .cse1 .cse2) |v_ULTIMATE.start_main1_~y~0#1_11|) 0)) (< 127 v_z_7)))) is different from true [2023-11-29 04:19:29,063 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-29 04:19:29,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:19:29,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602920784] [2023-11-29 04:19:29,064 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 04:19:29,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893953835] [2023-11-29 04:19:29,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893953835] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:19:29,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:19:29,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2023-11-29 04:19:29,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479990623] [2023-11-29 04:19:29,064 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:19:29,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 04:19:29,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:19:29,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 04:19:29,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=96, Unknown=17, NotChecked=92, Total=240 [2023-11-29 04:19:29,066 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:33,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2023-11-29 04:20:05,240 WARN L293 SmtUtils]: Spent 28.85s on a formula simplification. DAG size of input: 45 DAG size of output: 9 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 04:20:09,257 WARN L854 $PredicateComparison]: unable to prove that (and (or (not (= (mod |c_ULTIMATE.start_main1_~x~0#1| |c_ULTIMATE.start_main1_~y~0#1|) 0)) (let ((.cse0 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (and (let ((.cse1 (mod (mod .cse0 |c_ULTIMATE.start_main1_~y~0#1|) 256))) (or (< 127 .cse0) (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse1) 256) 0)) (= .cse1 0))) (let ((.cse2 (mod (+ .cse0 (- 256)) |c_ULTIMATE.start_main1_~y~0#1|))) (or (< .cse0 128) (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| (+ (- 256) (mod (+ .cse2 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) 256))) 256) 0)) (= .cse2 0))))) (< 0 (+ |c_ULTIMATE.start_main1_~x~0#1| 1)) (< |c_ULTIMATE.start_main1_~y~0#1| 1)) (= (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|) 0) (<= |c_ULTIMATE.start_gcd_test_~b#1| 127) (<= 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 128)) (or (< |c_ULTIMATE.start_gcd_test_~b#1| 0) (= |c_ULTIMATE.start_gcd_test_~b#1| 0) (< 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1)) (let ((.cse3 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (and (let ((.cse4 (mod (mod .cse3 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< 127 .cse3) (= 0 .cse4) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse4) 256) 0)))) (let ((.cse5 (mod (+ .cse3 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse5 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) 256) 0)) (= .cse5 0) (< .cse3 128)))))) (<= 0 (+ 128 |c_ULTIMATE.start_main1_~x~0#1|)) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (<= 1 |c_ULTIMATE.start_gcd_test_~b#1|)) is different from false [2023-11-29 04:20:13,262 WARN L876 $PredicateComparison]: unable to prove that (and (or (not (= (mod |c_ULTIMATE.start_main1_~x~0#1| |c_ULTIMATE.start_main1_~y~0#1|) 0)) (let ((.cse0 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (and (let ((.cse1 (mod (mod .cse0 |c_ULTIMATE.start_main1_~y~0#1|) 256))) (or (< 127 .cse0) (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse1) 256) 0)) (= .cse1 0))) (let ((.cse2 (mod (+ .cse0 (- 256)) |c_ULTIMATE.start_main1_~y~0#1|))) (or (< .cse0 128) (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| (+ (- 256) (mod (+ .cse2 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) 256))) 256) 0)) (= .cse2 0))))) (< 0 (+ |c_ULTIMATE.start_main1_~x~0#1| 1)) (< |c_ULTIMATE.start_main1_~y~0#1| 1)) (= (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|) 0) (<= |c_ULTIMATE.start_gcd_test_~b#1| 127) (<= 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 128)) (or (< |c_ULTIMATE.start_gcd_test_~b#1| 0) (= |c_ULTIMATE.start_gcd_test_~b#1| 0) (< 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1)) (let ((.cse3 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (and (let ((.cse4 (mod (mod .cse3 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< 127 .cse3) (= 0 .cse4) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse4) 256) 0)))) (let ((.cse5 (mod (+ .cse3 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse5 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) 256) 0)) (= .cse5 0) (< .cse3 128)))))) (<= 0 (+ 128 |c_ULTIMATE.start_main1_~x~0#1|)) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (<= 1 |c_ULTIMATE.start_gcd_test_~b#1|)) is different from true [2023-11-29 04:21:14,633 WARN L293 SmtUtils]: Spent 39.69s on a formula simplification. DAG size of input: 101 DAG size of output: 54 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 04:21:19,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 04:21:23,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 04:21:56,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 04:22:00,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 04:22:04,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 04:22:05,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 04:22:44,959 WARN L293 SmtUtils]: Spent 30.68s on a formula simplification. DAG size of input: 58 DAG size of output: 55 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 04:22:46,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-11-29 04:22:50,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Real, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-11-29 04:22:55,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 04:22:59,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 04:23:03,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 04:23:07,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 04:23:11,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 04:23:15,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 04:23:19,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 04:23:23,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 04:23:27,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2023-11-29 04:23:31,068 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_gcd_test_~b#1| 0))) (and (or (< |c_ULTIMATE.start_gcd_test_~b#1| 0) .cse0 (< 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1)) (let ((.cse1 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (and (let ((.cse2 (mod (mod .cse1 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< 127 .cse1) (= 0 .cse2) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse2) 256) 0)))) (let ((.cse3 (mod (+ .cse1 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse3 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) 256) 0)) (= .cse3 0) (< .cse1 128)))))) (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int) (|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (v_y_1 Int)) (let ((.cse4 (* 256 v_y_1)) (.cse5 (* 255 |v_ULTIMATE.start_gcd_test_~a#1_19|))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_19|) (<= (+ .cse4 .cse5 1) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |v_ULTIMATE.start_gcd_test_~a#1_20|) 256)) (<= 0 (+ .cse4 .cse5 128)) (<= 1 |v_ULTIMATE.start_gcd_test_~a#1_20|) (= 0 (mod (+ .cse4 .cse5) |v_ULTIMATE.start_gcd_test_~a#1_20|)) (<= |v_ULTIMATE.start_gcd_test_~a#1_19| 127) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| |c_ULTIMATE.start_gcd_test_~a#1|) 256) |c_ULTIMATE.start_gcd_test_~b#1|)))) (or (not .cse0) (< 127 |c_ULTIMATE.start_gcd_test_~a#1|) (< (+ |c_ULTIMATE.start_gcd_test_~a#1| 128) 0)) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0)))) is different from false [2023-11-29 04:23:35,201 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse7 (mod .cse15 256))) (let ((.cse2 (< 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1))) (.cse6 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) (.cse0 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse17 (= .cse7 0)) (.cse1 (= |c_ULTIMATE.start_gcd_test_~b#1| 0))) (and (or .cse0 .cse1 .cse2 (let ((.cse3 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (and (let ((.cse4 (mod (mod .cse3 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< 127 .cse3) (= 0 .cse4) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse4) 256) 0)))) (let ((.cse5 (mod (+ .cse3 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse5 .cse6) 256))) 256) 0)) (= .cse5 0) (< .cse3 128)))))) (or (let ((.cse19 (mod (+ .cse15 .cse6) 256))) (let ((.cse13 (< .cse19 128)) (.cse14 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse19)) 256) 0))) (.cse8 (< 127 .cse19)) (.cse11 (= .cse19 0)) (.cse12 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse19) 256) 0))) (.cse16 (< |c_ULTIMATE.start_gcd_test_~a#1| 0))) (and (or (< 127 .cse7) (let ((.cse9 (or .cse16 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse7) 256) 0)) .cse17)) (.cse10 (= .cse15 0))) (and (or .cse8 (and .cse9 (or .cse10 .cse11 .cse12 .cse2))) (or .cse13 (and .cse9 (or .cse10 .cse14 .cse2)))))) (or (let ((.cse18 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse7)) 256) 0)) .cse16))) (and (or .cse13 (and .cse18 (or .cse14 .cse2))) (or .cse8 (and .cse18 (or .cse11 .cse12 .cse2))))) (< .cse7 128))))) .cse0 .cse1) (or (< 127 |c_ULTIMATE.start_gcd_test_~b#1|) (not .cse17) (< (+ |c_ULTIMATE.start_gcd_test_~b#1| 128) 0) .cse1))))) is different from false [2023-11-29 04:23:39,208 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse15 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse7 (mod .cse15 256))) (let ((.cse2 (< 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 1))) (.cse6 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) (.cse0 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse17 (= .cse7 0)) (.cse1 (= |c_ULTIMATE.start_gcd_test_~b#1| 0))) (and (or .cse0 .cse1 .cse2 (let ((.cse3 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (and (let ((.cse4 (mod (mod .cse3 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< 127 .cse3) (= 0 .cse4) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse4) 256) 0)))) (let ((.cse5 (mod (+ .cse3 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse5 .cse6) 256))) 256) 0)) (= .cse5 0) (< .cse3 128)))))) (or (let ((.cse19 (mod (+ .cse15 .cse6) 256))) (let ((.cse13 (< .cse19 128)) (.cse14 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse19)) 256) 0))) (.cse8 (< 127 .cse19)) (.cse11 (= .cse19 0)) (.cse12 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse19) 256) 0))) (.cse16 (< |c_ULTIMATE.start_gcd_test_~a#1| 0))) (and (or (< 127 .cse7) (let ((.cse9 (or .cse16 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse7) 256) 0)) .cse17)) (.cse10 (= .cse15 0))) (and (or .cse8 (and .cse9 (or .cse10 .cse11 .cse12 .cse2))) (or .cse13 (and .cse9 (or .cse10 .cse14 .cse2)))))) (or (let ((.cse18 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse7)) 256) 0)) .cse16))) (and (or .cse13 (and .cse18 (or .cse14 .cse2))) (or .cse8 (and .cse18 (or .cse11 .cse12 .cse2))))) (< .cse7 128))))) .cse0 .cse1) (or (< 127 |c_ULTIMATE.start_gcd_test_~b#1|) (not .cse17) (< (+ |c_ULTIMATE.start_gcd_test_~b#1| 128) 0) .cse1))))) is different from true [2023-11-29 04:23:43,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Real, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-11-29 04:23:44,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:23:44,040 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2023-11-29 04:23:44,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 04:23:44,040 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-29 04:23:44,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:23:44,041 INFO L225 Difference]: With dead ends: 38 [2023-11-29 04:23:44,041 INFO L226 Difference]: Without dead ends: 34 [2023-11-29 04:23:44,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 340.0s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=28, NotChecked=224, Total=462 [2023-11-29 04:23:44,043 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 3 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 74.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 176 IncrementalHoareTripleChecker+Unchecked, 75.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:23:44,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 218 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 16 Unknown, 176 Unchecked, 75.0s Time] [2023-11-29 04:23:44,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-11-29 04:23:44,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2023-11-29 04:23:44,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 04:23:44,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2023-11-29 04:23:44,052 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 11 [2023-11-29 04:23:44,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:23:44,052 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2023-11-29 04:23:44,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:23:44,053 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2023-11-29 04:23:44,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 04:23:44,053 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:23:44,053 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:23:44,059 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea3c24aa-666f-4093-be40-70cff6fa4f5a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 04:23:44,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea3c24aa-666f-4093-be40-70cff6fa4f5a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:23:44,254 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:23:44,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:23:44,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1970943677, now seen corresponding path program 1 times [2023-11-29 04:23:44,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:23:44,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402501013] [2023-11-29 04:23:44,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:23:44,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:23:44,263 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 04:23:44,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1182351541] [2023-11-29 04:23:44,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:23:44,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:23:44,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea3c24aa-666f-4093-be40-70cff6fa4f5a/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:23:44,264 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea3c24aa-666f-4093-be40-70cff6fa4f5a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:23:44,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea3c24aa-666f-4093-be40-70cff6fa4f5a/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 04:23:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:23:44,323 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-29 04:23:44,324 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:23:44,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:23:44,721 INFO L327 TraceCheckSpWp]: Computing backward predicates...