./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound100.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_209c45cf-57c7-49c8-bc1c-4f7477d809c0/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_209c45cf-57c7-49c8-bc1c-4f7477d809c0/bin/ukojak-verify-EEHR8qb7sm/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_209c45cf-57c7-49c8-bc1c-4f7477d809c0/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_209c45cf-57c7-49c8-bc1c-4f7477d809c0/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound100.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_209c45cf-57c7-49c8-bc1c-4f7477d809c0/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_209c45cf-57c7-49c8-bc1c-4f7477d809c0/bin/ukojak-verify-EEHR8qb7sm --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 36da946a83103a61b88f0f1db9af94484aad5eefbde5313f974f53b267bd14bf --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 23:18:37,277 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 23:18:37,347 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_209c45cf-57c7-49c8-bc1c-4f7477d809c0/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 23:18:37,352 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 23:18:37,352 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 23:18:37,378 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 23:18:37,379 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 23:18:37,379 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 23:18:37,379 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 23:18:37,380 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 23:18:37,380 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 23:18:37,380 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 23:18:37,380 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 23:18:37,380 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 23:18:37,380 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 23:18:37,380 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 23:18:37,381 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 23:18:37,381 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 23:18:37,381 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 23:18:37,381 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 23:18:37,381 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 23:18:37,381 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 23:18:37,381 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 23:18:37,381 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 23:18:37,382 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 23:18:37,382 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 23:18:37,382 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 23:18:37,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 23:18:37,382 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 23:18:37,382 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 23:18:37,382 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 23:18:37,383 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 23:18:37,383 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 23:18:37,383 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_209c45cf-57c7-49c8-bc1c-4f7477d809c0/bin/ukojak-verify-EEHR8qb7sm 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 -> 36da946a83103a61b88f0f1db9af94484aad5eefbde5313f974f53b267bd14bf [2024-11-13 23:18:37,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 23:18:37,669 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 23:18:37,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 23:18:37,674 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 23:18:37,675 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 23:18:37,676 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_209c45cf-57c7-49c8-bc1c-4f7477d809c0/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound100.c Unable to find full path for "g++" [2024-11-13 23:18:39,524 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 23:18:39,838 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 23:18:39,841 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_209c45cf-57c7-49c8-bc1c-4f7477d809c0/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound100.c [2024-11-13 23:18:39,859 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_209c45cf-57c7-49c8-bc1c-4f7477d809c0/bin/ukojak-verify-EEHR8qb7sm/data/6bc0cf3b9/6ebc796ac96a44e189096ce44edd0816/FLAGa77c77147 [2024-11-13 23:18:39,906 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_209c45cf-57c7-49c8-bc1c-4f7477d809c0/bin/ukojak-verify-EEHR8qb7sm/data/6bc0cf3b9/6ebc796ac96a44e189096ce44edd0816 [2024-11-13 23:18:39,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 23:18:39,913 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 23:18:39,919 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 23:18:39,921 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 23:18:39,929 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 23:18:39,931 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:18:39" (1/1) ... [2024-11-13 23:18:39,932 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@256a88f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:18:39, skipping insertion in model container [2024-11-13 23:18:39,935 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:18:39" (1/1) ... [2024-11-13 23:18:39,955 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 23:18:40,113 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_209c45cf-57c7-49c8-bc1c-4f7477d809c0/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound100.c[524,537] [2024-11-13 23:18:40,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:18:40,147 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 23:18:40,158 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_209c45cf-57c7-49c8-bc1c-4f7477d809c0/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound100.c[524,537] [2024-11-13 23:18:40,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:18:40,180 INFO L204 MainTranslator]: Completed translation [2024-11-13 23:18:40,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:18:40 WrapperNode [2024-11-13 23:18:40,180 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 23:18:40,181 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 23:18:40,181 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 23:18:40,182 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 23:18:40,188 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:18:40" (1/1) ... [2024-11-13 23:18:40,193 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:18:40" (1/1) ... [2024-11-13 23:18:40,209 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 46 [2024-11-13 23:18:40,209 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 23:18:40,210 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 23:18:40,210 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 23:18:40,210 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 23:18:40,217 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:18:40" (1/1) ... [2024-11-13 23:18:40,218 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:18:40" (1/1) ... [2024-11-13 23:18:40,223 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:18:40" (1/1) ... [2024-11-13 23:18:40,223 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:18:40" (1/1) ... [2024-11-13 23:18:40,226 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:18:40" (1/1) ... [2024-11-13 23:18:40,232 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:18:40" (1/1) ... [2024-11-13 23:18:40,236 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:18:40" (1/1) ... [2024-11-13 23:18:40,237 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:18:40" (1/1) ... [2024-11-13 23:18:40,238 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 23:18:40,240 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 23:18:40,241 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 23:18:40,241 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 23:18:40,242 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:18:40" (1/1) ... [2024-11-13 23:18:40,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 23:18:40,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_209c45cf-57c7-49c8-bc1c-4f7477d809c0/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 23:18:40,283 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_209c45cf-57c7-49c8-bc1c-4f7477d809c0/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 23:18:40,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_209c45cf-57c7-49c8-bc1c-4f7477d809c0/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 23:18:40,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 23:18:40,315 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 23:18:40,315 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 23:18:40,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 23:18:40,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 23:18:40,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 23:18:40,316 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-13 23:18:40,316 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-13 23:18:40,391 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 23:18:40,393 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 23:18:40,508 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-11-13 23:18:40,508 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 23:18:40,556 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 23:18:40,557 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 23:18:40,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:18:40 BoogieIcfgContainer [2024-11-13 23:18:40,557 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 23:18:40,558 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 23:18:40,558 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 23:18:40,572 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 23:18:40,572 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:18:40" (1/1) ... [2024-11-13 23:18:40,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:18:40,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:18:40,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 19 states and 24 transitions. [2024-11-13 23:18:40,644 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2024-11-13 23:18:40,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 23:18:40,649 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:18:40,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:18:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:18:40,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 23:18:40,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:18:40,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 19 states and 22 transitions. [2024-11-13 23:18:40,866 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2024-11-13 23:18:40,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 23:18:40,867 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:18:40,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:18:40,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:18:41,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 23:18:41,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:18:41,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 21 states and 25 transitions. [2024-11-13 23:18:41,163 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2024-11-13 23:18:41,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 23:18:41,164 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:18:41,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:18:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 23:18:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:18:41,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 23:18:41,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:18:41,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 23:18:44,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-13 23:18:45,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-13 23:18:45,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:18:45,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 26 states and 35 transitions. [2024-11-13 23:18:45,710 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2024-11-13 23:18:45,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 23:18:45,711 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:18:45,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:18:45,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:18:47,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 23:18:49,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-13 23:18:51,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-13 23:18:51,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:18:51,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 27 states and 35 transitions. [2024-11-13 23:18:51,471 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2024-11-13 23:18:51,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 23:18:51,472 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:18:51,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:18:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 23:18:51,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:18:51,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 23:18:51,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:19:01,753 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 23:19:27,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-13 23:19:55,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-13 23:20:23,563 WARN L286 SmtUtils]: Spent 14.25s on a formula simplification. DAG size of input: 50 DAG size of output: 27 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 23:20:27,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-13 23:21:01,155 WARN L286 SmtUtils]: Spent 17.56s on a formula simplification. DAG size of input: 50 DAG size of output: 27 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 23:21:16,456 WARN L286 SmtUtils]: Spent 9.43s on a formula simplification. DAG size of input: 48 DAG size of output: 25 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 23:21:25,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:21:25,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 34 states and 56 transitions. [2024-11-13 23:21:25,586 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 56 transitions. [2024-11-13 23:21:25,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 23:21:25,586 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:21:25,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:21:25,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 23:21:25,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:21:25,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 23:21:25,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:21:51,538 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 23:23:21,505 WARN L286 SmtUtils]: Spent 13.05s on a formula simplification. DAG size of input: 37 DAG size of output: 21 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 23:23:48,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-13 23:23:50,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-13 23:23:50,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:23:50,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 35 states and 60 transitions. [2024-11-13 23:23:50,344 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 60 transitions. [2024-11-13 23:23:50,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 23:23:50,345 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:23:50,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:23:50,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 23:23:50,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:23:50,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-13 23:23:50,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:24:06,871 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 23:24:08,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:24:08,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 37 states and 69 transitions. [2024-11-13 23:24:08,812 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 69 transitions. [2024-11-13 23:24:08,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 23:24:08,814 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:24:08,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:24:08,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 23:24:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:24:08,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 23:24:08,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:24:13,362 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 23:25:13,513 WARN L286 SmtUtils]: Spent 5.70s on a formula simplification. DAG size of input: 39 DAG size of output: 1 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 23:25:24,980 WARN L286 SmtUtils]: Spent 11.40s on a formula simplification. DAG size of input: 40 DAG size of output: 30 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 23:25:30,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-13 23:25:31,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:25:31,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 37 states and 65 transitions. [2024-11-13 23:25:31,929 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 65 transitions. [2024-11-13 23:25:31,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 23:25:31,930 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:25:31,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:25:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:25:32,281 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 23:25:48,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:25:48,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 41 states and 78 transitions. [2024-11-13 23:25:48,688 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 78 transitions. [2024-11-13 23:25:48,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 23:25:48,689 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:25:48,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:25:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 23:25:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:25:48,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 23:25:48,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:25:58,493 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 23:26:10,530 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_ULTIMATE.start_main_~u~0#1| 1))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1|)) (.cse4 (= |c_ULTIMATE.start_main_~v~0#1| 1)) (.cse5 (= 3 |c_ULTIMATE.start_main_~v~0#1|)) (.cse3 (= (mod .cse8 2) 0)) (.cse9 (let ((.cse10 (div (+ (- 1) |c_ULTIMATE.start_main_~u~0#1|) 2))) (* .cse10 .cse10)))) (and (= |c_ULTIMATE.start_main_#t~post6#1| 0) (or (let ((.cse0 (div (+ (* (- 1) |c_ULTIMATE.start_main_~u~0#1|) 1) 2))) (let ((.cse1 (* .cse0 .cse0))) (and (<= (+ (* .cse0 4) 5 .cse1) |c_ULTIMATE.start_main_~A~0#1|) (= .cse2 .cse1) .cse3 (<= (+ 2 .cse1) (+ |c_ULTIMATE.start_main_~u~0#1| |c_ULTIMATE.start_main_~A~0#1|)) .cse4))) (let ((.cse7 (div .cse8 2))) (let ((.cse6 (* .cse7 .cse7))) (and .cse5 (<= (+ |c_ULTIMATE.start_main_~u~0#1| |c_ULTIMATE.start_main_~A~0#1| 1) .cse6) (= .cse6 (+ |c_ULTIMATE.start_main_~u~0#1| |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1| 1)) .cse3 (<= (+ 5 .cse6) (+ |c_ULTIMATE.start_main_~A~0#1| (* .cse7 4))))))) (not (and (= .cse2 .cse9) .cse3 .cse4)) (not (and .cse5 (<= (+ |c_ULTIMATE.start_main_~A~0#1| 1) .cse9) .cse3 (= .cse9 (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1| 1))))))) is different from false [2024-11-13 23:26:18,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:26:18,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 42 states and 82 transitions. [2024-11-13 23:26:18,339 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 82 transitions. [2024-11-13 23:26:18,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 23:26:18,340 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:26:18,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:26:18,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 23:26:18,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:26:18,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 23:26:18,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:26:20,991 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 23:27:02,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 8.24s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-13 23:27:04,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-13 23:27:29,776 WARN L286 SmtUtils]: Spent 5.21s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 23:27:33,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:27:33,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 44 states and 86 transitions. [2024-11-13 23:27:33,185 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 86 transitions. [2024-11-13 23:27:33,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 23:27:33,186 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:27:33,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:27:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 23:27:33,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:27:33,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 23:27:33,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:27:36,272 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 23:27:46,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:27:46,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 44 states and 86 transitions. [2024-11-13 23:27:46,645 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 86 transitions. [2024-11-13 23:27:46,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 23:27:46,646 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:27:46,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:27:46,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 23:27:46,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:27:46,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 23:27:46,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:28:05,637 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 23:28:21,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:28:21,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 44 states and 86 transitions. [2024-11-13 23:28:21,169 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 86 transitions. [2024-11-13 23:28:21,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 23:28:21,169 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:28:21,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:28:21,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 23:28:21,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:28:21,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-13 23:28:21,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:29:09,248 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 23:30:21,982 WARN L286 SmtUtils]: Spent 9.93s on a formula simplification. DAG size of input: 49 DAG size of output: 27 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 23:31:21,965 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (= |c_ULTIMATE.start_main_~v~0#1| 1)) (.cse5 (= 3 |c_ULTIMATE.start_main_~v~0#1|)) (.cse8 (+ |c_ULTIMATE.start_main_~A~0#1| 1)) (.cse2 (= (mod (+ |c_ULTIMATE.start_main_~u~0#1| 1) 2) 0)) (.cse10 (let ((.cse11 (div (+ (- 1) |c_ULTIMATE.start_main_~u~0#1|) 2))) (* .cse11 .cse11))) (.cse7 (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1| 1))) (and (let ((.cse1 (+ |c_ULTIMATE.start_main_~u~0#1| |c_ULTIMATE.start_main_~A~0#1|))) (or (let ((.cse0 (let ((.cse4 (div (+ |c_ULTIMATE.start_main_~u~0#1| (- 3)) 2))) (* .cse4 .cse4)))) (and (<= .cse0 |c_ULTIMATE.start_main_~A~0#1|) (<= (+ 5 .cse0) .cse1) .cse2 (= (+ 2 |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1|) (+ .cse0 |c_ULTIMATE.start_main_~u~0#1|)) .cse3)) (let ((.cse6 (let ((.cse9 (div (+ (* (- 1) |c_ULTIMATE.start_main_~u~0#1|) 1) 2))) (* .cse9 .cse9)))) (and .cse5 (= .cse6 .cse7) (<= (+ 3 .cse6) .cse1) .cse2 (<= .cse8 .cse6))))) (not (and (= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1|) .cse10) .cse2 .cse3)) (not (and .cse5 (<= .cse8 .cse10) .cse2 (= .cse10 .cse7))))) is different from false [2024-11-13 23:31:47,193 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse3 (= |c_ULTIMATE.start_main_~v~0#1| 1)) (.cse5 (= 3 |c_ULTIMATE.start_main_~v~0#1|)) (.cse8 (+ |c_ULTIMATE.start_main_~A~0#1| 1)) (.cse2 (= (mod (+ |c_ULTIMATE.start_main_~u~0#1| 1) 2) 0)) (.cse10 (let ((.cse11 (div (+ (- 1) |c_ULTIMATE.start_main_~u~0#1|) 2))) (* .cse11 .cse11))) (.cse7 (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1| 1))) (and (let ((.cse1 (+ |c_ULTIMATE.start_main_~u~0#1| |c_ULTIMATE.start_main_~A~0#1|))) (or (let ((.cse0 (let ((.cse4 (div (+ |c_ULTIMATE.start_main_~u~0#1| (- 3)) 2))) (* .cse4 .cse4)))) (and (<= .cse0 |c_ULTIMATE.start_main_~A~0#1|) (<= (+ 5 .cse0) .cse1) .cse2 (= (+ 2 |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1|) (+ .cse0 |c_ULTIMATE.start_main_~u~0#1|)) .cse3)) (let ((.cse6 (let ((.cse9 (div (+ (* (- 1) |c_ULTIMATE.start_main_~u~0#1|) 1) 2))) (* .cse9 .cse9)))) (and .cse5 (= .cse6 .cse7) (<= (+ 3 .cse6) .cse1) .cse2 (<= .cse8 .cse6))))) (not (and (= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1|) .cse10) .cse2 .cse3)) (not (and .cse5 (<= .cse8 .cse10) .cse2 (= .cse10 .cse7)))))) is different from true [2024-11-13 23:31:47,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:31:47,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 46 states and 94 transitions. [2024-11-13 23:31:47,197 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 94 transitions. [2024-11-13 23:31:47,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 23:31:47,198 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:31:47,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:31:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 23:31:47,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:31:47,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 23:31:47,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:32:02,110 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 23:32:30,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:32:30,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 46 states and 94 transitions. [2024-11-13 23:32:30,725 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 94 transitions. [2024-11-13 23:32:30,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 23:32:30,726 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:32:30,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:32:30,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 23:32:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:32:30,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 23:32:30,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:32:35,851 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 23:33:01,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:33:01,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 46 states and 94 transitions. [2024-11-13 23:33:01,713 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 94 transitions. [2024-11-13 23:33:01,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-13 23:33:01,714 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:33:01,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:33:01,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 23:33:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:33:01,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-13 23:33:01,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:33:34,197 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 23:34:08,766 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (+ |c_ULTIMATE.start_main_~u~0#1| 1)) (.cse9 (div (+ (* (- 1) |c_ULTIMATE.start_main_~u~0#1|) 1) 2))) (let ((.cse6 (* .cse9 .cse9)) (.cse1 (+ |c_ULTIMATE.start_main_~u~0#1| |c_ULTIMATE.start_main_~A~0#1|)) (.cse10 (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1|)) (.cse3 (= |c_ULTIMATE.start_main_~v~0#1| 1)) (.cse5 (= 3 |c_ULTIMATE.start_main_~v~0#1|)) (.cse8 (+ |c_ULTIMATE.start_main_~A~0#1| 1)) (.cse2 (= (mod .cse13 2) 0)) (.cse14 (let ((.cse15 (div (+ (- 1) |c_ULTIMATE.start_main_~u~0#1|) 2))) (* .cse15 .cse15))) (.cse7 (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1| 1))) (and (or (let ((.cse0 (let ((.cse4 (div (+ |c_ULTIMATE.start_main_~u~0#1| (- 3)) 2))) (* .cse4 .cse4)))) (and (<= .cse0 |c_ULTIMATE.start_main_~A~0#1|) (<= (+ 5 .cse0) .cse1) .cse2 (= (+ 2 |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1|) (+ .cse0 |c_ULTIMATE.start_main_~u~0#1|)) .cse3)) (and .cse5 (= .cse6 .cse7) (<= (+ 3 .cse6) .cse1) .cse2 (<= .cse8 .cse6))) (or (and (<= (+ (* .cse9 4) 5 .cse6) |c_ULTIMATE.start_main_~A~0#1|) (= .cse10 .cse6) .cse2 (<= (+ 2 .cse6) .cse1) .cse3) (let ((.cse12 (div .cse13 2))) (let ((.cse11 (* .cse12 .cse12))) (and .cse5 (<= (+ |c_ULTIMATE.start_main_~u~0#1| |c_ULTIMATE.start_main_~A~0#1| 1) .cse11) (= .cse11 (+ |c_ULTIMATE.start_main_~u~0#1| |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1| 1)) .cse2 (<= (+ 5 .cse11) (+ |c_ULTIMATE.start_main_~A~0#1| (* .cse12 4))))))) (not (and (= .cse10 .cse14) .cse2 .cse3)) (not (and .cse5 (<= .cse8 .cse14) .cse2 (= .cse14 .cse7)))))) is different from false