./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_2+newton_2_5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b54ec2dc-ffe6-4b56-9c0f-70b1bfb65b14/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b54ec2dc-ffe6-4b56-9c0f-70b1bfb65b14/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b54ec2dc-ffe6-4b56-9c0f-70b1bfb65b14/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b54ec2dc-ffe6-4b56-9c0f-70b1bfb65b14/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_2_5.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b54ec2dc-ffe6-4b56-9c0f-70b1bfb65b14/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b54ec2dc-ffe6-4b56-9c0f-70b1bfb65b14/bin/uautomizer-verify-aQ6SnzHsRB --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 de6f52d29ab8cbb588307c65427c40feccf3bbab41549d766ad7ad11f97b3a0b --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 04:36:14,999 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 04:36:15,067 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b54ec2dc-ffe6-4b56-9c0f-70b1bfb65b14/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-28 04:36:15,074 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 04:36:15,074 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 04:36:15,105 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 04:36:15,106 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 04:36:15,106 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 04:36:15,107 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 04:36:15,107 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 04:36:15,107 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 04:36:15,107 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 04:36:15,108 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 04:36:15,108 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 04:36:15,108 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 04:36:15,108 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 04:36:15,109 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 04:36:15,109 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 04:36:15,109 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 04:36:15,109 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 04:36:15,109 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 04:36:15,109 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 04:36:15,110 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 04:36:15,110 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 04:36:15,110 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 04:36:15,110 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 04:36:15,114 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 04:36:15,114 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 04:36:15,114 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 04:36:15,114 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:36:15,114 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:36:15,114 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:36:15,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:36:15,115 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 04:36:15,115 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:36:15,115 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:36:15,115 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:36:15,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:36:15,115 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 04:36:15,115 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 04:36:15,115 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 04:36:15,116 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 04:36:15,116 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 04:36:15,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 04:36:15,116 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 04:36:15,116 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 04:36:15,116 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 04:36:15,116 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 04:36:15,116 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_b54ec2dc-ffe6-4b56-9c0f-70b1bfb65b14/bin/uautomizer-verify-aQ6SnzHsRB 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 -> de6f52d29ab8cbb588307c65427c40feccf3bbab41549d766ad7ad11f97b3a0b [2024-11-28 04:36:15,479 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 04:36:15,497 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 04:36:15,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 04:36:15,503 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 04:36:15,504 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 04:36:15,507 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b54ec2dc-ffe6-4b56-9c0f-70b1bfb65b14/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/combinations/gcd_2+newton_2_5.i [2024-11-28 04:36:18,824 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b54ec2dc-ffe6-4b56-9c0f-70b1bfb65b14/bin/uautomizer-verify-aQ6SnzHsRB/data/8edfe48c5/93966fefaa354a65bfc55cb82f335a33/FLAGe238cc763 [2024-11-28 04:36:19,156 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 04:36:19,157 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b54ec2dc-ffe6-4b56-9c0f-70b1bfb65b14/sv-benchmarks/c/combinations/gcd_2+newton_2_5.i [2024-11-28 04:36:19,167 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b54ec2dc-ffe6-4b56-9c0f-70b1bfb65b14/bin/uautomizer-verify-aQ6SnzHsRB/data/8edfe48c5/93966fefaa354a65bfc55cb82f335a33/FLAGe238cc763 [2024-11-28 04:36:19,184 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b54ec2dc-ffe6-4b56-9c0f-70b1bfb65b14/bin/uautomizer-verify-aQ6SnzHsRB/data/8edfe48c5/93966fefaa354a65bfc55cb82f335a33 [2024-11-28 04:36:19,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 04:36:19,189 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 04:36:19,191 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 04:36:19,191 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 04:36:19,197 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 04:36:19,198 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:36:19" (1/1) ... [2024-11-28 04:36:19,199 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@666a6b29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:36:19, skipping insertion in model container [2024-11-28 04:36:19,199 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:36:19" (1/1) ... [2024-11-28 04:36:19,221 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 04:36:19,416 WARN L250 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_b54ec2dc-ffe6-4b56-9c0f-70b1bfb65b14/sv-benchmarks/c/combinations/gcd_2+newton_2_5.i[1226,1239] [2024-11-28 04:36:19,456 WARN L250 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_b54ec2dc-ffe6-4b56-9c0f-70b1bfb65b14/sv-benchmarks/c/combinations/gcd_2+newton_2_5.i[2841,2854] [2024-11-28 04:36:19,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:36:19,472 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 04:36:19,485 WARN L250 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_b54ec2dc-ffe6-4b56-9c0f-70b1bfb65b14/sv-benchmarks/c/combinations/gcd_2+newton_2_5.i[1226,1239] [2024-11-28 04:36:19,499 WARN L250 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_b54ec2dc-ffe6-4b56-9c0f-70b1bfb65b14/sv-benchmarks/c/combinations/gcd_2+newton_2_5.i[2841,2854] [2024-11-28 04:36:19,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:36:19,519 INFO L204 MainTranslator]: Completed translation [2024-11-28 04:36:19,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:36:19 WrapperNode [2024-11-28 04:36:19,521 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 04:36:19,522 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 04:36:19,522 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 04:36:19,522 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 04:36:19,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:36:19" (1/1) ... [2024-11-28 04:36:19,539 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:36:19" (1/1) ... [2024-11-28 04:36:19,568 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 85 [2024-11-28 04:36:19,572 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 04:36:19,573 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 04:36:19,573 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 04:36:19,573 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 04:36:19,587 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:36:19" (1/1) ... [2024-11-28 04:36:19,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:36:19" (1/1) ... [2024-11-28 04:36:19,594 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:36:19" (1/1) ... [2024-11-28 04:36:19,621 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]. [2024-11-28 04:36:19,625 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:36:19" (1/1) ... [2024-11-28 04:36:19,625 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:36:19" (1/1) ... [2024-11-28 04:36:19,638 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:36:19" (1/1) ... [2024-11-28 04:36:19,639 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:36:19" (1/1) ... [2024-11-28 04:36:19,647 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:36:19" (1/1) ... [2024-11-28 04:36:19,649 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:36:19" (1/1) ... [2024-11-28 04:36:19,654 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:36:19" (1/1) ... [2024-11-28 04:36:19,656 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 04:36:19,661 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 04:36:19,661 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 04:36:19,661 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 04:36:19,662 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:36:19" (1/1) ... [2024-11-28 04:36:19,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:36:19,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b54ec2dc-ffe6-4b56-9c0f-70b1bfb65b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:36:19,707 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b54ec2dc-ffe6-4b56-9c0f-70b1bfb65b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 04:36:19,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b54ec2dc-ffe6-4b56-9c0f-70b1bfb65b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 04:36:19,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 04:36:19,757 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-11-28 04:36:19,757 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-11-28 04:36:19,757 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-28 04:36:19,757 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-28 04:36:19,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 04:36:19,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 04:36:19,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 04:36:19,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 04:36:19,857 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 04:36:19,860 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 04:36:20,163 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-11-28 04:36:20,164 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 04:36:20,178 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 04:36:20,178 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-28 04:36:20,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:36:20 BoogieIcfgContainer [2024-11-28 04:36:20,179 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 04:36:20,182 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 04:36:20,182 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 04:36:20,187 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 04:36:20,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:36:19" (1/3) ... [2024-11-28 04:36:20,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e33ae79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:36:20, skipping insertion in model container [2024-11-28 04:36:20,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:36:19" (2/3) ... [2024-11-28 04:36:20,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e33ae79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:36:20, skipping insertion in model container [2024-11-28 04:36:20,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:36:20" (3/3) ... [2024-11-28 04:36:20,191 INFO L128 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_2_5.i [2024-11-28 04:36:20,206 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 04:36:20,208 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG gcd_2+newton_2_5.i that has 3 procedures, 38 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2024-11-28 04:36:20,286 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 04:36:20,309 INFO L333 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, 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;@4a1ebaff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 04:36:20,309 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-28 04:36:20,315 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 04:36:20,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-28 04:36:20,323 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:36:20,324 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:36:20,326 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:36:20,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:36:20,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1679801867, now seen corresponding path program 1 times [2024-11-28 04:36:20,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:36:20,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228322835] [2024-11-28 04:36:20,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:36:20,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:36:20,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:36:20,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:36:20,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:36:20,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228322835] [2024-11-28 04:36:20,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228322835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:36:20,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:36:20,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:36:20,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820918985] [2024-11-28 04:36:20,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:36:20,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:36:20,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:36:20,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:36:20,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:36:20,762 INFO L87 Difference]: Start difference. First operand has 38 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) [2024-11-28 04:36:20,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:36:20,872 INFO L93 Difference]: Finished difference Result 75 states and 94 transitions. [2024-11-28 04:36:20,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:36:20,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 [2024-11-28 04:36:20,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:36:20,883 INFO L225 Difference]: With dead ends: 75 [2024-11-28 04:36:20,884 INFO L226 Difference]: Without dead ends: 32 [2024-11-28 04:36:20,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:36:20,895 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 5 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:36:20,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 108 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:36:20,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-28 04:36:20,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2024-11-28 04:36:20,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 04:36:20,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-11-28 04:36:20,955 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2024-11-28 04:36:20,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:36:20,955 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-11-28 04:36:20,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) [2024-11-28 04:36:20,956 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-11-28 04:36:20,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-28 04:36:20,958 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:36:20,958 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:36:20,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 04:36:20,959 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:36:20,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:36:20,962 INFO L85 PathProgramCache]: Analyzing trace with hash 95205495, now seen corresponding path program 1 times [2024-11-28 04:36:20,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:36:20,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982081264] [2024-11-28 04:36:20,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:36:20,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:36:21,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:36:21,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:36:21,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:36:21,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982081264] [2024-11-28 04:36:21,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982081264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:36:21,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:36:21,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:36:21,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272730608] [2024-11-28 04:36:21,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:36:21,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:36:21,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:36:21,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:36:21,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:36:21,190 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) [2024-11-28 04:36:21,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:36:21,234 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2024-11-28 04:36:21,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:36:21,236 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 [2024-11-28 04:36:21,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:36:21,237 INFO L225 Difference]: With dead ends: 38 [2024-11-28 04:36:21,237 INFO L226 Difference]: Without dead ends: 32 [2024-11-28 04:36:21,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:36:21,239 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 2 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:36:21,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 81 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:36:21,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-28 04:36:21,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2024-11-28 04:36:21,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 04:36:21,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2024-11-28 04:36:21,253 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 11 [2024-11-28 04:36:21,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:36:21,253 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2024-11-28 04:36:21,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) [2024-11-28 04:36:21,253 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2024-11-28 04:36:21,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-28 04:36:21,254 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:36:21,254 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:36:21,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 04:36:21,255 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:36:21,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:36:21,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1676333701, now seen corresponding path program 1 times [2024-11-28 04:36:21,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:36:21,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202164002] [2024-11-28 04:36:21,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:36:21,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:36:21,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:36:21,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:36:21,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:36:21,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202164002] [2024-11-28 04:36:21,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202164002] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:36:21,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745462929] [2024-11-28 04:36:21,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:36:21,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:36:21,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b54ec2dc-ffe6-4b56-9c0f-70b1bfb65b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:36:21,655 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b54ec2dc-ffe6-4b56-9c0f-70b1bfb65b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:36:21,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b54ec2dc-ffe6-4b56-9c0f-70b1bfb65b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 04:36:21,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:36:21,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-28 04:36:21,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:36:21,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:36:21,957 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:36:22,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:36:22,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745462929] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:36:22,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:36:22,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-11-28 04:36:22,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990784606] [2024-11-28 04:36:22,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:36:22,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 04:36:22,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:36:22,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 04:36:22,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-28 04:36:22,106 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 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) [2024-11-28 04:36:22,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:36:22,246 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2024-11-28 04:36:22,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 04:36:22,249 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 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 13 [2024-11-28 04:36:22,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:36:22,250 INFO L225 Difference]: With dead ends: 40 [2024-11-28 04:36:22,250 INFO L226 Difference]: Without dead ends: 34 [2024-11-28 04:36:22,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-28 04:36:22,251 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 4 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:36:22,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 210 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:36:22,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-28 04:36:22,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2024-11-28 04:36:22,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 04:36:22,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2024-11-28 04:36:22,265 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 13 [2024-11-28 04:36:22,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:36:22,265 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2024-11-28 04:36:22,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 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) [2024-11-28 04:36:22,266 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2024-11-28 04:36:22,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-28 04:36:22,268 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:36:22,268 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:36:22,280 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b54ec2dc-ffe6-4b56-9c0f-70b1bfb65b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 04:36:22,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b54ec2dc-ffe6-4b56-9c0f-70b1bfb65b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:36:22,469 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:36:22,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:36:22,470 INFO L85 PathProgramCache]: Analyzing trace with hash 976515455, now seen corresponding path program 2 times [2024-11-28 04:36:22,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:36:22,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971611415] [2024-11-28 04:36:22,470 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:36:22,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:36:22,527 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:36:22,527 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:36:23,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:36:23,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:36:23,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971611415] [2024-11-28 04:36:23,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971611415] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:36:23,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732006528] [2024-11-28 04:36:23,490 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:36:23,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:36:23,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b54ec2dc-ffe6-4b56-9c0f-70b1bfb65b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:36:23,493 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b54ec2dc-ffe6-4b56-9c0f-70b1bfb65b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:36:23,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b54ec2dc-ffe6-4b56-9c0f-70b1bfb65b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 04:36:23,589 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:36:23,590 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:36:23,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-28 04:36:23,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:36:29,531 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:36:29,532 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:36:45,652 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:36:45,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732006528] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:36:45,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:36:45,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2024-11-28 04:36:45,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628662481] [2024-11-28 04:36:45,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:36:45,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-28 04:36:45,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:36:45,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-28 04:36:45,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2024-11-28 04:36:45,655 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 25 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 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) [2024-11-28 04:36:47,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-28 04:36:50,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2024-11-28 04:36:54,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2024-11-28 04:36:58,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2024-11-28 04:37:04,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2024-11-28 04:37:07,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2024-11-28 04:37:07,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:37:07,933 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2024-11-28 04:37:07,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 04:37:07,934 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 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 15 [2024-11-28 04:37:07,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:37:07,934 INFO L225 Difference]: With dead ends: 47 [2024-11-28 04:37:07,934 INFO L226 Difference]: Without dead ends: 38 [2024-11-28 04:37:07,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2024-11-28 04:37:07,936 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 5 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:37:07,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 394 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 177 Invalid, 1 Unknown, 0 Unchecked, 17.3s Time] [2024-11-28 04:37:07,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-28 04:37:07,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2024-11-28 04:37:07,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 04:37:07,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2024-11-28 04:37:07,948 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 15 [2024-11-28 04:37:07,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:37:07,948 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2024-11-28 04:37:07,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 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) [2024-11-28 04:37:07,949 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-11-28 04:37:07,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-28 04:37:07,949 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:37:07,949 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:37:07,957 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b54ec2dc-ffe6-4b56-9c0f-70b1bfb65b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 04:37:08,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b54ec2dc-ffe6-4b56-9c0f-70b1bfb65b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:37:08,150 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 04:37:08,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:37:08,152 INFO L85 PathProgramCache]: Analyzing trace with hash 44590727, now seen corresponding path program 3 times [2024-11-28 04:37:08,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:37:08,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295811588] [2024-11-28 04:37:08,153 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 04:37:08,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:37:08,285 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-28 04:37:08,285 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:37:12,533 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:37:12,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:37:12,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295811588] [2024-11-28 04:37:12,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295811588] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:37:12,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285322137] [2024-11-28 04:37:12,534 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 04:37:12,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:37:12,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b54ec2dc-ffe6-4b56-9c0f-70b1bfb65b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:37:12,536 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b54ec2dc-ffe6-4b56-9c0f-70b1bfb65b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:37:12,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b54ec2dc-ffe6-4b56-9c0f-70b1bfb65b14/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 04:37:12,800 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-28 04:37:12,801 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:37:12,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-28 04:37:12,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:37:43,540 WARN L873 $PredicateComparison]: unable to prove that (and (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_22| Int)) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_22| |c_ULTIMATE.start_gcd_test_~a#1|)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_22|))) (<= (+ |c_ULTIMATE.start_gcd_test_~a#1| 1) 0)) (and (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_22| Int)) (let ((.cse0 (mod |v_ULTIMATE.start_gcd_test_~a#1_22| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| .cse0) (<= (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse0) 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_22|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_22| Int)) (let ((.cse1 (mod |v_ULTIMATE.start_gcd_test_~a#1_22| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| .cse1) (<= 128 (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse1)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_22|))))) (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (not (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_21|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_main1_~y~0#1|) |c_ULTIMATE.start_gcd_test_~a#1|))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_main1_~y~0#1|))) (and (not (= .cse2 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_21| 1) 0) (= (+ |c_ULTIMATE.start_gcd_test_~a#1| 256) (mod (+ .cse2 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) 256)))))) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from true [2024-11-28 04:38:48,621 WARN L286 SmtUtils]: Spent 12.58s on a formula simplification. DAG size of input: 87 DAG size of output: 78 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 04:39:32,889 WARN L286 SmtUtils]: Spent 9.14s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 04:39:51,739 WARN L286 SmtUtils]: Spent 6.21s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 04:40:22,654 WARN L286 SmtUtils]: Spent 7.82s on a formula simplification. DAG size of input: 72 DAG size of output: 71 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 04:40:38,556 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 1 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-28 04:40:38,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:41:57,729 WARN L286 SmtUtils]: Spent 37.87s on a formula simplification. DAG size of input: 83 DAG size of output: 52 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 04:45:34,444 WARN L286 SmtUtils]: Spent 1.71m on a formula simplification. DAG size of input: 94 DAG size of output: 74 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 04:45:42,021 WARN L286 SmtUtils]: Spent 6.30s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 04:46:04,144 WARN L286 SmtUtils]: Spent 5.05s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 04:46:42,104 WARN L286 SmtUtils]: Spent 7.95s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 04:47:00,370 WARN L286 SmtUtils]: Spent 5.20s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 04:47:32,405 WARN L286 SmtUtils]: Spent 5.02s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 04:47:50,010 WARN L286 SmtUtils]: Spent 8.77s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 04:49:17,031 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 04:50:55,460 WARN L873 $PredicateComparison]: unable to prove that (or (< |c_ULTIMATE.start_main1_~y~0#1| 1) (let ((.cse8 (< 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 1))) (.cse0 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse3 (+ |c_ULTIMATE.start_main1_~y~0#1| 1)) (.cse7 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (and (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse1 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse4 (mod (+ .cse1 .cse7) 256))) (let ((.cse5 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse4))) (let ((.cse6 (mod .cse5 256))) (let ((.cse2 (mod .cse4 .cse6))) (or (< (mod .cse1 256) 128) (< .cse2 .cse3) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse4) (< (mod (+ (* .cse1 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse5) 256) 128) (< 127 (mod (+ .cse1 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (not (= (mod .cse6 (mod .cse2 256)) 0)) (= 0 .cse5) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))) (or .cse8 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse9 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse12 (mod .cse9 256))) (let ((.cse10 (+ (mod (+ (* .cse9 255) (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse12)) 256) (- 256)))) (let ((.cse11 (mod .cse12 .cse10))) (or (< (mod (+ .cse9 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 (mod (+ .cse9 .cse7) 256)) (not (= (mod .cse10 (mod .cse11 256)) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse12) (< .cse11 .cse3))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse13 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse17 (mod .cse13 256))) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse17))) (let ((.cse15 (mod .cse14 256))) (let ((.cse16 (mod .cse17 .cse15))) (or (< (mod (+ .cse13 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< (mod (+ (* .cse13 255) .cse14) 256) 128) (not (= (mod .cse15 (mod .cse16 256)) 0)) (< 127 (mod (+ .cse13 .cse7) 256)) (< .cse16 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse17) (= .cse14 0)))))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse18 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse22 (mod .cse18 256))) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse22))) (let ((.cse20 (mod .cse19 256))) (let ((.cse21 (mod .cse22 .cse20))) (or (< (mod (+ (* .cse18 255) .cse19) 256) 128) (not (= (mod .cse20 (mod .cse21 256)) 0)) (< 127 (mod (+ .cse18 .cse7) 256)) (< .cse21 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse22) (< 127 (mod (+ .cse18 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (= .cse19 0)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse25 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse26 (mod (+ .cse25 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse23 (+ (mod (+ (* .cse25 255) .cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse26)) 256) (- 256)))) (let ((.cse24 (mod .cse26 .cse23))) (or (not (= (mod .cse23 (mod .cse24 256)) 0)) (< 127 (mod (+ .cse25 .cse7) 256)) (< 127 (mod .cse25 256)) (< 127 .cse26) (< .cse24 .cse3) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse29 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse30 (mod (+ .cse29 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse28 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse30) 256))) (let ((.cse27 (mod .cse30 .cse28))) (or (< .cse27 .cse3) (= .cse28 0) (< 127 (mod (+ .cse29 .cse7) 256)) (< 127 (mod .cse29 256)) (< 127 .cse30) (not (= (mod .cse28 (mod .cse27 256)) 0)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse31 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse34 (mod .cse31 256))) (let ((.cse32 (+ (mod (+ (* .cse31 255) (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse34)) 256) (- 256)))) (let ((.cse33 (mod .cse34 .cse32))) (or (< 127 (mod (+ .cse31 .cse7) 256)) (not (= (mod .cse32 (mod .cse33 256)) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse34) (< 127 (mod (+ .cse31 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< .cse33 .cse3)))))))))) .cse8) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse35 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse38 (mod (+ .cse35 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse36 (+ (mod (+ (* .cse35 255) .cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse38)) 256) (- 256)))) (let ((.cse37 (mod .cse38 .cse36))) (or (< (mod .cse35 256) 128) (not (= (mod .cse36 (mod .cse37 256)) 0)) (< 127 .cse38) (< (mod (+ .cse35 .cse7) 256) 128) (< .cse37 .cse3) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse41 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse42 (mod (+ .cse41 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse40 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse42) 256))) (let ((.cse39 (mod .cse42 .cse40))) (or (< .cse39 .cse3) (= .cse40 0) (< (mod .cse41 256) 128) (< 127 .cse42) (not (= (mod .cse40 (mod .cse39 256)) 0)) (< (mod (+ .cse41 .cse7) 256) 128) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))))) .cse8) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse45 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse46 (mod (+ .cse45 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse44 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse46) 256))) (let ((.cse43 (mod .cse46 .cse44))) (or (< .cse43 .cse3) (= .cse44 0) (< (mod .cse45 256) 128) (< 127 (mod (+ .cse45 .cse7) 256)) (< 127 .cse46) (not (= (mod .cse44 (mod .cse43 256)) 0)) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse47 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse50 (mod (+ .cse47 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse48 (+ (mod (+ (* .cse47 255) .cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse50)) 256) (- 256)))) (let ((.cse49 (mod .cse50 .cse48))) (or (< (mod .cse47 256) 128) (not (= (mod .cse48 (mod .cse49 256)) 0)) (< 127 (mod (+ .cse47 .cse7) 256)) (< 127 .cse50) (< .cse49 .cse3) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))))) .cse8) (or .cse8 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse51 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse54 (mod .cse51 256))) (let ((.cse52 (+ (mod (+ (* .cse51 255) (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse54)) 256) (- 256)))) (let ((.cse53 (mod .cse54 .cse52))) (or (< (mod (+ .cse51 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (not (= (mod .cse52 (mod .cse53 256)) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse54) (< (mod (+ .cse51 .cse7) 256) 128) (< .cse53 .cse3))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse55 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse59 (mod .cse55 256))) (let ((.cse56 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse59))) (let ((.cse57 (mod .cse56 256))) (let ((.cse58 (mod .cse59 .cse57))) (or (< (mod (+ .cse55 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< (mod (+ (* .cse55 255) .cse56) 256) 128) (not (= (mod .cse57 (mod .cse58 256)) 0)) (< .cse58 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse59) (< (mod (+ .cse55 .cse7) 256) 128) (= .cse56 0)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))))) (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse60 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse64 (mod .cse60 256))) (let ((.cse61 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse64))) (let ((.cse62 (mod .cse61 256))) (let ((.cse63 (mod .cse64 .cse62))) (or (< (mod (+ .cse60 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (< (mod (+ (* .cse60 255) .cse61) 256) 128) (not (= (mod .cse62 (mod .cse63 256)) 0)) (< .cse63 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse64) (< (mod (+ .cse60 .cse7) 256) 128) (= .cse61 0))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse65 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse69 (mod .cse65 256))) (let ((.cse66 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse69))) (let ((.cse67 (mod .cse66 256))) (let ((.cse68 (mod .cse69 .cse67))) (or (< (mod (+ (* .cse65 255) .cse66) 256) 128) (not (= (mod .cse67 (mod .cse68 256)) 0)) (< 127 (mod (+ .cse65 .cse7) 256)) (< .cse68 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse69) (< 127 (mod (+ .cse65 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (= .cse66 0)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse72 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse71 (mod (+ .cse72 .cse7) 256))) (let ((.cse73 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse71))) (let ((.cse74 (mod .cse73 256))) (let ((.cse70 (mod .cse71 .cse74))) (or (< .cse70 .cse3) (< 127 .cse71) (< 127 (mod .cse72 256)) (< (mod (+ (* .cse72 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse73) 256) 128) (< 127 (mod (+ .cse72 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (not (= (mod .cse74 (mod .cse70 256)) 0)) (= 0 .cse73) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))))) .cse0) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse75 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse79 (mod .cse75 256))) (let ((.cse76 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse79))) (let ((.cse77 (mod .cse76 256))) (let ((.cse78 (mod .cse79 .cse77))) (or (< (mod (+ (* .cse75 255) .cse76) 256) 128) (not (= (mod .cse77 (mod .cse78 256)) 0)) (< .cse78 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse79) (< 127 (mod (+ .cse75 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse75 .cse7) 256) 128) (= .cse76 0)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse82 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse83 (mod (+ .cse82 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse80 (+ (mod (+ (* .cse82 255) .cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse83)) 256) (- 256)))) (let ((.cse81 (mod .cse83 .cse80))) (or (not (= (mod .cse80 (mod .cse81 256)) 0)) (< 127 (mod .cse82 256)) (< 127 .cse83) (< (mod (+ .cse82 .cse7) 256) 128) (< .cse81 .cse3) (= .cse82 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse86 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse87 (mod (+ .cse86 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse85 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse87) 256))) (let ((.cse84 (mod .cse87 .cse85))) (or (< .cse84 .cse3) (= .cse85 0) (< 127 (mod .cse86 256)) (< 127 .cse87) (not (= (mod .cse85 (mod .cse84 256)) 0)) (< (mod (+ .cse86 .cse7) 256) 128) (= .cse86 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1)))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_30| 1)) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse91 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse90 (mod .cse91 256))) (let ((.cse88 (+ (mod (+ (* .cse91 255) (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse90)) 256) (- 256)))) (let ((.cse89 (mod .cse90 .cse88))) (or (not (= (mod .cse88 (mod .cse89 256)) 0)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse90) (< 127 (mod (+ .cse91 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse91 .cse7) 256) 128) (< .cse89 .cse3)))))))))) .cse8) (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse92 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse96 (mod .cse92 256))) (let ((.cse93 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse96))) (let ((.cse94 (mod .cse93 256))) (let ((.cse95 (mod .cse96 .cse94))) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (< (mod (+ (* .cse92 255) .cse93) 256) 128) (not (= (mod .cse94 (mod .cse95 256)) 0)) (< .cse95 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse96) (< 127 (mod (+ .cse92 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (< (mod (+ .cse92 .cse7) 256) 128) (= .cse93 0))))))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse97 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse101 (mod .cse97 256))) (let ((.cse98 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse101))) (let ((.cse99 (mod .cse98 256))) (let ((.cse100 (mod .cse101 .cse99))) (or (< (mod (+ .cse97 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< (mod (+ (* .cse97 255) .cse98) 256) 128) (not (= (mod .cse99 (mod .cse100 256)) 0)) (< 127 (mod (+ .cse97 .cse7) 256)) (< .cse100 .cse3) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< 127 .cse101) (= .cse98 0)))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse103 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse104 (mod (+ .cse103 .cse7) 256))) (let ((.cse105 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse104))) (let ((.cse106 (mod .cse105 256))) (let ((.cse102 (mod .cse104 .cse106))) (or (< .cse102 .cse3) (< (mod (+ .cse103 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< 127 .cse104) (< 127 (mod .cse103 256)) (< (mod (+ (* .cse103 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse105) 256) 128) (not (= (mod .cse106 (mod .cse102 256)) 0)) (= 0 .cse105) (= .cse103 0) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_30| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse107 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse109 (mod (+ .cse107 .cse7) 256))) (let ((.cse110 (mod |v_ULTIMATE.start_gcd_test_~a#1_30| .cse109))) (let ((.cse111 (mod .cse110 256))) (let ((.cse108 (mod .cse109 .cse111))) (or (< (mod .cse107 256) 128) (< .cse108 .cse3) (< (mod (+ .cse107 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 128) (< |v_ULTIMATE.start_gcd_test_~a#1_30| |c_ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse109) (< (mod (+ (* .cse107 255) |c_ULTIMATE.start_gcd_test_~b#1| .cse110) 256) 128) (not (= (mod .cse111 (mod .cse108 256)) 0)) (= 0 .cse110) (< 0 (+ |ULTIMATE.start_gcd_test_~a#1| 1))))))))))))) is different from true