./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb7f14a-c356-485e-a911-23e9130a5726/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb7f14a-c356-485e-a911-23e9130a5726/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_1bb7f14a-c356-485e-a911-23e9130a5726/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb7f14a-c356-485e-a911-23e9130a5726/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb7f14a-c356-485e-a911-23e9130a5726/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Overflow-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb7f14a-c356-485e-a911-23e9130a5726/bin/ukojak-verify-CZk0znPC7b --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 87608ec580cc80a59c7836f9aeadd0fc773dea5ebb620dd020651936daa4e397 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 03:30:09,729 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 03:30:09,782 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb7f14a-c356-485e-a911-23e9130a5726/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Overflow-32bit-Kojak_Default.epf [2024-12-06 03:30:09,786 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 03:30:09,787 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 03:30:09,805 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 03:30:09,805 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 03:30:09,806 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 03:30:09,806 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 03:30:09,806 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 03:30:09,806 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 03:30:09,806 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 03:30:09,806 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 03:30:09,806 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 03:30:09,806 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 03:30:09,807 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 03:30:09,807 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 03:30:09,807 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 03:30:09,807 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 03:30:09,807 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-12-06 03:30:09,807 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-06 03:30:09,807 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 03:30:09,807 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 03:30:09,807 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 03:30:09,807 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 03:30:09,807 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 03:30:09,807 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 03:30:09,807 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 03:30:09,808 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 03:30:09,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 03:30:09,808 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 03:30:09,808 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 03:30:09,808 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 03:30:09,808 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 03:30:09,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 03:30:09,808 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_1bb7f14a-c356-485e-a911-23e9130a5726/bin/ukojak-verify-CZk0znPC7b Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 87608ec580cc80a59c7836f9aeadd0fc773dea5ebb620dd020651936daa4e397 [2024-12-06 03:30:10,038 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 03:30:10,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 03:30:10,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 03:30:10,050 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 03:30:10,050 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 03:30:10,051 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb7f14a-c356-485e-a911-23e9130a5726/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound1.c [2024-12-06 03:30:12,646 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb7f14a-c356-485e-a911-23e9130a5726/bin/ukojak-verify-CZk0znPC7b/data/2f8b4b181/d7c0923d88794c14a077361d1afbf1f9/FLAG66cb30e2b [2024-12-06 03:30:12,866 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 03:30:12,867 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb7f14a-c356-485e-a911-23e9130a5726/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound1.c [2024-12-06 03:30:12,874 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb7f14a-c356-485e-a911-23e9130a5726/bin/ukojak-verify-CZk0znPC7b/data/2f8b4b181/d7c0923d88794c14a077361d1afbf1f9/FLAG66cb30e2b [2024-12-06 03:30:13,220 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb7f14a-c356-485e-a911-23e9130a5726/bin/ukojak-verify-CZk0znPC7b/data/2f8b4b181/d7c0923d88794c14a077361d1afbf1f9 [2024-12-06 03:30:13,222 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 03:30:13,223 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 03:30:13,224 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 03:30:13,224 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 03:30:13,227 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 03:30:13,228 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 03:30:13" (1/1) ... [2024-12-06 03:30:13,228 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c5408b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:30:13, skipping insertion in model container [2024-12-06 03:30:13,228 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 03:30:13" (1/1) ... [2024-12-06 03:30:13,238 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 03:30:13,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 03:30:13,360 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 03:30:13,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 03:30:13,393 INFO L204 MainTranslator]: Completed translation [2024-12-06 03:30:13,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:30:13 WrapperNode [2024-12-06 03:30:13,394 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 03:30:13,395 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 03:30:13,395 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 03:30:13,395 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 03:30:13,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:30:13" (1/1) ... [2024-12-06 03:30:13,405 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:30:13" (1/1) ... [2024-12-06 03:30:13,426 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 143 [2024-12-06 03:30:13,426 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 03:30:13,426 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 03:30:13,426 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 03:30:13,426 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 03:30:13,432 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:30:13" (1/1) ... [2024-12-06 03:30:13,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:30:13" (1/1) ... [2024-12-06 03:30:13,434 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:30:13" (1/1) ... [2024-12-06 03:30:13,434 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:30:13" (1/1) ... [2024-12-06 03:30:13,437 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:30:13" (1/1) ... [2024-12-06 03:30:13,438 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:30:13" (1/1) ... [2024-12-06 03:30:13,440 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:30:13" (1/1) ... [2024-12-06 03:30:13,442 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:30:13" (1/1) ... [2024-12-06 03:30:13,443 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:30:13" (1/1) ... [2024-12-06 03:30:13,445 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 03:30:13,446 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 03:30:13,446 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 03:30:13,446 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 03:30:13,447 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:30:13" (1/1) ... [2024-12-06 03:30:13,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 03:30:13,467 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb7f14a-c356-485e-a911-23e9130a5726/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 03:30:13,479 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb7f14a-c356-485e-a911-23e9130a5726/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 03:30:13,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb7f14a-c356-485e-a911-23e9130a5726/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 03:30:13,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 03:30:13,509 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-12-06 03:30:13,509 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-12-06 03:30:13,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 03:30:13,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 03:30:13,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 03:30:13,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-12-06 03:30:13,509 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-12-06 03:30:13,562 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 03:30:13,564 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 03:30:14,058 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2024-12-06 03:30:14,058 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 03:30:14,099 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 03:30:14,099 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-06 03:30:14,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 03:30:14 BoogieIcfgContainer [2024-12-06 03:30:14,099 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 03:30:14,100 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 03:30:14,100 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 03:30:14,109 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 03:30:14,110 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 03:30:14" (1/1) ... [2024-12-06 03:30:14,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 03:30:14,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:14,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 218 states and 222 transitions. [2024-12-06 03:30:14,159 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 222 transitions. [2024-12-06 03:30:14,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-06 03:30:14,163 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:14,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:14,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:14,311 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 03:30:14,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:14,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 219 states and 223 transitions. [2024-12-06 03:30:14,348 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 223 transitions. [2024-12-06 03:30:14,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-06 03:30:14,348 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:14,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:14,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:14,395 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 03:30:14,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:14,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 220 states and 224 transitions. [2024-12-06 03:30:14,408 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 224 transitions. [2024-12-06 03:30:14,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-06 03:30:14,408 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:14,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:14,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:30:14,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:14,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-06 03:30:14,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:30:14,456 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 03:30:14,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:14,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 221 states and 225 transitions. [2024-12-06 03:30:14,470 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 225 transitions. [2024-12-06 03:30:14,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 03:30:14,470 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:14,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:14,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:14,490 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 03:30:14,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:14,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 220 states and 224 transitions. [2024-12-06 03:30:14,495 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 224 transitions. [2024-12-06 03:30:14,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-06 03:30:14,495 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:14,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:14,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:30:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:14,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-06 03:30:14,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:30:14,535 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 03:30:14,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:14,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 222 states and 226 transitions. [2024-12-06 03:30:14,552 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 226 transitions. [2024-12-06 03:30:14,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 03:30:14,552 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:14,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:30:14,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:14,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-06 03:30:14,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:30:14,592 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 03:30:14,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:14,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 223 states and 227 transitions. [2024-12-06 03:30:14,605 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 227 transitions. [2024-12-06 03:30:14,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-06 03:30:14,606 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:14,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:14,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:30:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:14,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-06 03:30:14,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:30:14,644 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 03:30:14,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:14,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 224 states and 228 transitions. [2024-12-06 03:30:14,657 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 228 transitions. [2024-12-06 03:30:14,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-06 03:30:14,658 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:14,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:14,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:14,676 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 03:30:14,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:14,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 223 states and 227 transitions. [2024-12-06 03:30:14,680 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 227 transitions. [2024-12-06 03:30:14,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-06 03:30:14,681 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:14,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:30:14,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:14,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-06 03:30:14,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:30:14,722 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 03:30:14,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:14,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 225 states and 229 transitions. [2024-12-06 03:30:14,737 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 229 transitions. [2024-12-06 03:30:14,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-06 03:30:14,738 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:14,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:30:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:14,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-06 03:30:14,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:30:14,779 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 03:30:14,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:14,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 226 states and 230 transitions. [2024-12-06 03:30:14,791 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 230 transitions. [2024-12-06 03:30:14,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-12-06 03:30:14,791 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:14,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:14,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:30:14,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:14,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-06 03:30:14,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:30:14,837 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 03:30:14,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:14,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 227 states and 231 transitions. [2024-12-06 03:30:14,850 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 231 transitions. [2024-12-06 03:30:14,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-06 03:30:14,850 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:14,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:14,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:14,868 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 03:30:14,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:14,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 226 states and 230 transitions. [2024-12-06 03:30:14,873 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 230 transitions. [2024-12-06 03:30:14,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-06 03:30:14,873 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:14,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:14,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:14,934 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 03:30:14,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:14,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 228 states and 232 transitions. [2024-12-06 03:30:14,953 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 232 transitions. [2024-12-06 03:30:14,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 03:30:14,953 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:14,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:14,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:14,986 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 03:30:14,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:14,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 229 states and 233 transitions. [2024-12-06 03:30:14,998 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 233 transitions. [2024-12-06 03:30:14,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 03:30:14,998 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:14,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:15,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:15,012 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 03:30:15,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:15,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 228 states and 232 transitions. [2024-12-06 03:30:15,017 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 232 transitions. [2024-12-06 03:30:15,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-12-06 03:30:15,018 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:15,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:15,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:30:15,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:15,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-06 03:30:15,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:30:15,075 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 03:30:15,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:15,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 230 states and 234 transitions. [2024-12-06 03:30:15,093 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 234 transitions. [2024-12-06 03:30:15,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-12-06 03:30:15,094 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:15,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:15,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:30:15,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:15,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-06 03:30:15,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:30:15,151 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 03:30:15,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:15,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 231 states and 235 transitions. [2024-12-06 03:30:15,164 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 235 transitions. [2024-12-06 03:30:15,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-12-06 03:30:15,165 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:15,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:30:15,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:15,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-06 03:30:15,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:30:15,223 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 03:30:15,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:15,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 232 states and 236 transitions. [2024-12-06 03:30:15,238 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 236 transitions. [2024-12-06 03:30:15,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-12-06 03:30:15,238 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:15,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:15,253 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 03:30:15,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:15,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 231 states and 235 transitions. [2024-12-06 03:30:15,258 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 235 transitions. [2024-12-06 03:30:15,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-06 03:30:15,259 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:15,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:30:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:15,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-06 03:30:15,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:30:15,317 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 03:30:15,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:15,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 233 states and 237 transitions. [2024-12-06 03:30:15,334 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 237 transitions. [2024-12-06 03:30:15,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-12-06 03:30:15,334 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:15,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:15,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:30:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:15,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-06 03:30:15,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:30:15,392 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 03:30:15,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:15,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 234 states and 238 transitions. [2024-12-06 03:30:15,409 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 238 transitions. [2024-12-06 03:30:15,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-12-06 03:30:15,410 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:15,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:30:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:15,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-06 03:30:15,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:30:15,469 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 03:30:15,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:15,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 235 states and 239 transitions. [2024-12-06 03:30:15,483 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 239 transitions. [2024-12-06 03:30:15,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-12-06 03:30:15,483 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:15,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:15,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:30:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:15,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-06 03:30:15,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:30:15,553 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 03:30:15,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:15,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 236 states and 240 transitions. [2024-12-06 03:30:15,570 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 240 transitions. [2024-12-06 03:30:15,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-12-06 03:30:15,570 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:15,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:15,590 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 03:30:15,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:15,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 235 states and 239 transitions. [2024-12-06 03:30:15,598 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 239 transitions. [2024-12-06 03:30:15,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-12-06 03:30:15,598 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:15,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:15,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:15,644 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 03:30:15,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:15,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 237 states and 241 transitions. [2024-12-06 03:30:15,668 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 241 transitions. [2024-12-06 03:30:15,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-06 03:30:15,668 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:15,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:15,713 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 03:30:15,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:15,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 238 states and 242 transitions. [2024-12-06 03:30:15,728 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 242 transitions. [2024-12-06 03:30:15,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 03:30:15,729 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:15,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:15,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:15,750 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 03:30:15,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:15,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 237 states and 241 transitions. [2024-12-06 03:30:15,759 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 241 transitions. [2024-12-06 03:30:15,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 03:30:15,759 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:15,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:15,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:15,806 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 03:30:15,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:15,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 239 states and 244 transitions. [2024-12-06 03:30:15,843 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 244 transitions. [2024-12-06 03:30:15,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 03:30:15,843 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:15,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:15,890 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 03:30:16,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:16,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 242 states and 249 transitions. [2024-12-06 03:30:16,001 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 249 transitions. [2024-12-06 03:30:16,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-06 03:30:16,002 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:16,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:16,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:16,053 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 03:30:16,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:16,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 246 states and 254 transitions. [2024-12-06 03:30:16,212 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 254 transitions. [2024-12-06 03:30:16,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 03:30:16,212 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:16,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:16,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:16,234 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 03:30:16,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:16,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 245 states and 253 transitions. [2024-12-06 03:30:16,242 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 253 transitions. [2024-12-06 03:30:16,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-06 03:30:16,243 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:16,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:16,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:16,302 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 03:30:16,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:16,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 251 states and 260 transitions. [2024-12-06 03:30:16,461 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 260 transitions. [2024-12-06 03:30:16,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-12-06 03:30:16,462 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:16,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:16,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:30:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:16,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-06 03:30:16,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:30:16,539 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 03:30:16,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:16,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 258 states and 267 transitions. [2024-12-06 03:30:16,620 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 267 transitions. [2024-12-06 03:30:16,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 03:30:16,620 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:16,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:16,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:16,634 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 03:30:16,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:16,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 257 states and 266 transitions. [2024-12-06 03:30:16,638 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 266 transitions. [2024-12-06 03:30:16,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-12-06 03:30:16,639 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:16,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:16,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:16,654 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 03:30:16,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:16,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 256 states and 265 transitions. [2024-12-06 03:30:16,660 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 265 transitions. [2024-12-06 03:30:16,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-12-06 03:30:16,660 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:16,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:16,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:16,708 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 03:30:16,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:16,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 255 states and 264 transitions. [2024-12-06 03:30:16,770 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 264 transitions. [2024-12-06 03:30:16,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-12-06 03:30:16,770 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:16,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:16,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:30:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:16,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-06 03:30:16,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:30:16,847 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 03:30:16,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:16,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 259 states and 268 transitions. [2024-12-06 03:30:16,923 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 268 transitions. [2024-12-06 03:30:16,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-12-06 03:30:16,923 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:16,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:16,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:16,940 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 03:30:16,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:16,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 258 states and 267 transitions. [2024-12-06 03:30:16,948 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 267 transitions. [2024-12-06 03:30:16,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-12-06 03:30:16,948 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:16,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:16,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:17,009 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 03:30:17,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:17,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 297 states and 308 transitions. [2024-12-06 03:30:17,242 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 308 transitions. [2024-12-06 03:30:17,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-12-06 03:30:17,242 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:17,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:17,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:17,271 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 03:30:17,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:17,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 298 states and 309 transitions. [2024-12-06 03:30:17,286 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 309 transitions. [2024-12-06 03:30:17,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-12-06 03:30:17,286 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:17,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:17,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:17,375 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 03:30:17,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:17,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 299 states and 310 transitions. [2024-12-06 03:30:17,566 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 310 transitions. [2024-12-06 03:30:17,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-12-06 03:30:17,566 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:17,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:17,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:17,616 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 03:30:17,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:17,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 300 states and 311 transitions. [2024-12-06 03:30:17,641 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 311 transitions. [2024-12-06 03:30:17,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-12-06 03:30:17,642 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:17,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:17,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:17,691 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 03:30:17,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:17,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 308 states and 322 transitions. [2024-12-06 03:30:17,887 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 322 transitions. [2024-12-06 03:30:17,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-12-06 03:30:17,888 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:17,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:17,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:17,959 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 03:30:18,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:18,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 353 states and 372 transitions. [2024-12-06 03:30:18,302 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 372 transitions. [2024-12-06 03:30:18,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-12-06 03:30:18,302 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:18,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:18,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:18,347 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 03:30:18,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:18,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 354 states and 373 transitions. [2024-12-06 03:30:18,366 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 373 transitions. [2024-12-06 03:30:18,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-12-06 03:30:18,366 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:18,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:18,413 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 03:30:18,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:18,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 355 states and 374 transitions. [2024-12-06 03:30:18,431 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 374 transitions. [2024-12-06 03:30:18,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-12-06 03:30:18,432 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:18,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:18,468 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 03:30:18,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:18,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 356 states and 375 transitions. [2024-12-06 03:30:18,515 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 375 transitions. [2024-12-06 03:30:18,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-12-06 03:30:18,515 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:18,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:18,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:18,559 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 03:30:18,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:18,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 359 states and 379 transitions. [2024-12-06 03:30:18,634 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 379 transitions. [2024-12-06 03:30:18,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-12-06 03:30:18,634 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:18,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:18,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:18,655 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 03:30:18,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:18,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 358 states and 378 transitions. [2024-12-06 03:30:18,664 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 378 transitions. [2024-12-06 03:30:18,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-12-06 03:30:18,665 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:18,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:18,706 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 03:30:18,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:18,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 359 states and 379 transitions. [2024-12-06 03:30:18,722 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 379 transitions. [2024-12-06 03:30:18,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-12-06 03:30:18,722 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:18,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:18,791 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 03:30:19,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:19,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 362 states and 382 transitions. [2024-12-06 03:30:19,007 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 382 transitions. [2024-12-06 03:30:19,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-12-06 03:30:19,007 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:19,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:19,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:19,028 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 03:30:19,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:19,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 361 states and 381 transitions. [2024-12-06 03:30:19,037 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 381 transitions. [2024-12-06 03:30:19,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-12-06 03:30:19,037 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:19,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:19,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:19,103 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 03:30:19,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:19,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 365 states and 385 transitions. [2024-12-06 03:30:19,349 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 385 transitions. [2024-12-06 03:30:19,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-12-06 03:30:19,349 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:19,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:30:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:19,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-06 03:30:19,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:30:19,490 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 03:30:19,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:19,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 367 states and 387 transitions. [2024-12-06 03:30:19,540 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 387 transitions. [2024-12-06 03:30:19,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-12-06 03:30:19,540 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:19,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:19,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:19,620 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 03:30:19,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:19,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 372 states and 392 transitions. [2024-12-06 03:30:19,914 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 392 transitions. [2024-12-06 03:30:19,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-12-06 03:30:19,914 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:19,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:30:19,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:19,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-06 03:30:19,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:30:20,086 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 03:30:20,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:20,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 373 states and 394 transitions. [2024-12-06 03:30:20,197 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 394 transitions. [2024-12-06 03:30:20,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-12-06 03:30:20,198 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:20,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:20,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:20,219 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 03:30:20,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:20,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 372 states and 393 transitions. [2024-12-06 03:30:20,230 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 393 transitions. [2024-12-06 03:30:20,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-12-06 03:30:20,230 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:20,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:30:20,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:20,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-06 03:30:20,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:30:20,399 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 03:30:20,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:20,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 374 states and 395 transitions. [2024-12-06 03:30:20,489 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 395 transitions. [2024-12-06 03:30:20,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-12-06 03:30:20,490 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:20,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:20,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:20,578 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 03:30:20,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:20,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 381 states and 402 transitions. [2024-12-06 03:30:20,893 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 402 transitions. [2024-12-06 03:30:20,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-12-06 03:30:20,893 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:20,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:20,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:20,912 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 03:30:20,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:20,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 380 states and 401 transitions. [2024-12-06 03:30:20,921 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 401 transitions. [2024-12-06 03:30:20,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-12-06 03:30:20,922 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:20,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:21,005 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 03:30:21,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:21,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 388 states and 409 transitions. [2024-12-06 03:30:21,374 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 409 transitions. [2024-12-06 03:30:21,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-12-06 03:30:21,375 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:21,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:21,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:30:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:21,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-06 03:30:21,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:30:21,475 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 03:30:21,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:21,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 391 states and 412 transitions. [2024-12-06 03:30:21,515 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 412 transitions. [2024-12-06 03:30:21,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-12-06 03:30:21,515 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:21,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:21,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:21,599 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 03:30:21,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:21,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 400 states and 421 transitions. [2024-12-06 03:30:21,967 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 421 transitions. [2024-12-06 03:30:21,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-12-06 03:30:21,967 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:21,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:30:22,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:22,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-06 03:30:22,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:30:22,066 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 03:30:22,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:22,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 401 states and 423 transitions. [2024-12-06 03:30:22,115 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 423 transitions. [2024-12-06 03:30:22,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-12-06 03:30:22,116 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:22,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:22,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:22,129 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 03:30:22,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:22,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 400 states and 422 transitions. [2024-12-06 03:30:22,136 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 422 transitions. [2024-12-06 03:30:22,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-12-06 03:30:22,136 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:22,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:30:22,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:22,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-06 03:30:22,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:30:22,264 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 03:30:22,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:22,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 402 states and 424 transitions. [2024-12-06 03:30:22,323 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 424 transitions. [2024-12-06 03:30:22,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-12-06 03:30:22,324 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:22,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:22,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:22,349 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 03:30:22,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:22,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 413 states and 435 transitions. [2024-12-06 03:30:22,493 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 435 transitions. [2024-12-06 03:30:22,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-12-06 03:30:22,494 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:22,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:22,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:22,600 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 03:30:23,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:23,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 428 states and 455 transitions. [2024-12-06 03:30:23,042 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 455 transitions. [2024-12-06 03:30:23,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-12-06 03:30:23,043 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:23,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:23,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:23,078 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 03:30:23,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:23,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 429 states and 456 transitions. [2024-12-06 03:30:23,097 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 456 transitions. [2024-12-06 03:30:23,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-12-06 03:30:23,097 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:23,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:23,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:23,200 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 03:30:23,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:23,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 430 states and 457 transitions. [2024-12-06 03:30:23,529 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 457 transitions. [2024-12-06 03:30:23,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-12-06 03:30:23,530 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:23,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:23,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:23,549 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 03:30:23,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:23,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 429 states and 456 transitions. [2024-12-06 03:30:23,559 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 456 transitions. [2024-12-06 03:30:23,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-12-06 03:30:23,560 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:23,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:23,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 03:30:23,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:23,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 432 states and 460 transitions. [2024-12-06 03:30:23,896 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 460 transitions. [2024-12-06 03:30:23,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-12-06 03:30:23,897 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:23,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:23,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:23,923 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 03:30:23,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:23,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 434 states and 462 transitions. [2024-12-06 03:30:23,967 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 462 transitions. [2024-12-06 03:30:23,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-12-06 03:30:23,967 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:23,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:23,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:24,012 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 03:30:24,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:24,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 439 states and 468 transitions. [2024-12-06 03:30:24,297 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 468 transitions. [2024-12-06 03:30:24,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-12-06 03:30:24,298 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:24,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:24,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:24,332 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 03:30:24,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:24,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 442 states and 471 transitions. [2024-12-06 03:30:24,386 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 471 transitions. [2024-12-06 03:30:24,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-12-06 03:30:24,386 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:24,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:24,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:30:24,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:24,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-06 03:30:24,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:30:24,490 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 03:30:24,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:24,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 444 states and 473 transitions. [2024-12-06 03:30:24,607 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 473 transitions. [2024-12-06 03:30:24,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-12-06 03:30:24,608 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:24,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:24,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:24,646 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 03:30:24,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:24,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 448 states and 477 transitions. [2024-12-06 03:30:24,705 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 477 transitions. [2024-12-06 03:30:24,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-12-06 03:30:24,705 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:24,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:24,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:24,723 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 03:30:24,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:24,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 447 states and 476 transitions. [2024-12-06 03:30:24,734 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 476 transitions. [2024-12-06 03:30:24,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-12-06 03:30:24,735 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:24,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:24,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:30:24,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:24,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-06 03:30:24,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:30:24,874 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 03:30:24,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:24,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 449 states and 479 transitions. [2024-12-06 03:30:24,918 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 479 transitions. [2024-12-06 03:30:24,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-12-06 03:30:24,918 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:24,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:24,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:24,944 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 03:30:25,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:25,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 455 states and 485 transitions. [2024-12-06 03:30:25,010 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 485 transitions. [2024-12-06 03:30:25,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-12-06 03:30:25,011 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:25,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:30:25,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:25,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-06 03:30:25,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:30:25,122 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 03:30:25,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:25,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 458 states and 488 transitions. [2024-12-06 03:30:25,241 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 488 transitions. [2024-12-06 03:30:25,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-12-06 03:30:25,242 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:25,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:25,336 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 03:30:25,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:25,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 465 states and 495 transitions. [2024-12-06 03:30:25,715 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 495 transitions. [2024-12-06 03:30:25,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-12-06 03:30:25,716 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:25,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:25,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:30:25,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:25,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-06 03:30:25,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:30:25,820 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 03:30:25,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:25,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 467 states and 497 transitions. [2024-12-06 03:30:25,871 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 497 transitions. [2024-12-06 03:30:25,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-12-06 03:30:25,871 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:25,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:25,960 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 03:30:26,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:26,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 475 states and 505 transitions. [2024-12-06 03:30:26,309 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 505 transitions. [2024-12-06 03:30:26,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-12-06 03:30:26,309 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:26,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:26,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:26,434 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 03:30:26,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:26,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 484 states and 514 transitions. [2024-12-06 03:30:26,901 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 514 transitions. [2024-12-06 03:30:26,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-12-06 03:30:26,901 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:26,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:30:26,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:26,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-06 03:30:26,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:30:27,039 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 03:30:27,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:27,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 486 states and 517 transitions. [2024-12-06 03:30:27,084 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 517 transitions. [2024-12-06 03:30:27,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-12-06 03:30:27,084 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:27,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:27,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:27,101 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 03:30:27,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:27,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 485 states and 516 transitions. [2024-12-06 03:30:27,116 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 516 transitions. [2024-12-06 03:30:27,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-12-06 03:30:27,116 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:27,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:30:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:27,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-06 03:30:27,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:30:27,221 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 03:30:27,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:27,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 488 states and 519 transitions. [2024-12-06 03:30:27,355 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 519 transitions. [2024-12-06 03:30:27,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-12-06 03:30:27,355 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:27,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:27,389 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 03:30:27,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:27,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 499 states and 530 transitions. [2024-12-06 03:30:27,542 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 530 transitions. [2024-12-06 03:30:27,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-12-06 03:30:27,542 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:27,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:27,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:30:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:27,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-06 03:30:27,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:30:27,648 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 03:30:27,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:27,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 501 states and 532 transitions. [2024-12-06 03:30:27,684 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 532 transitions. [2024-12-06 03:30:27,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-12-06 03:30:27,685 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:27,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:27,718 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 03:30:27,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:27,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 502 states and 533 transitions. [2024-12-06 03:30:27,738 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 533 transitions. [2024-12-06 03:30:27,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-12-06 03:30:27,738 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:27,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:27,753 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 03:30:27,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:27,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 501 states and 532 transitions. [2024-12-06 03:30:27,761 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 532 transitions. [2024-12-06 03:30:27,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-12-06 03:30:27,761 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:27,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:27,801 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 03:30:27,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:27,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 503 states and 535 transitions. [2024-12-06 03:30:27,857 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 535 transitions. [2024-12-06 03:30:27,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-12-06 03:30:27,858 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:27,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:27,887 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 03:30:27,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:27,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 505 states and 538 transitions. [2024-12-06 03:30:27,938 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 538 transitions. [2024-12-06 03:30:27,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-12-06 03:30:27,938 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:27,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:27,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:27,978 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 03:30:28,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:28,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 508 states and 541 transitions. [2024-12-06 03:30:28,045 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 541 transitions. [2024-12-06 03:30:28,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-12-06 03:30:28,046 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:28,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:28,076 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 03:30:28,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:28,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 511 states and 546 transitions. [2024-12-06 03:30:28,127 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 546 transitions. [2024-12-06 03:30:28,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-12-06 03:30:28,128 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:28,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:28,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:28,145 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 03:30:28,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:28,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 515 states and 551 transitions. [2024-12-06 03:30:28,191 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 551 transitions. [2024-12-06 03:30:28,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-12-06 03:30:28,191 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:28,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:30:28,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:28,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-06 03:30:28,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:30:28,307 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 03:30:28,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:28,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 518 states and 554 transitions. [2024-12-06 03:30:28,355 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 554 transitions. [2024-12-06 03:30:28,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-12-06 03:30:28,356 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:28,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:28,373 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 03:30:28,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:28,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 517 states and 553 transitions. [2024-12-06 03:30:28,391 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 553 transitions. [2024-12-06 03:30:28,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-12-06 03:30:28,392 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:28,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:28,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:30:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:28,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-06 03:30:28,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:30:28,514 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 03:30:28,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:28,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 518 states and 555 transitions. [2024-12-06 03:30:28,583 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 555 transitions. [2024-12-06 03:30:28,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-12-06 03:30:28,583 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:28,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:28,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:28,611 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 03:30:28,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:28,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 524 states and 562 transitions. [2024-12-06 03:30:28,677 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 562 transitions. [2024-12-06 03:30:28,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-12-06 03:30:28,678 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:28,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:28,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:30:28,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:28,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-06 03:30:28,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:30:28,829 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 03:30:28,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:28,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 526 states and 564 transitions. [2024-12-06 03:30:28,903 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 564 transitions. [2024-12-06 03:30:28,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-12-06 03:30:28,903 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:28,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:28,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:29,032 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 03:30:29,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:29,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 533 states and 571 transitions. [2024-12-06 03:30:29,223 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 571 transitions. [2024-12-06 03:30:29,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-12-06 03:30:29,224 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:29,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:29,240 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 03:30:29,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:29,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 532 states and 570 transitions. [2024-12-06 03:30:29,250 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 570 transitions. [2024-12-06 03:30:29,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-12-06 03:30:29,250 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:29,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:29,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:30:29,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:29,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-06 03:30:29,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:30:29,365 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 03:30:29,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:29,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 535 states and 573 transitions. [2024-12-06 03:30:29,404 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 573 transitions. [2024-12-06 03:30:29,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-12-06 03:30:29,405 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:29,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:29,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:29,417 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 03:30:29,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:29,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 534 states and 572 transitions. [2024-12-06 03:30:29,432 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 572 transitions. [2024-12-06 03:30:29,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-12-06 03:30:29,432 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:29,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:29,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:30:29,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:29,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-06 03:30:29,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:30:29,554 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 03:30:29,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:29,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 535 states and 574 transitions. [2024-12-06 03:30:29,618 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 574 transitions. [2024-12-06 03:30:29,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-12-06 03:30:29,619 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:29,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:29,645 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 03:30:29,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:29,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 534 states and 573 transitions. [2024-12-06 03:30:29,710 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 573 transitions. [2024-12-06 03:30:29,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-12-06 03:30:29,710 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:29,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:30:29,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:29,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-06 03:30:29,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:30:29,833 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 03:30:29,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:29,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 536 states and 575 transitions. [2024-12-06 03:30:29,895 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 575 transitions. [2024-12-06 03:30:29,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-12-06 03:30:29,895 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:29,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:29,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:30,029 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 03:30:30,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:30,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 535 states and 574 transitions. [2024-12-06 03:30:30,262 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 574 transitions. [2024-12-06 03:30:30,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-12-06 03:30:30,262 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:30,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:30:30,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:30,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-06 03:30:30,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:30:30,364 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 03:30:30,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:30,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 537 states and 576 transitions. [2024-12-06 03:30:30,401 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 576 transitions. [2024-12-06 03:30:30,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-12-06 03:30:30,401 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:30,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:30,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:30,412 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 03:30:30,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:30,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 536 states and 575 transitions. [2024-12-06 03:30:30,420 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 575 transitions. [2024-12-06 03:30:30,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-12-06 03:30:30,420 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:30,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:30,448 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 03:30:30,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:30,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 575 states and 616 transitions. [2024-12-06 03:30:30,801 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 616 transitions. [2024-12-06 03:30:30,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-12-06 03:30:30,801 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:30,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:30,849 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-12-06 03:30:30,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:30,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 574 states and 615 transitions. [2024-12-06 03:30:30,969 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 615 transitions. [2024-12-06 03:30:30,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-12-06 03:30:30,970 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:30,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:30,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:30,990 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 03:30:31,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:31,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 575 states and 616 transitions. [2024-12-06 03:30:31,007 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 616 transitions. [2024-12-06 03:30:31,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-12-06 03:30:31,008 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:31,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:31,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:31,060 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-06 03:30:31,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:31,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 574 states and 615 transitions. [2024-12-06 03:30:31,249 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 615 transitions. [2024-12-06 03:30:31,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-12-06 03:30:31,249 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:31,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:31,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:31,350 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 03:30:31,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:31,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 575 states and 616 transitions. [2024-12-06 03:30:31,615 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 616 transitions. [2024-12-06 03:30:31,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-12-06 03:30:31,615 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:31,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:31,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:31,710 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 03:30:31,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:31,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 574 states and 615 transitions. [2024-12-06 03:30:31,974 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 615 transitions. [2024-12-06 03:30:31,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-12-06 03:30:31,975 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:31,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:31,992 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-12-06 03:30:32,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:32,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 571 states and 610 transitions. [2024-12-06 03:30:32,310 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 610 transitions. [2024-12-06 03:30:32,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-12-06 03:30:32,310 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:32,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:32,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:32,334 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-12-06 03:30:32,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:32,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 567 states and 605 transitions. [2024-12-06 03:30:32,465 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 605 transitions. [2024-12-06 03:30:32,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-12-06 03:30:32,465 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:32,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:32,489 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-12-06 03:30:32,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:32,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 562 states and 599 transitions. [2024-12-06 03:30:32,675 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 599 transitions. [2024-12-06 03:30:32,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-12-06 03:30:32,675 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:32,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:32,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:30:32,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:32,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-06 03:30:32,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:30:32,785 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 03:30:33,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:33,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 580 states and 619 transitions. [2024-12-06 03:30:33,293 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 619 transitions. [2024-12-06 03:30:33,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-12-06 03:30:33,293 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:33,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:33,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:30:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:33,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-06 03:30:33,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:30:33,411 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 03:30:33,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:33,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 581 states and 620 transitions. [2024-12-06 03:30:33,431 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 620 transitions. [2024-12-06 03:30:33,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-12-06 03:30:33,432 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:33,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:33,454 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-06 03:30:33,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:33,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 574 states and 612 transitions. [2024-12-06 03:30:33,566 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 612 transitions. [2024-12-06 03:30:33,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-12-06 03:30:33,566 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:33,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:33,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:33,584 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 03:30:33,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:33,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 573 states and 611 transitions. [2024-12-06 03:30:33,604 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 611 transitions. [2024-12-06 03:30:33,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-12-06 03:30:33,604 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:33,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:33,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:30:33,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:33,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-06 03:30:33,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:30:33,747 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 03:30:33,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:33,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 583 states and 621 transitions. [2024-12-06 03:30:33,893 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 621 transitions. [2024-12-06 03:30:33,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-12-06 03:30:33,893 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:33,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:33,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:33,931 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 03:30:34,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:34,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 585 states and 624 transitions. [2024-12-06 03:30:34,007 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 624 transitions. [2024-12-06 03:30:34,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-12-06 03:30:34,008 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:34,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:34,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:30:34,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:34,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-12-06 03:30:34,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:30:34,138 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-12-06 03:30:34,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:34,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 584 states and 623 transitions. [2024-12-06 03:30:34,440 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 623 transitions. [2024-12-06 03:30:34,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-12-06 03:30:34,440 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:34,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:34,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:30:34,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:34,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-06 03:30:34,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:30:35,122 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 03:30:36,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:36,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 623 states and 665 transitions. [2024-12-06 03:30:36,320 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 665 transitions. [2024-12-06 03:30:36,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-12-06 03:30:36,320 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:36,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:36,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:30:36,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:36,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-06 03:30:36,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:30:36,890 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 03:30:38,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:38,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 663 states and 707 transitions. [2024-12-06 03:30:38,722 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 707 transitions. [2024-12-06 03:30:38,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-12-06 03:30:38,722 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:38,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:38,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:30:38,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:38,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-12-06 03:30:38,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:30:39,163 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 03:30:40,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:40,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 671 states and 716 transitions. [2024-12-06 03:30:40,725 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 716 transitions. [2024-12-06 03:30:40,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-12-06 03:30:40,725 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:40,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:30:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:40,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-06 03:30:40,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:30:41,243 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 03:30:42,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:42,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 673 states and 721 transitions. [2024-12-06 03:30:42,234 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 721 transitions. [2024-12-06 03:30:42,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-12-06 03:30:42,234 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:42,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:42,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:42,302 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-12-06 03:30:42,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:42,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 676 states and 728 transitions. [2024-12-06 03:30:42,535 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 728 transitions. [2024-12-06 03:30:42,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-12-06 03:30:42,535 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:42,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:42,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:42,638 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 03:30:44,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:44,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 733 states and 795 transitions. [2024-12-06 03:30:44,631 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 795 transitions. [2024-12-06 03:30:44,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-12-06 03:30:44,631 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:44,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:44,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:44,662 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 03:30:44,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:44,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 735 states and 800 transitions. [2024-12-06 03:30:44,950 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 800 transitions. [2024-12-06 03:30:44,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-12-06 03:30:44,950 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:44,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:44,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:45,064 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 03:30:47,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:47,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 793 states and 869 transitions. [2024-12-06 03:30:47,337 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 869 transitions. [2024-12-06 03:30:47,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-12-06 03:30:47,337 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:47,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:47,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:47,421 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 03:30:48,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:48,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 797 states and 878 transitions. [2024-12-06 03:30:48,088 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 878 transitions. [2024-12-06 03:30:48,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-12-06 03:30:48,088 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:48,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:48,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:48,119 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 03:30:48,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:48,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 799 states and 883 transitions. [2024-12-06 03:30:48,505 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 883 transitions. [2024-12-06 03:30:48,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-12-06 03:30:48,505 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:48,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:48,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:48,600 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 03:30:49,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:49,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 802 states and 889 transitions. [2024-12-06 03:30:49,105 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 889 transitions. [2024-12-06 03:30:49,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-12-06 03:30:49,106 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:49,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:49,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:49,143 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-12-06 03:30:49,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:49,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 806 states and 898 transitions. [2024-12-06 03:30:49,781 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 898 transitions. [2024-12-06 03:30:49,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-12-06 03:30:49,782 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:49,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:49,805 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-12-06 03:30:50,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:50,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 810 states and 905 transitions. [2024-12-06 03:30:50,365 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 905 transitions. [2024-12-06 03:30:50,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-12-06 03:30:50,365 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:50,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:50,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:50,386 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-12-06 03:30:51,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:51,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 814 states and 914 transitions. [2024-12-06 03:30:51,375 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 914 transitions. [2024-12-06 03:30:51,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-12-06 03:30:51,376 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:51,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:51,979 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 03:30:55,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:55,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 916 states and 1025 transitions. [2024-12-06 03:30:55,115 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1025 transitions. [2024-12-06 03:30:55,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-12-06 03:30:55,115 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:55,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:55,154 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-06 03:30:56,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:56,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 920 states and 1035 transitions. [2024-12-06 03:30:56,337 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1035 transitions. [2024-12-06 03:30:56,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-12-06 03:30:56,337 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:56,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:56,438 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 03:30:57,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:57,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 366 states and 382 transitions. [2024-12-06 03:30:57,054 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 382 transitions. [2024-12-06 03:30:57,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-12-06 03:30:57,055 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:57,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:57,078 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 03:30:58,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:58,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 360 states and 376 transitions. [2024-12-06 03:30:58,441 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 376 transitions. [2024-12-06 03:30:58,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-12-06 03:30:58,441 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:58,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:58,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:58,462 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 03:30:59,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:30:59,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 352 states and 368 transitions. [2024-12-06 03:30:59,874 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 368 transitions. [2024-12-06 03:30:59,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-12-06 03:30:59,875 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:30:59,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:30:59,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:30:59,896 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 03:31:01,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:31:01,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 343 states and 359 transitions. [2024-12-06 03:31:01,417 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 359 transitions. [2024-12-06 03:31:01,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-12-06 03:31:01,417 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:31:01,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:31:01,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:31:01,448 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-12-06 03:31:02,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:31:02,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 333 states and 349 transitions. [2024-12-06 03:31:02,861 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 349 transitions. [2024-12-06 03:31:02,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-12-06 03:31:02,862 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:31:02,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:31:02,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:31:02,935 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-06 03:31:03,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:31:03,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 332 states and 348 transitions. [2024-12-06 03:31:03,002 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 348 transitions. [2024-12-06 03:31:03,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-12-06 03:31:03,003 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:31:03,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:31:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:31:03,028 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-12-06 03:31:03,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:31:03,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 331 states and 347 transitions. [2024-12-06 03:31:03,140 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 347 transitions. [2024-12-06 03:31:03,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-12-06 03:31:03,141 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:31:03,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:31:03,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:31:03,169 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-12-06 03:31:03,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:31:03,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 328 states and 344 transitions. [2024-12-06 03:31:03,284 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 344 transitions. [2024-12-06 03:31:03,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-12-06 03:31:03,285 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:31:03,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:31:03,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:31:03,327 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-12-06 03:31:03,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:31:03,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 324 states and 340 transitions. [2024-12-06 03:31:03,448 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 340 transitions. [2024-12-06 03:31:03,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-12-06 03:31:03,448 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:31:03,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:31:03,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:31:03,469 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-06 03:31:03,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:31:03,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 319 states and 335 transitions. [2024-12-06 03:31:03,584 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 335 transitions. [2024-12-06 03:31:03,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-12-06 03:31:03,584 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:31:03,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:31:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:31:03,606 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-12-06 03:31:03,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:31:03,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 312 states and 328 transitions. [2024-12-06 03:31:03,751 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 328 transitions. [2024-12-06 03:31:03,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-12-06 03:31:03,751 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:31:03,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:31:03,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:31:03,773 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-12-06 03:31:04,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:31:04,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 304 states and 320 transitions. [2024-12-06 03:31:04,185 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 320 transitions. [2024-12-06 03:31:04,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-12-06 03:31:04,185 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:31:04,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:31:04,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:31:04,207 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-12-06 03:31:04,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:31:04,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 295 states and 311 transitions. [2024-12-06 03:31:04,638 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 311 transitions. [2024-12-06 03:31:04,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-12-06 03:31:04,638 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:31:04,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:31:04,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:31:04,662 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-12-06 03:31:06,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:31:06,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 285 states and 301 transitions. [2024-12-06 03:31:06,759 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 301 transitions. [2024-12-06 03:31:06,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-12-06 03:31:06,759 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:31:06,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:31:06,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:31:06,798 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-06 03:31:06,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:31:06,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 284 states and 300 transitions. [2024-12-06 03:31:06,916 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 300 transitions. [2024-12-06 03:31:06,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-12-06 03:31:06,916 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:31:06,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:31:06,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:31:06,971 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-12-06 03:31:07,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:31:07,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 283 states and 299 transitions. [2024-12-06 03:31:07,081 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 299 transitions. [2024-12-06 03:31:07,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-12-06 03:31:07,081 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:31:07,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:31:07,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:31:07,107 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-12-06 03:31:07,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:31:07,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 280 states and 294 transitions. [2024-12-06 03:31:07,275 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 294 transitions. [2024-12-06 03:31:07,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-12-06 03:31:07,276 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:31:07,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:31:07,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:31:07,302 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-12-06 03:31:07,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:31:07,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 276 states and 289 transitions. [2024-12-06 03:31:07,441 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 289 transitions. [2024-12-06 03:31:07,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-12-06 03:31:07,441 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:31:07,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:31:07,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:31:07,486 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-06 03:31:07,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:31:07,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 271 states and 283 transitions. [2024-12-06 03:31:07,641 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 283 transitions. [2024-12-06 03:31:07,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-12-06 03:31:07,641 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:31:07,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:31:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:31:07,668 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-12-06 03:31:07,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:31:07,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 264 states and 275 transitions. [2024-12-06 03:31:07,869 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 275 transitions. [2024-12-06 03:31:07,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-12-06 03:31:07,869 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:31:07,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:31:07,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:31:07,985 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-12-06 03:31:08,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:31:08,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 256 states and 267 transitions. [2024-12-06 03:31:08,317 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 267 transitions. [2024-12-06 03:31:08,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-06 03:31:08,317 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:31:08,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:31:08,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:31:08,480 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-12-06 03:31:10,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:31:10,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 269 states and 280 transitions. [2024-12-06 03:31:10,589 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 280 transitions. [2024-12-06 03:31:10,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-06 03:31:10,589 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:31:10,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:31:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:31:10,612 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-12-06 03:31:11,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:31:11,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 255 states and 266 transitions. [2024-12-06 03:31:11,826 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 266 transitions. [2024-12-06 03:31:11,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-12-06 03:31:11,826 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:31:11,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:31:11,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:31:11,989 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-12-06 03:31:13,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:31:13,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 269 states and 280 transitions. [2024-12-06 03:31:13,774 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 280 transitions. [2024-12-06 03:31:13,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-12-06 03:31:13,774 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:31:13,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:31:13,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:31:13,812 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-12-06 03:31:15,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:31:15,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 254 states and 265 transitions. [2024-12-06 03:31:15,076 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 265 transitions. [2024-12-06 03:31:15,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-12-06 03:31:15,077 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:31:15,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:31:15,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:31:15,107 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-12-06 03:31:18,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:31:18,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 268 states and 279 transitions. [2024-12-06 03:31:18,718 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 279 transitions. [2024-12-06 03:31:18,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-12-06 03:31:18,718 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:31:18,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:31:18,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:31:18,749 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-12-06 03:31:25,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:31:25,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 252 states and 263 transitions. [2024-12-06 03:31:25,660 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 263 transitions. [2024-12-06 03:31:25,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-12-06 03:31:25,660 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:31:25,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:31:25,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:31:25,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:31:25,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-12-06 03:31:25,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:31:26,593 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 03:31:37,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:31:37,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 270 states and 285 transitions. [2024-12-06 03:31:37,065 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 285 transitions. [2024-12-06 03:31:37,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-12-06 03:31:37,065 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:31:37,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:31:37,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:31:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:31:37,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-12-06 03:31:37,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:31:37,470 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 03:31:39,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:31:39,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 251 states and 262 transitions. [2024-12-06 03:31:39,589 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 262 transitions. [2024-12-06 03:31:39,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-12-06 03:31:39,590 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:31:39,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:31:39,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 03:31:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:31:39,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-12-06 03:31:39,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 03:31:40,272 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 03:31:42,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:31:42,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 250 states and 261 transitions. [2024-12-06 03:31:42,965 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 261 transitions. [2024-12-06 03:31:42,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-12-06 03:31:42,965 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:31:42,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:31:42,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:31:43,097 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 03:31:46,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:31:46,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 249 states and 260 transitions. [2024-12-06 03:31:46,001 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 260 transitions. [2024-12-06 03:31:46,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-06 03:31:46,001 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 176 iterations. [2024-12-06 03:31:46,009 INFO L726 CodeCheckObserver]: All specifications hold 102 specifications checked. All of them hold [2024-12-06 03:32:05,993 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-12-06 03:32:05,993 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-12-06 03:32:05,994 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-12-06 03:32:05,994 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr95ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) the Hoare annotation is: true [2024-12-06 03:32:05,994 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-12-06 03:32:05,994 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) the Hoare annotation is: true [2024-12-06 03:32:05,994 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-12-06 03:32:05,994 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-12-06 03:32:05,994 INFO L77 FloydHoareUtils]: At program point L36(line 36) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (< |ULTIMATE.start_main_~k~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0))) [2024-12-06 03:32:05,994 INFO L77 FloydHoareUtils]: At program point L36-1(line 36) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (< |ULTIMATE.start_main_~k~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0))) [2024-12-06 03:32:05,994 INFO L77 FloydHoareUtils]: At program point L36-2(line 36) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (< |ULTIMATE.start_main_~k~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0))) [2024-12-06 03:32:05,994 INFO L77 FloydHoareUtils]: At program point L36-3(line 36) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (< |ULTIMATE.start_main_~k~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0))) [2024-12-06 03:32:05,994 INFO L77 FloydHoareUtils]: At program point L36-4(line 36) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (< |ULTIMATE.start_main_~k~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0))) [2024-12-06 03:32:05,994 INFO L77 FloydHoareUtils]: At program point L36-5(line 36) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (< |ULTIMATE.start_main_~k~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0))) [2024-12-06 03:32:05,994 INFO L77 FloydHoareUtils]: At program point L36-6(line 36) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (< |ULTIMATE.start_main_~k~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0))) [2024-12-06 03:32:05,994 INFO L77 FloydHoareUtils]: At program point L36-7(line 36) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (< |ULTIMATE.start_main_~k~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0))) [2024-12-06 03:32:05,994 INFO L77 FloydHoareUtils]: At program point L36-8(line 36) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~y~0#1| 1))) (or (and .cse0 (<= 1 |ULTIMATE.start_main_~k~0#1|)) (and (< |ULTIMATE.start_main_~k~0#1| 0) .cse0) (not (= |ULTIMATE.start_main_~x~0#1| 0)) (and (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 9223372036854775807) (< 1 |ULTIMATE.start_main_~y~0#1|)) (and .cse0 (< |ULTIMATE.start_main_~c~0#1| 1)) (< |ULTIMATE.start_main_~y~0#1| 1) (and (< 1 |ULTIMATE.start_main_~c~0#1|) .cse0))) [2024-12-06 03:32:05,995 INFO L77 FloydHoareUtils]: At program point L36-9(line 36) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1) (< |ULTIMATE.start_main_~k~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0))) [2024-12-06 03:32:05,995 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-12-06 03:32:05,995 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-12-06 03:32:05,995 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-12-06 03:32:05,995 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-12-06 03:32:05,995 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) the Hoare annotation is: true [2024-12-06 03:32:05,995 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr89ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-12-06 03:32:05,995 INFO L77 FloydHoareUtils]: At program point L21(line 21) the Hoare annotation is: true [2024-12-06 03:32:05,995 INFO L77 FloydHoareUtils]: At program point L21-1(line 21) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 1)) [2024-12-06 03:32:05,995 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-12-06 03:32:05,995 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr100ASSERT_VIOLATIONINTEGER_OVERFLOW(line 40) no Hoare annotation was computed. [2024-12-06 03:32:05,995 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-12-06 03:32:05,995 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-12-06 03:32:05,995 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) the Hoare annotation is: true [2024-12-06 03:32:05,995 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) no Hoare annotation was computed. [2024-12-06 03:32:05,995 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-12-06 03:32:05,995 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr94ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) the Hoare annotation is: true [2024-12-06 03:32:05,995 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-12-06 03:32:05,995 INFO L77 FloydHoareUtils]: At program point L22(line 22) the Hoare annotation is: true [2024-12-06 03:32:05,995 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) the Hoare annotation is: true [2024-12-06 03:32:05,995 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) the Hoare annotation is: true [2024-12-06 03:32:05,996 INFO L77 FloydHoareUtils]: At program point L39(line 39) the Hoare annotation is: true [2024-12-06 03:32:05,996 INFO L77 FloydHoareUtils]: At program point L39-1(line 39) the Hoare annotation is: true [2024-12-06 03:32:05,996 INFO L77 FloydHoareUtils]: At program point L39-2(line 39) the Hoare annotation is: true [2024-12-06 03:32:05,996 INFO L77 FloydHoareUtils]: At program point L39-3(line 39) the Hoare annotation is: true [2024-12-06 03:32:05,996 INFO L77 FloydHoareUtils]: At program point L39-4(line 39) the Hoare annotation is: true [2024-12-06 03:32:05,996 INFO L77 FloydHoareUtils]: At program point L39-5(line 39) the Hoare annotation is: true [2024-12-06 03:32:05,996 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW(line 35) the Hoare annotation is: true [2024-12-06 03:32:05,996 INFO L77 FloydHoareUtils]: At program point L39-6(line 39) the Hoare annotation is: true [2024-12-06 03:32:05,996 INFO L77 FloydHoareUtils]: At program point L39-7(line 39) the Hoare annotation is: true [2024-12-06 03:32:05,996 INFO L77 FloydHoareUtils]: At program point L39-8(line 39) the Hoare annotation is: true [2024-12-06 03:32:05,996 INFO L77 FloydHoareUtils]: At program point L39-9(line 39) the Hoare annotation is: true [2024-12-06 03:32:05,996 INFO L77 FloydHoareUtils]: At program point L39-10(line 39) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (<= .cse0 1537228672809129301) (< 0 (+ 1537228672809129302 .cse0)))) [2024-12-06 03:32:05,996 INFO L77 FloydHoareUtils]: At program point L39-11(line 39) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (<= .cse0 1537228672809129301) (< 0 (+ 1537228672809129302 .cse0)))) [2024-12-06 03:32:05,996 INFO L77 FloydHoareUtils]: At program point L39-12(line 39) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (<= .cse0 1537228672809129301) (< 0 (+ 1537228672809129302 .cse0)))) [2024-12-06 03:32:05,996 INFO L77 FloydHoareUtils]: At program point L39-13(line 39) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (<= .cse0 1537228672809129301) (< 0 (+ 1537228672809129302 .cse0)))) [2024-12-06 03:32:05,996 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-12-06 03:32:05,996 INFO L77 FloydHoareUtils]: At program point L39-14(line 39) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (<= .cse0 1537228672809129301) (< 0 (+ 1537228672809129302 .cse0)))) [2024-12-06 03:32:05,996 INFO L77 FloydHoareUtils]: At program point L39-15(line 39) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (<= .cse0 1537228672809129301) (< 0 (+ 1537228672809129302 .cse0)))) [2024-12-06 03:32:05,996 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-12-06 03:32:05,996 INFO L77 FloydHoareUtils]: At program point L39-16(line 39) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (<= .cse0 1537228672809129301) (< 0 (+ 1537228672809129302 .cse0)))) [2024-12-06 03:32:05,996 INFO L77 FloydHoareUtils]: At program point L39-17(line 39) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (<= .cse0 1537228672809129301) (< 0 (+ 1537228672809129302 .cse0)))) [2024-12-06 03:32:05,996 INFO L77 FloydHoareUtils]: At program point L39-18(line 39) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (<= .cse0 1537228672809129301) (< 0 (+ 1537228672809129302 .cse0)))) [2024-12-06 03:32:05,996 INFO L77 FloydHoareUtils]: At program point L39-19(line 39) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (<= .cse0 1537228672809129301) (< 0 (+ 1537228672809129302 .cse0)))) [2024-12-06 03:32:05,996 INFO L77 FloydHoareUtils]: At program point L39-20(line 39) the Hoare annotation is: (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 1537228672809129301) [2024-12-06 03:32:05,996 INFO L77 FloydHoareUtils]: At program point L39-21(line 39) the Hoare annotation is: true [2024-12-06 03:32:05,996 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-12-06 03:32:05,996 INFO L77 FloydHoareUtils]: At program point L39-22(line 39) the Hoare annotation is: (<= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) 4611686018427387904) [2024-12-06 03:32:05,996 INFO L77 FloydHoareUtils]: At program point L39-23(line 39) the Hoare annotation is: (<= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) 4611686018427387904) [2024-12-06 03:32:05,996 INFO L77 FloydHoareUtils]: At program point L39-24(line 39) the Hoare annotation is: (<= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) 4611686018427387904) [2024-12-06 03:32:05,997 INFO L77 FloydHoareUtils]: At program point L39-25(line 39) the Hoare annotation is: (<= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) 4611686018427387904) [2024-12-06 03:32:05,997 INFO L77 FloydHoareUtils]: At program point L39-26(line 39) the Hoare annotation is: (<= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) 4611686018427387904) [2024-12-06 03:32:05,997 INFO L77 FloydHoareUtils]: At program point L39-27(line 39) the Hoare annotation is: (<= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) 4611686018427387904) [2024-12-06 03:32:05,997 INFO L77 FloydHoareUtils]: At program point L39-28(line 39) the Hoare annotation is: (<= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) 4611686018427387904) [2024-12-06 03:32:05,997 INFO L77 FloydHoareUtils]: At program point L39-29(line 39) the Hoare annotation is: (<= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) 4611686018427387904) [2024-12-06 03:32:05,997 INFO L77 FloydHoareUtils]: At program point L39-30(line 39) the Hoare annotation is: (<= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) 4611686018427387904) [2024-12-06 03:32:05,997 INFO L77 FloydHoareUtils]: At program point L39-31(line 39) the Hoare annotation is: (<= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) 4611686018427387904) [2024-12-06 03:32:05,997 INFO L77 FloydHoareUtils]: At program point L40(line 40) the Hoare annotation is: true [2024-12-06 03:32:05,997 INFO L77 FloydHoareUtils]: At program point L39-32(line 39) the Hoare annotation is: (<= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) 4611686018427387904) [2024-12-06 03:32:05,997 INFO L77 FloydHoareUtils]: At program point L40-1(line 40) the Hoare annotation is: true [2024-12-06 03:32:05,997 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) the Hoare annotation is: true [2024-12-06 03:32:05,997 INFO L77 FloydHoareUtils]: At program point L39-33(line 39) the Hoare annotation is: (<= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) 4611686018427387904) [2024-12-06 03:32:05,997 INFO L77 FloydHoareUtils]: At program point L40-2(line 40) the Hoare annotation is: true [2024-12-06 03:32:05,997 INFO L77 FloydHoareUtils]: At program point L39-34(line 39) the Hoare annotation is: (<= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) 4611686018427387904) [2024-12-06 03:32:05,997 INFO L77 FloydHoareUtils]: At program point L40-3(line 40) the Hoare annotation is: true [2024-12-06 03:32:05,997 INFO L77 FloydHoareUtils]: At program point L39-35(line 39) the Hoare annotation is: (<= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) 4611686018427387904) [2024-12-06 03:32:05,997 INFO L77 FloydHoareUtils]: At program point L40-4(line 40) the Hoare annotation is: true [2024-12-06 03:32:05,997 INFO L77 FloydHoareUtils]: At program point L39-36(line 39) the Hoare annotation is: (not (and (< (+ 9223372036854775808 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))) (= |ULTIMATE.start_main_~x~0#1| 0))) [2024-12-06 03:32:05,997 INFO L77 FloydHoareUtils]: At program point L39-37(line 39) the Hoare annotation is: (not (and (< (+ 9223372036854775808 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))) (= |ULTIMATE.start_main_~x~0#1| 0))) [2024-12-06 03:32:05,998 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-12-06 03:32:05,998 INFO L77 FloydHoareUtils]: At program point L39-38(line 39) the Hoare annotation is: (not (and (< (+ 9223372036854775808 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))) (= |ULTIMATE.start_main_~x~0#1| 0))) [2024-12-06 03:32:05,998 INFO L77 FloydHoareUtils]: At program point L39-39(line 39) the Hoare annotation is: (let ((.cse2 (* |ULTIMATE.start_main_~x~0#1| 12)) (.cse1 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse3 (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (.cse4 (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (.cse5 (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))) (let ((.cse0 (<= (+ .cse2 .cse1) (+ .cse3 9223372036854775807 .cse4 .cse5)))) (or (and .cse0 (<= .cse1 9223372036854775807)) (and (not (and (= |ULTIMATE.start_main_~k~0#1| 1) (<= 0 (+ 1537228672809129301 |ULTIMATE.start_main_~y~0#1|)))) .cse0) (<= (+ .cse2 9223372036854775809 .cse1) (+ .cse3 .cse4 .cse5))))) [2024-12-06 03:32:05,998 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr88ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-12-06 03:32:05,998 INFO L77 FloydHoareUtils]: At program point L39-40(line 39) the Hoare annotation is: (let ((.cse1 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse0 (<= (+ (* |ULTIMATE.start_main_~x~0#1| 12) .cse1) (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) 9223372036854775807 (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))))) (or (and .cse0 (<= .cse1 9223372036854775807)) (and (not (and (= |ULTIMATE.start_main_~k~0#1| 1) (<= 0 (+ 1537228672809129301 |ULTIMATE.start_main_~y~0#1|)))) .cse0)))) [2024-12-06 03:32:05,998 INFO L77 FloydHoareUtils]: At program point L39-41(line 39) the Hoare annotation is: (or (not (and (= |ULTIMATE.start_main_~k~0#1| 1) (<= 0 (+ 1537228672809129301 |ULTIMATE.start_main_~y~0#1|)))) (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 9223372036854775807)) [2024-12-06 03:32:05,998 INFO L77 FloydHoareUtils]: At program point L39-42(line 39) the Hoare annotation is: true [2024-12-06 03:32:05,998 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-12-06 03:32:05,998 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) the Hoare annotation is: true [2024-12-06 03:32:05,998 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-12-06 03:32:05,998 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr99ASSERT_VIOLATIONINTEGER_OVERFLOW(line 40) the Hoare annotation is: true [2024-12-06 03:32:05,998 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-12-06 03:32:05,998 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-12-06 03:32:05,998 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr93ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-12-06 03:32:05,998 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) the Hoare annotation is: true [2024-12-06 03:32:05,998 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-12-06 03:32:05,998 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-12-06 03:32:05,998 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-12-06 03:32:05,998 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-12-06 03:32:05,998 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) the Hoare annotation is: true [2024-12-06 03:32:05,998 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-12-06 03:32:05,998 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-12-06 03:32:05,998 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-12-06 03:32:05,999 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-12-06 03:32:05,999 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-12-06 03:32:05,999 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) no Hoare annotation was computed. [2024-12-06 03:32:05,999 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr87ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-12-06 03:32:05,999 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-12-06 03:32:05,999 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-12-06 03:32:05,999 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr98ASSERT_VIOLATIONINTEGER_OVERFLOW(line 40) the Hoare annotation is: true [2024-12-06 03:32:05,999 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-12-06 03:32:05,999 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) the Hoare annotation is: true [2024-12-06 03:32:05,999 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-12-06 03:32:05,999 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW(line 35) the Hoare annotation is: true [2024-12-06 03:32:05,999 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr92ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-12-06 03:32:05,999 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-12-06 03:32:05,999 INFO L77 FloydHoareUtils]: At program point L28-2(lines 28 37) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-12-06 03:32:05,999 INFO L77 FloydHoareUtils]: At program point L28-3(lines 28 37) the Hoare annotation is: true [2024-12-06 03:32:05,999 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-12-06 03:32:05,999 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-12-06 03:32:05,999 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) the Hoare annotation is: true [2024-12-06 03:32:05,999 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-12-06 03:32:05,999 INFO L77 FloydHoareUtils]: At program point L29(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-12-06 03:32:05,999 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-12-06 03:32:05,999 INFO L77 FloydHoareUtils]: At program point L29-1(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-12-06 03:32:05,999 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW(line 34) the Hoare annotation is: true [2024-12-06 03:32:05,999 INFO L77 FloydHoareUtils]: At program point L29-2(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-12-06 03:32:05,999 INFO L77 FloydHoareUtils]: At program point L29-3(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-12-06 03:32:06,000 INFO L77 FloydHoareUtils]: At program point L29-4(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-12-06 03:32:06,000 INFO L77 FloydHoareUtils]: At program point L29-5(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-12-06 03:32:06,000 INFO L77 FloydHoareUtils]: At program point L29-6(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-12-06 03:32:06,000 INFO L77 FloydHoareUtils]: At program point L29-7(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-12-06 03:32:06,000 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-12-06 03:32:06,000 INFO L77 FloydHoareUtils]: At program point L29-8(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-12-06 03:32:06,000 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-12-06 03:32:06,000 INFO L77 FloydHoareUtils]: At program point L29-9(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-12-06 03:32:06,000 INFO L77 FloydHoareUtils]: At program point L29-10(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-12-06 03:32:06,000 INFO L77 FloydHoareUtils]: At program point L29-11(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-12-06 03:32:06,000 INFO L77 FloydHoareUtils]: At program point L29-12(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-12-06 03:32:06,000 INFO L77 FloydHoareUtils]: At program point L29-13(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-12-06 03:32:06,000 INFO L77 FloydHoareUtils]: At program point L29-14(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-12-06 03:32:06,000 INFO L77 FloydHoareUtils]: At program point L29-15(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-12-06 03:32:06,000 INFO L77 FloydHoareUtils]: At program point L29-16(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-12-06 03:32:06,001 INFO L77 FloydHoareUtils]: At program point L29-17(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-12-06 03:32:06,001 INFO L77 FloydHoareUtils]: At program point L29-18(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-12-06 03:32:06,001 INFO L77 FloydHoareUtils]: At program point L29-19(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-12-06 03:32:06,001 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-12-06 03:32:06,001 INFO L77 FloydHoareUtils]: At program point L29-20(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-12-06 03:32:06,001 INFO L77 FloydHoareUtils]: At program point L29-21(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-12-06 03:32:06,001 INFO L77 FloydHoareUtils]: At program point L29-22(line 29) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~y~0#1| 1))) (or (and .cse0 (<= 1 |ULTIMATE.start_main_~k~0#1|)) (and (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)))) .cse0) (and (< |ULTIMATE.start_main_~k~0#1| 0) .cse0) (and .cse0 (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 1))))) (and (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 1537228672809129301) (not .cse0)) (and .cse0 (< |ULTIMATE.start_main_~c~0#1| 1)) (and (< 1 |ULTIMATE.start_main_~c~0#1|) .cse0))) [2024-12-06 03:32:06,001 INFO L77 FloydHoareUtils]: At program point L29-23(line 29) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~y~0#1| 1))) (or (and .cse0 (<= 1 |ULTIMATE.start_main_~k~0#1|)) (and (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)))) .cse0) (and (< |ULTIMATE.start_main_~k~0#1| 0) .cse0) (and .cse0 (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 1))))) (and (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 1537228672809129301) (not .cse0)) (and .cse0 (< |ULTIMATE.start_main_~c~0#1| 1)) (and (< 1 |ULTIMATE.start_main_~c~0#1|) .cse0))) [2024-12-06 03:32:06,002 INFO L77 FloydHoareUtils]: At program point L29-24(line 29) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~y~0#1| 1))) (or (and .cse0 (<= 1 |ULTIMATE.start_main_~k~0#1|)) (and (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)))) .cse0) (and (< |ULTIMATE.start_main_~k~0#1| 0) .cse0) (and .cse0 (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 1))))) (and (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 1537228672809129301) (not .cse0)) (and .cse0 (< |ULTIMATE.start_main_~c~0#1| 1)) (and (< 1 |ULTIMATE.start_main_~c~0#1|) .cse0))) [2024-12-06 03:32:06,002 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-12-06 03:32:06,002 INFO L77 FloydHoareUtils]: At program point L29-25(line 29) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~y~0#1| 1))) (or (and .cse0 (<= 1 |ULTIMATE.start_main_~k~0#1|)) (and (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)))) .cse0) (and (< |ULTIMATE.start_main_~k~0#1| 0) .cse0) (and .cse0 (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 1))))) (and (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 1537228672809129301) (not .cse0)) (and .cse0 (< |ULTIMATE.start_main_~c~0#1| 1)) (and (< 1 |ULTIMATE.start_main_~c~0#1|) .cse0))) [2024-12-06 03:32:06,002 INFO L77 FloydHoareUtils]: At program point L29-26(line 29) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~y~0#1| 1))) (or (and .cse0 (<= 1 |ULTIMATE.start_main_~k~0#1|)) (and (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)))) .cse0) (and (< |ULTIMATE.start_main_~k~0#1| 0) .cse0) (and .cse0 (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 1))))) (and (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 1537228672809129301) (not .cse0)) (and .cse0 (< |ULTIMATE.start_main_~c~0#1| 1)) (and (< 1 |ULTIMATE.start_main_~c~0#1|) .cse0))) [2024-12-06 03:32:06,002 INFO L77 FloydHoareUtils]: At program point L29-27(line 29) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~y~0#1| 1))) (or (and .cse0 (<= 1 |ULTIMATE.start_main_~k~0#1|)) (and (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)))) .cse0) (and (< |ULTIMATE.start_main_~k~0#1| 0) .cse0) (and .cse0 (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 1))))) (and (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 1537228672809129301) (not .cse0)) (and .cse0 (< |ULTIMATE.start_main_~c~0#1| 1)) (and (< 1 |ULTIMATE.start_main_~c~0#1|) .cse0))) [2024-12-06 03:32:06,003 INFO L77 FloydHoareUtils]: At program point L29-28(line 29) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~y~0#1| 1))) (or (and .cse0 (<= 1 |ULTIMATE.start_main_~k~0#1|)) (and (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)))) .cse0) (and (< |ULTIMATE.start_main_~k~0#1| 0) .cse0) (and .cse0 (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 1))))) (and (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 1537228672809129301) (not .cse0)) (and .cse0 (< |ULTIMATE.start_main_~c~0#1| 1)) (and (< 1 |ULTIMATE.start_main_~c~0#1|) .cse0))) [2024-12-06 03:32:06,003 INFO L77 FloydHoareUtils]: At program point L29-29(line 29) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~y~0#1| 1))) (or (and .cse0 (<= 1 |ULTIMATE.start_main_~k~0#1|)) (and (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)))) .cse0) (and (< |ULTIMATE.start_main_~k~0#1| 0) .cse0) (and .cse0 (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 1))))) (and (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 1537228672809129301) (not .cse0)) (and .cse0 (< |ULTIMATE.start_main_~c~0#1| 1)) (and (< 1 |ULTIMATE.start_main_~c~0#1|) .cse0))) [2024-12-06 03:32:06,003 INFO L77 FloydHoareUtils]: At program point L29-30(line 29) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~y~0#1| 1))) (or (and .cse0 (<= 1 |ULTIMATE.start_main_~k~0#1|)) (and (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)))) .cse0) (and (< |ULTIMATE.start_main_~k~0#1| 0) .cse0) (and .cse0 (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 1))))) (and (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 1537228672809129301) (not .cse0)) (and .cse0 (< |ULTIMATE.start_main_~c~0#1| 1)) (and (< 1 |ULTIMATE.start_main_~c~0#1|) .cse0))) [2024-12-06 03:32:06,003 INFO L77 FloydHoareUtils]: At program point L29-31(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-12-06 03:32:06,003 INFO L77 FloydHoareUtils]: At program point L29-32(line 29) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~y~0#1| 1)) (.cse1 (<= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) 4611686018427387904))) (or (and .cse0 (<= 1 |ULTIMATE.start_main_~k~0#1|)) (and (< |ULTIMATE.start_main_~k~0#1| 0) .cse0) (and .cse1 (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 1))))) (and .cse0 (< |ULTIMATE.start_main_~c~0#1| 1)) (and (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)))) .cse1) (and (< 1 |ULTIMATE.start_main_~c~0#1|) .cse0) (and (not .cse0) .cse1))) [2024-12-06 03:32:06,003 INFO L77 FloydHoareUtils]: At program point L29-33(line 29) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~y~0#1| 1)) (.cse1 (<= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) 4611686018427387904))) (or (and .cse0 (<= 1 |ULTIMATE.start_main_~k~0#1|)) (and (< |ULTIMATE.start_main_~k~0#1| 0) .cse0) (and .cse1 (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 1))))) (and .cse0 (< |ULTIMATE.start_main_~c~0#1| 1)) (and (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)))) .cse1) (and (< 1 |ULTIMATE.start_main_~c~0#1|) .cse0) (and (not .cse0) .cse1))) [2024-12-06 03:32:06,004 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) the Hoare annotation is: true [2024-12-06 03:32:06,004 INFO L77 FloydHoareUtils]: At program point L29-34(line 29) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~y~0#1| 1)) (.cse1 (<= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) 4611686018427387904))) (or (and .cse0 (<= 1 |ULTIMATE.start_main_~k~0#1|)) (and (< |ULTIMATE.start_main_~k~0#1| 0) .cse0) (and .cse1 (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 1))))) (and .cse0 (< |ULTIMATE.start_main_~c~0#1| 1)) (and (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)))) .cse1) (and (< 1 |ULTIMATE.start_main_~c~0#1|) .cse0) (and (not .cse0) .cse1))) [2024-12-06 03:32:06,004 INFO L77 FloydHoareUtils]: At program point L29-35(line 29) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~y~0#1| 1)) (.cse1 (<= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) (* 3 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) 4611686018427387904))) (or (and .cse0 (<= 1 |ULTIMATE.start_main_~k~0#1|)) (and (< |ULTIMATE.start_main_~k~0#1| 0) .cse0) (and .cse1 (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 1))))) (and .cse0 (< |ULTIMATE.start_main_~c~0#1| 1)) (and (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)))) .cse1) (and (< 1 |ULTIMATE.start_main_~c~0#1|) .cse0) (and (not .cse0) .cse1))) [2024-12-06 03:32:06,004 INFO L77 FloydHoareUtils]: At program point L29-36(line 29) the Hoare annotation is: (let ((.cse1 (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)))) (.cse0 (= |ULTIMATE.start_main_~x~0#1| 0))) (or (and (<= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ 9223372036854775808 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) .cse0) (and (< 1 |ULTIMATE.start_main_~c~0#1|) .cse1) (and .cse1 (<= 1 |ULTIMATE.start_main_~k~0#1|)) (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 1)))) (and (< |ULTIMATE.start_main_~c~0#1| 1) .cse1) (and (not (= |ULTIMATE.start_main_~y~0#1| 1)) .cse1) (and (< |ULTIMATE.start_main_~k~0#1| 0) .cse1) (and (not .cse1) (not .cse0)))) [2024-12-06 03:32:06,004 INFO L77 FloydHoareUtils]: At program point L29-37(line 29) the Hoare annotation is: (let ((.cse1 (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)))) (.cse0 (= |ULTIMATE.start_main_~x~0#1| 0))) (or (and (<= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ 9223372036854775808 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) .cse0) (and (< 1 |ULTIMATE.start_main_~c~0#1|) .cse1) (and .cse1 (<= 1 |ULTIMATE.start_main_~k~0#1|)) (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 1)))) (and (< |ULTIMATE.start_main_~c~0#1| 1) .cse1) (and (not (= |ULTIMATE.start_main_~y~0#1| 1)) .cse1) (and (< |ULTIMATE.start_main_~k~0#1| 0) .cse1) (and (not .cse1) (not .cse0)))) [2024-12-06 03:32:06,005 INFO L77 FloydHoareUtils]: At program point L29-38(line 29) the Hoare annotation is: (let ((.cse1 (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)))) (.cse0 (= |ULTIMATE.start_main_~x~0#1| 0))) (or (and (<= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ 9223372036854775808 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) .cse0) (and (< 1 |ULTIMATE.start_main_~c~0#1|) .cse1) (and .cse1 (<= 1 |ULTIMATE.start_main_~k~0#1|)) (not (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (and (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 1)))) (and (< |ULTIMATE.start_main_~c~0#1| 1) .cse1) (and (not (= |ULTIMATE.start_main_~y~0#1| 1)) .cse1) (and (< |ULTIMATE.start_main_~k~0#1| 0) .cse1) (and (not .cse1) (not .cse0)))) [2024-12-06 03:32:06,005 INFO L77 FloydHoareUtils]: At program point L29-39(line 29) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~y~0#1| 1) (<= 1 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~k~0#1| 1))) [2024-12-06 03:32:06,005 INFO L77 FloydHoareUtils]: At program point L29-40(line 29) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse1 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (or (< 1 |ULTIMATE.start_main_~c~0#1|) (and (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~c~0#1|))) (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 4611686018427387904)) (not (and (<= |ULTIMATE.start_main_~x~0#1| 768614336404564650) (<= |ULTIMATE.start_main_~x~0#1| .cse0) (<= .cse1 1537228672809129301))) (and (< 4611686018427387904 (+ .cse2 (* 3 .cse0))) (<= .cse2 4611686018427387904)) (< (+ (* 6 .cse0) (* 2 .cse2) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) 9223372036854775809 .cse1)) (< |ULTIMATE.start_main_~c~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0))) [2024-12-06 03:32:06,005 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-12-06 03:32:06,005 INFO L77 FloydHoareUtils]: At program point L29-41(line 29) the Hoare annotation is: (let ((.cse1 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (or (< 1 |ULTIMATE.start_main_~c~0#1|) (< 4611686018427387904 (+ .cse0 (* 3 .cse1))) (and (<= |ULTIMATE.start_main_~x~0#1| 768614336404564650) (< 0 (+ 768614336404564651 |ULTIMATE.start_main_~x~0#1|))) (< |ULTIMATE.start_main_~c~0#1| 1) (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~c~0#1|))) (and (not (= |ULTIMATE.start_main_~y~0#1| 0)) (< (+ (* 6 .cse1) (* 2 .cse0) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) 9223372036854775809 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)))))) [2024-12-06 03:32:06,005 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr86ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-12-06 03:32:06,005 INFO L77 FloydHoareUtils]: At program point L29-42(lines 28 37) the Hoare annotation is: true [2024-12-06 03:32:06,005 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-12-06 03:32:06,005 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-12-06 03:32:06,005 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-12-06 03:32:06,006 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) the Hoare annotation is: true [2024-12-06 03:32:06,006 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr91ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-12-06 03:32:06,006 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) the Hoare annotation is: true [2024-12-06 03:32:06,006 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-12-06 03:32:06,006 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-12-06 03:32:06,006 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-12-06 03:32:06,006 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) the Hoare annotation is: true [2024-12-06 03:32:06,006 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-12-06 03:32:06,006 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-12-06 03:32:06,006 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-12-06 03:32:06,006 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-12-06 03:32:06,006 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-12-06 03:32:06,006 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) the Hoare annotation is: true [2024-12-06 03:32:06,006 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) the Hoare annotation is: true [2024-12-06 03:32:06,006 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-12-06 03:32:06,006 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-12-06 03:32:06,006 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-12-06 03:32:06,006 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-12-06 03:32:06,006 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) the Hoare annotation is: true [2024-12-06 03:32:06,006 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-12-06 03:32:06,006 INFO L77 FloydHoareUtils]: At program point L34(line 34) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0) (< |ULTIMATE.start_main_~k~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0))) [2024-12-06 03:32:06,007 INFO L77 FloydHoareUtils]: At program point L34-1(line 34) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0) (< |ULTIMATE.start_main_~k~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0))) [2024-12-06 03:32:06,007 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr90ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-12-06 03:32:06,007 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW(line 34) the Hoare annotation is: true [2024-12-06 03:32:06,007 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) no Hoare annotation was computed. [2024-12-06 03:32:06,007 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2024-12-06 03:32:06,007 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW(line 40) the Hoare annotation is: true [2024-12-06 03:32:06,007 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW(line 39) the Hoare annotation is: true [2024-12-06 03:32:06,007 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) the Hoare annotation is: true [2024-12-06 03:32:06,007 INFO L77 FloydHoareUtils]: At program point L35(line 35) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0) (< |ULTIMATE.start_main_~k~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0))) [2024-12-06 03:32:06,007 INFO L77 FloydHoareUtils]: At program point L35-1(line 35) the Hoare annotation is: (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~c~0#1| 1) (<= 1 |ULTIMATE.start_main_~c~0#1|) (= |ULTIMATE.start_main_~y~0#1| 0) (< |ULTIMATE.start_main_~k~0#1| 1) (= |ULTIMATE.start_main_~x~0#1| 0))) [2024-12-06 03:32:06,007 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(lines 6 8) the Hoare annotation is: true [2024-12-06 03:32:06,007 INFO L77 FloydHoareUtils]: At program point assume_abort_if_notEXIT(lines 6 8) the Hoare annotation is: (not (= |assume_abort_if_not_#in~cond| 0)) [2024-12-06 03:32:06,007 INFO L77 FloydHoareUtils]: At program point __VERIFIER_assertEXIT(lines 9 15) the Hoare annotation is: true [2024-12-06 03:32:06,007 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(lines 9 15) the Hoare annotation is: true [2024-12-06 03:32:06,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 03:32:06 ImpRootNode [2024-12-06 03:32:06,024 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 03:32:06,025 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 03:32:06,025 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 03:32:06,025 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 03:32:06,025 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 03:30:14" (3/4) ... [2024-12-06 03:32:06,027 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-06 03:32:06,029 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-12-06 03:32:06,029 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-12-06 03:32:06,034 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-12-06 03:32:06,034 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-12-06 03:32:06,034 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-12-06 03:32:06,035 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-12-06 03:32:06,104 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb7f14a-c356-485e-a911-23e9130a5726/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 03:32:06,105 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb7f14a-c356-485e-a911-23e9130a5726/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 03:32:06,105 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 03:32:06,106 INFO L158 Benchmark]: Toolchain (without parser) took 112882.33ms. Allocated memory was 117.4MB in the beginning and 503.3MB in the end (delta: 385.9MB). Free memory was 93.4MB in the beginning and 316.3MB in the end (delta: -222.9MB). Peak memory consumption was 157.8MB. Max. memory is 16.1GB. [2024-12-06 03:32:06,106 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 117.4MB. Free memory was 72.9MB in the beginning and 72.8MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 03:32:06,106 INFO L158 Benchmark]: CACSL2BoogieTranslator took 170.21ms. Allocated memory is still 117.4MB. Free memory was 93.2MB in the beginning and 81.6MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 03:32:06,106 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.20ms. Allocated memory is still 117.4MB. Free memory was 81.6MB in the beginning and 79.4MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 03:32:06,106 INFO L158 Benchmark]: Boogie Preprocessor took 18.79ms. Allocated memory is still 117.4MB. Free memory was 79.4MB in the beginning and 78.4MB in the end (delta: 975.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 03:32:06,107 INFO L158 Benchmark]: RCFGBuilder took 653.57ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 43.5MB in the end (delta: 34.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-12-06 03:32:06,107 INFO L158 Benchmark]: CodeCheck took 111924.35ms. Allocated memory was 117.4MB in the beginning and 503.3MB in the end (delta: 385.9MB). Free memory was 43.3MB in the beginning and 320.5MB in the end (delta: -277.2MB). Peak memory consumption was 107.4MB. Max. memory is 16.1GB. [2024-12-06 03:32:06,107 INFO L158 Benchmark]: Witness Printer took 80.11ms. Allocated memory is still 503.3MB. Free memory was 320.5MB in the beginning and 316.3MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 03:32:06,109 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 3 procedures, 218 locations, 102 error locations. Started 1 CEGAR loops. OverallTime: 91.9s, OverallIterations: 176, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 149288 SdHoareTripleChecker+Valid, 332.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 127533 mSDsluCounter, 9165 SdHoareTripleChecker+Invalid, 286.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1282 mSDsCounter, 19763 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 287768 IncrementalHoareTripleChecker+Invalid, 307531 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19763 mSolverCounterUnsat, 7883 mSDtfsCounter, 287768 mSolverCounterSat, 3.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 91733 GetRequests, 86804 SyntacticMatches, 4273 SemanticMatches, 656 ConstructedPredicates, 0 IntricatePredicates, 24 DeprecatedPredicates, 303981 ImplicationChecksByTransitivity, 70.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 12.0s InterpolantComputationTime, 14113 NumberOfCodeBlocks, 14113 NumberOfCodeBlocksAsserted, 175 NumberOfCheckSat, 13938 ConstructedInterpolants, 79 QuantifiedInterpolants, 51542 SizeOfPredicates, 2 NumberOfNonLiveVariables, 5056 ConjunctsInSsa, 180 ConjunctsInUnsatCore, 175 InterpolantComputations, 147 PerfectInterpolantSequences, 2234/2997 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 102 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: !(((((((0 <= k) && (c <= 1)) && (1 <= c)) && (x <= (((((__int128) y * y) * y) * y) * y))) && (y == 1)) && (1 <= x)) && (k < 1)) - ProcedureContractResult [Line: 6]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (cond != 0) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 117.4MB. Free memory was 72.9MB in the beginning and 72.8MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 170.21ms. Allocated memory is still 117.4MB. Free memory was 93.2MB in the beginning and 81.6MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.20ms. Allocated memory is still 117.4MB. Free memory was 81.6MB in the beginning and 79.4MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.79ms. Allocated memory is still 117.4MB. Free memory was 79.4MB in the beginning and 78.4MB in the end (delta: 975.6kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 653.57ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 43.5MB in the end (delta: 34.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * CodeCheck took 111924.35ms. Allocated memory was 117.4MB in the beginning and 503.3MB in the end (delta: 385.9MB). Free memory was 43.3MB in the beginning and 320.5MB in the end (delta: -277.2MB). Peak memory consumption was 107.4MB. Max. memory is 16.1GB. * Witness Printer took 80.11ms. Allocated memory is still 503.3MB. Free memory was 320.5MB in the beginning and 316.3MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-12-06 03:32:06,168 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb7f14a-c356-485e-a911-23e9130a5726/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE