./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c68bdd82-1dd8-4dec-8acd-8d9c4f9be835/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c68bdd82-1dd8-4dec-8acd-8d9c4f9be835/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_c68bdd82-1dd8-4dec-8acd-8d9c4f9be835/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c68bdd82-1dd8-4dec-8acd-8d9c4f9be835/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound20.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c68bdd82-1dd8-4dec-8acd-8d9c4f9be835/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c68bdd82-1dd8-4dec-8acd-8d9c4f9be835/bin/ukojak-verify-CZk0znPC7b --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 2dec1b2e3c1461164aa09bac8cca047a14ba0fda75d53737804411255b62653a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 05:42:19,973 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 05:42:20,027 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c68bdd82-1dd8-4dec-8acd-8d9c4f9be835/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-06 05:42:20,031 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 05:42:20,032 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 05:42:20,050 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 05:42:20,051 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 05:42:20,051 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 05:42:20,052 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 05:42:20,052 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 05:42:20,052 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 05:42:20,052 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 05:42:20,052 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 05:42:20,052 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 05:42:20,052 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 05:42:20,052 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 05:42:20,053 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 05:42:20,053 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 05:42:20,053 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 05:42:20,053 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 05:42:20,053 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 05:42:20,053 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 05:42:20,053 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 05:42:20,053 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 05:42:20,053 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 05:42:20,053 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 05:42:20,054 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 05:42:20,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 05:42:20,054 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 05:42:20,054 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 05:42:20,054 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 05:42:20,054 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 05:42:20,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 05:42:20,054 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_c68bdd82-1dd8-4dec-8acd-8d9c4f9be835/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 ! 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 -> 2dec1b2e3c1461164aa09bac8cca047a14ba0fda75d53737804411255b62653a [2024-12-06 05:42:20,262 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 05:42:20,270 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 05:42:20,272 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 05:42:20,274 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 05:42:20,274 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 05:42:20,275 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c68bdd82-1dd8-4dec-8acd-8d9c4f9be835/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound20.c [2024-12-06 05:42:22,912 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c68bdd82-1dd8-4dec-8acd-8d9c4f9be835/bin/ukojak-verify-CZk0znPC7b/data/9fcd56b13/1a8c65ccbdad4430b4cd724ddc4ac35d/FLAG486d860fa [2024-12-06 05:42:23,104 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 05:42:23,104 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c68bdd82-1dd8-4dec-8acd-8d9c4f9be835/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound20.c [2024-12-06 05:42:23,111 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c68bdd82-1dd8-4dec-8acd-8d9c4f9be835/bin/ukojak-verify-CZk0znPC7b/data/9fcd56b13/1a8c65ccbdad4430b4cd724ddc4ac35d/FLAG486d860fa [2024-12-06 05:42:23,126 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c68bdd82-1dd8-4dec-8acd-8d9c4f9be835/bin/ukojak-verify-CZk0znPC7b/data/9fcd56b13/1a8c65ccbdad4430b4cd724ddc4ac35d [2024-12-06 05:42:23,128 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 05:42:23,129 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 05:42:23,131 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 05:42:23,131 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 05:42:23,135 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 05:42:23,136 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:42:23" (1/1) ... [2024-12-06 05:42:23,137 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1da3f9ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:23, skipping insertion in model container [2024-12-06 05:42:23,137 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:42:23" (1/1) ... [2024-12-06 05:42:23,151 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 05:42:23,286 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_c68bdd82-1dd8-4dec-8acd-8d9c4f9be835/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound20.c[535,548] [2024-12-06 05:42:23,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 05:42:23,316 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 05:42:23,326 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_c68bdd82-1dd8-4dec-8acd-8d9c4f9be835/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound20.c[535,548] [2024-12-06 05:42:23,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 05:42:23,347 INFO L204 MainTranslator]: Completed translation [2024-12-06 05:42:23,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:23 WrapperNode [2024-12-06 05:42:23,347 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 05:42:23,348 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 05:42:23,348 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 05:42:23,348 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 05:42:23,355 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:23" (1/1) ... [2024-12-06 05:42:23,360 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:23" (1/1) ... [2024-12-06 05:42:23,376 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 65 [2024-12-06 05:42:23,376 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 05:42:23,377 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 05:42:23,377 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 05:42:23,377 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 05:42:23,384 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:23" (1/1) ... [2024-12-06 05:42:23,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:23" (1/1) ... [2024-12-06 05:42:23,385 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:23" (1/1) ... [2024-12-06 05:42:23,386 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:23" (1/1) ... [2024-12-06 05:42:23,388 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:23" (1/1) ... [2024-12-06 05:42:23,389 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:23" (1/1) ... [2024-12-06 05:42:23,392 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:23" (1/1) ... [2024-12-06 05:42:23,393 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:23" (1/1) ... [2024-12-06 05:42:23,394 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:23" (1/1) ... [2024-12-06 05:42:23,395 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 05:42:23,396 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 05:42:23,396 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 05:42:23,396 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 05:42:23,397 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:23" (1/1) ... [2024-12-06 05:42:23,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 05:42:23,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c68bdd82-1dd8-4dec-8acd-8d9c4f9be835/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 05:42:23,427 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c68bdd82-1dd8-4dec-8acd-8d9c4f9be835/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 05:42:23,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c68bdd82-1dd8-4dec-8acd-8d9c4f9be835/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 05:42:23,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 05:42:23,456 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-12-06 05:42:23,456 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-12-06 05:42:23,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 05:42:23,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 05:42:23,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 05:42:23,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-12-06 05:42:23,457 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-12-06 05:42:23,512 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 05:42:23,514 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 05:42:23,649 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-12-06 05:42:23,649 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 05:42:23,672 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 05:42:23,672 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2024-12-06 05:42:23,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:42:23 BoogieIcfgContainer [2024-12-06 05:42:23,672 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 05:42:23,673 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 05:42:23,673 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 05:42:23,680 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 05:42:23,680 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:42:23" (1/1) ... [2024-12-06 05:42:23,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 05:42:23,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:42:23,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 27 states and 40 transitions. [2024-12-06 05:42:23,736 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 40 transitions. [2024-12-06 05:42:23,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-06 05:42:23,740 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:42:23,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:42:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:42:23,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 05:42:23,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:42:23,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 27 states and 37 transitions. [2024-12-06 05:42:23,879 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2024-12-06 05:42:23,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 05:42:23,879 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:42:23,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:42:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:42:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:42:23,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-12-06 05:42:23,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:42:24,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 05:42:25,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-12-06 05:42:25,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:42:25,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 32 states and 50 transitions. [2024-12-06 05:42:25,392 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 50 transitions. [2024-12-06 05:42:25,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 05:42:25,393 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:42:25,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:42:25,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:42:25,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 05:42:25,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:42:25,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 34 states and 54 transitions. [2024-12-06 05:42:25,850 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 54 transitions. [2024-12-06 05:42:25,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-06 05:42:25,851 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:42:25,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:42:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:42:26,324 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 05:42:27,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:42:27,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 35 states and 55 transitions. [2024-12-06 05:42:27,817 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 55 transitions. [2024-12-06 05:42:27,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 05:42:27,817 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:42:27,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:42:27,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:42:27,878 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 05:42:27,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:42:27,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 38 states and 58 transitions. [2024-12-06 05:42:27,914 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 58 transitions. [2024-12-06 05:42:27,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-12-06 05:42:27,914 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:42:27,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:42:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:42:28,071 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 05:42:43,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:42:43,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 42 states and 67 transitions. [2024-12-06 05:42:43,817 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 67 transitions. [2024-12-06 05:42:43,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-12-06 05:42:43,818 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:42:43,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:42:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:42:43,904 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 05:42:43,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:42:43,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 42 states and 66 transitions. [2024-12-06 05:42:43,966 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 66 transitions. [2024-12-06 05:42:43,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-12-06 05:42:43,967 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:42:43,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:42:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:42:44,033 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 05:42:47,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:42:47,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 45 states and 71 transitions. [2024-12-06 05:42:47,104 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 71 transitions. [2024-12-06 05:42:47,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-12-06 05:42:47,105 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:42:47,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:42:47,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:42:47,260 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 05:43:10,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:43:10,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 49 states and 80 transitions. [2024-12-06 05:43:10,514 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 80 transitions. [2024-12-06 05:43:10,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-06 05:43:10,515 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:43:10,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:43:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:43:10,635 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 05:43:24,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:43:24,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 51 states and 84 transitions. [2024-12-06 05:43:24,268 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 84 transitions. [2024-12-06 05:43:24,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-06 05:43:24,269 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:43:24,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:43:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:43:24,409 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 05:43:53,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:43:53,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 59 states and 99 transitions. [2024-12-06 05:43:53,240 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 99 transitions. [2024-12-06 05:43:53,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-06 05:43:53,241 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:43:53,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:43:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:43:53,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:43:53,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-12-06 05:43:53,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:44:08,785 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-06 05:44:56,720 WARN L286 SmtUtils]: Spent 8.31s on a formula simplification. DAG size of input: 36 DAG size of output: 26 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-06 05:45:21,653 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification. DAG size of input: 32 DAG size of output: 23 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-06 05:45:39,557 WARN L286 SmtUtils]: Spent 16.42s on a formula simplification. DAG size of input: 34 DAG size of output: 24 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-06 05:46:21,651 WARN L286 SmtUtils]: Spent 16.06s on a formula simplification. DAG size of input: 34 DAG size of output: 24 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-06 05:46:37,700 WARN L286 SmtUtils]: Spent 7.49s on a formula simplification. DAG size of input: 32 DAG size of output: 23 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-06 05:47:02,465 WARN L286 SmtUtils]: Spent 14.48s on a formula simplification. DAG size of input: 34 DAG size of output: 24 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-06 05:47:32,134 WARN L286 SmtUtils]: Spent 7.81s on a formula simplification. DAG size of input: 30 DAG size of output: 21 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-12-06 05:48:31,295 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 [] [2024-12-06 05:48:38,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 6.98s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-12-06 05:48:40,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:48:40,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 68 states and 122 transitions. [2024-12-06 05:48:40,552 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 122 transitions. [2024-12-06 05:48:40,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-06 05:48:40,553 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:48:40,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:48:40,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:48:40,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:48:40,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-12-06 05:48:40,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:48:46,001 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-06 05:48:56,022 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~v~0#1| 1))) (and (not (= |c_ULTIMATE.start_main_~r~0#1| 0)) (<= c_~counter~0 1) (not (and (= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1|) (let ((.cse0 (div (+ (- 1) |c_ULTIMATE.start_main_~u~0#1|) 2))) (* .cse0 .cse0))) (= (mod (+ |c_ULTIMATE.start_main_~u~0#1| 1) 2) 0) .cse1)) .cse1 (= (+ (* |c_ULTIMATE.start_main_~u~0#1| |c_ULTIMATE.start_main_~u~0#1|) (* 2 |c_ULTIMATE.start_main_~v~0#1|)) (+ (* |c_ULTIMATE.start_main_~v~0#1| |c_ULTIMATE.start_main_~v~0#1|) (* |c_ULTIMATE.start_main_~u~0#1| 2) (* |c_ULTIMATE.start_main_~r~0#1| 4) (* |c_ULTIMATE.start_main_~A~0#1| 4))))) is different from false [2024-12-06 05:49:23,662 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~v~0#1| 1))) (and (not (= |c_ULTIMATE.start_main_~r~0#1| 0)) (not (and (= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1|) (let ((.cse0 (div (+ (- 1) |c_ULTIMATE.start_main_~u~0#1|) 2))) (* .cse0 .cse0))) (= (mod (+ |c_ULTIMATE.start_main_~u~0#1| 1) 2) 0) .cse1)) (<= c_~counter~0 2) .cse1 (= (+ (* |c_ULTIMATE.start_main_~u~0#1| |c_ULTIMATE.start_main_~u~0#1|) (* 2 |c_ULTIMATE.start_main_~v~0#1|)) (+ (* |c_ULTIMATE.start_main_~v~0#1| |c_ULTIMATE.start_main_~v~0#1|) (* |c_ULTIMATE.start_main_~u~0#1| 2) (* |c_ULTIMATE.start_main_~r~0#1| 4) (* |c_ULTIMATE.start_main_~A~0#1| 4))))) is different from false [2024-12-06 05:49:33,671 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= |c_ULTIMATE.start_main_~v~0#1| 1))) (and (not (= |c_ULTIMATE.start_main_~r~0#1| 0)) (not (and (= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1|) (let ((.cse0 (div (+ (- 1) |c_ULTIMATE.start_main_~u~0#1|) 2))) (* .cse0 .cse0))) (= (mod (+ |c_ULTIMATE.start_main_~u~0#1| 1) 2) 0) .cse1)) (<= c_~counter~0 2) .cse1 (= (+ (* |c_ULTIMATE.start_main_~u~0#1| |c_ULTIMATE.start_main_~u~0#1|) (* 2 |c_ULTIMATE.start_main_~v~0#1|)) (+ (* |c_ULTIMATE.start_main_~v~0#1| |c_ULTIMATE.start_main_~v~0#1|) (* |c_ULTIMATE.start_main_~u~0#1| 2) (* |c_ULTIMATE.start_main_~r~0#1| 4) (* |c_ULTIMATE.start_main_~A~0#1| 4)))))) is different from true [2024-12-06 05:49:48,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:49:48,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 70 states and 133 transitions. [2024-12-06 05:49:48,248 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 133 transitions. [2024-12-06 05:49:48,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-06 05:49:48,249 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:49:48,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:49:48,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:49:48,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:49:48,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-12-06 05:49:48,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:50:08,517 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 05:50:18,537 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= |c_ULTIMATE.start_main_~v~0#1| 1))) (and (not (= |c_ULTIMATE.start_main_~r~0#1| 0)) (<= c_~counter~0 1) (not (and (= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1|) (let ((.cse0 (div (+ (- 1) |c_ULTIMATE.start_main_~u~0#1|) 2))) (* .cse0 .cse0))) (= (mod (+ |c_ULTIMATE.start_main_~u~0#1| 1) 2) 0) .cse1)) .cse1 (= (+ (* |c_ULTIMATE.start_main_~u~0#1| |c_ULTIMATE.start_main_~u~0#1|) (* 2 |c_ULTIMATE.start_main_~v~0#1|)) (+ (* |c_ULTIMATE.start_main_~v~0#1| |c_ULTIMATE.start_main_~v~0#1|) (* |c_ULTIMATE.start_main_~u~0#1| 2) (* |c_ULTIMATE.start_main_~r~0#1| 4) (* |c_ULTIMATE.start_main_~A~0#1| 4)))))) is different from true [2024-12-06 05:50:28,543 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~v~0#1| 1))) (and (not (= |c_ULTIMATE.start_main_~r~0#1| 0)) (<= |c_ULTIMATE.start_main_#t~post7#1| 1) (not (and (= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1|) (let ((.cse0 (div (+ (- 1) |c_ULTIMATE.start_main_~u~0#1|) 2))) (* .cse0 .cse0))) (= (mod (+ |c_ULTIMATE.start_main_~u~0#1| 1) 2) 0) .cse1)) (<= c_~counter~0 2) .cse1 (= (+ (* |c_ULTIMATE.start_main_~u~0#1| |c_ULTIMATE.start_main_~u~0#1|) (* 2 |c_ULTIMATE.start_main_~v~0#1|)) (+ (* |c_ULTIMATE.start_main_~v~0#1| |c_ULTIMATE.start_main_~v~0#1|) (* |c_ULTIMATE.start_main_~u~0#1| 2) (* |c_ULTIMATE.start_main_~r~0#1| 4) (* |c_ULTIMATE.start_main_~A~0#1| 4))))) is different from false [2024-12-06 05:50:43,338 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= |c_ULTIMATE.start_main_~v~0#1| 1))) (and (not (= |c_ULTIMATE.start_main_~r~0#1| 0)) (<= |c_ULTIMATE.start_main_#t~post7#1| 1) (not (and (= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1|) (let ((.cse0 (div (+ (- 1) |c_ULTIMATE.start_main_~u~0#1|) 2))) (* .cse0 .cse0))) (= (mod (+ |c_ULTIMATE.start_main_~u~0#1| 1) 2) 0) .cse1)) (<= c_~counter~0 2) .cse1 (= (+ (* |c_ULTIMATE.start_main_~u~0#1| |c_ULTIMATE.start_main_~u~0#1|) (* 2 |c_ULTIMATE.start_main_~v~0#1|)) (+ (* |c_ULTIMATE.start_main_~v~0#1| |c_ULTIMATE.start_main_~v~0#1|) (* |c_ULTIMATE.start_main_~u~0#1| 2) (* |c_ULTIMATE.start_main_~r~0#1| 4) (* |c_ULTIMATE.start_main_~A~0#1| 4)))))) is different from true [2024-12-06 05:50:56,122 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~v~0#1| 1))) (and (<= |c_ULTIMATE.start_main_#t~post8#1| 2) (not (and (= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1|) (let ((.cse0 (div (+ (- 1) |c_ULTIMATE.start_main_~u~0#1|) 2))) (* .cse0 .cse0))) (= (mod (+ |c_ULTIMATE.start_main_~u~0#1| 1) 2) 0) .cse1)) .cse1 (<= (+ |c_ULTIMATE.start_main_~r~0#1| 1) 0) (= (+ (* |c_ULTIMATE.start_main_~u~0#1| |c_ULTIMATE.start_main_~u~0#1|) (* 2 |c_ULTIMATE.start_main_~v~0#1|)) (+ (* |c_ULTIMATE.start_main_~v~0#1| |c_ULTIMATE.start_main_~v~0#1|) (* |c_ULTIMATE.start_main_~u~0#1| 2) (* |c_ULTIMATE.start_main_~r~0#1| 4) (* |c_ULTIMATE.start_main_~A~0#1| 4))))) is different from false [2024-12-06 05:51:06,153 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= |c_ULTIMATE.start_main_~v~0#1| 1))) (and (<= |c_ULTIMATE.start_main_#t~post8#1| 2) (not (and (= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1|) (let ((.cse0 (div (+ (- 1) |c_ULTIMATE.start_main_~u~0#1|) 2))) (* .cse0 .cse0))) (= (mod (+ |c_ULTIMATE.start_main_~u~0#1| 1) 2) 0) .cse1)) .cse1 (<= (+ |c_ULTIMATE.start_main_~r~0#1| 1) 0) (= (+ (* |c_ULTIMATE.start_main_~u~0#1| |c_ULTIMATE.start_main_~u~0#1|) (* 2 |c_ULTIMATE.start_main_~v~0#1|)) (+ (* |c_ULTIMATE.start_main_~v~0#1| |c_ULTIMATE.start_main_~v~0#1|) (* |c_ULTIMATE.start_main_~u~0#1| 2) (* |c_ULTIMATE.start_main_~r~0#1| 4) (* |c_ULTIMATE.start_main_~A~0#1| 4)))))) is different from true [2024-12-06 05:51:11,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:51:11,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 75 states and 155 transitions. [2024-12-06 05:51:11,777 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 155 transitions. [2024-12-06 05:51:11,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-06 05:51:11,778 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:51:11,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:51:11,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:51:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:51:11,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-12-06 05:51:11,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:51:16,243 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-06 05:51:30,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:51:30,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 79 states and 173 transitions. [2024-12-06 05:51:30,254 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 173 transitions. [2024-12-06 05:51:30,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-06 05:51:30,255 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:51:30,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:51:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:51:30,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:51:30,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-12-06 05:51:30,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:51:45,368 WARN L286 SmtUtils]: Spent 10.01s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-06 05:51:57,127 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 05:52:07,176 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~v~0#1| 1))) (and (not (and (= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1|) (let ((.cse0 (div (+ (- 1) |c_ULTIMATE.start_main_~u~0#1|) 2))) (* .cse0 .cse0))) (= (mod (+ |c_ULTIMATE.start_main_~u~0#1| 1) 2) 0) .cse1)) (<= c_~counter~0 2) .cse1 (<= (+ |c_ULTIMATE.start_main_~r~0#1| 1) 0) (= (+ (* |c_ULTIMATE.start_main_~u~0#1| |c_ULTIMATE.start_main_~u~0#1|) (* 2 |c_ULTIMATE.start_main_~v~0#1|)) (+ (* |c_ULTIMATE.start_main_~v~0#1| |c_ULTIMATE.start_main_~v~0#1|) (* |c_ULTIMATE.start_main_~u~0#1| 2) (* |c_ULTIMATE.start_main_~r~0#1| 4) (* |c_ULTIMATE.start_main_~A~0#1| 4))))) is different from false [2024-12-06 05:52:21,629 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= |c_ULTIMATE.start_main_~v~0#1| 1))) (and (not (and (= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1|) (let ((.cse0 (div (+ (- 1) |c_ULTIMATE.start_main_~u~0#1|) 2))) (* .cse0 .cse0))) (= (mod (+ |c_ULTIMATE.start_main_~u~0#1| 1) 2) 0) .cse1)) (<= c_~counter~0 2) .cse1 (<= (+ |c_ULTIMATE.start_main_~r~0#1| 1) 0) (= (+ (* |c_ULTIMATE.start_main_~u~0#1| |c_ULTIMATE.start_main_~u~0#1|) (* 2 |c_ULTIMATE.start_main_~v~0#1|)) (+ (* |c_ULTIMATE.start_main_~v~0#1| |c_ULTIMATE.start_main_~v~0#1|) (* |c_ULTIMATE.start_main_~u~0#1| 2) (* |c_ULTIMATE.start_main_~r~0#1| 4) (* |c_ULTIMATE.start_main_~A~0#1| 4)))))) is different from true [2024-12-06 05:52:31,639 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~v~0#1| 1))) (and (not (and (= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1|) (let ((.cse0 (div (+ (- 1) |c_ULTIMATE.start_main_~u~0#1|) 2))) (* .cse0 .cse0))) (= (mod (+ |c_ULTIMATE.start_main_~u~0#1| 1) 2) 0) .cse1)) .cse1 (<= (+ |c_ULTIMATE.start_main_~r~0#1| 1) 0) (= (+ (* |c_ULTIMATE.start_main_~u~0#1| |c_ULTIMATE.start_main_~u~0#1|) (* 2 |c_ULTIMATE.start_main_~v~0#1|)) (+ (* |c_ULTIMATE.start_main_~v~0#1| |c_ULTIMATE.start_main_~v~0#1|) (* |c_ULTIMATE.start_main_~u~0#1| 2) (* |c_ULTIMATE.start_main_~r~0#1| 4) (* |c_ULTIMATE.start_main_~A~0#1| 4))))) is different from false [2024-12-06 05:52:58,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:52:58,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 81 states and 191 transitions. [2024-12-06 05:52:58,305 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 191 transitions. [2024-12-06 05:52:58,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-06 05:52:58,306 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:52:58,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:52:58,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:52:58,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:52:58,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-12-06 05:52:58,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:53:01,836 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-06 05:53:17,301 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= |c_ULTIMATE.start_main_~v~0#1| 1))) (and (not (and (= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1|) (let ((.cse0 (div (+ (- 1) |c_ULTIMATE.start_main_~u~0#1|) 2))) (* .cse0 .cse0))) (= (mod (+ |c_ULTIMATE.start_main_~u~0#1| 1) 2) 0) .cse1)) .cse1 (<= (+ |c_ULTIMATE.start_main_~r~0#1| 1) 0) (= (+ (* |c_ULTIMATE.start_main_~u~0#1| |c_ULTIMATE.start_main_~u~0#1|) (* 2 |c_ULTIMATE.start_main_~v~0#1|)) (+ (* |c_ULTIMATE.start_main_~v~0#1| |c_ULTIMATE.start_main_~v~0#1|) (* |c_ULTIMATE.start_main_~u~0#1| 2) (* |c_ULTIMATE.start_main_~r~0#1| 4) (* |c_ULTIMATE.start_main_~A~0#1| 4)))))) is different from true [2024-12-06 05:53:23,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:53:23,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 85 states and 218 transitions. [2024-12-06 05:53:23,901 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 218 transitions. [2024-12-06 05:53:23,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-06 05:53:23,902 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:53:23,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:53:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:53:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:53:23,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-12-06 05:53:23,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:53:36,737 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 05:53:39,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:53:39,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 87 states and 236 transitions. [2024-12-06 05:53:39,724 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 236 transitions. [2024-12-06 05:53:39,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-06 05:53:39,724 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:53:39,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:53:39,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:53:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:53:39,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-12-06 05:53:39,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:53:50,397 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-06 05:53:53,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:53:53,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 90 states and 265 transitions. [2024-12-06 05:53:53,147 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 265 transitions. [2024-12-06 05:53:53,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-06 05:53:53,148 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:53:53,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:53:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:53:53,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:53:53,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-12-06 05:53:53,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:54:04,251 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-06 05:54:05,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:54:05,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 93 states and 297 transitions. [2024-12-06 05:54:05,367 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 297 transitions. [2024-12-06 05:54:05,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-06 05:54:05,368 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:54:05,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:54:05,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:54:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:54:05,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-12-06 05:54:05,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:54:28,018 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 3 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 05:56:16,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:56:16,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 93 states and 297 transitions. [2024-12-06 05:56:16,523 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 297 transitions. [2024-12-06 05:56:16,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-06 05:56:16,524 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:56:16,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:56:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:56:16,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:56:16,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-12-06 05:56:16,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:56:26,702 WARN L286 SmtUtils]: Spent 5.63s on a formula simplification. DAG size of input: 10 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-06 05:56:57,631 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 05:57:09,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:57:09,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 93 states and 297 transitions. [2024-12-06 05:57:09,782 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 297 transitions. [2024-12-06 05:57:09,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-06 05:57:09,783 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:57:09,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:57:09,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:57:09,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:57:09,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-12-06 05:57:09,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:57:09,995 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 3 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 05:57:13,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:57:13,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 94 states and 305 transitions. [2024-12-06 05:57:13,472 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 305 transitions. [2024-12-06 05:57:13,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-06 05:57:13,473 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:57:13,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:57:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:57:13,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:57:13,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-12-06 05:57:13,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:57:25,855 WARN L286 SmtUtils]: Spent 10.01s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-12-06 05:57:27,391 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 1 refuted. 3 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 05:57:31,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:57:31,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 94 states and 305 transitions. [2024-12-06 05:57:31,006 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 305 transitions. [2024-12-06 05:57:31,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-06 05:57:31,007 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:57:31,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:57:31,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:57:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:57:31,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-12-06 05:57:31,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:57:37,312 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 3 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 05:57:40,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:57:40,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 94 states and 305 transitions. [2024-12-06 05:57:40,828 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 305 transitions. [2024-12-06 05:57:40,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-06 05:57:40,829 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:57:40,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:57:40,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:57:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:57:40,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-12-06 05:57:40,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 05:57:41,040 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 3 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 05:57:45,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:57:45,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 95 states and 316 transitions. [2024-12-06 05:57:45,693 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 316 transitions. [2024-12-06 05:57:45,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-06 05:57:45,693 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:57:45,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:57:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 05:57:45,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:57:45,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-12-06 05:57:45,738 INFO L279 TraceCheckSpWp]: Computing forward predicates...