./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/ps4-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_7d5d392b-3550-43c4-b3e5-065b56e5a7e4/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d5d392b-3550-43c4-b3e5-065b56e5a7e4/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_7d5d392b-3550-43c4-b3e5-065b56e5a7e4/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d5d392b-3550-43c4-b3e5-065b56e5a7e4/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d5d392b-3550-43c4-b3e5-065b56e5a7e4/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_7d5d392b-3550-43c4-b3e5-065b56e5a7e4/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 9c6f057d93c74db928b7d0b0915eda2af89e3a19cf93af1e21b1cfa684bd6cf4 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 01:30:12,343 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 01:30:12,396 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d5d392b-3550-43c4-b3e5-065b56e5a7e4/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Overflow-32bit-Kojak_Default.epf [2024-12-06 01:30:12,400 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 01:30:12,401 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 01:30:12,420 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 01:30:12,421 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 01:30:12,422 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 01:30:12,422 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 01:30:12,422 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 01:30:12,422 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 01:30:12,422 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 01:30:12,422 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 01:30:12,423 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 01:30:12,423 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 01:30:12,423 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 01:30:12,423 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 01:30:12,423 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 01:30:12,423 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 01:30:12,423 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-12-06 01:30:12,423 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-06 01:30:12,423 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 01:30:12,423 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 01:30:12,423 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 01:30:12,424 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 01:30:12,424 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 01:30:12,424 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 01:30:12,424 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 01:30:12,424 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 01:30:12,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 01:30:12,424 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 01:30:12,424 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 01:30:12,424 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 01:30:12,425 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 01:30:12,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 01:30:12,425 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_7d5d392b-3550-43c4-b3e5-065b56e5a7e4/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 -> 9c6f057d93c74db928b7d0b0915eda2af89e3a19cf93af1e21b1cfa684bd6cf4 [2024-12-06 01:30:12,629 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 01:30:12,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 01:30:12,638 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 01:30:12,639 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 01:30:12,639 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 01:30:12,640 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d5d392b-3550-43c4-b3e5-065b56e5a7e4/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound1.c [2024-12-06 01:30:15,247 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d5d392b-3550-43c4-b3e5-065b56e5a7e4/bin/ukojak-verify-CZk0znPC7b/data/eedba90cf/a51c3eccd12c4a068428fc820e28bd4c/FLAG57313753b [2024-12-06 01:30:15,444 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 01:30:15,444 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d5d392b-3550-43c4-b3e5-065b56e5a7e4/sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound1.c [2024-12-06 01:30:15,449 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d5d392b-3550-43c4-b3e5-065b56e5a7e4/bin/ukojak-verify-CZk0znPC7b/data/eedba90cf/a51c3eccd12c4a068428fc820e28bd4c/FLAG57313753b [2024-12-06 01:30:15,831 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d5d392b-3550-43c4-b3e5-065b56e5a7e4/bin/ukojak-verify-CZk0znPC7b/data/eedba90cf/a51c3eccd12c4a068428fc820e28bd4c [2024-12-06 01:30:15,833 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 01:30:15,834 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 01:30:15,835 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 01:30:15,835 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 01:30:15,838 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 01:30:15,839 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:30:15" (1/1) ... [2024-12-06 01:30:15,839 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e8555ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:30:15, skipping insertion in model container [2024-12-06 01:30:15,839 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:30:15" (1/1) ... [2024-12-06 01:30:15,849 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 01:30:15,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 01:30:15,986 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 01:30:16,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 01:30:16,016 INFO L204 MainTranslator]: Completed translation [2024-12-06 01:30:16,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:30:16 WrapperNode [2024-12-06 01:30:16,016 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 01:30:16,017 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 01:30:16,017 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 01:30:16,017 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 01:30:16,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:30:16" (1/1) ... [2024-12-06 01:30:16,026 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:30:16" (1/1) ... [2024-12-06 01:30:16,041 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 103 [2024-12-06 01:30:16,041 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 01:30:16,041 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 01:30:16,041 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 01:30:16,041 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 01:30:16,046 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:30:16" (1/1) ... [2024-12-06 01:30:16,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:30:16" (1/1) ... [2024-12-06 01:30:16,047 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:30:16" (1/1) ... [2024-12-06 01:30:16,047 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:30:16" (1/1) ... [2024-12-06 01:30:16,050 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:30:16" (1/1) ... [2024-12-06 01:30:16,051 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:30:16" (1/1) ... [2024-12-06 01:30:16,053 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:30:16" (1/1) ... [2024-12-06 01:30:16,054 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:30:16" (1/1) ... [2024-12-06 01:30:16,054 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:30:16" (1/1) ... [2024-12-06 01:30:16,056 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 01:30:16,056 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 01:30:16,057 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 01:30:16,057 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 01:30:16,057 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:30:16" (1/1) ... [2024-12-06 01:30:16,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 01:30:16,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d5d392b-3550-43c4-b3e5-065b56e5a7e4/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 01:30:16,083 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d5d392b-3550-43c4-b3e5-065b56e5a7e4/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 01:30:16,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d5d392b-3550-43c4-b3e5-065b56e5a7e4/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 01:30:16,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 01:30:16,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 01:30:16,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 01:30:16,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 01:30:16,106 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-12-06 01:30:16,106 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-12-06 01:30:16,145 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 01:30:16,147 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 01:30:16,465 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-12-06 01:30:16,465 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 01:30:16,500 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 01:30:16,500 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-06 01:30:16,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:30:16 BoogieIcfgContainer [2024-12-06 01:30:16,501 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 01:30:16,502 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 01:30:16,502 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 01:30:16,511 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 01:30:16,511 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:30:16" (1/1) ... [2024-12-06 01:30:16,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 01:30:16,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:16,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 129 states and 132 transitions. [2024-12-06 01:30:16,568 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2024-12-06 01:30:16,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-12-06 01:30:16,569 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:16,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:16,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:16,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:16,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:16,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 130 states and 133 transitions. [2024-12-06 01:30:16,719 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 133 transitions. [2024-12-06 01:30:16,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-12-06 01:30:16,719 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:16,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:16,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:16,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:16,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 132 states and 136 transitions. [2024-12-06 01:30:16,800 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 136 transitions. [2024-12-06 01:30:16,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-12-06 01:30:16,801 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:16,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:16,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:16,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:16,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:16,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 131 states and 135 transitions. [2024-12-06 01:30:16,821 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2024-12-06 01:30:16,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-12-06 01:30:16,821 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:16,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:16,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 01:30:16,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:16,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-06 01:30:16,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 01:30:16,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:17,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:17,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 135 states and 142 transitions. [2024-12-06 01:30:17,024 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 142 transitions. [2024-12-06 01:30:17,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-12-06 01:30:17,024 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:17,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 01:30:17,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:17,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-06 01:30:17,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 01:30:17,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:17,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:17,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 136 states and 143 transitions. [2024-12-06 01:30:17,069 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 143 transitions. [2024-12-06 01:30:17,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-12-06 01:30:17,069 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:17,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 01:30:17,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:17,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-06 01:30:17,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 01:30:17,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:17,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:17,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 137 states and 144 transitions. [2024-12-06 01:30:17,113 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 144 transitions. [2024-12-06 01:30:17,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-12-06 01:30:17,114 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:17,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:17,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:17,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:17,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:17,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 136 states and 143 transitions. [2024-12-06 01:30:17,135 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 143 transitions. [2024-12-06 01:30:17,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-06 01:30:17,136 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:17,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:17,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 01:30:17,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:17,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-06 01:30:17,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 01:30:17,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:17,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:17,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 138 states and 145 transitions. [2024-12-06 01:30:17,191 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 145 transitions. [2024-12-06 01:30:17,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-06 01:30:17,191 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:17,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:17,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:17,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:17,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:17,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 146 states and 155 transitions. [2024-12-06 01:30:17,387 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 155 transitions. [2024-12-06 01:30:17,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-12-06 01:30:17,387 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:17,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:17,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 01:30:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:17,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-12-06 01:30:17,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 01:30:17,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:17,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:17,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 154 states and 164 transitions. [2024-12-06 01:30:17,635 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 164 transitions. [2024-12-06 01:30:17,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-12-06 01:30:17,635 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:17,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:17,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:17,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:17,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:17,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 155 states and 166 transitions. [2024-12-06 01:30:17,683 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 166 transitions. [2024-12-06 01:30:17,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-12-06 01:30:17,683 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:17,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:17,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:17,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:17,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:17,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 156 states and 167 transitions. [2024-12-06 01:30:17,730 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 167 transitions. [2024-12-06 01:30:17,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-12-06 01:30:17,730 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:17,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:17,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:17,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:17,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 155 states and 166 transitions. [2024-12-06 01:30:17,751 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 166 transitions. [2024-12-06 01:30:17,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-12-06 01:30:17,751 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:17,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:17,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 01:30:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:17,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-06 01:30:17,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 01:30:17,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:17,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:17,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 157 states and 168 transitions. [2024-12-06 01:30:17,821 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 168 transitions. [2024-12-06 01:30:17,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-12-06 01:30:17,821 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:17,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:17,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 01:30:17,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:17,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-06 01:30:17,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 01:30:17,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:17,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:17,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 158 states and 169 transitions. [2024-12-06 01:30:17,895 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 169 transitions. [2024-12-06 01:30:17,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-12-06 01:30:17,895 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:17,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:17,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 01:30:17,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:17,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-06 01:30:17,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 01:30:17,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:17,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:17,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 159 states and 170 transitions. [2024-12-06 01:30:17,958 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 170 transitions. [2024-12-06 01:30:17,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-12-06 01:30:17,959 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:17,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 01:30:17,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:17,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-12-06 01:30:17,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 01:30:18,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:18,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:18,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 168 states and 179 transitions. [2024-12-06 01:30:18,221 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 179 transitions. [2024-12-06 01:30:18,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-12-06 01:30:18,221 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:18,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:18,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 01:30:18,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:18,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-12-06 01:30:18,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 01:30:18,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:18,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:18,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 176 states and 188 transitions. [2024-12-06 01:30:18,375 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 188 transitions. [2024-12-06 01:30:18,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-12-06 01:30:18,376 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:18,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:18,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:18,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:18,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:18,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 175 states and 187 transitions. [2024-12-06 01:30:18,398 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 187 transitions. [2024-12-06 01:30:18,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-12-06 01:30:18,398 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:18,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:18,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:18,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:18,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 177 states and 189 transitions. [2024-12-06 01:30:18,496 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 189 transitions. [2024-12-06 01:30:18,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-06 01:30:18,496 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:18,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:18,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 01:30:18,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:18,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-12-06 01:30:18,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 01:30:18,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:18,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:18,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 181 states and 194 transitions. [2024-12-06 01:30:18,705 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 194 transitions. [2024-12-06 01:30:18,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-06 01:30:18,706 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:18,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:18,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 01:30:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:18,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-12-06 01:30:18,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 01:30:18,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:18,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:18,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 185 states and 199 transitions. [2024-12-06 01:30:18,845 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 199 transitions. [2024-12-06 01:30:18,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-06 01:30:18,848 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:18,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:18,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 01:30:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:18,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-06 01:30:18,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 01:30:18,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:18,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:18,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 188 states and 205 transitions. [2024-12-06 01:30:18,937 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 205 transitions. [2024-12-06 01:30:18,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-12-06 01:30:18,938 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:18,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:18,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:18,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:19,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:19,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 213 states and 236 transitions. [2024-12-06 01:30:19,335 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 236 transitions. [2024-12-06 01:30:19,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-12-06 01:30:19,336 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:19,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:19,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 01:30:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:19,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-06 01:30:19,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 01:30:19,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:19,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:19,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 214 states and 237 transitions. [2024-12-06 01:30:19,413 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 237 transitions. [2024-12-06 01:30:19,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-12-06 01:30:19,413 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:19,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:19,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:19,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:19,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 215 states and 238 transitions. [2024-12-06 01:30:19,462 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 238 transitions. [2024-12-06 01:30:19,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-12-06 01:30:19,463 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:19,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:19,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:19,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:19,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:19,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 214 states and 237 transitions. [2024-12-06 01:30:19,488 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 237 transitions. [2024-12-06 01:30:19,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-12-06 01:30:19,488 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:19,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:19,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:19,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:19,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 217 states and 241 transitions. [2024-12-06 01:30:19,581 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 241 transitions. [2024-12-06 01:30:19,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-12-06 01:30:19,581 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:19,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:19,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:19,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:19,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:19,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 219 states and 243 transitions. [2024-12-06 01:30:19,646 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 243 transitions. [2024-12-06 01:30:19,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-12-06 01:30:19,646 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:19,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:19,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:19,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:19,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:19,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 220 states and 244 transitions. [2024-12-06 01:30:19,699 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 244 transitions. [2024-12-06 01:30:19,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-12-06 01:30:19,699 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:19,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:19,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 01:30:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:19,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-06 01:30:19,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 01:30:19,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:19,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:19,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 223 states and 247 transitions. [2024-12-06 01:30:19,840 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 247 transitions. [2024-12-06 01:30:19,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-12-06 01:30:19,840 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:19,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:19,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:19,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:19,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:19,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 222 states and 246 transitions. [2024-12-06 01:30:19,867 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 246 transitions. [2024-12-06 01:30:19,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-12-06 01:30:19,868 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:19,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 01:30:19,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:19,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-06 01:30:19,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 01:30:19,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:19,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:19,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 223 states and 247 transitions. [2024-12-06 01:30:19,951 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 247 transitions. [2024-12-06 01:30:19,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-12-06 01:30:19,952 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:19,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 01:30:19,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:19,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-06 01:30:19,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 01:30:20,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:20,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:20,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 225 states and 249 transitions. [2024-12-06 01:30:20,075 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 249 transitions. [2024-12-06 01:30:20,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-12-06 01:30:20,075 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:20,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 01:30:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:20,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-12-06 01:30:20,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 01:30:20,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:20,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:20,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 228 states and 252 transitions. [2024-12-06 01:30:20,578 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 252 transitions. [2024-12-06 01:30:20,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-06 01:30:20,579 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:20,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:20,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 01:30:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:20,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-06 01:30:20,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 01:30:20,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:20,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:20,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 229 states and 254 transitions. [2024-12-06 01:30:20,800 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 254 transitions. [2024-12-06 01:30:20,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 01:30:20,800 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:20,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:20,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:20,846 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 01:30:20,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:20,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 237 states and 265 transitions. [2024-12-06 01:30:20,964 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 265 transitions. [2024-12-06 01:30:20,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-06 01:30:20,964 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:20,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:21,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:21,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:21,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 244 states and 275 transitions. [2024-12-06 01:30:21,351 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 275 transitions. [2024-12-06 01:30:21,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-06 01:30:21,353 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:21,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:21,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:21,396 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 01:30:21,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:21,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 253 states and 287 transitions. [2024-12-06 01:30:21,562 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 287 transitions. [2024-12-06 01:30:21,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-06 01:30:21,562 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:21,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:21,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:21,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:22,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:22,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 261 states and 298 transitions. [2024-12-06 01:30:22,105 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 298 transitions. [2024-12-06 01:30:22,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 01:30:22,105 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:22,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:22,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:22,121 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 01:30:22,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:22,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 260 states and 297 transitions. [2024-12-06 01:30:22,130 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 297 transitions. [2024-12-06 01:30:22,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-12-06 01:30:22,130 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:22,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:22,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 01:30:22,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:22,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-06 01:30:22,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 01:30:22,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:22,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:22,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 263 states and 302 transitions. [2024-12-06 01:30:22,815 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 302 transitions. [2024-12-06 01:30:22,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-12-06 01:30:22,815 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:22,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:22,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:22,843 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 01:30:23,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:23,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 268 states and 310 transitions. [2024-12-06 01:30:23,168 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 310 transitions. [2024-12-06 01:30:23,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-12-06 01:30:23,168 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:23,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 01:30:23,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:23,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-06 01:30:23,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 01:30:23,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:23,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:23,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 272 states and 316 transitions. [2024-12-06 01:30:23,865 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 316 transitions. [2024-12-06 01:30:23,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-12-06 01:30:23,865 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:23,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:23,957 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 01:30:24,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:24,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 278 states and 325 transitions. [2024-12-06 01:30:24,591 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 325 transitions. [2024-12-06 01:30:24,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 01:30:24,591 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:24,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:24,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:24,665 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 01:30:25,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:25,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 285 states and 335 transitions. [2024-12-06 01:30:25,341 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 335 transitions. [2024-12-06 01:30:25,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-12-06 01:30:25,341 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:25,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:25,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:25,364 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:25,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:25,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 289 states and 341 transitions. [2024-12-06 01:30:25,641 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 341 transitions. [2024-12-06 01:30:25,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-12-06 01:30:25,641 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:25,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:25,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:25,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 01:30:25,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:25,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 288 states and 340 transitions. [2024-12-06 01:30:25,666 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 340 transitions. [2024-12-06 01:30:25,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-12-06 01:30:25,666 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:25,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:25,688 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:26,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:26,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 293 states and 347 transitions. [2024-12-06 01:30:26,249 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 347 transitions. [2024-12-06 01:30:26,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-12-06 01:30:26,250 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:26,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:26,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:26,342 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 01:30:27,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:27,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 302 states and 359 transitions. [2024-12-06 01:30:27,086 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 359 transitions. [2024-12-06 01:30:27,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-12-06 01:30:27,087 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:27,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:27,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:27,099 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:27,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:27,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 308 states and 367 transitions. [2024-12-06 01:30:27,752 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 367 transitions. [2024-12-06 01:30:27,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-12-06 01:30:27,752 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:27,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:27,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:27,873 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 01:30:28,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:28,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 316 states and 375 transitions. [2024-12-06 01:30:28,351 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 375 transitions. [2024-12-06 01:30:28,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-12-06 01:30:28,351 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:28,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:28,428 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 01:30:28,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:28,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 315 states and 374 transitions. [2024-12-06 01:30:28,922 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 374 transitions. [2024-12-06 01:30:28,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-12-06 01:30:28,922 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:28,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 01:30:28,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:28,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-06 01:30:28,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 01:30:28,993 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:29,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:29,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 323 states and 385 transitions. [2024-12-06 01:30:29,683 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 385 transitions. [2024-12-06 01:30:29,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-12-06 01:30:29,683 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:29,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:29,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:29,712 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 01:30:30,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:30,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 335 states and 400 transitions. [2024-12-06 01:30:30,618 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 400 transitions. [2024-12-06 01:30:30,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-12-06 01:30:30,618 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:30,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 01:30:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:30,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-06 01:30:30,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 01:30:30,912 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:31,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:31,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 341 states and 406 transitions. [2024-12-06 01:30:31,220 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 406 transitions. [2024-12-06 01:30:31,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-12-06 01:30:31,220 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:31,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:31,247 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 01:30:31,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:31,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 342 states and 407 transitions. [2024-12-06 01:30:31,279 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 407 transitions. [2024-12-06 01:30:31,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-12-06 01:30:31,279 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:31,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:31,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 01:30:31,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:31,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-12-06 01:30:31,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 01:30:31,378 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 01:30:31,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:31,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 344 states and 412 transitions. [2024-12-06 01:30:31,977 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 412 transitions. [2024-12-06 01:30:31,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-12-06 01:30:31,978 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:31,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:31,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 01:30:31,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:31,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 343 states and 411 transitions. [2024-12-06 01:30:31,993 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 411 transitions. [2024-12-06 01:30:31,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-12-06 01:30:31,994 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:31,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:32,044 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:32,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:32,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 346 states and 417 transitions. [2024-12-06 01:30:32,711 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 417 transitions. [2024-12-06 01:30:32,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-12-06 01:30:32,712 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:32,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:32,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 01:30:32,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:32,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 348 states and 419 transitions. [2024-12-06 01:30:32,934 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 419 transitions. [2024-12-06 01:30:32,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-12-06 01:30:32,935 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:32,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:32,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:32,961 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:33,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:33,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 352 states and 424 transitions. [2024-12-06 01:30:33,603 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 424 transitions. [2024-12-06 01:30:33,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-12-06 01:30:33,603 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:33,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:33,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:33,714 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 01:30:34,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:34,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 355 states and 427 transitions. [2024-12-06 01:30:34,085 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 427 transitions. [2024-12-06 01:30:34,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-12-06 01:30:34,085 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:34,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:34,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:34,181 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 01:30:34,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:34,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 359 states and 431 transitions. [2024-12-06 01:30:34,548 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 431 transitions. [2024-12-06 01:30:34,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-12-06 01:30:34,548 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:34,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:34,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 01:30:34,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:34,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-06 01:30:34,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 01:30:34,626 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:34,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:34,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 362 states and 434 transitions. [2024-12-06 01:30:34,689 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 434 transitions. [2024-12-06 01:30:34,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-12-06 01:30:34,689 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:34,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:34,853 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 01:30:35,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:35,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 367 states and 439 transitions. [2024-12-06 01:30:35,977 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 439 transitions. [2024-12-06 01:30:35,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-12-06 01:30:35,977 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:35,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:35,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:36,197 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:36,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:36,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 368 states and 441 transitions. [2024-12-06 01:30:36,525 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 441 transitions. [2024-12-06 01:30:36,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-12-06 01:30:36,525 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:36,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:36,626 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 01:30:37,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:37,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 374 states and 447 transitions. [2024-12-06 01:30:37,793 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 447 transitions. [2024-12-06 01:30:37,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-12-06 01:30:37,793 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:37,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:37,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:37,997 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:38,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:38,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 376 states and 450 transitions. [2024-12-06 01:30:38,434 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 450 transitions. [2024-12-06 01:30:38,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-12-06 01:30:38,434 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:38,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:38,442 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 01:30:38,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:38,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 375 states and 449 transitions. [2024-12-06 01:30:38,452 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 449 transitions. [2024-12-06 01:30:38,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-12-06 01:30:38,452 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:38,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:38,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:38,735 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:40,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:40,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 379 states and 459 transitions. [2024-12-06 01:30:40,713 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 459 transitions. [2024-12-06 01:30:40,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-12-06 01:30:40,714 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:40,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:40,736 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 01:30:42,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:42,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 378 states and 458 transitions. [2024-12-06 01:30:42,041 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 458 transitions. [2024-12-06 01:30:42,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-12-06 01:30:42,042 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:42,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:42,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:42,195 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:44,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:44,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 387 states and 470 transitions. [2024-12-06 01:30:44,011 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 470 transitions. [2024-12-06 01:30:44,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-12-06 01:30:44,011 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:44,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:44,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:44,176 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 01:30:46,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:46,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 396 states and 479 transitions. [2024-12-06 01:30:46,839 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 479 transitions. [2024-12-06 01:30:46,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-12-06 01:30:46,839 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:46,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:46,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:46,948 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 01:30:47,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:47,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 395 states and 478 transitions. [2024-12-06 01:30:47,701 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 478 transitions. [2024-12-06 01:30:47,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-12-06 01:30:47,702 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:47,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:47,715 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:48,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:48,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 396 states and 479 transitions. [2024-12-06 01:30:48,958 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 479 transitions. [2024-12-06 01:30:48,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-12-06 01:30:48,959 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:48,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 01:30:48,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:48,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-12-06 01:30:48,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 01:30:49,630 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:51,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:51,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 408 states and 492 transitions. [2024-12-06 01:30:51,326 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 492 transitions. [2024-12-06 01:30:51,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-12-06 01:30:51,326 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:51,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 01:30:51,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:51,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-12-06 01:30:51,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 01:30:51,958 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:52,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:52,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 409 states and 492 transitions. [2024-12-06 01:30:52,359 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 492 transitions. [2024-12-06 01:30:52,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-12-06 01:30:52,359 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:52,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:52,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 01:30:52,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:52,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-12-06 01:30:52,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 01:30:52,556 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:30:53,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:53,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 424 states and 508 transitions. [2024-12-06 01:30:53,487 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 508 transitions. [2024-12-06 01:30:53,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-12-06 01:30:53,487 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:53,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:53,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 01:30:53,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:53,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-06 01:30:53,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 01:30:53,864 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 01:30:56,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:56,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 483 states and 576 transitions. [2024-12-06 01:30:56,175 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 576 transitions. [2024-12-06 01:30:56,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-12-06 01:30:56,175 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:56,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:56,279 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 01:30:58,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:58,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 202 states and 224 transitions. [2024-12-06 01:30:58,236 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 224 transitions. [2024-12-06 01:30:58,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-12-06 01:30:58,237 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:58,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:58,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 01:30:58,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:58,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-06 01:30:58,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 01:30:58,529 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 01:30:59,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:30:59,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 201 states and 223 transitions. [2024-12-06 01:30:59,717 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 223 transitions. [2024-12-06 01:30:59,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-12-06 01:30:59,717 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:30:59,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:30:59,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:30:59,732 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-06 01:31:01,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:31:01,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 198 states and 220 transitions. [2024-12-06 01:31:01,189 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 220 transitions. [2024-12-06 01:31:01,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-12-06 01:31:01,189 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:31:01,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:31:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 01:31:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:31:01,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-12-06 01:31:01,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 01:31:01,495 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 01:31:03,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:31:03,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 197 states and 219 transitions. [2024-12-06 01:31:03,164 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 219 transitions. [2024-12-06 01:31:03,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-12-06 01:31:03,165 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:31:03,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:31:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-12-06 01:31:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:31:03,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-12-06 01:31:03,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-06 01:31:03,350 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 01:31:03,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:31:03,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 196 states and 218 transitions. [2024-12-06 01:31:03,438 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 218 transitions. [2024-12-06 01:31:03,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-12-06 01:31:03,439 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:31:03,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:31:03,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:31:03,539 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-12-06 01:31:05,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:31:05,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 195 states and 217 transitions. [2024-12-06 01:31:05,318 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 217 transitions. [2024-12-06 01:31:05,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-12-06 01:31:05,318 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:31:05,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:31:05,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:31:05,334 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 01:31:07,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:31:07,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 194 states and 216 transitions. [2024-12-06 01:31:07,196 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 216 transitions. [2024-12-06 01:31:07,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-12-06 01:31:07,197 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:31:07,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:31:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:31:07,214 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 01:31:07,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:31:07,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 192 states and 212 transitions. [2024-12-06 01:31:07,657 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 212 transitions. [2024-12-06 01:31:07,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-12-06 01:31:07,657 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:31:07,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:31:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:31:07,675 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 01:31:08,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:31:08,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 192 states and 211 transitions. [2024-12-06 01:31:08,102 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 211 transitions. [2024-12-06 01:31:08,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-12-06 01:31:08,103 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:31:08,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:31:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:31:08,122 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 01:31:08,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:31:08,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 188 states and 207 transitions. [2024-12-06 01:31:08,480 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 207 transitions. [2024-12-06 01:31:08,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-12-06 01:31:08,480 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:31:08,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:31:08,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:31:08,497 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 01:31:10,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:31:10,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 186 states and 203 transitions. [2024-12-06 01:31:10,060 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 203 transitions. [2024-12-06 01:31:10,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-12-06 01:31:10,060 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:31:10,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:31:10,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:31:10,077 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 01:31:10,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:31:10,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 186 states and 202 transitions. [2024-12-06 01:31:10,566 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 202 transitions. [2024-12-06 01:31:10,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-12-06 01:31:10,567 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:31:10,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:31:10,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:31:10,583 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 01:31:11,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:31:11,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 181 states and 197 transitions. [2024-12-06 01:31:11,104 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 197 transitions. [2024-12-06 01:31:11,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-12-06 01:31:11,105 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:31:11,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:31:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:31:11,121 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 01:31:12,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:31:12,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 179 states and 193 transitions. [2024-12-06 01:31:12,457 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 193 transitions. [2024-12-06 01:31:12,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-12-06 01:31:12,458 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:31:12,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:31:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:31:12,474 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 01:31:12,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:31:12,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 178 states and 191 transitions. [2024-12-06 01:31:12,910 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 191 transitions. [2024-12-06 01:31:12,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-12-06 01:31:12,910 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:31:12,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:31:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:31:12,953 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 01:31:13,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:31:13,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 173 states and 186 transitions. [2024-12-06 01:31:13,417 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 186 transitions. [2024-12-06 01:31:13,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-12-06 01:31:13,418 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:31:13,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:31:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:31:13,443 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 01:31:15,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:31:15,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 170 states and 180 transitions. [2024-12-06 01:31:15,752 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 180 transitions. [2024-12-06 01:31:15,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-12-06 01:31:15,752 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:31:15,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:31:15,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:31:15,768 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 01:31:16,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:31:16,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 163 states and 173 transitions. [2024-12-06 01:31:16,336 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 173 transitions. [2024-12-06 01:31:16,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-12-06 01:31:16,337 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:31:16,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:31:16,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:31:16,355 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-12-06 01:31:18,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:31:18,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 154 states and 164 transitions. [2024-12-06 01:31:18,394 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 164 transitions. [2024-12-06 01:31:18,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-12-06 01:31:18,394 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:31:18,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:31:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:31:18,514 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-06 01:31:19,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:31:19,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 153 states and 163 transitions. [2024-12-06 01:31:19,676 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 163 transitions. [2024-12-06 01:31:19,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-12-06 01:31:19,677 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:31:19,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:31:19,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:31:19,784 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 01:31:21,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:31:21,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 152 states and 162 transitions. [2024-12-06 01:31:21,117 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 162 transitions. [2024-12-06 01:31:21,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-12-06 01:31:21,118 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:31:21,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:31:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:31:21,144 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-12-06 01:31:22,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:31:22,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 149 states and 159 transitions. [2024-12-06 01:31:22,959 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 159 transitions. [2024-12-06 01:31:22,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-12-06 01:31:22,960 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:31:22,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:31:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:31:22,977 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-12-06 01:31:24,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:31:24,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 145 states and 155 transitions. [2024-12-06 01:31:24,397 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 155 transitions. [2024-12-06 01:31:24,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-12-06 01:31:24,397 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:31:24,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:31:24,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:31:24,415 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-06 01:31:26,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:31:26,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 140 states and 150 transitions. [2024-12-06 01:31:26,173 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 150 transitions. [2024-12-06 01:31:26,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-12-06 01:31:26,173 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:31:26,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:31:26,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:31:26,303 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-12-06 01:31:31,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:31:31,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 134 states and 144 transitions. [2024-12-06 01:31:31,811 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2024-12-06 01:31:31,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-12-06 01:31:31,812 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:31:31,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:31:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:31:31,919 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-12-06 01:31:34,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:31:34,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 127 states and 137 transitions. [2024-12-06 01:31:34,379 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2024-12-06 01:31:34,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-12-06 01:31:34,380 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:31:34,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:31:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:31:34,588 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-12-06 01:31:40,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:31:40,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 137 states and 147 transitions. [2024-12-06 01:31:40,464 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 147 transitions. [2024-12-06 01:31:40,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-12-06 01:31:40,464 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:31:40,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:31:40,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:31:40,669 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-12-06 01:31:41,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:31:41,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 117 states and 127 transitions. [2024-12-06 01:31:41,903 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2024-12-06 01:31:41,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-06 01:31:41,904 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 109 iterations. [2024-12-06 01:31:41,910 INFO L726 CodeCheckObserver]: All specifications hold 60 specifications checked. All of them hold [2024-12-06 01:31:48,712 INFO L77 FloydHoareUtils]: At program point L35-2(line 35) the Hoare annotation is: true [2024-12-06 01:31:48,712 INFO L77 FloydHoareUtils]: At program point L35-3(line 35) the Hoare annotation is: true [2024-12-06 01:31:48,712 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) the Hoare annotation is: true [2024-12-06 01:31:48,712 INFO L77 FloydHoareUtils]: At program point L35-4(line 35) the Hoare annotation is: true [2024-12-06 01:31:48,712 INFO L77 FloydHoareUtils]: At program point L35-5(line 35) the Hoare annotation is: true [2024-12-06 01:31:48,712 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) the Hoare annotation is: true [2024-12-06 01:31:48,712 INFO L77 FloydHoareUtils]: At program point L27-2(lines 27 36) the Hoare annotation is: true [2024-12-06 01:31:48,713 INFO L77 FloydHoareUtils]: At program point L27-3(lines 27 36) the Hoare annotation is: true [2024-12-06 01:31:48,713 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW(line 35) the Hoare annotation is: true [2024-12-06 01:31:48,713 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) the Hoare annotation is: true [2024-12-06 01:31:48,713 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) no Hoare annotation was computed. [2024-12-06 01:31:48,713 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) the Hoare annotation is: true [2024-12-06 01:31:48,713 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) the Hoare annotation is: true [2024-12-06 01:31:48,713 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2024-12-06 01:31:48,713 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) no Hoare annotation was computed. [2024-12-06 01:31:48,713 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) the Hoare annotation is: true [2024-12-06 01:31:48,713 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) no Hoare annotation was computed. [2024-12-06 01:31:48,713 INFO L77 FloydHoareUtils]: At program point L28(line 28) the Hoare annotation is: true [2024-12-06 01:31:48,713 INFO L77 FloydHoareUtils]: At program point L28-1(line 28) the Hoare annotation is: (not (and (< 2305843009213693951 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1))) [2024-12-06 01:31:48,713 INFO L77 FloydHoareUtils]: At program point L28-2(line 28) the Hoare annotation is: (not (and (< 2305843009213693951 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1))) [2024-12-06 01:31:48,713 INFO L77 FloydHoareUtils]: At program point L28-3(line 28) the Hoare annotation is: (not (and (< 2305843009213693951 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1))) [2024-12-06 01:31:48,713 INFO L77 FloydHoareUtils]: At program point L28-4(line 28) the Hoare annotation is: (not (and (< 2305843009213693951 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1))) [2024-12-06 01:31:48,713 INFO L77 FloydHoareUtils]: At program point L28-5(line 28) the Hoare annotation is: (not (and (< 2305843009213693951 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1))) [2024-12-06 01:31:48,713 INFO L77 FloydHoareUtils]: At program point L28-6(line 28) the Hoare annotation is: (not (and (< 2305843009213693951 |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_main_~y~0#1| 1))) [2024-12-06 01:31:48,714 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) the Hoare annotation is: true [2024-12-06 01:31:48,714 INFO L77 FloydHoareUtils]: At program point L28-7(line 28) the Hoare annotation is: true [2024-12-06 01:31:48,714 INFO L77 FloydHoareUtils]: At program point L28-8(line 28) the Hoare annotation is: (not (and (< (+ 9223372036854775807 (* |ULTIMATE.start_main_~x~0#1| 4)) (+ (* (* |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|))) (< 0 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 1))) [2024-12-06 01:31:48,714 INFO L77 FloydHoareUtils]: At program point L28-9(line 28) the Hoare annotation is: (let ((.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|)) (.cse1 (* |ULTIMATE.start_main_~x~0#1| 4)) (.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (or (and (< .cse0 |ULTIMATE.start_main_~x~0#1|) (<= .cse1 (+ (* .cse0 2) 9223372036854775807 .cse2))) (not (= |ULTIMATE.start_main_~y~0#1| 1)) (and (<= .cse2 (+ 9223372036854775807 .cse1)) (<= |ULTIMATE.start_main_~x~0#1| 0)) (and (< 0 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| .cse0)))) [2024-12-06 01:31:48,714 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW(line 34) the Hoare annotation is: true [2024-12-06 01:31:48,714 INFO L77 FloydHoareUtils]: At program point L28-10(line 28) the Hoare annotation is: (let ((.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|)) (.cse1 (* |ULTIMATE.start_main_~x~0#1| 4)) (.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (or (and (< .cse0 |ULTIMATE.start_main_~x~0#1|) (<= .cse1 (+ (* .cse0 2) 9223372036854775807 .cse2))) (not (= |ULTIMATE.start_main_~y~0#1| 1)) (and (<= .cse2 (+ 9223372036854775807 .cse1)) (<= |ULTIMATE.start_main_~x~0#1| 0)) (and (< 0 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| .cse0)))) [2024-12-06 01:31:48,714 INFO L77 FloydHoareUtils]: At program point L28-11(line 28) the Hoare annotation is: (let ((.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|)) (.cse1 (* |ULTIMATE.start_main_~x~0#1| 4)) (.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (or (and (< .cse0 |ULTIMATE.start_main_~x~0#1|) (<= .cse1 (+ (* .cse0 2) 9223372036854775807 .cse2))) (not (= |ULTIMATE.start_main_~y~0#1| 1)) (and (<= .cse2 (+ 9223372036854775807 .cse1)) (<= |ULTIMATE.start_main_~x~0#1| 0)) (and (< 0 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| .cse0)))) [2024-12-06 01:31:48,714 INFO L77 FloydHoareUtils]: At program point L28-12(line 28) the Hoare annotation is: (let ((.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|)) (.cse1 (* |ULTIMATE.start_main_~x~0#1| 4)) (.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (or (and (< .cse0 |ULTIMATE.start_main_~x~0#1|) (<= .cse1 (+ (* .cse0 2) 9223372036854775807 .cse2))) (not (= |ULTIMATE.start_main_~y~0#1| 1)) (and (<= .cse2 (+ 9223372036854775807 .cse1)) (<= |ULTIMATE.start_main_~x~0#1| 0)) (and (< 0 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| .cse0)))) [2024-12-06 01:31:48,714 INFO L77 FloydHoareUtils]: At program point L28-13(line 28) the Hoare annotation is: true [2024-12-06 01:31:48,714 INFO L77 FloydHoareUtils]: At program point L28-14(line 28) the Hoare annotation is: (not (let ((.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse2 (* .cse0 2)) (.cse3 (* |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_~x~0#1| 4))) (and (< 9223372036854775807 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (<= .cse0 2305843009213693951) (<= .cse1 (+ .cse2 9223372036854775807 .cse3)) (<= (+ .cse2 .cse3) (+ 9223372036854775807 .cse1)))))) [2024-12-06 01:31:48,714 INFO L77 FloydHoareUtils]: At program point L28-15(line 28) the Hoare annotation is: (not (let ((.cse1 (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2)) (.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|)) (.cse0 (* |ULTIMATE.start_main_~x~0#1| 4))) (and (< 9223372036854775807 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (<= .cse0 (+ .cse1 9223372036854775807 .cse2)) (<= (+ .cse1 .cse2) (+ 9223372036854775807 .cse0))))) [2024-12-06 01:31:48,714 INFO L77 FloydHoareUtils]: At program point L28-16(line 28) the Hoare annotation is: true [2024-12-06 01:31:48,714 INFO L77 FloydHoareUtils]: At program point L28-17(line 28) the Hoare annotation is: true [2024-12-06 01:31:48,715 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) the Hoare annotation is: true [2024-12-06 01:31:48,715 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) the Hoare annotation is: true [2024-12-06 01:31:48,715 INFO L77 FloydHoareUtils]: At program point L28-18(line 28) the Hoare annotation is: true [2024-12-06 01:31:48,715 INFO L77 FloydHoareUtils]: At program point L28-19(line 28) the Hoare annotation is: true [2024-12-06 01:31:48,715 INFO L77 FloydHoareUtils]: At program point L28-20(line 28) the Hoare annotation is: (let ((.cse1 (< 0 (+ 2305843009213693953 |ULTIMATE.start_main_~x~0#1|))) (.cse3 (* |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|)) (.cse2 (+ 9223372036854775809 (* |ULTIMATE.start_main_~x~0#1| 4)))) (or (and (<= .cse0 9223372036854775807) .cse1 (<= .cse2 .cse0)) (and .cse1 (<= |ULTIMATE.start_main_~x~0#1| 2305843009213693951) (< 9223372036854775807 .cse0)) (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 1) (<= 0 (+ |ULTIMATE.start_main_~y~0#1| 4611686018427387904)))) (= |ULTIMATE.start_main_~y~0#1| 0) (not (and (<= |ULTIMATE.start_main_~x~0#1| .cse3) (<= .cse3 4611686018427387903))) (< (+ (* .cse3 2) .cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) .cse2) (< |ULTIMATE.start_main_~c~0#1| 1))) [2024-12-06 01:31:48,715 INFO L77 FloydHoareUtils]: At program point L28-21(line 28) the Hoare annotation is: (let ((.cse0 (+ 9223372036854775809 (* |ULTIMATE.start_main_~x~0#1| 4))) (.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|))) (or (<= .cse0 .cse1) (< (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) .cse1 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) .cse0) (< |ULTIMATE.start_main_~c~0#1| 1) (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 1))) (< 9223372036854775807 .cse1))) [2024-12-06 01:31:48,715 INFO L77 FloydHoareUtils]: At program point L28-22(lines 27 36) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~y~0#1| 0))) (let ((.cse1 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse3 (* |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|)) (.cse6 (not .cse0)) (.cse4 (<= 1 |ULTIMATE.start_main_~c~0#1|))) (or (and (<= 0 |ULTIMATE.start_main_~x~0#1|) .cse0 (<= |ULTIMATE.start_main_~x~0#1| 0)) (and (< 0 (+ 9223372036854775809 .cse1)) (< 0 (+ 2305843009213693953 |ULTIMATE.start_main_~x~0#1|)) (<= .cse1 9223372036854775807) (< 9223372036854775807 .cse2)) (and .cse0 (not (= |ULTIMATE.start_main_~c~0#1| 0))) (< 4611686018427387903 .cse3) (let ((.cse5 (+ 9223372036854775809 (* |ULTIMATE.start_main_~x~0#1| 4)))) (and .cse4 (< (+ (* .cse1 2) .cse2 .cse3) .cse5) (< .cse2 .cse5))) (and .cse6 (< |ULTIMATE.start_main_~c~0#1| 1)) (and .cse6 (not (and (<= 0 |ULTIMATE.start_main_~k~0#1|) (<= |ULTIMATE.start_main_~k~0#1| 1)))) (and .cse4 (< 2305843009213693951 |ULTIMATE.start_main_~x~0#1|))))) [2024-12-06 01:31:48,715 INFO L77 FloydHoareUtils]: At program point L37(line 37) the Hoare annotation is: true [2024-12-06 01:31:48,715 INFO L77 FloydHoareUtils]: At program point L37-1(line 37) the Hoare annotation is: true [2024-12-06 01:31:48,715 INFO L77 FloydHoareUtils]: At program point L37-2(line 37) the Hoare annotation is: true [2024-12-06 01:31:48,715 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) no Hoare annotation was computed. [2024-12-06 01:31:48,715 INFO L77 FloydHoareUtils]: At program point L37-3(line 37) the Hoare annotation is: true [2024-12-06 01:31:48,715 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) the Hoare annotation is: true [2024-12-06 01:31:48,716 INFO L77 FloydHoareUtils]: At program point L37-4(line 37) the Hoare annotation is: true [2024-12-06 01:31:48,716 INFO L77 FloydHoareUtils]: At program point L37-5(line 37) the Hoare annotation is: true [2024-12-06 01:31:48,716 INFO L77 FloydHoareUtils]: At program point L37-6(line 37) the Hoare annotation is: true [2024-12-06 01:31:48,716 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) the Hoare annotation is: true [2024-12-06 01:31:48,716 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) the Hoare annotation is: true [2024-12-06 01:31:48,716 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW(line 34) the Hoare annotation is: true [2024-12-06 01:31:48,716 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) the Hoare annotation is: true [2024-12-06 01:31:48,716 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) the Hoare annotation is: true [2024-12-06 01:31:48,716 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-12-06 01:31:48,716 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) no Hoare annotation was computed. [2024-12-06 01:31:48,716 INFO L77 FloydHoareUtils]: At program point L38(line 38) the Hoare annotation is: true [2024-12-06 01:31:48,716 INFO L77 FloydHoareUtils]: At program point L38-1(line 38) 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|))) (or (let ((.cse0 (* |ULTIMATE.start_main_~x~0#1| 4))) (and (<= .cse0 (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) 9223372036854775807 .cse1)) (<= .cse0 (+ 9223372036854775807 .cse1)))) (< 9223372036854775807 .cse1))) [2024-12-06 01:31:48,716 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) no Hoare annotation was computed. [2024-12-06 01:31:48,716 INFO L77 FloydHoareUtils]: At program point L38-2(line 38) 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|))) (or (let ((.cse0 (* |ULTIMATE.start_main_~x~0#1| 4))) (and (<= .cse0 (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) 9223372036854775807 .cse1)) (<= .cse0 (+ 9223372036854775807 .cse1)))) (< 9223372036854775807 .cse1))) [2024-12-06 01:31:48,716 INFO L77 FloydHoareUtils]: At program point L38-3(line 38) 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|))) (or (let ((.cse0 (* |ULTIMATE.start_main_~x~0#1| 4))) (and (<= .cse0 (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) 9223372036854775807 .cse1)) (<= .cse0 (+ 9223372036854775807 .cse1)))) (< 9223372036854775807 .cse1))) [2024-12-06 01:31:48,716 INFO L77 FloydHoareUtils]: At program point L38-4(line 38) 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|))) (or (let ((.cse0 (* |ULTIMATE.start_main_~x~0#1| 4))) (and (<= .cse0 (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) 9223372036854775807 .cse1)) (<= .cse0 (+ 9223372036854775807 .cse1)))) (< 9223372036854775807 .cse1))) [2024-12-06 01:31:48,717 INFO L77 FloydHoareUtils]: At program point L38-5(line 38) 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|))) (or (let ((.cse0 (* |ULTIMATE.start_main_~x~0#1| 4))) (and (<= .cse0 (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) 9223372036854775807 .cse1)) (<= .cse0 (+ 9223372036854775807 .cse1)))) (< 9223372036854775807 .cse1))) [2024-12-06 01:31:48,717 INFO L77 FloydHoareUtils]: At program point L38-6(line 38) 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|))) (or (let ((.cse0 (* |ULTIMATE.start_main_~x~0#1| 4))) (and (<= .cse0 (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) 9223372036854775807 .cse1)) (<= .cse0 (+ 9223372036854775807 .cse1)))) (< 9223372036854775807 .cse1))) [2024-12-06 01:31:48,717 INFO L77 FloydHoareUtils]: At program point L38-7(line 38) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~x~0#1| 4)) (.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|))) (or (<= (+ 9223372036854775809 .cse0) .cse1) (let ((.cse2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (<= .cse0 (+ (* .cse2 2) 9223372036854775807 .cse1)) (<= .cse2 4611686018427387903) (< 0 (+ .cse2 4611686018427387905)) (<= .cse0 (+ 9223372036854775807 .cse1)))))) [2024-12-06 01:31:48,717 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) the Hoare annotation is: true [2024-12-06 01:31:48,717 INFO L77 FloydHoareUtils]: At program point L38-8(line 38) the Hoare annotation is: (let ((.cse8 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse4 (* |ULTIMATE.start_main_~x~0#1| 4)) (.cse5 (* .cse8 2)) (.cse6 (* |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 ((.cse1 (+ .cse5 .cse6)) (.cse2 (<= .cse8 4611686018427387903)) (.cse0 (+ 9223372036854775809 .cse4)) (.cse7 (+ .cse5 .cse6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (.cse3 (< 0 (+ .cse8 4611686018427387905)))) (or (and (not (= |ULTIMATE.start_main_~y~0#1| 0)) (<= .cse0 .cse1) .cse2 .cse3) (and (<= .cse4 (+ .cse5 9223372036854775807 .cse6)) (< .cse7 .cse0) .cse2 .cse3 (<= .cse4 (+ 9223372036854775807 .cse6))) (and (< .cse1 .cse0) .cse2 (<= .cse0 .cse7) .cse3))))) [2024-12-06 01:31:48,717 INFO L77 FloydHoareUtils]: At program point L38-9(line 38) the Hoare annotation is: (let ((.cse8 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse4 (* |ULTIMATE.start_main_~x~0#1| 4)) (.cse5 (* .cse8 2)) (.cse6 (* |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 ((.cse1 (+ .cse5 .cse6)) (.cse2 (<= .cse8 4611686018427387903)) (.cse0 (+ 9223372036854775809 .cse4)) (.cse7 (+ .cse5 .cse6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (.cse3 (< 0 (+ .cse8 4611686018427387905)))) (or (and (not (= |ULTIMATE.start_main_~y~0#1| 0)) (<= .cse0 .cse1) .cse2 .cse3) (and (<= .cse4 (+ .cse5 9223372036854775807 .cse6)) (< .cse7 .cse0) .cse2 .cse3) (and (< .cse1 .cse0) .cse2 (<= .cse0 .cse7) .cse3))))) [2024-12-06 01:31:48,717 INFO L77 FloydHoareUtils]: At program point L38-10(line 38) the Hoare annotation is: (let ((.cse8 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse4 (* |ULTIMATE.start_main_~x~0#1| 4)) (.cse5 (* .cse8 2)) (.cse6 (* |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 ((.cse1 (+ .cse5 .cse6)) (.cse2 (<= .cse8 4611686018427387903)) (.cse0 (+ 9223372036854775809 .cse4)) (.cse7 (+ .cse5 .cse6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (.cse3 (< 0 (+ .cse8 4611686018427387905)))) (or (and (not (= |ULTIMATE.start_main_~y~0#1| 0)) (<= .cse0 .cse1) .cse2 .cse3) (and (<= .cse4 (+ .cse5 9223372036854775807 .cse6)) (< .cse7 .cse0) .cse2 .cse3) (and (< .cse1 .cse0) .cse2 (<= .cse0 .cse7) .cse3))))) [2024-12-06 01:31:48,717 INFO L77 FloydHoareUtils]: At program point L38-11(line 38) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (<= (* |ULTIMATE.start_main_~x~0#1| 4) (+ (* .cse0 2) 9223372036854775807 (* |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 4611686018427387903) (< 0 (+ .cse0 4611686018427387905)))) [2024-12-06 01:31:48,717 INFO L77 FloydHoareUtils]: At program point L38-12(line 38) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (<= (* |ULTIMATE.start_main_~x~0#1| 4) (+ (* .cse0 2) 9223372036854775807 (* |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 4611686018427387903) (< 0 (+ .cse0 4611686018427387905)))) [2024-12-06 01:31:48,717 INFO L77 FloydHoareUtils]: At program point L38-13(line 38) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (<= (* |ULTIMATE.start_main_~x~0#1| 4) (+ (* .cse0 2) 9223372036854775807 (* |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 4611686018427387903) (< 0 (+ .cse0 4611686018427387905)))) [2024-12-06 01:31:48,718 INFO L77 FloydHoareUtils]: At program point L38-14(line 38) the Hoare annotation is: (let ((.cse4 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (let ((.cse0 (* |ULTIMATE.start_main_~x~0#1| 4)) (.cse1 (* .cse4 2)) (.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|)) (.cse3 (<= .cse4 4611686018427387903))) (or (and (<= .cse0 (+ .cse1 9223372036854775807 .cse2)) .cse3 (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 9223372036854775807)) (and (<= (+ 9223372036854775809 .cse0) (+ .cse1 .cse2)) .cse3)))) [2024-12-06 01:31:48,718 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) the Hoare annotation is: true [2024-12-06 01:31:48,718 INFO L77 FloydHoareUtils]: At program point L38-15(line 38) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~x~0#1| 4)) (.cse1 (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2)) (.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|))) (or (and (<= .cse0 (+ .cse1 9223372036854775807 .cse2)) (<= (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 9223372036854775807)) (<= (+ 9223372036854775809 .cse0) (+ .cse1 .cse2)))) [2024-12-06 01:31:48,718 INFO L77 FloydHoareUtils]: At program point L38-16(line 38) the Hoare annotation is: (and (<= (* |ULTIMATE.start_main_~x~0#1| 4) (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) 9223372036854775807 (* |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|) 9223372036854775807)) [2024-12-06 01:31:48,718 INFO L77 FloydHoareUtils]: At program point L38-17(line 38) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (<= (* |ULTIMATE.start_main_~x~0#1| 4) (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) 9223372036854775807 (* |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)) (<= .cse0 9223372036854775807))) [2024-12-06 01:31:48,718 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW(line 35) the Hoare annotation is: true [2024-12-06 01:31:48,718 INFO L77 FloydHoareUtils]: At program point L38-18(line 38) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (<= (* |ULTIMATE.start_main_~x~0#1| 4) (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) 9223372036854775807 (* |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)) (<= .cse0 9223372036854775807))) [2024-12-06 01:31:48,718 INFO L77 FloydHoareUtils]: At program point L38-19(line 38) the Hoare annotation is: (<= (* |ULTIMATE.start_main_~x~0#1| 4) (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) 9223372036854775807 (* |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|))) [2024-12-06 01:31:48,718 INFO L77 FloydHoareUtils]: At program point L38-20(line 38) the Hoare annotation is: (<= (* |ULTIMATE.start_main_~x~0#1| 4) (+ (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 2) 9223372036854775807 (* |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|))) [2024-12-06 01:31:48,718 INFO L77 FloydHoareUtils]: At program point L38-21(line 38) the Hoare annotation is: true [2024-12-06 01:31:48,718 INFO L77 FloydHoareUtils]: At program point L38-22(line 38) the Hoare annotation is: true [2024-12-06 01:31:48,718 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) the Hoare annotation is: true [2024-12-06 01:31:48,718 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) the Hoare annotation is: true [2024-12-06 01:31:48,718 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) the Hoare annotation is: true [2024-12-06 01:31:48,719 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) the Hoare annotation is: true [2024-12-06 01:31:48,719 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2024-12-06 01:31:48,719 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW(line 35) no Hoare annotation was computed. [2024-12-06 01:31:48,719 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) the Hoare annotation is: true [2024-12-06 01:31:48,719 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) the Hoare annotation is: true [2024-12-06 01:31:48,719 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) no Hoare annotation was computed. [2024-12-06 01:31:48,719 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) the Hoare annotation is: true [2024-12-06 01:31:48,719 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW(line 35) the Hoare annotation is: true [2024-12-06 01:31:48,719 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) the Hoare annotation is: true [2024-12-06 01:31:48,719 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) no Hoare annotation was computed. [2024-12-06 01:31:48,719 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) the Hoare annotation is: true [2024-12-06 01:31:48,719 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) the Hoare annotation is: true [2024-12-06 01:31:48,719 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) no Hoare annotation was computed. [2024-12-06 01:31:48,719 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) no Hoare annotation was computed. [2024-12-06 01:31:48,719 INFO L77 FloydHoareUtils]: At program point L33(line 33) the Hoare annotation is: (not (and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0) (not (and (<= 0 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 0))))) [2024-12-06 01:31:48,719 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-12-06 01:31:48,719 INFO L77 FloydHoareUtils]: At program point L33-1(line 33) the Hoare annotation is: (not (and (= |ULTIMATE.start_main_~c~0#1| 0) (= |ULTIMATE.start_main_~y~0#1| 0) (not (and (<= 0 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 0))))) [2024-12-06 01:31:48,720 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) no Hoare annotation was computed. [2024-12-06 01:31:48,720 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) the Hoare annotation is: true [2024-12-06 01:31:48,720 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW(line 35) the Hoare annotation is: true [2024-12-06 01:31:48,720 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) the Hoare annotation is: true [2024-12-06 01:31:48,720 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2024-12-06 01:31:48,720 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) the Hoare annotation is: true [2024-12-06 01:31:48,720 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) no Hoare annotation was computed. [2024-12-06 01:31:48,720 INFO L77 FloydHoareUtils]: At program point L34(line 34) the Hoare annotation is: true [2024-12-06 01:31:48,720 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) the Hoare annotation is: true [2024-12-06 01:31:48,720 INFO L77 FloydHoareUtils]: At program point L34-1(line 34) the Hoare annotation is: true [2024-12-06 01:31:48,720 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2024-12-06 01:31:48,720 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) the Hoare annotation is: true [2024-12-06 01:31:48,720 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW(line 35) the Hoare annotation is: true [2024-12-06 01:31:48,720 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) no Hoare annotation was computed. [2024-12-06 01:31:48,720 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) the Hoare annotation is: true [2024-12-06 01:31:48,720 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) the Hoare annotation is: true [2024-12-06 01:31:48,720 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) the Hoare annotation is: true [2024-12-06 01:31:48,720 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) no Hoare annotation was computed. [2024-12-06 01:31:48,720 INFO L77 FloydHoareUtils]: At program point L35(line 35) the Hoare annotation is: true [2024-12-06 01:31:48,721 INFO L77 FloydHoareUtils]: At program point L35-1(line 35) the Hoare annotation is: true [2024-12-06 01:31:48,721 INFO L77 FloydHoareUtils]: At program point __VERIFIER_assertEXIT(lines 9 15) the Hoare annotation is: (not (= |__VERIFIER_assert_#in~cond#1| 0)) [2024-12-06 01:31:48,721 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(lines 9 15) the Hoare annotation is: true [2024-12-06 01:31:48,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 01:31:48 ImpRootNode [2024-12-06 01:31:48,733 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 01:31:48,733 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 01:31:48,733 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 01:31:48,733 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 01:31:48,734 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:30:16" (3/4) ... [2024-12-06 01:31:48,735 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-06 01:31:48,737 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-12-06 01:31:48,740 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-12-06 01:31:48,740 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-12-06 01:31:48,740 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-12-06 01:31:48,741 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-12-06 01:31:48,799 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d5d392b-3550-43c4-b3e5-065b56e5a7e4/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 01:31:48,799 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d5d392b-3550-43c4-b3e5-065b56e5a7e4/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 01:31:48,800 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 01:31:48,800 INFO L158 Benchmark]: Toolchain (without parser) took 92966.32ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 117.3MB in the beginning and 253.3MB in the end (delta: -136.0MB). Peak memory consumption was 261.9MB. Max. memory is 16.1GB. [2024-12-06 01:31:48,800 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 142.6MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 01:31:48,801 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.71ms. Allocated memory is still 142.6MB. Free memory was 117.3MB in the beginning and 106.2MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 01:31:48,801 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.18ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 104.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 01:31:48,801 INFO L158 Benchmark]: Boogie Preprocessor took 14.71ms. Allocated memory is still 142.6MB. Free memory was 104.6MB in the beginning and 103.8MB in the end (delta: 856.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 01:31:48,801 INFO L158 Benchmark]: RCFGBuilder took 444.56ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 80.0MB in the end (delta: 23.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-06 01:31:48,802 INFO L158 Benchmark]: CodeCheck took 92231.21ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 80.0MB in the beginning and 257.4MB in the end (delta: -177.4MB). Peak memory consumption was 228.4MB. Max. memory is 16.1GB. [2024-12-06 01:31:48,802 INFO L158 Benchmark]: Witness Printer took 66.36ms. Allocated memory is still 545.3MB. Free memory was 257.4MB in the beginning and 253.3MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 01:31:48,804 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 2 procedures, 129 locations, 60 error locations. Started 1 CEGAR loops. OverallTime: 85.4s, OverallIterations: 109, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 58659 SdHoareTripleChecker+Valid, 141.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 51545 mSDsluCounter, 4093 SdHoareTripleChecker+Invalid, 121.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 172 mSDsCounter, 12819 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 131758 IncrementalHoareTripleChecker+Invalid, 144577 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12819 mSolverCounterUnsat, 3921 mSDtfsCounter, 131758 mSolverCounterSat, 2.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37299 GetRequests, 34410 SyntacticMatches, 2093 SemanticMatches, 796 ConstructedPredicates, 0 IntricatePredicates, 10 DeprecatedPredicates, 432544 ImplicationChecksByTransitivity, 74.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 5034 NumberOfCodeBlocks, 5034 NumberOfCodeBlocksAsserted, 108 NumberOfCheckSat, 4926 ConstructedInterpolants, 2 QuantifiedInterpolants, 22010 SizeOfPredicates, 3 NumberOfNonLiveVariables, 2189 ConjunctsInSsa, 132 ConjunctsInUnsatCore, 108 InterpolantComputations, 94 PerfectInterpolantSequences, 920/1123 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: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: 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: 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: 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: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 60 specifications checked. All of them hold - ProcedureContractResult [Line: 9]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Ensures: (cond != 0) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 142.6MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 181.71ms. Allocated memory is still 142.6MB. Free memory was 117.3MB in the beginning and 106.2MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.18ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 104.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 14.71ms. Allocated memory is still 142.6MB. Free memory was 104.6MB in the beginning and 103.8MB in the end (delta: 856.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 444.56ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 80.0MB in the end (delta: 23.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * CodeCheck took 92231.21ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 80.0MB in the beginning and 257.4MB in the end (delta: -177.4MB). Peak memory consumption was 228.4MB. Max. memory is 16.1GB. * Witness Printer took 66.36ms. Allocated memory is still 545.3MB. Free memory was 257.4MB in the beginning and 253.3MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-12-06 01:31:48,851 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d5d392b-3550-43c4-b3e5-065b56e5a7e4/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