./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/geo3-ll2_unwindbound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5b7446f-859a-4898-ba03-1410004273ab/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5b7446f-859a-4898-ba03-1410004273ab/bin/ukojak-verify-CZk0znPC7b/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5b7446f-859a-4898-ba03-1410004273ab/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5b7446f-859a-4898-ba03-1410004273ab/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/geo3-ll2_unwindbound5.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5b7446f-859a-4898-ba03-1410004273ab/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Overflow-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5b7446f-859a-4898-ba03-1410004273ab/bin/ukojak-verify-CZk0znPC7b --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ecdd934011f0184386bb9e5e09961f3056f116a23d0d68c545d7785bb46c98e0 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 03:34:09,883 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 03:34:09,940 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5b7446f-859a-4898-ba03-1410004273ab/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Overflow-32bit-Kojak_Default.epf [2024-12-06 03:34:09,945 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 03:34:09,945 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 03:34:09,963 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 03:34:09,964 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 03:34:09,964 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 03:34:09,964 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 03:34:09,964 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 03:34:09,964 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 03:34:09,964 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 03:34:09,965 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 03:34:09,965 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 03:34:09,965 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 03:34:09,965 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 03:34:09,965 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 03:34:09,965 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 03:34:09,965 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 03:34:09,965 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-12-06 03:34:09,965 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-06 03:34:09,965 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 03:34:09,965 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 03:34:09,966 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 03:34:09,966 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 03:34:09,966 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 03:34:09,966 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 03:34:09,966 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 03:34:09,966 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 03:34:09,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 03:34:09,966 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 03:34:09,966 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 03:34:09,966 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 03:34:09,967 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 03:34:09,967 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 03:34:09,967 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_e5b7446f-859a-4898-ba03-1410004273ab/bin/ukojak-verify-CZk0znPC7b 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 ! overflow) ) 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 -> ecdd934011f0184386bb9e5e09961f3056f116a23d0d68c545d7785bb46c98e0 [2024-12-06 03:34:10,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 03:34:10,205 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 03:34:10,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 03:34:10,208 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 03:34:10,209 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 03:34:10,210 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5b7446f-859a-4898-ba03-1410004273ab/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/nla-digbench-scaling/geo3-ll2_unwindbound5.c [2024-12-06 03:34:12,860 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5b7446f-859a-4898-ba03-1410004273ab/bin/ukojak-verify-CZk0znPC7b/data/d92e5a42b/25dcdea3be6a46c59f818fda5d18f42e/FLAGcb12e9423 [2024-12-06 03:34:13,057 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 03:34:13,057 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5b7446f-859a-4898-ba03-1410004273ab/sv-benchmarks/c/nla-digbench-scaling/geo3-ll2_unwindbound5.c [2024-12-06 03:34:13,064 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5b7446f-859a-4898-ba03-1410004273ab/bin/ukojak-verify-CZk0znPC7b/data/d92e5a42b/25dcdea3be6a46c59f818fda5d18f42e/FLAGcb12e9423 [2024-12-06 03:34:13,419 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5b7446f-859a-4898-ba03-1410004273ab/bin/ukojak-verify-CZk0znPC7b/data/d92e5a42b/25dcdea3be6a46c59f818fda5d18f42e [2024-12-06 03:34:13,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 03:34:13,422 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 03:34:13,423 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 03:34:13,423 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 03:34:13,426 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 03:34:13,427 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 03:34:13" (1/1) ... [2024-12-06 03:34:13,428 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@315142d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:34:13, skipping insertion in model container [2024-12-06 03:34:13,428 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 03:34:13" (1/1) ... [2024-12-06 03:34:13,437 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 03:34:13,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 03:34:13,590 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 03:34:13,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 03:34:13,619 INFO L204 MainTranslator]: Completed translation [2024-12-06 03:34:13,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:34:13 WrapperNode [2024-12-06 03:34:13,620 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 03:34:13,621 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 03:34:13,621 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 03:34:13,621 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 03:34:13,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:34:13" (1/1) ... [2024-12-06 03:34:13,633 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:34:13" (1/1) ... [2024-12-06 03:34:13,650 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 87 [2024-12-06 03:34:13,650 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 03:34:13,651 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 03:34:13,651 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 03:34:13,651 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 03:34:13,658 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:34:13" (1/1) ... [2024-12-06 03:34:13,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:34:13" (1/1) ... [2024-12-06 03:34:13,660 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:34:13" (1/1) ... [2024-12-06 03:34:13,660 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:34:13" (1/1) ... [2024-12-06 03:34:13,663 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:34:13" (1/1) ... [2024-12-06 03:34:13,664 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:34:13" (1/1) ... [2024-12-06 03:34:13,667 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:34:13" (1/1) ... [2024-12-06 03:34:13,668 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:34:13" (1/1) ... [2024-12-06 03:34:13,668 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:34:13" (1/1) ... [2024-12-06 03:34:13,670 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 03:34:13,670 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 03:34:13,670 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 03:34:13,671 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 03:34:13,671 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:34:13" (1/1) ... [2024-12-06 03:34:13,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 03:34:13,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5b7446f-859a-4898-ba03-1410004273ab/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 03:34:13,700 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5b7446f-859a-4898-ba03-1410004273ab/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 03:34:13,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5b7446f-859a-4898-ba03-1410004273ab/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 03:34:13,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 03:34:13,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 03:34:13,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 03:34:13,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 03:34:13,729 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-12-06 03:34:13,729 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-12-06 03:34:13,777 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 03:34:13,778 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 03:34:14,045 INFO L? ?]: Removed 85 outVars from TransFormulas that were not future-live. [2024-12-06 03:34:14,045 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 03:34:14,075 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 03:34:14,076 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-12-06 03:34:14,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 03:34:14 BoogieIcfgContainer [2024-12-06 03:34:14,076 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 03:34:14,077 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 03:34:14,077 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 03:34:14,085 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 03:34:14,085 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 03:34:14" (1/1) ... [2024-12-06 03:34:14,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 03:34:14,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:34:14,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 74 states and 77 transitions. [2024-12-06 03:34:14,144 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2024-12-06 03:34:14,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-12-06 03:34:14,145 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:34:14,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:34:14,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:34:14,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:34:14,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-06 03:34:14,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:34:14,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:34:14,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:34:14,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 73 states and 76 transitions. [2024-12-06 03:34:14,340 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2024-12-06 03:34:14,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-12-06 03:34:14,340 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:34:14,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:34:14,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:34:14,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:34:14,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-06 03:34:14,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:34:14,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:34:14,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:34:14,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 72 states and 75 transitions. [2024-12-06 03:34:14,418 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2024-12-06 03:34:14,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-12-06 03:34:14,418 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:34:14,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:34:14,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:34:14,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:34:14,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:34:14,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 72 states and 74 transitions. [2024-12-06 03:34:14,455 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2024-12-06 03:34:14,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-12-06 03:34:14,455 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:34:14,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:34:14,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:34:14,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:34:14,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:34:14,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 74 states and 77 transitions. [2024-12-06 03:34:14,661 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2024-12-06 03:34:14,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-06 03:34:14,661 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:34:14,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:34:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:34:14,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:34:14,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:34:14,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 75 states and 78 transitions. [2024-12-06 03:34:14,718 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2024-12-06 03:34:14,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-12-06 03:34:14,718 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:34:14,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:34:14,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:34:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:34:14,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-12-06 03:34:14,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:34:14,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:34:15,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:34:15,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 80 states and 85 transitions. [2024-12-06 03:34:15,296 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2024-12-06 03:34:15,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-12-06 03:34:15,297 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:34:15,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:34:15,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:34:15,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:34:15,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:34:15,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 81 states and 86 transitions. [2024-12-06 03:34:15,394 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2024-12-06 03:34:15,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-06 03:34:15,394 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:34:15,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:34:15,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:34:15,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:34:15,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-12-06 03:34:15,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:34:15,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:34:16,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:34:16,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 87 states and 93 transitions. [2024-12-06 03:34:16,777 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2024-12-06 03:34:16,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-06 03:34:16,777 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:34:16,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:34:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:34:16,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:34:16,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-06 03:34:16,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:34:16,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:34:18,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:34:18,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 94 states and 102 transitions. [2024-12-06 03:34:18,038 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2024-12-06 03:34:18,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-06 03:34:18,038 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:34:18,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:34:18,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:34:18,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:34:18,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-06 03:34:18,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:34:18,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:34:19,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:34:19,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 102 states and 113 transitions. [2024-12-06 03:34:19,445 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2024-12-06 03:34:19,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 03:34:19,445 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:34:19,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:34:19,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:34:19,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:34:21,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:34:21,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 111 states and 126 transitions. [2024-12-06 03:34:21,083 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 126 transitions. [2024-12-06 03:34:21,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-06 03:34:21,083 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:34:21,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:34:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:34:21,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:34:23,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:34:23,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 121 states and 140 transitions. [2024-12-06 03:34:23,110 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 140 transitions. [2024-12-06 03:34:23,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 03:34:23,110 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:34:23,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:34:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:34:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:34:23,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-06 03:34:23,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:34:23,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:34:27,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:34:27,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 132 states and 157 transitions. [2024-12-06 03:34:27,859 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 157 transitions. [2024-12-06 03:34:27,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-06 03:34:27,859 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:34:27,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:34:27,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:34:27,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:34:27,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-06 03:34:27,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:34:40,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:35:04,562 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~y~0#1| 1)) (.cse0 (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1|))) (and (<= .cse0 9223372036854775807) (<= |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~a~0#1|) (<= |c_ULTIMATE.start_main_~x~0#1| 2147483647) .cse1 (not (and .cse1 (exists ((|ULTIMATE.start_main_~a~0#1| Int) (|ULTIMATE.start_main_~z~0#1| Int)) (let ((.cse2 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|))) (and (<= |c_ULTIMATE.start_main_~az~0#1| .cse2) (<= .cse2 9223372036854775807)))))) (<= 0 (+ .cse0 9223372036854775808)) (<= 0 (+ |c_ULTIMATE.start_main_~x~0#1| 2147483648)) (exists ((|ULTIMATE.start_main_~a~0#1| Int) (|ULTIMATE.start_main_~z~0#1| Int)) (let ((.cse3 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|))) (and (<= 0 (+ 9223372036854775808 .cse3)) (<= .cse3 |c_ULTIMATE.start_main_~az~0#1|)))) (<= 0 (+ |c_ULTIMATE.start_main_~z~0#1| 2147483648)) (<= |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~x~0#1|) (= c_~counter~0 0))) is different from false [2024-12-06 03:35:19,559 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= |c_ULTIMATE.start_main_~y~0#1| 1)) (.cse0 (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1|))) (and (<= .cse0 9223372036854775807) (<= |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~a~0#1|) (<= |c_ULTIMATE.start_main_~x~0#1| 2147483647) .cse1 (not (and .cse1 (exists ((|ULTIMATE.start_main_~a~0#1| Int) (|ULTIMATE.start_main_~z~0#1| Int)) (let ((.cse2 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|))) (and (<= |c_ULTIMATE.start_main_~az~0#1| .cse2) (<= .cse2 9223372036854775807)))))) (<= 0 (+ .cse0 9223372036854775808)) (<= 0 (+ |c_ULTIMATE.start_main_~x~0#1| 2147483648)) (exists ((|ULTIMATE.start_main_~a~0#1| Int) (|ULTIMATE.start_main_~z~0#1| Int)) (let ((.cse3 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|))) (and (<= 0 (+ 9223372036854775808 .cse3)) (<= .cse3 |c_ULTIMATE.start_main_~az~0#1|)))) (<= 0 (+ |c_ULTIMATE.start_main_~z~0#1| 2147483648)) (<= |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~x~0#1|) (= c_~counter~0 0)))) is different from true [2024-12-06 03:35:29,686 WARN L286 SmtUtils]: Spent 10.07s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-06 03:37:18,601 WARN L286 SmtUtils]: Spent 59.15s on a formula simplification. DAG size of input: 38 DAG size of output: 32 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-06 03:37:30,941 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse0 (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1|))) (and (<= .cse0 9223372036854775807) (<= |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~a~0#1|) (<= |c_ULTIMATE.start_main_~x~0#1| 2147483647) (= |c_ULTIMATE.start_main_~y~0#1| 1) (<= 0 (+ .cse0 9223372036854775808)) (<= 0 (+ |c_ULTIMATE.start_main_~x~0#1| 2147483648)) (<= 0 (+ |c_ULTIMATE.start_main_~z~0#1| 2147483648)) (<= |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~x~0#1|) (= |c_ULTIMATE.start_main_#t~post7#1| 0) (not (exists ((|ULTIMATE.start_main_~a~0#1| Int) (|ULTIMATE.start_main_~z~0#1| Int)) (let ((.cse1 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|))) (and (<= |c_ULTIMATE.start_main_~az~0#1| .cse1) (<= .cse1 9223372036854775807)))))))) is different from true [2024-12-06 03:37:40,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 10.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-12-06 03:40:02,438 WARN L286 SmtUtils]: Spent 1.23m on a formula simplification. DAG size of input: 36 DAG size of output: 30 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-06 03:40:14,938 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse0 (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1|))) (and (<= .cse0 9223372036854775807) (<= |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~a~0#1|) (<= |c_ULTIMATE.start_main_~x~0#1| 2147483647) (= |c_ULTIMATE.start_main_~y~0#1| 1) (<= 0 (+ .cse0 9223372036854775808)) (<= 0 (+ |c_ULTIMATE.start_main_~x~0#1| 2147483648)) (<= 0 (+ |c_ULTIMATE.start_main_~z~0#1| 2147483648)) (<= |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~x~0#1|) (not (exists ((|ULTIMATE.start_main_~a~0#1| Int) (|ULTIMATE.start_main_~z~0#1| Int)) (let ((.cse1 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|))) (and (<= |c_ULTIMATE.start_main_~az~0#1| .cse1) (<= .cse1 9223372036854775807)))))))) is different from true [2024-12-06 03:40:21,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 6.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-12-06 03:42:50,629 WARN L286 SmtUtils]: Spent 1.38m on a formula simplification. DAG size of input: 35 DAG size of output: 29 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-06 03:42:56,551 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse0 (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1|))) (and (<= |c_ULTIMATE.start_main_~x~0#1| (+ |c_ULTIMATE.start_main_~a~0#1| .cse0 9223372036854775808)) (<= .cse0 9223372036854775807) (<= |c_ULTIMATE.start_main_~x~0#1| 2147483647) (= |c_ULTIMATE.start_main_~y~0#1| 1) (<= 0 (+ |c_ULTIMATE.start_main_~x~0#1| 2147483648)) (<= 0 (+ |c_ULTIMATE.start_main_~z~0#1| 2147483648)) (<= |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~x~0#1|) (not (exists ((|ULTIMATE.start_main_~a~0#1| Int) (|ULTIMATE.start_main_~z~0#1| Int)) (let ((.cse1 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|))) (and (<= |c_ULTIMATE.start_main_~az~0#1| .cse1) (<= .cse1 9223372036854775807)))))))) is different from true [2024-12-06 03:46:09,226 WARN L286 SmtUtils]: Spent 1.30m on a formula simplification. DAG size of input: 39 DAG size of output: 33 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-06 03:46:38,906 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse0 (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1|))) (and (<= |c_ULTIMATE.start_main_~x~0#1| (+ |c_ULTIMATE.start_main_~a~0#1| .cse0 9223372036854775808)) (<= .cse0 9223372036854775807) (<= |c_ULTIMATE.start_main_~x~0#1| 2147483647) (= |c_ULTIMATE.start_main_~y~0#1| 1) (<= 0 (+ .cse0 9223372036854775808)) (<= 0 (+ |c_ULTIMATE.start_main_~x~0#1| 2147483648)) (<= 0 (+ |c_ULTIMATE.start_main_~z~0#1| 2147483648)) (<= (+ |c_ULTIMATE.start_main_~a~0#1| .cse0) (+ |c_ULTIMATE.start_main_~x~0#1| 9223372036854775807)) (not (exists ((|ULTIMATE.start_main_~a~0#1| Int) (|ULTIMATE.start_main_~z~0#1| Int)) (let ((.cse1 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|))) (and (<= |c_ULTIMATE.start_main_~az~0#1| .cse1) (<= .cse1 9223372036854775807)))))))) is different from true [2024-12-06 03:46:41,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-12-06 03:46:52,105 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~y~0#1| 1)) (.cse0 (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1|))) (and (<= |c_ULTIMATE.start_main_~x~0#1| (+ |c_ULTIMATE.start_main_~a~0#1| .cse0 9223372036854775808)) (<= .cse0 9223372036854775807) .cse1 (not (and .cse1 (exists ((|ULTIMATE.start_main_~a~0#1| Int) (|ULTIMATE.start_main_~z~0#1| Int)) (let ((.cse2 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|))) (and (<= |c_ULTIMATE.start_main_~az~0#1| .cse2) (<= .cse2 9223372036854775807)))))) (<= 0 (+ |c_ULTIMATE.start_main_~x~0#1| 2147483648)) (exists ((|ULTIMATE.start_main_~a~0#1| Int) (|ULTIMATE.start_main_~z~0#1| Int)) (let ((.cse3 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|))) (and (<= 0 (+ 9223372036854775808 .cse3)) (<= .cse3 |c_ULTIMATE.start_main_~az~0#1|)))) (<= 0 (+ |c_ULTIMATE.start_main_~z~0#1| 2147483648)) (<= (+ |c_ULTIMATE.start_main_~a~0#1| .cse0) (+ |c_ULTIMATE.start_main_~x~0#1| 9223372036854775807)))) is different from false [2024-12-06 03:47:05,710 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= |c_ULTIMATE.start_main_~y~0#1| 1)) (.cse0 (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1|))) (and (<= |c_ULTIMATE.start_main_~x~0#1| (+ |c_ULTIMATE.start_main_~a~0#1| .cse0 9223372036854775808)) (<= .cse0 9223372036854775807) .cse1 (not (and .cse1 (exists ((|ULTIMATE.start_main_~a~0#1| Int) (|ULTIMATE.start_main_~z~0#1| Int)) (let ((.cse2 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|))) (and (<= |c_ULTIMATE.start_main_~az~0#1| .cse2) (<= .cse2 9223372036854775807)))))) (<= 0 (+ |c_ULTIMATE.start_main_~x~0#1| 2147483648)) (exists ((|ULTIMATE.start_main_~a~0#1| Int) (|ULTIMATE.start_main_~z~0#1| Int)) (let ((.cse3 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|))) (and (<= 0 (+ 9223372036854775808 .cse3)) (<= .cse3 |c_ULTIMATE.start_main_~az~0#1|)))) (<= 0 (+ |c_ULTIMATE.start_main_~z~0#1| 2147483648)) (<= (+ |c_ULTIMATE.start_main_~a~0#1| .cse0) (+ |c_ULTIMATE.start_main_~x~0#1| 9223372036854775807))))) is different from true [2024-12-06 03:47:13,122 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~y~0#1| 1)) (.cse0 (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1|))) (and (<= |c_ULTIMATE.start_main_~x~0#1| (+ |c_ULTIMATE.start_main_~a~0#1| .cse0 9223372036854775808)) .cse1 (not (and .cse1 (exists ((|ULTIMATE.start_main_~a~0#1| Int) (|ULTIMATE.start_main_~z~0#1| Int)) (let ((.cse2 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|))) (and (<= |c_ULTIMATE.start_main_~az~0#1| .cse2) (<= .cse2 9223372036854775807)))))) (exists ((|ULTIMATE.start_main_~a~0#1| Int) (|ULTIMATE.start_main_~z~0#1| Int)) (let ((.cse3 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|))) (and (<= 0 (+ 9223372036854775808 .cse3)) (<= .cse3 |c_ULTIMATE.start_main_~az~0#1|)))) (<= (+ |c_ULTIMATE.start_main_~a~0#1| .cse0) (+ |c_ULTIMATE.start_main_~x~0#1| 9223372036854775807)))) is different from false [2024-12-06 03:47:21,128 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= |c_ULTIMATE.start_main_~y~0#1| 1)) (.cse0 (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1|))) (and (<= |c_ULTIMATE.start_main_~x~0#1| (+ |c_ULTIMATE.start_main_~a~0#1| .cse0 9223372036854775808)) .cse1 (not (and .cse1 (exists ((|ULTIMATE.start_main_~a~0#1| Int) (|ULTIMATE.start_main_~z~0#1| Int)) (let ((.cse2 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|))) (and (<= |c_ULTIMATE.start_main_~az~0#1| .cse2) (<= .cse2 9223372036854775807)))))) (exists ((|ULTIMATE.start_main_~a~0#1| Int) (|ULTIMATE.start_main_~z~0#1| Int)) (let ((.cse3 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|))) (and (<= 0 (+ 9223372036854775808 .cse3)) (<= .cse3 |c_ULTIMATE.start_main_~az~0#1|)))) (<= (+ |c_ULTIMATE.start_main_~a~0#1| .cse0) (+ |c_ULTIMATE.start_main_~x~0#1| 9223372036854775807))))) is different from true [2024-12-06 03:48:54,903 WARN L286 SmtUtils]: Spent 17.95s on a formula simplification. DAG size of input: 27 DAG size of output: 19 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-06 03:49:11,524 WARN L873 $PredicateComparison]: unable to prove that (not (and (= |c_ULTIMATE.start_main_~y~0#1| 1) (<= (+ |c_ULTIMATE.start_main_~a~0#1| (* |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~z~0#1|)) (+ |c_ULTIMATE.start_main_~x~0#1| 9223372036854775807)) (not (exists ((|ULTIMATE.start_main_~a~0#1| Int) (|ULTIMATE.start_main_~z~0#1| Int)) (let ((.cse0 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|))) (and (<= |c_ULTIMATE.start_main_~az~0#1| .cse0) (<= .cse0 9223372036854775807))))))) is different from true [2024-12-06 03:49:16,713 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~y~0#1| 1))) (and .cse0 (not (and .cse0 (exists ((|ULTIMATE.start_main_~a~0#1| Int) (|ULTIMATE.start_main_~z~0#1| Int)) (let ((.cse1 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|))) (and (<= |c_ULTIMATE.start_main_~az~0#1| .cse1) (<= .cse1 9223372036854775807)))))) (exists ((|ULTIMATE.start_main_~a~0#1| Int) (|ULTIMATE.start_main_~z~0#1| Int)) (let ((.cse2 (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|))) (and (<= 0 (+ 9223372036854775808 .cse2)) (<= .cse2 |c_ULTIMATE.start_main_~az~0#1|)))))) is different from false