./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench/prodbin-ll.c --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_73c4b7f7-d280-4609-84ce-6cb52f871e12/bin/ukojak-verify-ENZ3QT5qd3/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73c4b7f7-d280-4609-84ce-6cb52f871e12/bin/ukojak-verify-ENZ3QT5qd3/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73c4b7f7-d280-4609-84ce-6cb52f871e12/bin/ukojak-verify-ENZ3QT5qd3/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73c4b7f7-d280-4609-84ce-6cb52f871e12/bin/ukojak-verify-ENZ3QT5qd3/config/KojakReach.xml -i ../../sv-benchmarks/c/nla-digbench/prodbin-ll.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73c4b7f7-d280-4609-84ce-6cb52f871e12/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73c4b7f7-d280-4609-84ce-6cb52f871e12/bin/ukojak-verify-ENZ3QT5qd3 --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 Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 77bbfba272f7904e5efe099569a5ed86d54de3fd07a8ce9d48301467c5048e30 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-25 03:35:39,111 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-25 03:35:39,210 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73c4b7f7-d280-4609-84ce-6cb52f871e12/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-25 03:35:39,215 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-25 03:35:39,216 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-25 03:35:39,241 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-25 03:35:39,241 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-25 03:35:39,242 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-25 03:35:39,242 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-25 03:35:39,242 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-25 03:35:39,242 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-25 03:35:39,243 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-25 03:35:39,243 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-25 03:35:39,243 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-25 03:35:39,243 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-25 03:35:39,243 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-25 03:35:39,243 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-25 03:35:39,243 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-25 03:35:39,243 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-25 03:35:39,244 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-25 03:35:39,244 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-25 03:35:39,244 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-25 03:35:39,244 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-25 03:35:39,244 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-25 03:35:39,244 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-25 03:35:39,244 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-25 03:35:39,245 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-25 03:35:39,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 03:35:39,245 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-25 03:35:39,245 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-25 03:35:39,245 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-25 03:35:39,245 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-25 03:35:39,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-25 03:35:39,246 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_73c4b7f7-d280-4609-84ce-6cb52f871e12/bin/ukojak-verify-ENZ3QT5qd3 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 -> Kojak 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 -> 77bbfba272f7904e5efe099569a5ed86d54de3fd07a8ce9d48301467c5048e30 [2024-11-25 03:35:39,600 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-25 03:35:39,617 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-25 03:35:39,621 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-25 03:35:39,622 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-25 03:35:39,625 INFO L274 PluginConnector]: CDTParser initialized [2024-11-25 03:35:39,627 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73c4b7f7-d280-4609-84ce-6cb52f871e12/bin/ukojak-verify-ENZ3QT5qd3/../../sv-benchmarks/c/nla-digbench/prodbin-ll.c [2024-11-25 03:35:43,279 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73c4b7f7-d280-4609-84ce-6cb52f871e12/bin/ukojak-verify-ENZ3QT5qd3/data/e3848ed95/fec761fef242436a883897dec470dd47/FLAGc48fe8a33 [2024-11-25 03:35:43,627 INFO L384 CDTParser]: Found 1 translation units. [2024-11-25 03:35:43,628 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73c4b7f7-d280-4609-84ce-6cb52f871e12/sv-benchmarks/c/nla-digbench/prodbin-ll.c [2024-11-25 03:35:43,640 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73c4b7f7-d280-4609-84ce-6cb52f871e12/bin/ukojak-verify-ENZ3QT5qd3/data/e3848ed95/fec761fef242436a883897dec470dd47/FLAGc48fe8a33 [2024-11-25 03:35:43,668 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73c4b7f7-d280-4609-84ce-6cb52f871e12/bin/ukojak-verify-ENZ3QT5qd3/data/e3848ed95/fec761fef242436a883897dec470dd47 [2024-11-25 03:35:43,671 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-25 03:35:43,673 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-25 03:35:43,676 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-25 03:35:43,677 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-25 03:35:43,683 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-25 03:35:43,685 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:35:43" (1/1) ... [2024-11-25 03:35:43,690 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e0f3b7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:35:43, skipping insertion in model container [2024-11-25 03:35:43,690 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:35:43" (1/1) ... [2024-11-25 03:35:43,710 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-25 03:35:43,922 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_73c4b7f7-d280-4609-84ce-6cb52f871e12/sv-benchmarks/c/nla-digbench/prodbin-ll.c[537,550] [2024-11-25 03:35:43,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 03:35:43,961 INFO L200 MainTranslator]: Completed pre-run [2024-11-25 03:35:43,976 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_73c4b7f7-d280-4609-84ce-6cb52f871e12/sv-benchmarks/c/nla-digbench/prodbin-ll.c[537,550] [2024-11-25 03:35:43,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 03:35:44,015 INFO L204 MainTranslator]: Completed translation [2024-11-25 03:35:44,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:35:44 WrapperNode [2024-11-25 03:35:44,017 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-25 03:35:44,018 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-25 03:35:44,018 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-25 03:35:44,019 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-25 03:35:44,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:35:44" (1/1) ... [2024-11-25 03:35:44,043 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:35:44" (1/1) ... [2024-11-25 03:35:44,065 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 43 [2024-11-25 03:35:44,066 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-25 03:35:44,067 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-25 03:35:44,067 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-25 03:35:44,068 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-25 03:35:44,078 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:35:44" (1/1) ... [2024-11-25 03:35:44,079 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:35:44" (1/1) ... [2024-11-25 03:35:44,084 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:35:44" (1/1) ... [2024-11-25 03:35:44,084 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:35:44" (1/1) ... [2024-11-25 03:35:44,092 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:35:44" (1/1) ... [2024-11-25 03:35:44,093 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:35:44" (1/1) ... [2024-11-25 03:35:44,101 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:35:44" (1/1) ... [2024-11-25 03:35:44,105 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:35:44" (1/1) ... [2024-11-25 03:35:44,106 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:35:44" (1/1) ... [2024-11-25 03:35:44,107 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-25 03:35:44,112 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-25 03:35:44,112 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-25 03:35:44,112 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-25 03:35:44,113 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:35:44" (1/1) ... [2024-11-25 03:35:44,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 03:35:44,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73c4b7f7-d280-4609-84ce-6cb52f871e12/bin/ukojak-verify-ENZ3QT5qd3/z3 [2024-11-25 03:35:44,164 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73c4b7f7-d280-4609-84ce-6cb52f871e12/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-25 03:35:44,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73c4b7f7-d280-4609-84ce-6cb52f871e12/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-25 03:35:44,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-25 03:35:44,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-25 03:35:44,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-25 03:35:44,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-25 03:35:44,209 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-25 03:35:44,209 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-25 03:35:44,288 INFO L234 CfgBuilder]: Building ICFG [2024-11-25 03:35:44,290 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-25 03:35:44,500 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-11-25 03:35:44,502 INFO L283 CfgBuilder]: Performing block encoding [2024-11-25 03:35:44,627 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-25 03:35:44,628 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-25 03:35:44,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:35:44 BoogieIcfgContainer [2024-11-25 03:35:44,629 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-25 03:35:44,629 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-25 03:35:44,630 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-25 03:35:44,645 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-25 03:35:44,645 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:35:44" (1/1) ... [2024-11-25 03:35:44,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-25 03:35:44,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:44,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 12 states and 15 transitions. [2024-11-25 03:35:44,731 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2024-11-25 03:35:44,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-25 03:35:44,735 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:44,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:44,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 03:35:44,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:44,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-25 03:35:44,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 03:35:45,105 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-25 03:35:45,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:45,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 15 states and 20 transitions. [2024-11-25 03:35:45,235 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2024-11-25 03:35:45,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-25 03:35:45,240 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:45,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:45,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:35:45,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:45,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 16 states and 22 transitions. [2024-11-25 03:35:45,455 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2024-11-25 03:35:45,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-25 03:35:45,455 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:45,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:45,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 03:35:45,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:45,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-25 03:35:45,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 03:35:46,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:35:47,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:47,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 20 states and 33 transitions. [2024-11-25 03:35:47,238 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 33 transitions. [2024-11-25 03:35:47,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-25 03:35:47,239 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:47,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 03:35:47,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:47,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-25 03:35:47,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 03:35:48,852 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-25 03:35:50,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:50,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 22 states and 39 transitions. [2024-11-25 03:35:50,710 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 39 transitions. [2024-11-25 03:35:50,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-25 03:35:50,711 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:50,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:50,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 03:35:50,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:50,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-25 03:35:50,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 03:35:52,904 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-25 03:35:57,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:57,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 24 states and 42 transitions. [2024-11-25 03:35:57,772 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 42 transitions. [2024-11-25 03:35:57,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-25 03:35:57,772 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:57,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 03:35:57,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:57,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-25 03:35:57,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 03:35:59,178 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-25 03:35:59,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:35:59,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 25 states and 43 transitions. [2024-11-25 03:35:59,751 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 43 transitions. [2024-11-25 03:35:59,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-25 03:35:59,752 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:35:59,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:35:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 03:35:59,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:35:59,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-25 03:35:59,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 03:36:04,695 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-25 03:36:24,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-25 03:36:24,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:36:24,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 27 states and 49 transitions. [2024-11-25 03:36:24,926 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 49 transitions. [2024-11-25 03:36:24,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-25 03:36:24,927 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:36:24,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:36:24,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 03:36:25,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:36:25,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-25 03:36:25,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 03:36:30,913 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-25 03:36:32,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:36:32,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 28 states and 50 transitions. [2024-11-25 03:36:32,294 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2024-11-25 03:36:32,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-25 03:36:32,295 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:36:32,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:36:32,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 03:36:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:36:32,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-25 03:36:32,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 03:36:37,955 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 14 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-25 03:36:55,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:36:55,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 30 states and 62 transitions. [2024-11-25 03:36:55,950 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 62 transitions. [2024-11-25 03:36:55,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-25 03:36:55,951 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:36:55,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:36:56,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 03:36:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:36:56,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-25 03:36:56,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 03:37:31,186 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 14 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-25 03:37:56,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:37:56,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 31 states and 63 transitions. [2024-11-25 03:37:56,864 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 63 transitions. [2024-11-25 03:37:56,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-25 03:37:56,866 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:37:56,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:37:57,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 03:37:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:37:57,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-25 03:37:57,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 03:37:58,728 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 21 proven. 26 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-25 03:38:14,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:38:14,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 33 states and 70 transitions. [2024-11-25 03:38:14,010 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 70 transitions. [2024-11-25 03:38:14,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-25 03:38:14,011 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:38:14,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:38:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 03:38:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:38:14,417 WARN L254 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-25 03:38:14,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 03:40:05,359 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 402 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-25 03:40:08,149 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 18 proven. 29 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-25 03:40:29,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-25 03:40:52,016 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse55 (+ (- 1) |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse9 (div |c_ULTIMATE.start_main_~b~0#1| 2)) (.cse6 (div .cse55 2))) (let ((.cse83 (* (- 1) .cse6)) (.cse46 (+ (- 1) .cse9))) (let ((.cse21 (* |c_ULTIMATE.start_main_~y~0#1| 2)) (.cse4 (= (mod |c_ULTIMATE.start_main_~b~0#1| 2) 1)) (.cse78 (+ .cse9 1)) (.cse20 (div .cse46 2)) (.cse34 (* |c_ULTIMATE.start_main_~a~0#1| 4)) (.cse22 (div (+ 1 .cse83) 2)) (.cse27 (div |c_ULTIMATE.start_main_~b~0#1| 4)) (.cse13 (div .cse55 4)) (.cse10 (* |c_ULTIMATE.start_main_~a~0#1| 2))) (let ((.cse3 (= |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 32))) (.cse25 (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 3))) (.cse18 (= |c_ULTIMATE.start_main_~z~0#1| .cse10)) (.cse16 (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 5))) (.cse5 (= |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~z~0#1|)) (.cse30 (not (= (mod .cse13 2) 1))) (.cse33 (* |c_ULTIMATE.start_main_~a~0#1| 8)) (.cse31 (not (= (mod .cse27 2) 1))) (.cse23 (not (= (mod .cse22 2) 1))) (.cse24 (= (mod (+ .cse6 1) 2) 0)) (.cse28 (= |c_ULTIMATE.start_main_~z~0#1| .cse34)) (.cse17 (not (= (mod .cse20 2) 1))) (.cse19 (= (mod .cse78 2) 0)) (.cse26 (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 6))) (.cse7 (not .cse4)) (.cse29 (not (= (mod .cse9 2) 1))) (.cse12 (= (* 7 |c_ULTIMATE.start_main_~a~0#1|) |c_ULTIMATE.start_main_~z~0#1|)) (.cse15 (not (= (mod .cse6 2) 1))) (.cse14 (+ .cse21 1)) (.cse32 (* |c_ULTIMATE.start_main_~y~0#1| 4)) (.cse8 (= |c_ULTIMATE.start_main_~z~0#1| 0)) (.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~a~0#1|)) (.cse1 (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|)) (.cse2 (<= 1 |c_ULTIMATE.start_main_~b~0#1|)) (.cse43 (* |c_ULTIMATE.start_main_~a~0#1| 16))) (and (not (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 31 (* |c_ULTIMATE.start_main_~y~0#1| 32))) (= (+ |c_ULTIMATE.start_main_~z~0#1| (* .cse0 32)) .cse1) .cse2 .cse3)) (not (and .cse2 (or (and .cse4 .cse5 (= |c_ULTIMATE.start_main_~y~0#1| .cse6)) (and .cse7 .cse8 (= |c_ULTIMATE.start_main_~y~0#1| .cse9))) (= |c_ULTIMATE.start_main_~x~0#1| .cse10))) (not (and (let ((.cse11 (+ .cse32 3))) (or (and (= .cse6 .cse11) .cse4 .cse12) (and (= .cse13 .cse14) .cse4 .cse15 .cse16) (and .cse17 .cse18 .cse19 .cse7 (not (= .cse20 0)) (<= .cse21 .cse20) (<= .cse20 .cse14)) (and .cse4 (<= 0 (+ .cse21 .cse22 1)) .cse23 .cse24 (not (= .cse22 0)) .cse25 (<= (+ .cse21 .cse22) 0)) (and .cse26 .cse7 (= .cse9 .cse11)) (and (= .cse27 .cse14) .cse7 .cse28 .cse29) (and (not (= .cse13 0)) .cse4 (<= .cse13 .cse14) (<= .cse21 .cse13) .cse15 .cse5 .cse30) (and .cse7 .cse29 (<= .cse21 .cse27) .cse8 .cse31 (<= .cse27 .cse14)))) .cse2 (= |c_ULTIMATE.start_main_~x~0#1| .cse33))) .cse2 (not (and (= |c_ULTIMATE.start_main_~x~0#1| .cse34) .cse2 (or (and (not (= .cse6 0)) .cse4 .cse15 .cse5 (= |c_ULTIMATE.start_main_~y~0#1| .cse13)) (and .cse4 .cse25 (= .cse6 .cse14)) (and (= .cse9 .cse14) .cse18 .cse7) (and .cse7 .cse29 .cse8 (= |c_ULTIMATE.start_main_~y~0#1| .cse27))))) .cse3 (let ((.cse82 (div (+ (* (- 1) .cse13) 1) 2)) (.cse81 (div (+ 3 .cse83) 4)) (.cse80 (div (+ (* (- 1) .cse27) 1) 2)) (.cse74 (+ (- 3) .cse9))) (let ((.cse79 (div .cse74 4)) (.cse71 (* (- 1) .cse80)) (.cse77 (* (- 1) .cse81)) (.cse53 (* (- 1) .cse82))) (let ((.cse48 (= (mod .cse82 2) 1)) (.cse50 (+ (- 1) .cse53)) (.cse59 (= (mod .cse81 2) 1)) (.cse76 (+ (- 1) .cse77)) (.cse68 (+ (- 1) .cse71)) (.cse69 (= (mod .cse80 2) 1)) (.cse75 (+ (- 1) .cse79)) (.cse62 (= (mod .cse79 2) 1)) (.cse41 (* (- 1) .cse22)) (.cse40 (* |c_ULTIMATE.start_main_~y~0#1| 8))) (let ((.cse36 (div .cse55 8)) (.cse44 (div |c_ULTIMATE.start_main_~b~0#1| 8)) (.cse45 (+ 2 .cse40)) (.cse42 (div .cse41 2)) (.cse38 (+ 7 .cse40)) (.cse39 (+ 6 .cse40)) (.cse47 (div .cse46 4)) (.cse37 (+ .cse32 2)) (.cse35 (+ .cse40 4)) (.cse65 (not .cse62)) (.cse64 (div .cse74 8)) (.cse63 (div .cse75 2)) (.cse61 (= (mod .cse78 4) 0)) (.cse72 (not .cse69)) (.cse70 (div .cse71 2)) (.cse67 (div .cse68 2)) (.cse73 (= (mod (+ .cse27 1) 2) 0)) (.cse56 (= (mod (+ (* 3 .cse6) 3) 4) 0)) (.cse60 (div .cse76 2)) (.cse58 (div .cse77 2)) (.cse57 (not .cse59)) (.cse54 (= 0 (mod (+ .cse13 1) 2))) (.cse49 (div .cse50 2)) (.cse52 (not .cse48)) (.cse51 (div .cse53 2))) (or (and (or (and (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 17)) (<= .cse35 .cse13) (<= .cse36 .cse37)) (and (<= .cse13 .cse38) (= (* |c_ULTIMATE.start_main_~a~0#1| 25) |c_ULTIMATE.start_main_~z~0#1|) (<= .cse39 .cse13))) .cse4 .cse15 .cse30) (and .cse4 .cse23 .cse24 (or (and (<= (+ 6 .cse22) 0) (= (* |c_ULTIMATE.start_main_~a~0#1| 11) |c_ULTIMATE.start_main_~z~0#1|) (<= (+ 2 .cse22 .cse40) 0) (<= (div .cse41 4) .cse21)) (and (<= (+ .cse22 4) 0) (<= (+ .cse22 .cse40) 0) .cse25 (<= (+ (div (+ (- 1) .cse42) 2) 1) .cse21)))) (and (or (and (<= .cse35 .cse27) (= .cse43 |c_ULTIMATE.start_main_~z~0#1|) (<= .cse44 .cse37)) (and (= (* |c_ULTIMATE.start_main_~a~0#1| 24) |c_ULTIMATE.start_main_~z~0#1|) (<= .cse27 .cse38) (<= .cse39 .cse27))) .cse7 .cse29 .cse31) (and .cse17 .cse19 .cse7 (or (and (<= .cse45 .cse20) (<= 6 .cse20) (<= (div .cse46 8) .cse21) (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 10))) (and .cse18 (<= 4 .cse20) (<= (+ (div (+ (- 1) .cse47) 2) 1) .cse21) (<= .cse40 .cse20)))) (and .cse4 (or (and .cse48 (<= .cse21 .cse49) (not (= .cse49 0)) (not (= (+ (* 2 (div .cse50 4)) 1) .cse49)) (<= .cse49 .cse14) (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 13))) (and .cse16 (not (= .cse51 0)) .cse52 (<= .cse21 .cse51) (not (= (+ (* 2 (div .cse53 4)) 1) .cse51)) (<= .cse51 .cse14))) .cse15 .cse54) (and (or (and (<= .cse40 .cse13) .cse5 (<= (+ (div (+ (- 1) .cse36) 2) 1) .cse21) (<= 4 .cse13)) (and (<= 6 .cse13) (<= (div .cse55 16) .cse21) (<= .cse45 .cse13) (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 9)))) .cse4 .cse15 .cse30) (and .cse56 .cse4 (or (and (= (* 23 |c_ULTIMATE.start_main_~a~0#1|) |c_ULTIMATE.start_main_~z~0#1|) .cse57 (= .cse14 .cse58)) (and .cse59 (= .cse60 .cse14) (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 31))))) (and .cse7 .cse61 (or (and .cse62 (= (* |c_ULTIMATE.start_main_~a~0#1| 30) |c_ULTIMATE.start_main_~z~0#1|) (= .cse63 .cse14)) (and (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 22)) (= .cse64 .cse14) .cse65))) (and .cse7 .cse29 (let ((.cse66 (div |c_ULTIMATE.start_main_~b~0#1| 16))) (or (and (<= .cse44 .cse32) (<= .cse21 .cse66) .cse8) (and (<= 6 .cse27) (= .cse33 |c_ULTIMATE.start_main_~z~0#1|) (<= .cse45 .cse27) (<= .cse66 .cse21)))) .cse31) (and .cse4 .cse23 (or (and (<= (+ .cse22 .cse40 4) 0) (= (* 19 |c_ULTIMATE.start_main_~a~0#1|) |c_ULTIMATE.start_main_~z~0#1|) (<= .cse42 .cse37)) (and (<= 0 (+ 7 .cse22 .cse40)) (<= (+ 6 .cse22 .cse40) 0) (= (* |c_ULTIMATE.start_main_~a~0#1| 27) |c_ULTIMATE.start_main_~z~0#1|))) .cse24) (and (or (and (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 12)) (not (= (mod .cse67 2) 1)) (= (div .cse68 4) |c_ULTIMATE.start_main_~y~0#1|) .cse69 (not (= .cse67 0))) (and .cse28 (not (= .cse70 0)) (= |c_ULTIMATE.start_main_~y~0#1| (div .cse71 4)) .cse72 (not (= (mod .cse70 2) 1)))) .cse7 .cse29 .cse73) (and .cse17 .cse19 .cse7 (or (and (<= .cse20 .cse38) (<= .cse39 .cse20) (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 26))) (and (<= .cse47 .cse37) (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 18)) (<= .cse35 .cse20)))) (and .cse7 (or (and (<= .cse21 .cse64) (<= .cse64 .cse14) .cse26 (not (= .cse64 (+ (* 2 (div .cse74 16)) 1))) .cse65 (not (= .cse64 0))) (and .cse62 (not (= .cse63 0)) (<= .cse63 .cse14) (<= .cse21 .cse63) (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 14)) (not (= (+ (* 2 (div .cse75 4)) 1) .cse63)))) .cse61) (and (or (and .cse72 (= .cse70 .cse14) (= (* |c_ULTIMATE.start_main_~a~0#1| 20) |c_ULTIMATE.start_main_~z~0#1|)) (and (= .cse67 .cse14) (= (* |c_ULTIMATE.start_main_~a~0#1| 28) |c_ULTIMATE.start_main_~z~0#1|) .cse69)) .cse7 .cse29 .cse73) (and .cse56 .cse4 (or (and (= |c_ULTIMATE.start_main_~y~0#1| (div .cse76 4)) .cse59 (not (= .cse60 0)) (not (= (mod .cse60 2) 1)) (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 15))) (and (not (= .cse58 0)) (= |c_ULTIMATE.start_main_~y~0#1| (div .cse77 4)) (not (= (mod .cse58 2) 1)) .cse12 .cse57))) (and .cse4 .cse15 .cse54 (or (and .cse48 (= (* |c_ULTIMATE.start_main_~a~0#1| 29) |c_ULTIMATE.start_main_~z~0#1|) (= .cse14 .cse49)) (and .cse52 (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 21)) (= .cse14 .cse51))))))))) (not (and (= |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~b~0#1|) (= |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~a~0#1|) .cse2 .cse8)) (not (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 15 (* |c_ULTIMATE.start_main_~y~0#1| 16))) (= (+ |c_ULTIMATE.start_main_~z~0#1| (* .cse0 16)) .cse1) .cse2 (= .cse43 |c_ULTIMATE.start_main_~x~0#1|))))))))) is different from false [2024-11-25 03:41:43,752 WARN L286 SmtUtils]: Spent 7.13s on a formula simplification that was a NOOP. DAG size: 403 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-25 03:42:23,351 WARN L286 SmtUtils]: Spent 36.81s on a formula simplification. DAG size of input: 482 DAG size of output: 157 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-25 03:42:33,381 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse55 (+ (- 1) |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse9 (div |c_ULTIMATE.start_main_~b~0#1| 2)) (.cse6 (div .cse55 2))) (let ((.cse83 (* (- 1) .cse6)) (.cse46 (+ (- 1) .cse9))) (let ((.cse21 (* |c_ULTIMATE.start_main_~y~0#1| 2)) (.cse4 (= (mod |c_ULTIMATE.start_main_~b~0#1| 2) 1)) (.cse78 (+ .cse9 1)) (.cse20 (div .cse46 2)) (.cse34 (* |c_ULTIMATE.start_main_~a~0#1| 4)) (.cse22 (div (+ 1 .cse83) 2)) (.cse27 (div |c_ULTIMATE.start_main_~b~0#1| 4)) (.cse13 (div .cse55 4)) (.cse10 (* |c_ULTIMATE.start_main_~a~0#1| 2))) (let ((.cse3 (= |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 32))) (.cse25 (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 3))) (.cse18 (= |c_ULTIMATE.start_main_~z~0#1| .cse10)) (.cse16 (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 5))) (.cse5 (= |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~z~0#1|)) (.cse30 (not (= (mod .cse13 2) 1))) (.cse33 (* |c_ULTIMATE.start_main_~a~0#1| 8)) (.cse31 (not (= (mod .cse27 2) 1))) (.cse23 (not (= (mod .cse22 2) 1))) (.cse24 (= (mod (+ .cse6 1) 2) 0)) (.cse28 (= |c_ULTIMATE.start_main_~z~0#1| .cse34)) (.cse17 (not (= (mod .cse20 2) 1))) (.cse19 (= (mod .cse78 2) 0)) (.cse26 (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 6))) (.cse7 (not .cse4)) (.cse29 (not (= (mod .cse9 2) 1))) (.cse12 (= (* 7 |c_ULTIMATE.start_main_~a~0#1|) |c_ULTIMATE.start_main_~z~0#1|)) (.cse15 (not (= (mod .cse6 2) 1))) (.cse14 (+ .cse21 1)) (.cse32 (* |c_ULTIMATE.start_main_~y~0#1| 4)) (.cse8 (= |c_ULTIMATE.start_main_~z~0#1| 0)) (.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~a~0#1|)) (.cse1 (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|)) (.cse2 (<= 1 |c_ULTIMATE.start_main_~b~0#1|)) (.cse43 (* |c_ULTIMATE.start_main_~a~0#1| 16))) (and (not (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 31 (* |c_ULTIMATE.start_main_~y~0#1| 32))) (= (+ |c_ULTIMATE.start_main_~z~0#1| (* .cse0 32)) .cse1) .cse2 .cse3)) (not (and .cse2 (or (and .cse4 .cse5 (= |c_ULTIMATE.start_main_~y~0#1| .cse6)) (and .cse7 .cse8 (= |c_ULTIMATE.start_main_~y~0#1| .cse9))) (= |c_ULTIMATE.start_main_~x~0#1| .cse10))) (not (and (let ((.cse11 (+ .cse32 3))) (or (and (= .cse6 .cse11) .cse4 .cse12) (and (= .cse13 .cse14) .cse4 .cse15 .cse16) (and .cse17 .cse18 .cse19 .cse7 (not (= .cse20 0)) (<= .cse21 .cse20) (<= .cse20 .cse14)) (and .cse4 (<= 0 (+ .cse21 .cse22 1)) .cse23 .cse24 (not (= .cse22 0)) .cse25 (<= (+ .cse21 .cse22) 0)) (and .cse26 .cse7 (= .cse9 .cse11)) (and (= .cse27 .cse14) .cse7 .cse28 .cse29) (and (not (= .cse13 0)) .cse4 (<= .cse13 .cse14) (<= .cse21 .cse13) .cse15 .cse5 .cse30) (and .cse7 .cse29 (<= .cse21 .cse27) .cse8 .cse31 (<= .cse27 .cse14)))) .cse2 (= |c_ULTIMATE.start_main_~x~0#1| .cse33))) .cse2 (not (and (= |c_ULTIMATE.start_main_~x~0#1| .cse34) .cse2 (or (and (not (= .cse6 0)) .cse4 .cse15 .cse5 (= |c_ULTIMATE.start_main_~y~0#1| .cse13)) (and .cse4 .cse25 (= .cse6 .cse14)) (and (= .cse9 .cse14) .cse18 .cse7) (and .cse7 .cse29 .cse8 (= |c_ULTIMATE.start_main_~y~0#1| .cse27))))) .cse3 (let ((.cse82 (div (+ (* (- 1) .cse13) 1) 2)) (.cse81 (div (+ 3 .cse83) 4)) (.cse80 (div (+ (* (- 1) .cse27) 1) 2)) (.cse74 (+ (- 3) .cse9))) (let ((.cse79 (div .cse74 4)) (.cse71 (* (- 1) .cse80)) (.cse77 (* (- 1) .cse81)) (.cse53 (* (- 1) .cse82))) (let ((.cse48 (= (mod .cse82 2) 1)) (.cse50 (+ (- 1) .cse53)) (.cse59 (= (mod .cse81 2) 1)) (.cse76 (+ (- 1) .cse77)) (.cse68 (+ (- 1) .cse71)) (.cse69 (= (mod .cse80 2) 1)) (.cse75 (+ (- 1) .cse79)) (.cse62 (= (mod .cse79 2) 1)) (.cse41 (* (- 1) .cse22)) (.cse40 (* |c_ULTIMATE.start_main_~y~0#1| 8))) (let ((.cse36 (div .cse55 8)) (.cse44 (div |c_ULTIMATE.start_main_~b~0#1| 8)) (.cse45 (+ 2 .cse40)) (.cse42 (div .cse41 2)) (.cse38 (+ 7 .cse40)) (.cse39 (+ 6 .cse40)) (.cse47 (div .cse46 4)) (.cse37 (+ .cse32 2)) (.cse35 (+ .cse40 4)) (.cse65 (not .cse62)) (.cse64 (div .cse74 8)) (.cse63 (div .cse75 2)) (.cse61 (= (mod .cse78 4) 0)) (.cse72 (not .cse69)) (.cse70 (div .cse71 2)) (.cse67 (div .cse68 2)) (.cse73 (= (mod (+ .cse27 1) 2) 0)) (.cse56 (= (mod (+ (* 3 .cse6) 3) 4) 0)) (.cse60 (div .cse76 2)) (.cse58 (div .cse77 2)) (.cse57 (not .cse59)) (.cse54 (= 0 (mod (+ .cse13 1) 2))) (.cse49 (div .cse50 2)) (.cse52 (not .cse48)) (.cse51 (div .cse53 2))) (or (and (or (and (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 17)) (<= .cse35 .cse13) (<= .cse36 .cse37)) (and (<= .cse13 .cse38) (= (* |c_ULTIMATE.start_main_~a~0#1| 25) |c_ULTIMATE.start_main_~z~0#1|) (<= .cse39 .cse13))) .cse4 .cse15 .cse30) (and .cse4 .cse23 .cse24 (or (and (<= (+ 6 .cse22) 0) (= (* |c_ULTIMATE.start_main_~a~0#1| 11) |c_ULTIMATE.start_main_~z~0#1|) (<= (+ 2 .cse22 .cse40) 0) (<= (div .cse41 4) .cse21)) (and (<= (+ .cse22 4) 0) (<= (+ .cse22 .cse40) 0) .cse25 (<= (+ (div (+ (- 1) .cse42) 2) 1) .cse21)))) (and (or (and (<= .cse35 .cse27) (= .cse43 |c_ULTIMATE.start_main_~z~0#1|) (<= .cse44 .cse37)) (and (= (* |c_ULTIMATE.start_main_~a~0#1| 24) |c_ULTIMATE.start_main_~z~0#1|) (<= .cse27 .cse38) (<= .cse39 .cse27))) .cse7 .cse29 .cse31) (and .cse17 .cse19 .cse7 (or (and (<= .cse45 .cse20) (<= 6 .cse20) (<= (div .cse46 8) .cse21) (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 10))) (and .cse18 (<= 4 .cse20) (<= (+ (div (+ (- 1) .cse47) 2) 1) .cse21) (<= .cse40 .cse20)))) (and .cse4 (or (and .cse48 (<= .cse21 .cse49) (not (= .cse49 0)) (not (= (+ (* 2 (div .cse50 4)) 1) .cse49)) (<= .cse49 .cse14) (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 13))) (and .cse16 (not (= .cse51 0)) .cse52 (<= .cse21 .cse51) (not (= (+ (* 2 (div .cse53 4)) 1) .cse51)) (<= .cse51 .cse14))) .cse15 .cse54) (and (or (and (<= .cse40 .cse13) .cse5 (<= (+ (div (+ (- 1) .cse36) 2) 1) .cse21) (<= 4 .cse13)) (and (<= 6 .cse13) (<= (div .cse55 16) .cse21) (<= .cse45 .cse13) (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 9)))) .cse4 .cse15 .cse30) (and .cse56 .cse4 (or (and (= (* 23 |c_ULTIMATE.start_main_~a~0#1|) |c_ULTIMATE.start_main_~z~0#1|) .cse57 (= .cse14 .cse58)) (and .cse59 (= .cse60 .cse14) (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 31))))) (and .cse7 .cse61 (or (and .cse62 (= (* |c_ULTIMATE.start_main_~a~0#1| 30) |c_ULTIMATE.start_main_~z~0#1|) (= .cse63 .cse14)) (and (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 22)) (= .cse64 .cse14) .cse65))) (and .cse7 .cse29 (let ((.cse66 (div |c_ULTIMATE.start_main_~b~0#1| 16))) (or (and (<= .cse44 .cse32) (<= .cse21 .cse66) .cse8) (and (<= 6 .cse27) (= .cse33 |c_ULTIMATE.start_main_~z~0#1|) (<= .cse45 .cse27) (<= .cse66 .cse21)))) .cse31) (and .cse4 .cse23 (or (and (<= (+ .cse22 .cse40 4) 0) (= (* 19 |c_ULTIMATE.start_main_~a~0#1|) |c_ULTIMATE.start_main_~z~0#1|) (<= .cse42 .cse37)) (and (<= 0 (+ 7 .cse22 .cse40)) (<= (+ 6 .cse22 .cse40) 0) (= (* |c_ULTIMATE.start_main_~a~0#1| 27) |c_ULTIMATE.start_main_~z~0#1|))) .cse24) (and (or (and (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 12)) (not (= (mod .cse67 2) 1)) (= (div .cse68 4) |c_ULTIMATE.start_main_~y~0#1|) .cse69 (not (= .cse67 0))) (and .cse28 (not (= .cse70 0)) (= |c_ULTIMATE.start_main_~y~0#1| (div .cse71 4)) .cse72 (not (= (mod .cse70 2) 1)))) .cse7 .cse29 .cse73) (and .cse17 .cse19 .cse7 (or (and (<= .cse20 .cse38) (<= .cse39 .cse20) (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 26))) (and (<= .cse47 .cse37) (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 18)) (<= .cse35 .cse20)))) (and .cse7 (or (and (<= .cse21 .cse64) (<= .cse64 .cse14) .cse26 (not (= .cse64 (+ (* 2 (div .cse74 16)) 1))) .cse65 (not (= .cse64 0))) (and .cse62 (not (= .cse63 0)) (<= .cse63 .cse14) (<= .cse21 .cse63) (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 14)) (not (= (+ (* 2 (div .cse75 4)) 1) .cse63)))) .cse61) (and (or (and .cse72 (= .cse70 .cse14) (= (* |c_ULTIMATE.start_main_~a~0#1| 20) |c_ULTIMATE.start_main_~z~0#1|)) (and (= .cse67 .cse14) (= (* |c_ULTIMATE.start_main_~a~0#1| 28) |c_ULTIMATE.start_main_~z~0#1|) .cse69)) .cse7 .cse29 .cse73) (and .cse56 .cse4 (or (and (= |c_ULTIMATE.start_main_~y~0#1| (div .cse76 4)) .cse59 (not (= .cse60 0)) (not (= (mod .cse60 2) 1)) (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 15))) (and (not (= .cse58 0)) (= |c_ULTIMATE.start_main_~y~0#1| (div .cse77 4)) (not (= (mod .cse58 2) 1)) .cse12 .cse57))) (and .cse4 .cse15 .cse54 (or (and .cse48 (= (* |c_ULTIMATE.start_main_~a~0#1| 29) |c_ULTIMATE.start_main_~z~0#1|) (= .cse14 .cse49)) (and .cse52 (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 21)) (= .cse14 .cse51))))))))) (not (and (= |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~b~0#1|) (= |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~a~0#1|) .cse2 .cse8)) (not (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 15 (* |c_ULTIMATE.start_main_~y~0#1| 16))) (= (+ |c_ULTIMATE.start_main_~z~0#1| (* .cse0 16)) .cse1) .cse2 (= .cse43 |c_ULTIMATE.start_main_~x~0#1|)))))))))) is different from true [2024-11-25 03:42:33,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:42:33,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 37 states and 88 transitions. [2024-11-25 03:42:33,593 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 88 transitions. [2024-11-25 03:42:33,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-25 03:42:33,594 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:42:33,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:42:33,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 03:42:34,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:42:34,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-25 03:42:34,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 03:42:36,074 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 26 proven. 37 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-25 03:43:26,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:43:26,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 39 states and 98 transitions. [2024-11-25 03:43:26,983 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 98 transitions. [2024-11-25 03:43:26,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-25 03:43:26,984 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:43:26,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:43:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 03:43:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:43:27,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-25 03:43:27,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 03:43:31,072 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 36 proven. 39 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-25 03:43:53,302 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse55 (+ (- 1) |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse9 (div |c_ULTIMATE.start_main_~b~0#1| 2)) (.cse6 (div .cse55 2))) (let ((.cse83 (* (- 1) .cse6)) (.cse46 (+ (- 1) .cse9))) (let ((.cse21 (* |c_ULTIMATE.start_main_~y~0#1| 2)) (.cse4 (= (mod |c_ULTIMATE.start_main_~b~0#1| 2) 1)) (.cse78 (+ .cse9 1)) (.cse20 (div .cse46 2)) (.cse34 (* |c_ULTIMATE.start_main_~a~0#1| 4)) (.cse22 (div (+ 1 .cse83) 2)) (.cse27 (div |c_ULTIMATE.start_main_~b~0#1| 4)) (.cse13 (div .cse55 4)) (.cse10 (* |c_ULTIMATE.start_main_~a~0#1| 2))) (let ((.cse3 (= |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 32))) (.cse25 (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 3))) (.cse18 (= |c_ULTIMATE.start_main_~z~0#1| .cse10)) (.cse16 (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 5))) (.cse5 (= |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~z~0#1|)) (.cse30 (not (= (mod .cse13 2) 1))) (.cse33 (* |c_ULTIMATE.start_main_~a~0#1| 8)) (.cse31 (not (= (mod .cse27 2) 1))) (.cse23 (not (= (mod .cse22 2) 1))) (.cse24 (= (mod (+ .cse6 1) 2) 0)) (.cse28 (= |c_ULTIMATE.start_main_~z~0#1| .cse34)) (.cse17 (not (= (mod .cse20 2) 1))) (.cse19 (= (mod .cse78 2) 0)) (.cse26 (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 6))) (.cse7 (not .cse4)) (.cse29 (not (= (mod .cse9 2) 1))) (.cse12 (= (* 7 |c_ULTIMATE.start_main_~a~0#1|) |c_ULTIMATE.start_main_~z~0#1|)) (.cse15 (not (= (mod .cse6 2) 1))) (.cse14 (+ .cse21 1)) (.cse32 (* |c_ULTIMATE.start_main_~y~0#1| 4)) (.cse8 (= |c_ULTIMATE.start_main_~z~0#1| 0)) (.cse1 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~a~0#1|)) (.cse0 (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|)) (.cse2 (<= 1 |c_ULTIMATE.start_main_~b~0#1|)) (.cse43 (* |c_ULTIMATE.start_main_~a~0#1| 16))) (and (not (and (= .cse0 (+ (* .cse1 64) |c_ULTIMATE.start_main_~z~0#1|)) (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* |c_ULTIMATE.start_main_~y~0#1| 64) 63)) .cse2 (= (* |c_ULTIMATE.start_main_~a~0#1| 64) |c_ULTIMATE.start_main_~x~0#1|))) (not (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 31 (* |c_ULTIMATE.start_main_~y~0#1| 32))) (= (+ |c_ULTIMATE.start_main_~z~0#1| (* .cse1 32)) .cse0) .cse2 .cse3)) (not (and .cse2 (or (and .cse4 .cse5 (= |c_ULTIMATE.start_main_~y~0#1| .cse6)) (and .cse7 .cse8 (= |c_ULTIMATE.start_main_~y~0#1| .cse9))) (= |c_ULTIMATE.start_main_~x~0#1| .cse10))) (not (and (let ((.cse11 (+ .cse32 3))) (or (and (= .cse6 .cse11) .cse4 .cse12) (and (= .cse13 .cse14) .cse4 .cse15 .cse16) (and .cse17 .cse18 .cse19 .cse7 (not (= .cse20 0)) (<= .cse21 .cse20) (<= .cse20 .cse14)) (and .cse4 (<= 0 (+ .cse21 .cse22 1)) .cse23 .cse24 (not (= .cse22 0)) .cse25 (<= (+ .cse21 .cse22) 0)) (and .cse26 .cse7 (= .cse9 .cse11)) (and (= .cse27 .cse14) .cse7 .cse28 .cse29) (and (not (= .cse13 0)) .cse4 (<= .cse13 .cse14) (<= .cse21 .cse13) .cse15 .cse5 .cse30) (and .cse7 .cse29 (<= .cse21 .cse27) .cse8 .cse31 (<= .cse27 .cse14)))) .cse2 (= |c_ULTIMATE.start_main_~x~0#1| .cse33))) .cse2 (not (and (= |c_ULTIMATE.start_main_~x~0#1| .cse34) .cse2 (or (and (not (= .cse6 0)) .cse4 .cse15 .cse5 (= |c_ULTIMATE.start_main_~y~0#1| .cse13)) (and .cse4 .cse25 (= .cse6 .cse14)) (and (= .cse9 .cse14) .cse18 .cse7) (and .cse7 .cse29 .cse8 (= |c_ULTIMATE.start_main_~y~0#1| .cse27))))) .cse3 (let ((.cse82 (div (+ (* (- 1) .cse13) 1) 2)) (.cse81 (div (+ 3 .cse83) 4)) (.cse80 (div (+ (* (- 1) .cse27) 1) 2)) (.cse74 (+ (- 3) .cse9))) (let ((.cse79 (div .cse74 4)) (.cse71 (* (- 1) .cse80)) (.cse77 (* (- 1) .cse81)) (.cse53 (* (- 1) .cse82))) (let ((.cse48 (= (mod .cse82 2) 1)) (.cse50 (+ (- 1) .cse53)) (.cse59 (= (mod .cse81 2) 1)) (.cse76 (+ (- 1) .cse77)) (.cse68 (+ (- 1) .cse71)) (.cse69 (= (mod .cse80 2) 1)) (.cse75 (+ (- 1) .cse79)) (.cse62 (= (mod .cse79 2) 1)) (.cse41 (* (- 1) .cse22)) (.cse40 (* |c_ULTIMATE.start_main_~y~0#1| 8))) (let ((.cse36 (div .cse55 8)) (.cse44 (div |c_ULTIMATE.start_main_~b~0#1| 8)) (.cse45 (+ 2 .cse40)) (.cse42 (div .cse41 2)) (.cse38 (+ 7 .cse40)) (.cse39 (+ 6 .cse40)) (.cse47 (div .cse46 4)) (.cse37 (+ .cse32 2)) (.cse35 (+ .cse40 4)) (.cse65 (not .cse62)) (.cse64 (div .cse74 8)) (.cse63 (div .cse75 2)) (.cse61 (= (mod .cse78 4) 0)) (.cse72 (not .cse69)) (.cse70 (div .cse71 2)) (.cse67 (div .cse68 2)) (.cse73 (= (mod (+ .cse27 1) 2) 0)) (.cse56 (= (mod (+ (* 3 .cse6) 3) 4) 0)) (.cse60 (div .cse76 2)) (.cse58 (div .cse77 2)) (.cse57 (not .cse59)) (.cse54 (= 0 (mod (+ .cse13 1) 2))) (.cse49 (div .cse50 2)) (.cse52 (not .cse48)) (.cse51 (div .cse53 2))) (or (and (or (and (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 17)) (<= .cse35 .cse13) (<= .cse36 .cse37)) (and (<= .cse13 .cse38) (= (* |c_ULTIMATE.start_main_~a~0#1| 25) |c_ULTIMATE.start_main_~z~0#1|) (<= .cse39 .cse13))) .cse4 .cse15 .cse30) (and .cse4 .cse23 .cse24 (or (and (<= (+ 6 .cse22) 0) (= (* |c_ULTIMATE.start_main_~a~0#1| 11) |c_ULTIMATE.start_main_~z~0#1|) (<= (+ 2 .cse22 .cse40) 0) (<= (div .cse41 4) .cse21)) (and (<= (+ .cse22 4) 0) (<= (+ .cse22 .cse40) 0) .cse25 (<= (+ (div (+ (- 1) .cse42) 2) 1) .cse21)))) (and (or (and (<= .cse35 .cse27) (= .cse43 |c_ULTIMATE.start_main_~z~0#1|) (<= .cse44 .cse37)) (and (= (* |c_ULTIMATE.start_main_~a~0#1| 24) |c_ULTIMATE.start_main_~z~0#1|) (<= .cse27 .cse38) (<= .cse39 .cse27))) .cse7 .cse29 .cse31) (and .cse17 .cse19 .cse7 (or (and (<= .cse45 .cse20) (<= 6 .cse20) (<= (div .cse46 8) .cse21) (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 10))) (and .cse18 (<= 4 .cse20) (<= (+ (div (+ (- 1) .cse47) 2) 1) .cse21) (<= .cse40 .cse20)))) (and .cse4 (or (and .cse48 (<= .cse21 .cse49) (not (= .cse49 0)) (not (= (+ (* 2 (div .cse50 4)) 1) .cse49)) (<= .cse49 .cse14) (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 13))) (and .cse16 (not (= .cse51 0)) .cse52 (<= .cse21 .cse51) (not (= (+ (* 2 (div .cse53 4)) 1) .cse51)) (<= .cse51 .cse14))) .cse15 .cse54) (and (or (and (<= .cse40 .cse13) .cse5 (<= (+ (div (+ (- 1) .cse36) 2) 1) .cse21) (<= 4 .cse13)) (and (<= 6 .cse13) (<= (div .cse55 16) .cse21) (<= .cse45 .cse13) (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 9)))) .cse4 .cse15 .cse30) (and .cse56 .cse4 (or (and (= (* 23 |c_ULTIMATE.start_main_~a~0#1|) |c_ULTIMATE.start_main_~z~0#1|) .cse57 (= .cse14 .cse58)) (and .cse59 (= .cse60 .cse14) (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 31))))) (and .cse7 .cse61 (or (and .cse62 (= (* |c_ULTIMATE.start_main_~a~0#1| 30) |c_ULTIMATE.start_main_~z~0#1|) (= .cse63 .cse14)) (and (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 22)) (= .cse64 .cse14) .cse65))) (and .cse7 .cse29 (let ((.cse66 (div |c_ULTIMATE.start_main_~b~0#1| 16))) (or (and (<= .cse44 .cse32) (<= .cse21 .cse66) .cse8) (and (<= 6 .cse27) (= .cse33 |c_ULTIMATE.start_main_~z~0#1|) (<= .cse45 .cse27) (<= .cse66 .cse21)))) .cse31) (and .cse4 .cse23 (or (and (<= (+ .cse22 .cse40 4) 0) (= (* 19 |c_ULTIMATE.start_main_~a~0#1|) |c_ULTIMATE.start_main_~z~0#1|) (<= .cse42 .cse37)) (and (<= 0 (+ 7 .cse22 .cse40)) (<= (+ 6 .cse22 .cse40) 0) (= (* |c_ULTIMATE.start_main_~a~0#1| 27) |c_ULTIMATE.start_main_~z~0#1|))) .cse24) (and (or (and (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 12)) (not (= (mod .cse67 2) 1)) (= (div .cse68 4) |c_ULTIMATE.start_main_~y~0#1|) .cse69 (not (= .cse67 0))) (and .cse28 (not (= .cse70 0)) (= |c_ULTIMATE.start_main_~y~0#1| (div .cse71 4)) .cse72 (not (= (mod .cse70 2) 1)))) .cse7 .cse29 .cse73) (and .cse17 .cse19 .cse7 (or (and (<= .cse20 .cse38) (<= .cse39 .cse20) (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 26))) (and (<= .cse47 .cse37) (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 18)) (<= .cse35 .cse20)))) (and .cse7 (or (and (<= .cse21 .cse64) (<= .cse64 .cse14) .cse26 (not (= .cse64 (+ (* 2 (div .cse74 16)) 1))) .cse65 (not (= .cse64 0))) (and .cse62 (not (= .cse63 0)) (<= .cse63 .cse14) (<= .cse21 .cse63) (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 14)) (not (= (+ (* 2 (div .cse75 4)) 1) .cse63)))) .cse61) (and (or (and .cse72 (= .cse70 .cse14) (= (* |c_ULTIMATE.start_main_~a~0#1| 20) |c_ULTIMATE.start_main_~z~0#1|)) (and (= .cse67 .cse14) (= (* |c_ULTIMATE.start_main_~a~0#1| 28) |c_ULTIMATE.start_main_~z~0#1|) .cse69)) .cse7 .cse29 .cse73) (and .cse56 .cse4 (or (and (= |c_ULTIMATE.start_main_~y~0#1| (div .cse76 4)) .cse59 (not (= .cse60 0)) (not (= (mod .cse60 2) 1)) (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 15))) (and (not (= .cse58 0)) (= |c_ULTIMATE.start_main_~y~0#1| (div .cse77 4)) (not (= (mod .cse58 2) 1)) .cse12 .cse57))) (and .cse4 .cse15 .cse54 (or (and .cse48 (= (* |c_ULTIMATE.start_main_~a~0#1| 29) |c_ULTIMATE.start_main_~z~0#1|) (= .cse14 .cse49)) (and .cse52 (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 21)) (= .cse14 .cse51))))))))) (not (and (= |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~b~0#1|) (= |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~a~0#1|) .cse2 .cse8)) (not (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 15 (* |c_ULTIMATE.start_main_~y~0#1| 16))) (= (+ |c_ULTIMATE.start_main_~z~0#1| (* .cse1 16)) .cse0) .cse2 (= .cse43 |c_ULTIMATE.start_main_~x~0#1|))))))))) is different from false [2024-11-25 03:44:03,342 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse55 (+ (- 1) |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse9 (div |c_ULTIMATE.start_main_~b~0#1| 2)) (.cse6 (div .cse55 2))) (let ((.cse83 (* (- 1) .cse6)) (.cse46 (+ (- 1) .cse9))) (let ((.cse21 (* |c_ULTIMATE.start_main_~y~0#1| 2)) (.cse4 (= (mod |c_ULTIMATE.start_main_~b~0#1| 2) 1)) (.cse78 (+ .cse9 1)) (.cse20 (div .cse46 2)) (.cse34 (* |c_ULTIMATE.start_main_~a~0#1| 4)) (.cse22 (div (+ 1 .cse83) 2)) (.cse27 (div |c_ULTIMATE.start_main_~b~0#1| 4)) (.cse13 (div .cse55 4)) (.cse10 (* |c_ULTIMATE.start_main_~a~0#1| 2))) (let ((.cse3 (= |c_ULTIMATE.start_main_~x~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 32))) (.cse25 (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 3))) (.cse18 (= |c_ULTIMATE.start_main_~z~0#1| .cse10)) (.cse16 (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 5))) (.cse5 (= |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~z~0#1|)) (.cse30 (not (= (mod .cse13 2) 1))) (.cse33 (* |c_ULTIMATE.start_main_~a~0#1| 8)) (.cse31 (not (= (mod .cse27 2) 1))) (.cse23 (not (= (mod .cse22 2) 1))) (.cse24 (= (mod (+ .cse6 1) 2) 0)) (.cse28 (= |c_ULTIMATE.start_main_~z~0#1| .cse34)) (.cse17 (not (= (mod .cse20 2) 1))) (.cse19 (= (mod .cse78 2) 0)) (.cse26 (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 6))) (.cse7 (not .cse4)) (.cse29 (not (= (mod .cse9 2) 1))) (.cse12 (= (* 7 |c_ULTIMATE.start_main_~a~0#1|) |c_ULTIMATE.start_main_~z~0#1|)) (.cse15 (not (= (mod .cse6 2) 1))) (.cse14 (+ .cse21 1)) (.cse32 (* |c_ULTIMATE.start_main_~y~0#1| 4)) (.cse8 (= |c_ULTIMATE.start_main_~z~0#1| 0)) (.cse1 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~a~0#1|)) (.cse0 (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|)) (.cse2 (<= 1 |c_ULTIMATE.start_main_~b~0#1|)) (.cse43 (* |c_ULTIMATE.start_main_~a~0#1| 16))) (and (not (and (= .cse0 (+ (* .cse1 64) |c_ULTIMATE.start_main_~z~0#1|)) (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* |c_ULTIMATE.start_main_~y~0#1| 64) 63)) .cse2 (= (* |c_ULTIMATE.start_main_~a~0#1| 64) |c_ULTIMATE.start_main_~x~0#1|))) (not (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 31 (* |c_ULTIMATE.start_main_~y~0#1| 32))) (= (+ |c_ULTIMATE.start_main_~z~0#1| (* .cse1 32)) .cse0) .cse2 .cse3)) (not (and .cse2 (or (and .cse4 .cse5 (= |c_ULTIMATE.start_main_~y~0#1| .cse6)) (and .cse7 .cse8 (= |c_ULTIMATE.start_main_~y~0#1| .cse9))) (= |c_ULTIMATE.start_main_~x~0#1| .cse10))) (not (and (let ((.cse11 (+ .cse32 3))) (or (and (= .cse6 .cse11) .cse4 .cse12) (and (= .cse13 .cse14) .cse4 .cse15 .cse16) (and .cse17 .cse18 .cse19 .cse7 (not (= .cse20 0)) (<= .cse21 .cse20) (<= .cse20 .cse14)) (and .cse4 (<= 0 (+ .cse21 .cse22 1)) .cse23 .cse24 (not (= .cse22 0)) .cse25 (<= (+ .cse21 .cse22) 0)) (and .cse26 .cse7 (= .cse9 .cse11)) (and (= .cse27 .cse14) .cse7 .cse28 .cse29) (and (not (= .cse13 0)) .cse4 (<= .cse13 .cse14) (<= .cse21 .cse13) .cse15 .cse5 .cse30) (and .cse7 .cse29 (<= .cse21 .cse27) .cse8 .cse31 (<= .cse27 .cse14)))) .cse2 (= |c_ULTIMATE.start_main_~x~0#1| .cse33))) .cse2 (not (and (= |c_ULTIMATE.start_main_~x~0#1| .cse34) .cse2 (or (and (not (= .cse6 0)) .cse4 .cse15 .cse5 (= |c_ULTIMATE.start_main_~y~0#1| .cse13)) (and .cse4 .cse25 (= .cse6 .cse14)) (and (= .cse9 .cse14) .cse18 .cse7) (and .cse7 .cse29 .cse8 (= |c_ULTIMATE.start_main_~y~0#1| .cse27))))) .cse3 (let ((.cse82 (div (+ (* (- 1) .cse13) 1) 2)) (.cse81 (div (+ 3 .cse83) 4)) (.cse80 (div (+ (* (- 1) .cse27) 1) 2)) (.cse74 (+ (- 3) .cse9))) (let ((.cse79 (div .cse74 4)) (.cse71 (* (- 1) .cse80)) (.cse77 (* (- 1) .cse81)) (.cse53 (* (- 1) .cse82))) (let ((.cse48 (= (mod .cse82 2) 1)) (.cse50 (+ (- 1) .cse53)) (.cse59 (= (mod .cse81 2) 1)) (.cse76 (+ (- 1) .cse77)) (.cse68 (+ (- 1) .cse71)) (.cse69 (= (mod .cse80 2) 1)) (.cse75 (+ (- 1) .cse79)) (.cse62 (= (mod .cse79 2) 1)) (.cse41 (* (- 1) .cse22)) (.cse40 (* |c_ULTIMATE.start_main_~y~0#1| 8))) (let ((.cse36 (div .cse55 8)) (.cse44 (div |c_ULTIMATE.start_main_~b~0#1| 8)) (.cse45 (+ 2 .cse40)) (.cse42 (div .cse41 2)) (.cse38 (+ 7 .cse40)) (.cse39 (+ 6 .cse40)) (.cse47 (div .cse46 4)) (.cse37 (+ .cse32 2)) (.cse35 (+ .cse40 4)) (.cse65 (not .cse62)) (.cse64 (div .cse74 8)) (.cse63 (div .cse75 2)) (.cse61 (= (mod .cse78 4) 0)) (.cse72 (not .cse69)) (.cse70 (div .cse71 2)) (.cse67 (div .cse68 2)) (.cse73 (= (mod (+ .cse27 1) 2) 0)) (.cse56 (= (mod (+ (* 3 .cse6) 3) 4) 0)) (.cse60 (div .cse76 2)) (.cse58 (div .cse77 2)) (.cse57 (not .cse59)) (.cse54 (= 0 (mod (+ .cse13 1) 2))) (.cse49 (div .cse50 2)) (.cse52 (not .cse48)) (.cse51 (div .cse53 2))) (or (and (or (and (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 17)) (<= .cse35 .cse13) (<= .cse36 .cse37)) (and (<= .cse13 .cse38) (= (* |c_ULTIMATE.start_main_~a~0#1| 25) |c_ULTIMATE.start_main_~z~0#1|) (<= .cse39 .cse13))) .cse4 .cse15 .cse30) (and .cse4 .cse23 .cse24 (or (and (<= (+ 6 .cse22) 0) (= (* |c_ULTIMATE.start_main_~a~0#1| 11) |c_ULTIMATE.start_main_~z~0#1|) (<= (+ 2 .cse22 .cse40) 0) (<= (div .cse41 4) .cse21)) (and (<= (+ .cse22 4) 0) (<= (+ .cse22 .cse40) 0) .cse25 (<= (+ (div (+ (- 1) .cse42) 2) 1) .cse21)))) (and (or (and (<= .cse35 .cse27) (= .cse43 |c_ULTIMATE.start_main_~z~0#1|) (<= .cse44 .cse37)) (and (= (* |c_ULTIMATE.start_main_~a~0#1| 24) |c_ULTIMATE.start_main_~z~0#1|) (<= .cse27 .cse38) (<= .cse39 .cse27))) .cse7 .cse29 .cse31) (and .cse17 .cse19 .cse7 (or (and (<= .cse45 .cse20) (<= 6 .cse20) (<= (div .cse46 8) .cse21) (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 10))) (and .cse18 (<= 4 .cse20) (<= (+ (div (+ (- 1) .cse47) 2) 1) .cse21) (<= .cse40 .cse20)))) (and .cse4 (or (and .cse48 (<= .cse21 .cse49) (not (= .cse49 0)) (not (= (+ (* 2 (div .cse50 4)) 1) .cse49)) (<= .cse49 .cse14) (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 13))) (and .cse16 (not (= .cse51 0)) .cse52 (<= .cse21 .cse51) (not (= (+ (* 2 (div .cse53 4)) 1) .cse51)) (<= .cse51 .cse14))) .cse15 .cse54) (and (or (and (<= .cse40 .cse13) .cse5 (<= (+ (div (+ (- 1) .cse36) 2) 1) .cse21) (<= 4 .cse13)) (and (<= 6 .cse13) (<= (div .cse55 16) .cse21) (<= .cse45 .cse13) (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 9)))) .cse4 .cse15 .cse30) (and .cse56 .cse4 (or (and (= (* 23 |c_ULTIMATE.start_main_~a~0#1|) |c_ULTIMATE.start_main_~z~0#1|) .cse57 (= .cse14 .cse58)) (and .cse59 (= .cse60 .cse14) (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 31))))) (and .cse7 .cse61 (or (and .cse62 (= (* |c_ULTIMATE.start_main_~a~0#1| 30) |c_ULTIMATE.start_main_~z~0#1|) (= .cse63 .cse14)) (and (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 22)) (= .cse64 .cse14) .cse65))) (and .cse7 .cse29 (let ((.cse66 (div |c_ULTIMATE.start_main_~b~0#1| 16))) (or (and (<= .cse44 .cse32) (<= .cse21 .cse66) .cse8) (and (<= 6 .cse27) (= .cse33 |c_ULTIMATE.start_main_~z~0#1|) (<= .cse45 .cse27) (<= .cse66 .cse21)))) .cse31) (and .cse4 .cse23 (or (and (<= (+ .cse22 .cse40 4) 0) (= (* 19 |c_ULTIMATE.start_main_~a~0#1|) |c_ULTIMATE.start_main_~z~0#1|) (<= .cse42 .cse37)) (and (<= 0 (+ 7 .cse22 .cse40)) (<= (+ 6 .cse22 .cse40) 0) (= (* |c_ULTIMATE.start_main_~a~0#1| 27) |c_ULTIMATE.start_main_~z~0#1|))) .cse24) (and (or (and (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 12)) (not (= (mod .cse67 2) 1)) (= (div .cse68 4) |c_ULTIMATE.start_main_~y~0#1|) .cse69 (not (= .cse67 0))) (and .cse28 (not (= .cse70 0)) (= |c_ULTIMATE.start_main_~y~0#1| (div .cse71 4)) .cse72 (not (= (mod .cse70 2) 1)))) .cse7 .cse29 .cse73) (and .cse17 .cse19 .cse7 (or (and (<= .cse20 .cse38) (<= .cse39 .cse20) (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 26))) (and (<= .cse47 .cse37) (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 18)) (<= .cse35 .cse20)))) (and .cse7 (or (and (<= .cse21 .cse64) (<= .cse64 .cse14) .cse26 (not (= .cse64 (+ (* 2 (div .cse74 16)) 1))) .cse65 (not (= .cse64 0))) (and .cse62 (not (= .cse63 0)) (<= .cse63 .cse14) (<= .cse21 .cse63) (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 14)) (not (= (+ (* 2 (div .cse75 4)) 1) .cse63)))) .cse61) (and (or (and .cse72 (= .cse70 .cse14) (= (* |c_ULTIMATE.start_main_~a~0#1| 20) |c_ULTIMATE.start_main_~z~0#1|)) (and (= .cse67 .cse14) (= (* |c_ULTIMATE.start_main_~a~0#1| 28) |c_ULTIMATE.start_main_~z~0#1|) .cse69)) .cse7 .cse29 .cse73) (and .cse56 .cse4 (or (and (= |c_ULTIMATE.start_main_~y~0#1| (div .cse76 4)) .cse59 (not (= .cse60 0)) (not (= (mod .cse60 2) 1)) (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 15))) (and (not (= .cse58 0)) (= |c_ULTIMATE.start_main_~y~0#1| (div .cse77 4)) (not (= (mod .cse58 2) 1)) .cse12 .cse57))) (and .cse4 .cse15 .cse54 (or (and .cse48 (= (* |c_ULTIMATE.start_main_~a~0#1| 29) |c_ULTIMATE.start_main_~z~0#1|) (= .cse14 .cse49)) (and .cse52 (= |c_ULTIMATE.start_main_~z~0#1| (* |c_ULTIMATE.start_main_~a~0#1| 21)) (= .cse14 .cse51))))))))) (not (and (= |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~b~0#1|) (= |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~a~0#1|) .cse2 .cse8)) (not (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 15 (* |c_ULTIMATE.start_main_~y~0#1| 16))) (= (+ |c_ULTIMATE.start_main_~z~0#1| (* .cse1 16)) .cse0) .cse2 (= .cse43 |c_ULTIMATE.start_main_~x~0#1|)))))))))) is different from true [2024-11-25 03:44:03,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:44:03,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 40 states and 102 transitions. [2024-11-25 03:44:03,372 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 102 transitions. [2024-11-25 03:44:03,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-25 03:44:03,373 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:44:03,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:44:03,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 03:44:03,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:44:03,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-25 03:44:03,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 03:44:08,376 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 32 proven. 40 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-25 03:44:15,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:44:15,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 40 states and 102 transitions. [2024-11-25 03:44:15,048 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 102 transitions. [2024-11-25 03:44:15,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-25 03:44:15,049 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:44:15,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:44:15,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 03:44:15,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:44:15,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-25 03:44:15,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 03:44:16,607 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 34 proven. 38 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-25 03:44:16,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:44:16,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 40 states and 102 transitions. [2024-11-25 03:44:16,840 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 102 transitions. [2024-11-25 03:44:16,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-25 03:44:16,841 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:44:16,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:44:16,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 03:44:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:44:17,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-25 03:44:17,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 03:44:19,483 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 36 proven. 39 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-25 03:44:24,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:44:24,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 40 states and 102 transitions. [2024-11-25 03:44:24,341 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 102 transitions. [2024-11-25 03:44:24,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-25 03:44:24,342 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:44:24,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:44:24,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 03:44:24,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:44:24,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-25 03:44:24,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 03:44:26,680 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 36 proven. 39 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-25 03:44:35,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:44:35,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 40 states and 102 transitions. [2024-11-25 03:44:35,409 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 102 transitions. [2024-11-25 03:44:35,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-25 03:44:35,410 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:44:35,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:44:35,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 03:44:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:44:36,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-25 03:44:36,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 03:44:37,332 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 34 proven. 38 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-25 03:44:37,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:44:37,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 40 states and 102 transitions. [2024-11-25 03:44:37,539 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 102 transitions. [2024-11-25 03:44:37,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-25 03:44:37,540 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:44:37,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:44:37,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-25 03:44:37,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:44:37,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-25 03:44:37,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 03:46:49,491 WARN L286 SmtUtils]: Spent 11.44s on a formula simplification. DAG size of input: 659 DAG size of output: 656 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-25 03:46:59,915 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 36 proven. 39 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-25 03:47:27,764 WARN L286 SmtUtils]: Spent 16.92s on a formula simplification. DAG size of input: 482 DAG size of output: 225 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-25 03:47:55,059 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse27 (* |c_ULTIMATE.start_main_~a~0#1| 15)) (.cse6 (* |c_ULTIMATE.start_main_~a~0#1| 2)) (.cse21 (* |c_ULTIMATE.start_main_~a~0#1| 4)) (.cse13 (* |c_ULTIMATE.start_main_~a~0#1| 11)) (.cse3 (* |c_ULTIMATE.start_main_~a~0#1| 10)) (.cse31 (* |c_ULTIMATE.start_main_~a~0#1| 9)) (.cse43 (* |c_ULTIMATE.start_main_~a~0#1| 8)) (.cse12 (* |c_ULTIMATE.start_main_~a~0#1| 3)) (.cse40 (* |c_ULTIMATE.start_main_~a~0#1| 14)) (.cse41 (* |c_ULTIMATE.start_main_~a~0#1| 6)) (.cse35 (* |c_ULTIMATE.start_main_~a~0#1| 5)) (.cse18 (* |c_ULTIMATE.start_main_~a~0#1| 12)) (.cse5 (* |c_ULTIMATE.start_main_~y~0#1| 2)) (.cse28 (* 7 |c_ULTIMATE.start_main_~a~0#1|)) (.cse37 (* |c_ULTIMATE.start_main_~a~0#1| 13)) (.cse44 (<= 1 |c_ULTIMATE.start_main_~b~0#1|)) (.cse45 (= (* |c_ULTIMATE.start_main_~a~0#1| 16) |c_ULTIMATE.start_main_~x~0#1|))) (and (let ((.cse32 (+ (- 1) |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse7 (* |c_ULTIMATE.start_main_~y~0#1| 4)) (.cse14 (= (mod |c_ULTIMATE.start_main_~b~0#1| 2) 1)) (.cse10 (div |c_ULTIMATE.start_main_~b~0#1| 2)) (.cse15 (div .cse32 2))) (let ((.cse16 (* (- 1) .cse15)) (.cse29 (not (= (mod .cse15 2) 1))) (.cse30 (div .cse32 4)) (.cse8 (+ .cse10 1)) (.cse9 (not .cse14)) (.cse22 (not (= (mod .cse10 2) 1))) (.cse2 (+ .cse7 3)) (.cse1 (+ .cse7 2)) (.cse23 (div |c_ULTIMATE.start_main_~b~0#1| 4))) (or (let ((.cse4 (+ (- 1) .cse10))) (let ((.cse0 (div .cse4 2))) (and (not (= (mod .cse0 2) 1)) (or (and (<= .cse1 .cse0) (<= .cse0 .cse2) (= |c_ULTIMATE.start_main_~z~0#1| .cse3)) (and (<= (div .cse4 4) .cse5) (<= 2 .cse0) (= |c_ULTIMATE.start_main_~z~0#1| .cse6) (<= .cse7 .cse0))) (= (mod .cse8 2) 0) .cse9))) (let ((.cse11 (div (+ 1 .cse16) 2))) (and (or (and (<= (+ 2 .cse11) 0) (= |c_ULTIMATE.start_main_~z~0#1| .cse12) (<= (+ .cse7 .cse11) 0) (<= (div (* (- 1) .cse11) 2) .cse5)) (and (<= 0 (+ .cse7 3 .cse11)) (<= (+ .cse7 2 .cse11) 0) (= .cse13 |c_ULTIMATE.start_main_~z~0#1|))) .cse14 (not (= (mod .cse11 2) 1)) (= (mod (+ .cse15 1) 2) 0))) (let ((.cse17 (div (+ (* (- 1) .cse23) 1) 2))) (and (not (= .cse17 0)) (let ((.cse19 (* (- 1) .cse17)) (.cse20 (= (mod .cse17 2) 1))) (or (and (= |c_ULTIMATE.start_main_~z~0#1| .cse18) (= |c_ULTIMATE.start_main_~y~0#1| (div (+ (- 1) .cse19) 2)) .cse20) (and (= |c_ULTIMATE.start_main_~y~0#1| (div .cse19 2)) (= |c_ULTIMATE.start_main_~z~0#1| .cse21) (not .cse20)))) .cse9 .cse22 (= (mod (+ .cse23 1) 2) 0))) (let ((.cse24 (div (+ 3 .cse16) 4))) (and (not (= .cse24 0)) (= (mod (+ (* 3 .cse15) 3) 4) 0) .cse14 (let ((.cse26 (= (mod .cse24 2) 1)) (.cse25 (* (- 1) .cse24))) (or (and (= |c_ULTIMATE.start_main_~y~0#1| (div (+ (- 1) .cse25) 2)) .cse26 (= |c_ULTIMATE.start_main_~z~0#1| .cse27)) (and (= .cse28 |c_ULTIMATE.start_main_~z~0#1|) (not .cse26) (= |c_ULTIMATE.start_main_~y~0#1| (div .cse25 2))))))) (and .cse14 .cse29 (not (= (mod .cse30 2) 1)) (or (and (<= .cse30 .cse2) (<= .cse1 .cse30) (= |c_ULTIMATE.start_main_~z~0#1| .cse31)) (and (<= (div .cse32 8) .cse5) (<= .cse7 .cse30) (= |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~z~0#1|) (<= 2 .cse30)))) (let ((.cse33 (div (+ (* (- 1) .cse30) 1) 2))) (and .cse14 .cse29 (= 0 (mod (+ .cse30 1) 2)) (not (= .cse33 0)) (let ((.cse36 (= (mod .cse33 2) 1)) (.cse34 (* (- 1) .cse33))) (or (and (= |c_ULTIMATE.start_main_~y~0#1| (div .cse34 2)) (= |c_ULTIMATE.start_main_~z~0#1| .cse35) (not .cse36)) (and .cse36 (= |c_ULTIMATE.start_main_~y~0#1| (div (+ (- 1) .cse34) 2)) (= |c_ULTIMATE.start_main_~z~0#1| .cse37)))))) (let ((.cse42 (+ (- 3) .cse10))) (let ((.cse38 (div .cse42 4))) (and (not (= .cse38 0)) .cse9 (let ((.cse39 (= (mod .cse38 2) 1))) (or (and .cse39 (= |c_ULTIMATE.start_main_~y~0#1| (div (+ (- 1) .cse38) 2)) (= |c_ULTIMATE.start_main_~z~0#1| .cse40)) (and (= |c_ULTIMATE.start_main_~z~0#1| .cse41) (= |c_ULTIMATE.start_main_~y~0#1| (div .cse42 8)) (not .cse39)))) (= (mod .cse8 4) 0)))) (and .cse9 .cse22 (or (and (<= (div |c_ULTIMATE.start_main_~b~0#1| 8) .cse5) (= |c_ULTIMATE.start_main_~z~0#1| 0) (<= .cse7 .cse23)) (and (<= .cse23 .cse2) (= .cse43 |c_ULTIMATE.start_main_~z~0#1|) (<= .cse1 .cse23))) (not (= (mod .cse23 2) 1))))))) .cse44 .cse45 (not (and (let ((.cse48 (* (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~a~0#1|) 16)) (.cse49 (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse47 (= (+ |c_ULTIMATE.start_main_~z~0#1| .cse48) .cse49)) (.cse46 (* |c_ULTIMATE.start_main_~y~0#1| 16))) (or (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 15 .cse46)) .cse47 (= (+ .cse27 .cse48) .cse49)) (exists ((v_z_421 Int) (v_y_421 Int)) (let ((.cse50 (* 2 v_y_421))) (let ((.cse51 (* 16 (* |c_ULTIMATE.start_main_~a~0#1| v_y_421))) (.cse52 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_421) 8)) (.cse53 (+ .cse50 v_z_421))) (and (<= 1 (+ .cse5 .cse50 v_z_421)) (<= 0 v_z_421) (not (= v_z_421 1)) (= (+ .cse51 .cse52 .cse6 .cse48) .cse49) (<= .cse53 1) (<= v_z_421 1) (= (+ |c_ULTIMATE.start_main_~z~0#1| .cse51 .cse52 .cse48) .cse49) (<= |c_ULTIMATE.start_main_~b~0#1| (+ 2 (* 16 v_y_421) (* v_z_421 8) .cse46)) (<= 0 .cse53))))) (exists ((v_z_451 Int) (v_y_451 Int)) (let ((.cse57 (* 2 v_y_451))) (let ((.cse54 (* 16 (* |c_ULTIMATE.start_main_~a~0#1| v_y_451))) (.cse55 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_451) 8)) (.cse56 (+ .cse57 v_z_451))) (and (= (+ .cse54 .cse55 .cse48 .cse21) .cse49) (<= 0 .cse56) (not (= v_z_451 1)) (<= 0 v_z_451) (= (+ .cse54 |c_ULTIMATE.start_main_~z~0#1| .cse55 .cse48) .cse49) (<= .cse56 1) (not (= (+ .cse5 .cse57 v_z_451) 0)) (<= |c_ULTIMATE.start_main_~b~0#1| (+ 4 (* 16 v_y_451) .cse46 (* v_z_451 8))) (<= v_z_451 1))))) (and (= (+ .cse13 .cse48) .cse49) (<= |c_ULTIMATE.start_main_~b~0#1| (+ 11 .cse46)) .cse47) (and (= (+ .cse48 .cse3) .cse49) .cse47 (<= |c_ULTIMATE.start_main_~b~0#1| (+ 10 .cse46))) (and (= .cse49 (+ .cse31 .cse48)) .cse47 (<= |c_ULTIMATE.start_main_~b~0#1| (+ 9 .cse46))) (and (= .cse49 (+ .cse43 .cse48)) .cse47 (<= |c_ULTIMATE.start_main_~b~0#1| (+ 8 .cse46))) (exists ((v_z_441 Int) (v_y_441 Int)) (let ((.cse61 (* 2 v_y_441))) (let ((.cse59 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_441) 8)) (.cse60 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_441) 16)) (.cse58 (+ .cse61 v_z_441))) (and (<= .cse58 1) (<= |c_ULTIMATE.start_main_~b~0#1| (+ 3 (* v_z_441 8) .cse46 (* 16 v_y_441))) (<= v_z_441 1) (= .cse49 (+ .cse59 .cse60 |c_ULTIMATE.start_main_~z~0#1| .cse48)) (= (+ .cse59 .cse60 .cse12 .cse48) .cse49) (<= 0 .cse58) (<= 0 v_z_441) (<= 1 (+ .cse61 .cse5 v_z_441)) (not (= v_z_441 1)))))) (and (= .cse49 (+ .cse40 .cse48)) (<= |c_ULTIMATE.start_main_~b~0#1| (+ 14 .cse46)) .cse47) (exists ((v_z_433 Int) (v_y_433 Int)) (let ((.cse64 (+ (* 2 v_y_433) v_z_433)) (.cse62 (* 16 (* |c_ULTIMATE.start_main_~a~0#1| v_y_433))) (.cse63 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_433) 8))) (and (not (= v_z_433 1)) (<= v_z_433 1) (= (+ .cse62 .cse63 .cse48) .cse49) (<= 0 v_z_433) (<= 0 .cse64) (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_z_433 8) (* 16 v_y_433) .cse46)) (<= .cse64 1) (= .cse49 (+ .cse62 |c_ULTIMATE.start_main_~z~0#1| .cse63 .cse48))))) (exists ((v_z_446 Int) (v_y_446 Int)) (let ((.cse68 (* 2 v_y_446))) (let ((.cse65 (+ .cse68 v_z_446)) (.cse66 (* 8 (* |c_ULTIMATE.start_main_~a~0#1| v_z_446))) (.cse67 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_446) 16))) (and (<= 0 .cse65) (= (+ .cse66 .cse67 .cse41 .cse48) .cse49) (not (= (+ .cse5 .cse68 v_z_446) 0)) (<= v_z_446 1) (<= .cse65 1) (<= 0 v_z_446) (not (= v_z_446 1)) (= .cse49 (+ .cse66 .cse67 |c_ULTIMATE.start_main_~z~0#1| .cse48)) (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* 16 v_y_446) (* v_z_446 8) 6 .cse46)))))) (exists ((v_z_456 Int) (v_y_456 Int)) (let ((.cse69 (* 2 v_y_456))) (let ((.cse70 (+ .cse69 v_z_456)) (.cse71 (* 16 (* |c_ULTIMATE.start_main_~a~0#1| v_y_456))) (.cse72 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_456) 8))) (and (<= v_z_456 1) (not (= (+ .cse5 .cse69 v_z_456) 0)) (<= .cse70 1) (= .cse49 (+ .cse71 .cse72 .cse48 .cse35)) (<= 0 .cse70) (not (= v_z_456 1)) (<= 0 v_z_456) (= (+ .cse71 |c_ULTIMATE.start_main_~z~0#1| .cse72 .cse48) .cse49) (<= |c_ULTIMATE.start_main_~b~0#1| (+ 5 (* v_z_456 8) (* 16 v_y_456) .cse46)))))) (and .cse47 (= (+ .cse18 .cse48) .cse49) (<= |c_ULTIMATE.start_main_~b~0#1| (+ 12 .cse46))) (exists ((v_y_428 Int) (v_z_428 Int)) (let ((.cse76 (* 2 v_y_428))) (let ((.cse73 (+ .cse76 v_z_428)) (.cse74 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_428) 16)) (.cse75 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_428) 8))) (and (<= .cse73 1) (<= 0 .cse73) (= .cse49 (+ .cse74 |c_ULTIMATE.start_main_~z~0#1| .cse75 .cse48)) (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_z_428 8) .cse46 (* 16 v_y_428) 1)) (<= 0 v_z_428) (<= 1 (+ .cse76 .cse5 v_z_428)) (= (+ .cse74 |c_ULTIMATE.start_main_~a~0#1| .cse75 .cse48) .cse49) (<= v_z_428 1) (not (= v_z_428 1)))))) (exists ((v_y_438 Int) (v_z_438 Int)) (let ((.cse77 (* 2 v_y_438))) (let ((.cse78 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_438) 16)) (.cse79 (* 8 (* |c_ULTIMATE.start_main_~a~0#1| v_z_438))) (.cse80 (+ v_z_438 .cse77))) (and (not (= v_z_438 1)) (<= v_z_438 1) (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_z_438 8) 7 (* 16 v_y_438) .cse46)) (not (= (+ .cse5 v_z_438 .cse77) 0)) (= (+ .cse28 .cse78 .cse79 .cse48) .cse49) (= .cse49 (+ |c_ULTIMATE.start_main_~z~0#1| .cse78 .cse79 .cse48)) (<= 0 .cse80) (<= 0 v_z_438) (<= .cse80 1))))) (and (= (+ .cse37 .cse48) .cse49) .cse47 (<= |c_ULTIMATE.start_main_~b~0#1| (+ 13 .cse46)))))) .cse44 .cse45)))) is different from false [2024-11-25 03:48:05,140 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse27 (* |c_ULTIMATE.start_main_~a~0#1| 15)) (.cse6 (* |c_ULTIMATE.start_main_~a~0#1| 2)) (.cse21 (* |c_ULTIMATE.start_main_~a~0#1| 4)) (.cse13 (* |c_ULTIMATE.start_main_~a~0#1| 11)) (.cse3 (* |c_ULTIMATE.start_main_~a~0#1| 10)) (.cse31 (* |c_ULTIMATE.start_main_~a~0#1| 9)) (.cse43 (* |c_ULTIMATE.start_main_~a~0#1| 8)) (.cse12 (* |c_ULTIMATE.start_main_~a~0#1| 3)) (.cse40 (* |c_ULTIMATE.start_main_~a~0#1| 14)) (.cse41 (* |c_ULTIMATE.start_main_~a~0#1| 6)) (.cse35 (* |c_ULTIMATE.start_main_~a~0#1| 5)) (.cse18 (* |c_ULTIMATE.start_main_~a~0#1| 12)) (.cse5 (* |c_ULTIMATE.start_main_~y~0#1| 2)) (.cse28 (* 7 |c_ULTIMATE.start_main_~a~0#1|)) (.cse37 (* |c_ULTIMATE.start_main_~a~0#1| 13)) (.cse44 (<= 1 |c_ULTIMATE.start_main_~b~0#1|)) (.cse45 (= (* |c_ULTIMATE.start_main_~a~0#1| 16) |c_ULTIMATE.start_main_~x~0#1|))) (and (let ((.cse32 (+ (- 1) |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse7 (* |c_ULTIMATE.start_main_~y~0#1| 4)) (.cse14 (= (mod |c_ULTIMATE.start_main_~b~0#1| 2) 1)) (.cse10 (div |c_ULTIMATE.start_main_~b~0#1| 2)) (.cse15 (div .cse32 2))) (let ((.cse16 (* (- 1) .cse15)) (.cse29 (not (= (mod .cse15 2) 1))) (.cse30 (div .cse32 4)) (.cse8 (+ .cse10 1)) (.cse9 (not .cse14)) (.cse22 (not (= (mod .cse10 2) 1))) (.cse2 (+ .cse7 3)) (.cse1 (+ .cse7 2)) (.cse23 (div |c_ULTIMATE.start_main_~b~0#1| 4))) (or (let ((.cse4 (+ (- 1) .cse10))) (let ((.cse0 (div .cse4 2))) (and (not (= (mod .cse0 2) 1)) (or (and (<= .cse1 .cse0) (<= .cse0 .cse2) (= |c_ULTIMATE.start_main_~z~0#1| .cse3)) (and (<= (div .cse4 4) .cse5) (<= 2 .cse0) (= |c_ULTIMATE.start_main_~z~0#1| .cse6) (<= .cse7 .cse0))) (= (mod .cse8 2) 0) .cse9))) (let ((.cse11 (div (+ 1 .cse16) 2))) (and (or (and (<= (+ 2 .cse11) 0) (= |c_ULTIMATE.start_main_~z~0#1| .cse12) (<= (+ .cse7 .cse11) 0) (<= (div (* (- 1) .cse11) 2) .cse5)) (and (<= 0 (+ .cse7 3 .cse11)) (<= (+ .cse7 2 .cse11) 0) (= .cse13 |c_ULTIMATE.start_main_~z~0#1|))) .cse14 (not (= (mod .cse11 2) 1)) (= (mod (+ .cse15 1) 2) 0))) (let ((.cse17 (div (+ (* (- 1) .cse23) 1) 2))) (and (not (= .cse17 0)) (let ((.cse19 (* (- 1) .cse17)) (.cse20 (= (mod .cse17 2) 1))) (or (and (= |c_ULTIMATE.start_main_~z~0#1| .cse18) (= |c_ULTIMATE.start_main_~y~0#1| (div (+ (- 1) .cse19) 2)) .cse20) (and (= |c_ULTIMATE.start_main_~y~0#1| (div .cse19 2)) (= |c_ULTIMATE.start_main_~z~0#1| .cse21) (not .cse20)))) .cse9 .cse22 (= (mod (+ .cse23 1) 2) 0))) (let ((.cse24 (div (+ 3 .cse16) 4))) (and (not (= .cse24 0)) (= (mod (+ (* 3 .cse15) 3) 4) 0) .cse14 (let ((.cse26 (= (mod .cse24 2) 1)) (.cse25 (* (- 1) .cse24))) (or (and (= |c_ULTIMATE.start_main_~y~0#1| (div (+ (- 1) .cse25) 2)) .cse26 (= |c_ULTIMATE.start_main_~z~0#1| .cse27)) (and (= .cse28 |c_ULTIMATE.start_main_~z~0#1|) (not .cse26) (= |c_ULTIMATE.start_main_~y~0#1| (div .cse25 2))))))) (and .cse14 .cse29 (not (= (mod .cse30 2) 1)) (or (and (<= .cse30 .cse2) (<= .cse1 .cse30) (= |c_ULTIMATE.start_main_~z~0#1| .cse31)) (and (<= (div .cse32 8) .cse5) (<= .cse7 .cse30) (= |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~z~0#1|) (<= 2 .cse30)))) (let ((.cse33 (div (+ (* (- 1) .cse30) 1) 2))) (and .cse14 .cse29 (= 0 (mod (+ .cse30 1) 2)) (not (= .cse33 0)) (let ((.cse36 (= (mod .cse33 2) 1)) (.cse34 (* (- 1) .cse33))) (or (and (= |c_ULTIMATE.start_main_~y~0#1| (div .cse34 2)) (= |c_ULTIMATE.start_main_~z~0#1| .cse35) (not .cse36)) (and .cse36 (= |c_ULTIMATE.start_main_~y~0#1| (div (+ (- 1) .cse34) 2)) (= |c_ULTIMATE.start_main_~z~0#1| .cse37)))))) (let ((.cse42 (+ (- 3) .cse10))) (let ((.cse38 (div .cse42 4))) (and (not (= .cse38 0)) .cse9 (let ((.cse39 (= (mod .cse38 2) 1))) (or (and .cse39 (= |c_ULTIMATE.start_main_~y~0#1| (div (+ (- 1) .cse38) 2)) (= |c_ULTIMATE.start_main_~z~0#1| .cse40)) (and (= |c_ULTIMATE.start_main_~z~0#1| .cse41) (= |c_ULTIMATE.start_main_~y~0#1| (div .cse42 8)) (not .cse39)))) (= (mod .cse8 4) 0)))) (and .cse9 .cse22 (or (and (<= (div |c_ULTIMATE.start_main_~b~0#1| 8) .cse5) (= |c_ULTIMATE.start_main_~z~0#1| 0) (<= .cse7 .cse23)) (and (<= .cse23 .cse2) (= .cse43 |c_ULTIMATE.start_main_~z~0#1|) (<= .cse1 .cse23))) (not (= (mod .cse23 2) 1))))))) .cse44 .cse45 (not (and (let ((.cse48 (* (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~a~0#1|) 16)) (.cse49 (* |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~b~0#1|))) (let ((.cse47 (= (+ |c_ULTIMATE.start_main_~z~0#1| .cse48) .cse49)) (.cse46 (* |c_ULTIMATE.start_main_~y~0#1| 16))) (or (and (<= |c_ULTIMATE.start_main_~b~0#1| (+ 15 .cse46)) .cse47 (= (+ .cse27 .cse48) .cse49)) (exists ((v_z_421 Int) (v_y_421 Int)) (let ((.cse50 (* 2 v_y_421))) (let ((.cse51 (* 16 (* |c_ULTIMATE.start_main_~a~0#1| v_y_421))) (.cse52 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_421) 8)) (.cse53 (+ .cse50 v_z_421))) (and (<= 1 (+ .cse5 .cse50 v_z_421)) (<= 0 v_z_421) (not (= v_z_421 1)) (= (+ .cse51 .cse52 .cse6 .cse48) .cse49) (<= .cse53 1) (<= v_z_421 1) (= (+ |c_ULTIMATE.start_main_~z~0#1| .cse51 .cse52 .cse48) .cse49) (<= |c_ULTIMATE.start_main_~b~0#1| (+ 2 (* 16 v_y_421) (* v_z_421 8) .cse46)) (<= 0 .cse53))))) (exists ((v_z_451 Int) (v_y_451 Int)) (let ((.cse57 (* 2 v_y_451))) (let ((.cse54 (* 16 (* |c_ULTIMATE.start_main_~a~0#1| v_y_451))) (.cse55 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_451) 8)) (.cse56 (+ .cse57 v_z_451))) (and (= (+ .cse54 .cse55 .cse48 .cse21) .cse49) (<= 0 .cse56) (not (= v_z_451 1)) (<= 0 v_z_451) (= (+ .cse54 |c_ULTIMATE.start_main_~z~0#1| .cse55 .cse48) .cse49) (<= .cse56 1) (not (= (+ .cse5 .cse57 v_z_451) 0)) (<= |c_ULTIMATE.start_main_~b~0#1| (+ 4 (* 16 v_y_451) .cse46 (* v_z_451 8))) (<= v_z_451 1))))) (and (= (+ .cse13 .cse48) .cse49) (<= |c_ULTIMATE.start_main_~b~0#1| (+ 11 .cse46)) .cse47) (and (= (+ .cse48 .cse3) .cse49) .cse47 (<= |c_ULTIMATE.start_main_~b~0#1| (+ 10 .cse46))) (and (= .cse49 (+ .cse31 .cse48)) .cse47 (<= |c_ULTIMATE.start_main_~b~0#1| (+ 9 .cse46))) (and (= .cse49 (+ .cse43 .cse48)) .cse47 (<= |c_ULTIMATE.start_main_~b~0#1| (+ 8 .cse46))) (exists ((v_z_441 Int) (v_y_441 Int)) (let ((.cse61 (* 2 v_y_441))) (let ((.cse59 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_441) 8)) (.cse60 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_441) 16)) (.cse58 (+ .cse61 v_z_441))) (and (<= .cse58 1) (<= |c_ULTIMATE.start_main_~b~0#1| (+ 3 (* v_z_441 8) .cse46 (* 16 v_y_441))) (<= v_z_441 1) (= .cse49 (+ .cse59 .cse60 |c_ULTIMATE.start_main_~z~0#1| .cse48)) (= (+ .cse59 .cse60 .cse12 .cse48) .cse49) (<= 0 .cse58) (<= 0 v_z_441) (<= 1 (+ .cse61 .cse5 v_z_441)) (not (= v_z_441 1)))))) (and (= .cse49 (+ .cse40 .cse48)) (<= |c_ULTIMATE.start_main_~b~0#1| (+ 14 .cse46)) .cse47) (exists ((v_z_433 Int) (v_y_433 Int)) (let ((.cse64 (+ (* 2 v_y_433) v_z_433)) (.cse62 (* 16 (* |c_ULTIMATE.start_main_~a~0#1| v_y_433))) (.cse63 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_433) 8))) (and (not (= v_z_433 1)) (<= v_z_433 1) (= (+ .cse62 .cse63 .cse48) .cse49) (<= 0 v_z_433) (<= 0 .cse64) (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_z_433 8) (* 16 v_y_433) .cse46)) (<= .cse64 1) (= .cse49 (+ .cse62 |c_ULTIMATE.start_main_~z~0#1| .cse63 .cse48))))) (exists ((v_z_446 Int) (v_y_446 Int)) (let ((.cse68 (* 2 v_y_446))) (let ((.cse65 (+ .cse68 v_z_446)) (.cse66 (* 8 (* |c_ULTIMATE.start_main_~a~0#1| v_z_446))) (.cse67 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_446) 16))) (and (<= 0 .cse65) (= (+ .cse66 .cse67 .cse41 .cse48) .cse49) (not (= (+ .cse5 .cse68 v_z_446) 0)) (<= v_z_446 1) (<= .cse65 1) (<= 0 v_z_446) (not (= v_z_446 1)) (= .cse49 (+ .cse66 .cse67 |c_ULTIMATE.start_main_~z~0#1| .cse48)) (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* 16 v_y_446) (* v_z_446 8) 6 .cse46)))))) (exists ((v_z_456 Int) (v_y_456 Int)) (let ((.cse69 (* 2 v_y_456))) (let ((.cse70 (+ .cse69 v_z_456)) (.cse71 (* 16 (* |c_ULTIMATE.start_main_~a~0#1| v_y_456))) (.cse72 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_456) 8))) (and (<= v_z_456 1) (not (= (+ .cse5 .cse69 v_z_456) 0)) (<= .cse70 1) (= .cse49 (+ .cse71 .cse72 .cse48 .cse35)) (<= 0 .cse70) (not (= v_z_456 1)) (<= 0 v_z_456) (= (+ .cse71 |c_ULTIMATE.start_main_~z~0#1| .cse72 .cse48) .cse49) (<= |c_ULTIMATE.start_main_~b~0#1| (+ 5 (* v_z_456 8) (* 16 v_y_456) .cse46)))))) (and .cse47 (= (+ .cse18 .cse48) .cse49) (<= |c_ULTIMATE.start_main_~b~0#1| (+ 12 .cse46))) (exists ((v_y_428 Int) (v_z_428 Int)) (let ((.cse76 (* 2 v_y_428))) (let ((.cse73 (+ .cse76 v_z_428)) (.cse74 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_428) 16)) (.cse75 (* (* |c_ULTIMATE.start_main_~a~0#1| v_z_428) 8))) (and (<= .cse73 1) (<= 0 .cse73) (= .cse49 (+ .cse74 |c_ULTIMATE.start_main_~z~0#1| .cse75 .cse48)) (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_z_428 8) .cse46 (* 16 v_y_428) 1)) (<= 0 v_z_428) (<= 1 (+ .cse76 .cse5 v_z_428)) (= (+ .cse74 |c_ULTIMATE.start_main_~a~0#1| .cse75 .cse48) .cse49) (<= v_z_428 1) (not (= v_z_428 1)))))) (exists ((v_y_438 Int) (v_z_438 Int)) (let ((.cse77 (* 2 v_y_438))) (let ((.cse78 (* (* |c_ULTIMATE.start_main_~a~0#1| v_y_438) 16)) (.cse79 (* 8 (* |c_ULTIMATE.start_main_~a~0#1| v_z_438))) (.cse80 (+ v_z_438 .cse77))) (and (not (= v_z_438 1)) (<= v_z_438 1) (<= |c_ULTIMATE.start_main_~b~0#1| (+ (* v_z_438 8) 7 (* 16 v_y_438) .cse46)) (not (= (+ .cse5 v_z_438 .cse77) 0)) (= (+ .cse28 .cse78 .cse79 .cse48) .cse49) (= .cse49 (+ |c_ULTIMATE.start_main_~z~0#1| .cse78 .cse79 .cse48)) (<= 0 .cse80) (<= 0 v_z_438) (<= .cse80 1))))) (and (= (+ .cse37 .cse48) .cse49) .cse47 (<= |c_ULTIMATE.start_main_~b~0#1| (+ 13 .cse46)))))) .cse44 .cse45))))) is different from true [2024-11-25 03:48:22,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-25 03:48:32,275 WARN L286 SmtUtils]: Spent 7.97s on a formula simplification. DAG size of input: 409 DAG size of output: 355 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-25 03:49:07,568 WARN L286 SmtUtils]: Spent 5.22s on a formula simplification. DAG size of input: 411 DAG size of output: 358 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-25 03:49:44,526 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification. DAG size of input: 412 DAG size of output: 356 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-25 03:50:07,429 WARN L286 SmtUtils]: Spent 10.47s on a formula simplification. DAG size of input: 414 DAG size of output: 354 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)