./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label36.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853ba356-f2aa-4f19-8502-e13887dffd36/bin/ukojak-verify-ENZ3QT5qd3/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853ba356-f2aa-4f19-8502-e13887dffd36/bin/ukojak-verify-ENZ3QT5qd3/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853ba356-f2aa-4f19-8502-e13887dffd36/bin/ukojak-verify-ENZ3QT5qd3/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853ba356-f2aa-4f19-8502-e13887dffd36/bin/ukojak-verify-ENZ3QT5qd3/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label36.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853ba356-f2aa-4f19-8502-e13887dffd36/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853ba356-f2aa-4f19-8502-e13887dffd36/bin/ukojak-verify-ENZ3QT5qd3 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 16921798414ec528dd37161230657dad4883a0777e5a6c6f07453756efda755c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-25 03:31:14,034 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-25 03:31:14,098 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853ba356-f2aa-4f19-8502-e13887dffd36/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-25 03:31:14,103 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-25 03:31:14,103 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-25 03:31:14,135 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-25 03:31:14,135 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-25 03:31:14,136 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-25 03:31:14,136 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-25 03:31:14,136 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-25 03:31:14,136 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-25 03:31:14,136 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-25 03:31:14,137 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-25 03:31:14,137 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-25 03:31:14,137 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-25 03:31:14,137 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-25 03:31:14,137 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-25 03:31:14,137 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-25 03:31:14,137 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-25 03:31:14,137 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-25 03:31:14,137 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-25 03:31:14,138 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-25 03:31:14,140 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-25 03:31:14,140 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-25 03:31:14,140 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-25 03:31:14,140 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-25 03:31:14,140 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-25 03:31:14,140 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 03:31:14,140 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-25 03:31:14,141 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-25 03:31:14,141 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-25 03:31:14,141 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-25 03:31:14,141 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-25 03:31:14,141 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_853ba356-f2aa-4f19-8502-e13887dffd36/bin/ukojak-verify-ENZ3QT5qd3 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 16921798414ec528dd37161230657dad4883a0777e5a6c6f07453756efda755c [2024-11-25 03:31:14,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-25 03:31:14,421 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-25 03:31:14,423 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-25 03:31:14,425 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-25 03:31:14,425 INFO L274 PluginConnector]: CDTParser initialized [2024-11-25 03:31:14,427 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853ba356-f2aa-4f19-8502-e13887dffd36/bin/ukojak-verify-ENZ3QT5qd3/../../sv-benchmarks/c/eca-rers2012/Problem02_label36.c [2024-11-25 03:31:17,415 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853ba356-f2aa-4f19-8502-e13887dffd36/bin/ukojak-verify-ENZ3QT5qd3/data/27517ecf7/b1bfe1501fd04263a74d761b4da9674e/FLAG201ce3fa3 [2024-11-25 03:31:17,794 INFO L384 CDTParser]: Found 1 translation units. [2024-11-25 03:31:17,794 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853ba356-f2aa-4f19-8502-e13887dffd36/sv-benchmarks/c/eca-rers2012/Problem02_label36.c [2024-11-25 03:31:17,815 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853ba356-f2aa-4f19-8502-e13887dffd36/bin/ukojak-verify-ENZ3QT5qd3/data/27517ecf7/b1bfe1501fd04263a74d761b4da9674e/FLAG201ce3fa3 [2024-11-25 03:31:17,986 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853ba356-f2aa-4f19-8502-e13887dffd36/bin/ukojak-verify-ENZ3QT5qd3/data/27517ecf7/b1bfe1501fd04263a74d761b4da9674e [2024-11-25 03:31:17,988 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-25 03:31:17,991 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-25 03:31:17,992 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-25 03:31:17,993 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-25 03:31:18,003 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-25 03:31:18,004 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:31:17" (1/1) ... [2024-11-25 03:31:18,005 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@565b5eb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:31:18, skipping insertion in model container [2024-11-25 03:31:18,005 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:31:17" (1/1) ... [2024-11-25 03:31:18,059 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-25 03:31:18,404 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853ba356-f2aa-4f19-8502-e13887dffd36/sv-benchmarks/c/eca-rers2012/Problem02_label36.c[20425,20438] [2024-11-25 03:31:18,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 03:31:18,432 INFO L200 MainTranslator]: Completed pre-run [2024-11-25 03:31:18,539 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853ba356-f2aa-4f19-8502-e13887dffd36/sv-benchmarks/c/eca-rers2012/Problem02_label36.c[20425,20438] [2024-11-25 03:31:18,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 03:31:18,571 INFO L204 MainTranslator]: Completed translation [2024-11-25 03:31:18,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:31:18 WrapperNode [2024-11-25 03:31:18,571 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-25 03:31:18,572 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-25 03:31:18,572 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-25 03:31:18,573 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-25 03:31:18,584 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:31:18" (1/1) ... [2024-11-25 03:31:18,601 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:31:18" (1/1) ... [2024-11-25 03:31:18,644 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2024-11-25 03:31:18,645 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-25 03:31:18,645 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-25 03:31:18,645 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-25 03:31:18,645 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-25 03:31:18,653 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:31:18" (1/1) ... [2024-11-25 03:31:18,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:31:18" (1/1) ... [2024-11-25 03:31:18,657 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:31:18" (1/1) ... [2024-11-25 03:31:18,657 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:31:18" (1/1) ... [2024-11-25 03:31:18,673 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:31:18" (1/1) ... [2024-11-25 03:31:18,676 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:31:18" (1/1) ... [2024-11-25 03:31:18,683 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:31:18" (1/1) ... [2024-11-25 03:31:18,688 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:31:18" (1/1) ... [2024-11-25 03:31:18,690 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:31:18" (1/1) ... [2024-11-25 03:31:18,696 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-25 03:31:18,697 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-25 03:31:18,697 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-25 03:31:18,697 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-25 03:31:18,698 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:31:18" (1/1) ... [2024-11-25 03:31:18,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 03:31:18,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853ba356-f2aa-4f19-8502-e13887dffd36/bin/ukojak-verify-ENZ3QT5qd3/z3 [2024-11-25 03:31:18,742 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853ba356-f2aa-4f19-8502-e13887dffd36/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-25 03:31:18,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853ba356-f2aa-4f19-8502-e13887dffd36/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-25 03:31:18,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-25 03:31:18,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-25 03:31:18,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-25 03:31:18,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-25 03:31:18,852 INFO L234 CfgBuilder]: Building ICFG [2024-11-25 03:31:18,854 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-25 03:31:20,330 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-25 03:31:20,330 INFO L283 CfgBuilder]: Performing block encoding [2024-11-25 03:31:20,711 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-25 03:31:20,712 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-25 03:31:20,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:31:20 BoogieIcfgContainer [2024-11-25 03:31:20,712 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-25 03:31:20,715 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-25 03:31:20,715 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-25 03:31:20,736 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-25 03:31:20,737 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:31:20" (1/1) ... [2024-11-25 03:31:20,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-25 03:31:20,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:20,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 85 states and 162 transitions. [2024-11-25 03:31:20,810 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 162 transitions. [2024-11-25 03:31:20,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-25 03:31:20,815 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:20,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:21,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:31:22,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:22,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 163 states and 240 transitions. [2024-11-25 03:31:22,170 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 240 transitions. [2024-11-25 03:31:22,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-25 03:31:22,172 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:22,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:22,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:31:22,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:22,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 166 states and 245 transitions. [2024-11-25 03:31:22,833 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 245 transitions. [2024-11-25 03:31:22,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-25 03:31:22,839 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:22,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:23,025 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-25 03:31:23,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:23,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 167 states and 248 transitions. [2024-11-25 03:31:23,259 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 248 transitions. [2024-11-25 03:31:23,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-25 03:31:23,260 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:23,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:23,464 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:31:23,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:23,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 184 states and 274 transitions. [2024-11-25 03:31:23,831 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 274 transitions. [2024-11-25 03:31:23,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-25 03:31:23,835 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:23,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:24,052 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:31:24,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:24,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 202 states and 296 transitions. [2024-11-25 03:31:24,531 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 296 transitions. [2024-11-25 03:31:24,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-25 03:31:24,535 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:24,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:24,716 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:31:25,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:25,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 220 states and 323 transitions. [2024-11-25 03:31:25,601 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 323 transitions. [2024-11-25 03:31:25,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-25 03:31:25,602 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:25,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:25,708 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:31:25,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:25,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 223 states and 327 transitions. [2024-11-25 03:31:25,874 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 327 transitions. [2024-11-25 03:31:25,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-25 03:31:25,875 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:25,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:25,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:26,102 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-25 03:31:26,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:26,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 227 states and 334 transitions. [2024-11-25 03:31:26,562 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 334 transitions. [2024-11-25 03:31:26,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-25 03:31:26,563 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:26,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:26,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:26,736 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-25 03:31:27,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:27,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 244 states and 351 transitions. [2024-11-25 03:31:27,238 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 351 transitions. [2024-11-25 03:31:27,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-25 03:31:27,239 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:27,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:27,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:27,431 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:31:28,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:28,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 264 states and 375 transitions. [2024-11-25 03:31:28,092 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 375 transitions. [2024-11-25 03:31:28,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-25 03:31:28,093 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:28,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:28,406 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-25 03:31:28,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:28,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 268 states and 382 transitions. [2024-11-25 03:31:28,963 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 382 transitions. [2024-11-25 03:31:28,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-25 03:31:28,967 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:28,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:29,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:29,619 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:31:31,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:31,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 372 states and 496 transitions. [2024-11-25 03:31:31,578 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 496 transitions. [2024-11-25 03:31:31,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-25 03:31:31,581 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:31,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:31,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:31,861 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:31:32,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:32,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 388 states and 518 transitions. [2024-11-25 03:31:32,608 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 518 transitions. [2024-11-25 03:31:32,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-25 03:31:32,610 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:32,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:32,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:32,816 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:31:33,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:33,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 391 states and 521 transitions. [2024-11-25 03:31:33,066 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 521 transitions. [2024-11-25 03:31:33,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-25 03:31:33,068 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:33,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:33,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:33,234 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:31:34,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:34,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 415 states and 550 transitions. [2024-11-25 03:31:34,452 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 550 transitions. [2024-11-25 03:31:34,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-25 03:31:34,453 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:34,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:34,603 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:31:35,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:35,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 429 states and 563 transitions. [2024-11-25 03:31:35,017 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 563 transitions. [2024-11-25 03:31:35,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-25 03:31:35,019 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:35,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:35,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:35,230 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:31:36,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:36,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 454 states and 598 transitions. [2024-11-25 03:31:36,328 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 598 transitions. [2024-11-25 03:31:36,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-25 03:31:36,332 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:36,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:36,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:36,479 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:31:36,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:36,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 468 states and 618 transitions. [2024-11-25 03:31:36,970 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 618 transitions. [2024-11-25 03:31:36,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-25 03:31:36,972 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:36,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:37,050 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:31:37,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:37,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 474 states and 626 transitions. [2024-11-25 03:31:37,601 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 626 transitions. [2024-11-25 03:31:37,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-25 03:31:37,603 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:37,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:37,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:37,688 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:31:37,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:37,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 475 states and 626 transitions. [2024-11-25 03:31:37,849 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 626 transitions. [2024-11-25 03:31:37,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-25 03:31:37,851 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:37,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:37,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:38,066 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 33 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:31:40,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:40,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 504 states and 668 transitions. [2024-11-25 03:31:40,027 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 668 transitions. [2024-11-25 03:31:40,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-25 03:31:40,029 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:40,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:40,166 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 33 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:31:40,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:40,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 518 states and 682 transitions. [2024-11-25 03:31:40,598 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 682 transitions. [2024-11-25 03:31:40,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-25 03:31:40,602 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:40,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:40,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:40,707 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 33 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:31:41,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:41,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 524 states and 689 transitions. [2024-11-25 03:31:41,279 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 689 transitions. [2024-11-25 03:31:41,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-25 03:31:41,282 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:41,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:41,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:41,354 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:31:42,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:42,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 538 states and 706 transitions. [2024-11-25 03:31:42,473 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 706 transitions. [2024-11-25 03:31:42,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-25 03:31:42,475 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:42,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:42,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:42,549 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:31:42,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:42,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 544 states and 712 transitions. [2024-11-25 03:31:42,747 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 712 transitions. [2024-11-25 03:31:42,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-25 03:31:42,749 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:42,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:42,824 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:31:43,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:43,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 549 states and 717 transitions. [2024-11-25 03:31:43,192 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 717 transitions. [2024-11-25 03:31:43,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-25 03:31:43,194 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:43,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:43,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:43,271 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:31:43,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:43,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 555 states and 723 transitions. [2024-11-25 03:31:43,806 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 723 transitions. [2024-11-25 03:31:43,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-25 03:31:43,808 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:43,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:43,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:43,904 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:31:44,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:44,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 563 states and 732 transitions. [2024-11-25 03:31:44,417 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 732 transitions. [2024-11-25 03:31:44,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-25 03:31:44,419 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:44,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:44,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:44,513 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:31:44,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:44,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 568 states and 736 transitions. [2024-11-25 03:31:44,871 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 736 transitions. [2024-11-25 03:31:44,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-25 03:31:44,872 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:44,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:44,967 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-25 03:31:45,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:45,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 597 states and 774 transitions. [2024-11-25 03:31:45,963 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 774 transitions. [2024-11-25 03:31:45,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-25 03:31:45,965 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:45,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:46,077 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-25 03:31:46,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:46,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 614 states and 791 transitions. [2024-11-25 03:31:46,590 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 791 transitions. [2024-11-25 03:31:46,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-25 03:31:46,591 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:46,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:46,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:46,729 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:31:46,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:46,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 636 states and 816 transitions. [2024-11-25 03:31:46,971 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 816 transitions. [2024-11-25 03:31:46,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-25 03:31:46,973 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:46,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:47,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:47,100 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-25 03:31:47,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:47,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 649 states and 833 transitions. [2024-11-25 03:31:47,542 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 833 transitions. [2024-11-25 03:31:47,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-25 03:31:47,543 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:47,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:47,666 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-25 03:31:48,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:48,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 659 states and 843 transitions. [2024-11-25 03:31:48,007 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 843 transitions. [2024-11-25 03:31:48,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-25 03:31:48,008 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:48,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:48,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:48,096 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-25 03:31:48,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:48,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 664 states and 847 transitions. [2024-11-25 03:31:48,285 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 847 transitions. [2024-11-25 03:31:48,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-25 03:31:48,287 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:48,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:48,356 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:31:48,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:48,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 670 states and 853 transitions. [2024-11-25 03:31:48,914 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 853 transitions. [2024-11-25 03:31:48,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-25 03:31:48,915 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:48,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:48,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:48,997 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-25 03:31:49,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:49,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 701 states and 886 transitions. [2024-11-25 03:31:49,584 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 886 transitions. [2024-11-25 03:31:49,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-25 03:31:49,585 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:49,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:49,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:49,698 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-25 03:31:50,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:50,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 706 states and 890 transitions. [2024-11-25 03:31:50,003 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 890 transitions. [2024-11-25 03:31:50,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-25 03:31:50,004 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:50,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:50,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:50,078 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:31:50,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:50,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 715 states and 899 transitions. [2024-11-25 03:31:50,192 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 899 transitions. [2024-11-25 03:31:50,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-25 03:31:50,193 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:50,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:50,370 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:31:52,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:52,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 747 states and 938 transitions. [2024-11-25 03:31:52,102 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 938 transitions. [2024-11-25 03:31:52,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-25 03:31:52,103 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:52,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:52,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:52,179 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:31:53,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:53,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 758 states and 950 transitions. [2024-11-25 03:31:53,155 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 950 transitions. [2024-11-25 03:31:53,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-25 03:31:53,156 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:53,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:53,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:53,216 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-25 03:31:53,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:53,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 765 states and 959 transitions. [2024-11-25 03:31:53,435 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 959 transitions. [2024-11-25 03:31:53,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-25 03:31:53,436 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:53,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:53,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:53,510 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 03:31:53,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:53,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 769 states and 965 transitions. [2024-11-25 03:31:53,598 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 965 transitions. [2024-11-25 03:31:53,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-25 03:31:53,599 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:53,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:53,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:53,676 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 03:31:53,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:53,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 770 states and 966 transitions. [2024-11-25 03:31:53,766 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 966 transitions. [2024-11-25 03:31:53,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-25 03:31:53,767 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:53,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:53,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:53,852 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:31:54,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:54,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 801 states and 998 transitions. [2024-11-25 03:31:54,066 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 998 transitions. [2024-11-25 03:31:54,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-25 03:31:54,067 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:54,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:54,178 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-25 03:31:54,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:54,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 808 states and 1008 transitions. [2024-11-25 03:31:54,493 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1008 transitions. [2024-11-25 03:31:54,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-25 03:31:54,494 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:54,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:54,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:54,624 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-25 03:31:54,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:54,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 813 states and 1012 transitions. [2024-11-25 03:31:54,916 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1012 transitions. [2024-11-25 03:31:54,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-25 03:31:54,917 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:54,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:54,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:55,023 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-25 03:31:55,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:55,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 820 states and 1020 transitions. [2024-11-25 03:31:55,315 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1020 transitions. [2024-11-25 03:31:55,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-25 03:31:55,316 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:55,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:55,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:55,771 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:31:57,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:57,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 887 states and 1097 transitions. [2024-11-25 03:31:57,878 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1097 transitions. [2024-11-25 03:31:57,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-25 03:31:57,879 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:57,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:58,046 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 03:31:59,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:31:59,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 912 states and 1128 transitions. [2024-11-25 03:31:59,665 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1128 transitions. [2024-11-25 03:31:59,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-25 03:31:59,667 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:31:59,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:31:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:31:59,727 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 03:32:00,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:00,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 935 states and 1153 transitions. [2024-11-25 03:32:00,887 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1153 transitions. [2024-11-25 03:32:00,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-25 03:32:00,889 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:00,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:00,954 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 03:32:01,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:01,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 940 states and 1157 transitions. [2024-11-25 03:32:01,319 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1157 transitions. [2024-11-25 03:32:01,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-25 03:32:01,320 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:01,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:01,398 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 03:32:01,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:01,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 945 states and 1161 transitions. [2024-11-25 03:32:01,764 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1161 transitions. [2024-11-25 03:32:01,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-25 03:32:01,765 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:01,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:01,861 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 03:32:01,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:01,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 946 states and 1162 transitions. [2024-11-25 03:32:01,915 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1162 transitions. [2024-11-25 03:32:01,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-25 03:32:01,916 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:01,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:01,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:02,429 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 71 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:32:06,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:06,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1013 states and 1239 transitions. [2024-11-25 03:32:06,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1239 transitions. [2024-11-25 03:32:06,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-25 03:32:06,016 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:06,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:06,235 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 71 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:32:07,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:07,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1035 states and 1260 transitions. [2024-11-25 03:32:07,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1260 transitions. [2024-11-25 03:32:07,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-25 03:32:07,411 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:07,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:07,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:07,622 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 71 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:32:08,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:08,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1040 states and 1264 transitions. [2024-11-25 03:32:08,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1264 transitions. [2024-11-25 03:32:08,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-25 03:32:08,130 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:08,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:08,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:08,496 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 72 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:32:09,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:09,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1045 states and 1270 transitions. [2024-11-25 03:32:09,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1270 transitions. [2024-11-25 03:32:09,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-25 03:32:09,683 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:09,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:09,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:09,793 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:32:10,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:10,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1277 states to 1051 states and 1277 transitions. [2024-11-25 03:32:10,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1277 transitions. [2024-11-25 03:32:10,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-25 03:32:10,129 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:10,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:10,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:10,469 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 75 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:32:13,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:13,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1113 states and 1349 transitions. [2024-11-25 03:32:13,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1349 transitions. [2024-11-25 03:32:13,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-25 03:32:13,606 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:13,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:13,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:13,748 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 75 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:32:14,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:14,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1118 states and 1353 transitions. [2024-11-25 03:32:14,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1353 transitions. [2024-11-25 03:32:14,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-25 03:32:14,119 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:14,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:14,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:14,221 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:32:15,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:15,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1136 states and 1374 transitions. [2024-11-25 03:32:15,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1374 transitions. [2024-11-25 03:32:15,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-25 03:32:15,575 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:15,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:15,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:15,625 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:32:15,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:15,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1141 states and 1378 transitions. [2024-11-25 03:32:15,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1378 transitions. [2024-11-25 03:32:15,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-25 03:32:15,943 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:15,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:15,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:16,191 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:32:19,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:19,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1177 states and 1417 transitions. [2024-11-25 03:32:19,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1417 transitions. [2024-11-25 03:32:19,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-25 03:32:19,655 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:19,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:19,711 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:32:21,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:21,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1188 states and 1432 transitions. [2024-11-25 03:32:21,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1432 transitions. [2024-11-25 03:32:21,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-25 03:32:21,273 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:21,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:21,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:21,330 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-25 03:32:21,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:21,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1189 states and 1432 transitions. [2024-11-25 03:32:21,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 1432 transitions. [2024-11-25 03:32:21,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-25 03:32:21,382 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:21,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:21,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:21,445 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 03:32:22,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:22,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1202 states and 1445 transitions. [2024-11-25 03:32:22,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1445 transitions. [2024-11-25 03:32:22,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-25 03:32:22,102 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:22,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:22,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:22,161 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 03:32:22,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:22,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1212 states and 1454 transitions. [2024-11-25 03:32:22,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1454 transitions. [2024-11-25 03:32:22,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-25 03:32:22,454 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:22,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:22,593 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-25 03:32:23,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:23,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 1291 states and 1549 transitions. [2024-11-25 03:32:23,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1549 transitions. [2024-11-25 03:32:23,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-25 03:32:23,489 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:23,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:23,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:23,607 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-25 03:32:24,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:24,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1292 states and 1551 transitions. [2024-11-25 03:32:24,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1551 transitions. [2024-11-25 03:32:24,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-25 03:32:24,142 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:24,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:24,396 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:32:24,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:24,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1302 states and 1563 transitions. [2024-11-25 03:32:24,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1563 transitions. [2024-11-25 03:32:24,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-25 03:32:24,904 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:24,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:24,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:25,009 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-25 03:32:25,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:25,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1303 states and 1564 transitions. [2024-11-25 03:32:25,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1303 states and 1564 transitions. [2024-11-25 03:32:25,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-25 03:32:25,625 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:25,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:25,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:25,820 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:32:25,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:25,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1306 states and 1567 transitions. [2024-11-25 03:32:25,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1567 transitions. [2024-11-25 03:32:25,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-25 03:32:25,897 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:25,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:25,977 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-25 03:32:26,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:26,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1325 states and 1589 transitions. [2024-11-25 03:32:26,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1589 transitions. [2024-11-25 03:32:26,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-25 03:32:26,585 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:26,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:26,722 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-25 03:32:27,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:27,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1329 states and 1593 transitions. [2024-11-25 03:32:27,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1593 transitions. [2024-11-25 03:32:27,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-25 03:32:27,365 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:27,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:27,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:27,586 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-25 03:32:27,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:27,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1331 states and 1595 transitions. [2024-11-25 03:32:27,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1595 transitions. [2024-11-25 03:32:27,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-25 03:32:27,656 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:27,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:27,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:27,745 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:32:31,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:31,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1644 states to 1372 states and 1644 transitions. [2024-11-25 03:32:31,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1644 transitions. [2024-11-25 03:32:31,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-25 03:32:31,263 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:31,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:31,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:31,339 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:32:32,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:32,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1376 states and 1647 transitions. [2024-11-25 03:32:32,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 1647 transitions. [2024-11-25 03:32:32,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-25 03:32:32,060 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:32,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:32,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:32,121 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:32:35,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:35,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1412 states and 1692 transitions. [2024-11-25 03:32:35,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 1692 transitions. [2024-11-25 03:32:35,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-25 03:32:35,583 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:35,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:35,655 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:32:36,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:36,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1417 states and 1696 transitions. [2024-11-25 03:32:36,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 1696 transitions. [2024-11-25 03:32:36,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-25 03:32:36,345 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:36,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:36,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:36,456 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-25 03:32:38,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:38,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1428 states and 1718 transitions. [2024-11-25 03:32:38,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1718 transitions. [2024-11-25 03:32:38,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-25 03:32:38,276 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:38,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:38,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:38,360 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-25 03:32:38,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:38,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1728 states to 1435 states and 1728 transitions. [2024-11-25 03:32:38,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 1728 transitions. [2024-11-25 03:32:38,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-25 03:32:38,505 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:38,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:38,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:38,584 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-25 03:32:39,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:39,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1448 states and 1742 transitions. [2024-11-25 03:32:39,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 1742 transitions. [2024-11-25 03:32:39,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-25 03:32:39,761 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:39,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:39,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:39,861 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-25 03:32:40,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:40,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1458 states and 1752 transitions. [2024-11-25 03:32:40,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 1752 transitions. [2024-11-25 03:32:40,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-25 03:32:40,418 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:40,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:40,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:40,501 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-25 03:32:40,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:40,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1463 states and 1756 transitions. [2024-11-25 03:32:40,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 1756 transitions. [2024-11-25 03:32:40,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-25 03:32:40,807 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:40,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:40,875 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-25 03:32:41,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:41,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1468 states and 1760 transitions. [2024-11-25 03:32:41,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 1760 transitions. [2024-11-25 03:32:41,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-25 03:32:41,189 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:41,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:41,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:41,358 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-25 03:32:42,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:42,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1498 states and 1794 transitions. [2024-11-25 03:32:42,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 1794 transitions. [2024-11-25 03:32:42,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-25 03:32:42,812 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:42,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:42,941 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-25 03:32:44,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:44,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1504 states and 1802 transitions. [2024-11-25 03:32:44,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 1802 transitions. [2024-11-25 03:32:44,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-25 03:32:44,231 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:44,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:44,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:44,368 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-25 03:32:44,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:44,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1518 states and 1815 transitions. [2024-11-25 03:32:44,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 1815 transitions. [2024-11-25 03:32:44,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-25 03:32:44,971 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:44,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:44,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:45,169 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-25 03:32:45,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:45,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1832 states to 1535 states and 1832 transitions. [2024-11-25 03:32:45,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 1832 transitions. [2024-11-25 03:32:45,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-25 03:32:45,712 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:45,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:45,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:45,982 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 03:32:46,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:46,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1545 states and 1844 transitions. [2024-11-25 03:32:46,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 1844 transitions. [2024-11-25 03:32:46,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-25 03:32:46,498 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:46,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:46,630 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-25 03:32:47,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:47,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1865 states to 1562 states and 1865 transitions. [2024-11-25 03:32:47,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 1865 transitions. [2024-11-25 03:32:47,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-25 03:32:47,919 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:47,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:47,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:48,151 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 03:32:49,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:49,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1881 states to 1575 states and 1881 transitions. [2024-11-25 03:32:49,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 1881 transitions. [2024-11-25 03:32:49,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-25 03:32:49,076 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:49,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:49,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:49,132 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-25 03:32:49,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:49,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1587 states and 1893 transitions. [2024-11-25 03:32:49,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 1893 transitions. [2024-11-25 03:32:49,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-25 03:32:49,226 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:49,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:49,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:49,281 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-25 03:32:50,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:50,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1592 states and 1897 transitions. [2024-11-25 03:32:50,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 1897 transitions. [2024-11-25 03:32:50,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-25 03:32:50,176 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:50,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:50,232 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-25 03:32:50,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:50,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1605 states and 1910 transitions. [2024-11-25 03:32:50,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 1910 transitions. [2024-11-25 03:32:50,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-25 03:32:50,759 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:50,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:50,813 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-25 03:32:51,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:51,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1913 states to 1609 states and 1913 transitions. [2024-11-25 03:32:51,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 1913 transitions. [2024-11-25 03:32:51,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-25 03:32:51,312 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:51,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:51,477 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 03:32:51,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:51,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1915 states to 1611 states and 1915 transitions. [2024-11-25 03:32:51,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 1915 transitions. [2024-11-25 03:32:51,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-25 03:32:51,564 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:51,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:51,666 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-25 03:32:52,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:52,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1620 states and 1931 transitions. [2024-11-25 03:32:52,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 1931 transitions. [2024-11-25 03:32:52,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-25 03:32:52,681 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:52,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:52,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:52,752 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-25 03:32:54,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:54,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1640 states and 1952 transitions. [2024-11-25 03:32:54,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 1952 transitions. [2024-11-25 03:32:54,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-25 03:32:54,230 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:54,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:54,326 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-25 03:32:54,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:32:54,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1654 states and 1965 transitions. [2024-11-25 03:32:54,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 1965 transitions. [2024-11-25 03:32:54,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-25 03:32:54,905 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:32:54,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:32:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:32:55,778 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 03:33:01,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:33:01,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 1790 states and 2133 transitions. [2024-11-25 03:33:01,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1790 states and 2133 transitions. [2024-11-25 03:33:01,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-25 03:33:01,324 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:33:01,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:33:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:33:01,622 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 03:33:02,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:33:02,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 1813 states and 2155 transitions. [2024-11-25 03:33:02,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 2155 transitions. [2024-11-25 03:33:02,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-25 03:33:02,671 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:33:02,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:33:02,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:33:02,920 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 03:33:07,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:33:07,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2208 states to 1855 states and 2208 transitions. [2024-11-25 03:33:07,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1855 states and 2208 transitions. [2024-11-25 03:33:07,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-25 03:33:07,184 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:33:07,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:33:07,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:33:07,508 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 03:33:12,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:33:12,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2271 states to 1911 states and 2271 transitions. [2024-11-25 03:33:12,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1911 states and 2271 transitions. [2024-11-25 03:33:12,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-25 03:33:12,441 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:33:12,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:33:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:33:12,679 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 03:33:13,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:33:13,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2275 states to 1916 states and 2275 transitions. [2024-11-25 03:33:13,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 2275 transitions. [2024-11-25 03:33:13,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-25 03:33:13,500 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:33:13,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:33:13,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:33:13,613 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-25 03:33:14,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:33:14,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 1943 states and 2306 transitions. [2024-11-25 03:33:14,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1943 states and 2306 transitions. [2024-11-25 03:33:14,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-25 03:33:14,227 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:33:14,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:33:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:33:14,296 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-25 03:33:15,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:33:15,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 1955 states and 2318 transitions. [2024-11-25 03:33:15,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1955 states and 2318 transitions. [2024-11-25 03:33:15,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-25 03:33:15,539 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:33:15,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:33:15,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:33:15,784 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:33:17,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:33:17,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2341 states to 1975 states and 2341 transitions. [2024-11-25 03:33:17,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 2341 transitions. [2024-11-25 03:33:17,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-25 03:33:17,805 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:33:17,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:33:17,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:33:17,901 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 142 proven. 8 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-25 03:33:19,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:33:19,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2368 states to 1993 states and 2368 transitions. [2024-11-25 03:33:19,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 2368 transitions. [2024-11-25 03:33:19,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-25 03:33:19,490 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:33:19,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:33:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:33:19,607 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-25 03:33:21,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:33:21,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2382 states to 2005 states and 2382 transitions. [2024-11-25 03:33:21,158 INFO L276 IsEmpty]: Start isEmpty. Operand 2005 states and 2382 transitions. [2024-11-25 03:33:21,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-25 03:33:21,159 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:33:21,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:33:21,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:33:21,234 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-25 03:33:21,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:33:21,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2384 states to 2006 states and 2384 transitions. [2024-11-25 03:33:21,654 INFO L276 IsEmpty]: Start isEmpty. Operand 2006 states and 2384 transitions. [2024-11-25 03:33:21,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-25 03:33:21,655 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:33:21,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:33:21,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:33:21,761 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-25 03:33:22,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:33:22,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2390 states to 2012 states and 2390 transitions. [2024-11-25 03:33:22,958 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 2390 transitions. [2024-11-25 03:33:22,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-25 03:33:22,959 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:33:22,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:33:22,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:33:23,061 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-25 03:33:23,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:33:23,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2394 states to 2017 states and 2394 transitions. [2024-11-25 03:33:23,780 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 2394 transitions. [2024-11-25 03:33:23,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-25 03:33:23,781 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:33:23,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:33:23,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:33:24,763 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 93 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 03:33:30,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:33:30,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2178 states and 2568 transitions. [2024-11-25 03:33:30,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2178 states and 2568 transitions. [2024-11-25 03:33:30,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-25 03:33:30,017 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:33:30,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:33:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:33:30,286 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2024-11-25 03:33:35,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:33:35,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2727 states to 2328 states and 2727 transitions. [2024-11-25 03:33:35,986 INFO L276 IsEmpty]: Start isEmpty. Operand 2328 states and 2727 transitions. [2024-11-25 03:33:35,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-25 03:33:35,988 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:33:35,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:33:36,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:33:36,069 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-25 03:33:37,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:33:37,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2732 states to 2334 states and 2732 transitions. [2024-11-25 03:33:37,197 INFO L276 IsEmpty]: Start isEmpty. Operand 2334 states and 2732 transitions. [2024-11-25 03:33:37,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-25 03:33:37,198 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:33:37,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:33:37,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:33:37,314 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-25 03:33:38,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:33:38,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2742 states to 2344 states and 2742 transitions. [2024-11-25 03:33:38,193 INFO L276 IsEmpty]: Start isEmpty. Operand 2344 states and 2742 transitions. [2024-11-25 03:33:38,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-25 03:33:38,195 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:33:38,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:33:38,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:33:38,443 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-25 03:33:38,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:33:38,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2746 states to 2349 states and 2746 transitions. [2024-11-25 03:33:38,995 INFO L276 IsEmpty]: Start isEmpty. Operand 2349 states and 2746 transitions. [2024-11-25 03:33:38,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-25 03:33:38,997 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:33:38,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:33:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:33:39,168 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-25 03:33:40,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:33:40,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2773 states to 2375 states and 2773 transitions. [2024-11-25 03:33:40,677 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 2773 transitions. [2024-11-25 03:33:40,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-25 03:33:40,678 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:33:40,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:33:40,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:33:40,779 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2024-11-25 03:33:40,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:33:40,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2773 states to 2376 states and 2773 transitions. [2024-11-25 03:33:40,854 INFO L276 IsEmpty]: Start isEmpty. Operand 2376 states and 2773 transitions. [2024-11-25 03:33:40,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-11-25 03:33:40,855 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:33:40,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:33:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:33:41,789 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-25 03:33:44,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:33:44,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2788 states to 2388 states and 2788 transitions. [2024-11-25 03:33:44,654 INFO L276 IsEmpty]: Start isEmpty. Operand 2388 states and 2788 transitions. [2024-11-25 03:33:44,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-11-25 03:33:44,656 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:33:44,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:33:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:33:44,841 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-25 03:33:45,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:33:45,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2792 states to 2393 states and 2792 transitions. [2024-11-25 03:33:45,082 INFO L276 IsEmpty]: Start isEmpty. Operand 2393 states and 2792 transitions. [2024-11-25 03:33:45,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-11-25 03:33:45,083 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:33:45,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:33:45,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:33:45,173 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-25 03:33:47,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:33:47,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2804 states to 2405 states and 2804 transitions. [2024-11-25 03:33:47,336 INFO L276 IsEmpty]: Start isEmpty. Operand 2405 states and 2804 transitions. [2024-11-25 03:33:47,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-11-25 03:33:47,337 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:33:47,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:33:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:33:47,515 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-25 03:33:49,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:33:49,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2813 states to 2412 states and 2813 transitions. [2024-11-25 03:33:49,258 INFO L276 IsEmpty]: Start isEmpty. Operand 2412 states and 2813 transitions. [2024-11-25 03:33:49,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-11-25 03:33:49,261 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:33:49,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:33:49,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:33:49,492 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-25 03:33:50,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:33:50,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2817 states to 2417 states and 2817 transitions. [2024-11-25 03:33:50,340 INFO L276 IsEmpty]: Start isEmpty. Operand 2417 states and 2817 transitions. [2024-11-25 03:33:50,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-25 03:33:50,342 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:33:50,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:33:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:33:50,436 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-11-25 03:33:50,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:33:50,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2823 states to 2423 states and 2823 transitions. [2024-11-25 03:33:50,941 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 2823 transitions. [2024-11-25 03:33:50,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-25 03:33:50,943 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:33:50,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:33:50,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:33:51,039 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-11-25 03:33:53,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:33:53,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2831 states to 2429 states and 2831 transitions. [2024-11-25 03:33:53,238 INFO L276 IsEmpty]: Start isEmpty. Operand 2429 states and 2831 transitions. [2024-11-25 03:33:53,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2024-11-25 03:33:53,240 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:33:53,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:33:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:33:53,621 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 316 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-25 03:33:54,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:33:54,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2911 states to 2508 states and 2911 transitions. [2024-11-25 03:33:54,930 INFO L276 IsEmpty]: Start isEmpty. Operand 2508 states and 2911 transitions. [2024-11-25 03:33:54,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2024-11-25 03:33:54,931 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:33:54,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:33:54,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:33:55,656 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 328 proven. 16 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-11-25 03:34:04,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:34:04,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3041 states to 2625 states and 3041 transitions. [2024-11-25 03:34:04,837 INFO L276 IsEmpty]: Start isEmpty. Operand 2625 states and 3041 transitions. [2024-11-25 03:34:04,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2024-11-25 03:34:04,838 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:34:04,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:34:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:34:05,079 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 328 proven. 16 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-11-25 03:34:09,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:34:09,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3087 states to 2673 states and 3087 transitions. [2024-11-25 03:34:09,633 INFO L276 IsEmpty]: Start isEmpty. Operand 2673 states and 3087 transitions. [2024-11-25 03:34:09,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2024-11-25 03:34:09,636 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:34:09,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:34:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:34:10,150 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 328 proven. 16 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-11-25 03:34:11,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:34:11,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3092 states to 2678 states and 3092 transitions. [2024-11-25 03:34:11,028 INFO L276 IsEmpty]: Start isEmpty. Operand 2678 states and 3092 transitions. [2024-11-25 03:34:11,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2024-11-25 03:34:11,030 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:34:11,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:34:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:34:11,457 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 328 proven. 16 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-11-25 03:34:12,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:34:12,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3096 states to 2683 states and 3096 transitions. [2024-11-25 03:34:12,707 INFO L276 IsEmpty]: Start isEmpty. Operand 2683 states and 3096 transitions. [2024-11-25 03:34:12,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2024-11-25 03:34:12,708 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:34:12,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:34:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:34:12,958 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 328 proven. 16 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-11-25 03:34:14,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:34:14,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3100 states to 2688 states and 3100 transitions. [2024-11-25 03:34:14,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2688 states and 3100 transitions. [2024-11-25 03:34:14,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-11-25 03:34:14,168 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:34:14,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:34:14,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:34:14,391 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 214 proven. 4 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2024-11-25 03:34:15,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:34:15,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3112 states to 2695 states and 3112 transitions. [2024-11-25 03:34:15,809 INFO L276 IsEmpty]: Start isEmpty. Operand 2695 states and 3112 transitions. [2024-11-25 03:34:15,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-11-25 03:34:15,816 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:34:15,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:34:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:34:15,931 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-11-25 03:34:16,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:34:16,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 2696 states and 3115 transitions. [2024-11-25 03:34:16,548 INFO L276 IsEmpty]: Start isEmpty. Operand 2696 states and 3115 transitions. [2024-11-25 03:34:16,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-11-25 03:34:16,551 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:34:16,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:34:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:34:16,659 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-11-25 03:34:19,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:34:19,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 2703 states and 3125 transitions. [2024-11-25 03:34:19,070 INFO L276 IsEmpty]: Start isEmpty. Operand 2703 states and 3125 transitions. [2024-11-25 03:34:19,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-11-25 03:34:19,073 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:34:19,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:34:19,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:34:19,248 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-11-25 03:34:19,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:34:19,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 2709 states and 3130 transitions. [2024-11-25 03:34:19,855 INFO L276 IsEmpty]: Start isEmpty. Operand 2709 states and 3130 transitions. [2024-11-25 03:34:19,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-11-25 03:34:19,858 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:34:19,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:34:19,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:34:20,033 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-11-25 03:34:21,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:34:21,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 2714 states and 3135 transitions. [2024-11-25 03:34:21,146 INFO L276 IsEmpty]: Start isEmpty. Operand 2714 states and 3135 transitions. [2024-11-25 03:34:21,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-11-25 03:34:21,149 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:34:21,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:34:21,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:34:21,256 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-11-25 03:34:22,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:34:22,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 2717 states and 3137 transitions. [2024-11-25 03:34:22,244 INFO L276 IsEmpty]: Start isEmpty. Operand 2717 states and 3137 transitions. [2024-11-25 03:34:22,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-11-25 03:34:22,246 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:34:22,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:34:22,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:34:22,352 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-11-25 03:34:23,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:34:23,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3142 states to 2722 states and 3142 transitions. [2024-11-25 03:34:23,421 INFO L276 IsEmpty]: Start isEmpty. Operand 2722 states and 3142 transitions. [2024-11-25 03:34:23,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-11-25 03:34:23,423 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:34:23,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:34:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:34:23,545 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-11-25 03:34:24,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:34:24,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3142 states to 2723 states and 3142 transitions. [2024-11-25 03:34:24,706 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 3142 transitions. [2024-11-25 03:34:24,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-11-25 03:34:24,707 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:34:24,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:34:24,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:34:24,872 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-11-25 03:34:26,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:34:26,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3146 states to 2728 states and 3146 transitions. [2024-11-25 03:34:26,054 INFO L276 IsEmpty]: Start isEmpty. Operand 2728 states and 3146 transitions. [2024-11-25 03:34:26,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-11-25 03:34:26,056 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:34:26,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:34:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:34:26,162 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-11-25 03:34:26,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:34:26,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3147 states to 2729 states and 3147 transitions. [2024-11-25 03:34:26,402 INFO L276 IsEmpty]: Start isEmpty. Operand 2729 states and 3147 transitions. [2024-11-25 03:34:26,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2024-11-25 03:34:26,404 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 03:34:26,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 03:34:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 03:34:26,514 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2024-11-25 03:34:27,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 03:34:27,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2468 states to 2159 states and 2468 transitions. [2024-11-25 03:34:27,081 INFO L276 IsEmpty]: Start isEmpty. Operand 2159 states and 2468 transitions. [2024-11-25 03:34:27,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-25 03:34:27,082 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 146 iterations. [2024-11-25 03:34:27,090 INFO L726 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-11-25 03:34:49,613 INFO L77 FloydHoareUtils]: At program point L301(lines 301 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-11-25 03:34:49,613 INFO L77 FloydHoareUtils]: At program point L235(lines 235 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-11-25 03:34:49,614 INFO L77 FloydHoareUtils]: At program point L169(lines 169 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,614 INFO L77 FloydHoareUtils]: At program point L303(lines 303 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-11-25 03:34:49,614 INFO L77 FloydHoareUtils]: At program point L105(lines 105 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,615 INFO L77 FloydHoareUtils]: At program point L40(lines 40 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,615 INFO L77 FloydHoareUtils]: At program point L371(lines 371 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,615 INFO L77 FloydHoareUtils]: At program point L307(lines 307 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-11-25 03:34:49,615 INFO L77 FloydHoareUtils]: At program point L175(lines 175 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,615 INFO L77 FloydHoareUtils]: At program point L109(lines 109 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,616 INFO L77 FloydHoareUtils]: At program point L242(lines 242 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-11-25 03:34:49,616 INFO L77 FloydHoareUtils]: At program point L45(lines 45 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,616 INFO L77 FloydHoareUtils]: At program point L574-1(lines 39 608) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not (= 7 ~a17~0)) .cse1) (and (= ~a25~0 1) .cse1)))) [2024-11-25 03:34:49,616 INFO L77 FloydHoareUtils]: At program point L244(lines 244 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-11-25 03:34:49,617 INFO L77 FloydHoareUtils]: At program point L179(lines 179 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,617 INFO L77 FloydHoareUtils]: At program point L378(lines 378 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,617 INFO L77 FloydHoareUtils]: At program point L48(lines 48 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,617 INFO L77 FloydHoareUtils]: At program point L577-1(lines 39 608) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not (= 7 ~a17~0)) .cse1) (and (= ~a25~0 1) .cse1)))) [2024-11-25 03:34:49,617 INFO L77 FloydHoareUtils]: At program point L247(lines 247 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-11-25 03:34:49,618 INFO L75 FloydHoareUtils]: For program point L578(line 578) no Hoare annotation was computed. [2024-11-25 03:34:49,618 INFO L77 FloydHoareUtils]: At program point L116(lines 116 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,618 INFO L77 FloydHoareUtils]: At program point L52(lines 52 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,618 INFO L77 FloydHoareUtils]: At program point L185(lines 185 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,618 INFO L77 FloydHoareUtils]: At program point L385(lines 385 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,619 INFO L77 FloydHoareUtils]: At program point L319(lines 319 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-11-25 03:34:49,619 INFO L77 FloydHoareUtils]: At program point L189(lines 189 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,619 INFO L77 FloydHoareUtils]: At program point L123(lines 123 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,619 INFO L77 FloydHoareUtils]: At program point L57(lines 57 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,619 INFO L77 FloydHoareUtils]: At program point L388(lines 388 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,619 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-25 03:34:49,620 INFO L77 FloydHoareUtils]: At program point L390(lines 390 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,620 INFO L77 FloydHoareUtils]: At program point L324(lines 324 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-11-25 03:34:49,620 INFO L77 FloydHoareUtils]: At program point L258(lines 258 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-11-25 03:34:49,620 INFO L77 FloydHoareUtils]: At program point L60(lines 60 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,620 INFO L77 FloydHoareUtils]: At program point L195(lines 195 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,620 INFO L77 FloydHoareUtils]: At program point L129(lines 129 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,621 INFO L77 FloydHoareUtils]: At program point L64(lines 64 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,621 INFO L77 FloydHoareUtils]: At program point L263(lines 263 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-11-25 03:34:49,621 INFO L77 FloydHoareUtils]: At program point L197(lines 197 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,621 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 578) no Hoare annotation was computed. [2024-11-25 03:34:49,621 INFO L77 FloydHoareUtils]: At program point L199(lines 199 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,621 INFO L77 FloydHoareUtils]: At program point L133(lines 133 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,622 INFO L77 FloydHoareUtils]: At program point L399(lines 399 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,622 INFO L77 FloydHoareUtils]: At program point L201(lines 201 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,622 INFO L77 FloydHoareUtils]: At program point L69(lines 69 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,622 INFO L77 FloydHoareUtils]: At program point L269(lines 269 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-11-25 03:34:49,622 INFO L77 FloydHoareUtils]: At program point L204(lines 204 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,622 INFO L77 FloydHoareUtils]: At program point L271(lines 271 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-11-25 03:34:49,622 INFO L77 FloydHoareUtils]: At program point L404(lines 404 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,623 INFO L77 FloydHoareUtils]: At program point L338(lines 338 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-11-25 03:34:49,623 INFO L77 FloydHoareUtils]: At program point L140(lines 140 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,623 INFO L77 FloydHoareUtils]: At program point L75(lines 75 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,623 INFO L77 FloydHoareUtils]: At program point L208(lines 208 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,623 INFO L77 FloydHoareUtils]: At program point L341(lines 341 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,623 INFO L77 FloydHoareUtils]: At program point L408(lines 408 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,624 INFO L77 FloydHoareUtils]: At program point L144(lines 144 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,624 INFO L77 FloydHoareUtils]: At program point L79(lines 79 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,624 INFO L77 FloydHoareUtils]: At program point L212(lines 212 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,624 INFO L77 FloydHoareUtils]: At program point L610(lines 610 627) the Hoare annotation is: true [2024-11-25 03:34:49,624 INFO L77 FloydHoareUtils]: At program point L412(lines 412 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,624 INFO L77 FloydHoareUtils]: At program point L347(lines 347 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,624 INFO L77 FloydHoareUtils]: At program point L149(lines 149 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,625 INFO L77 FloydHoareUtils]: At program point L414(lines 414 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,625 INFO L77 FloydHoareUtils]: At program point L84(lines 84 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,625 INFO L77 FloydHoareUtils]: At program point L417(lines 417 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,625 INFO L77 FloydHoareUtils]: At program point L153(lines 153 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,625 INFO L77 FloydHoareUtils]: At program point L616-2(lines 616 626) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,625 INFO L77 FloydHoareUtils]: At program point L286(lines 286 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-11-25 03:34:49,626 INFO L77 FloydHoareUtils]: At program point L419(lines 419 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,626 INFO L77 FloydHoareUtils]: At program point L222(lines 222 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,626 INFO L77 FloydHoareUtils]: At program point L290(lines 290 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-11-25 03:34:49,626 INFO L77 FloydHoareUtils]: At program point L158(lines 158 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,626 INFO L77 FloydHoareUtils]: At program point L92(lines 92 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,626 INFO L77 FloydHoareUtils]: At program point L621(line 621) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,626 INFO L77 FloydHoareUtils]: At program point L225(lines 225 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,626 INFO L77 FloydHoareUtils]: At program point L359(lines 359 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,627 INFO L77 FloydHoareUtils]: At program point L293(lines 293 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-11-25 03:34:49,627 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-25 03:34:49,627 INFO L77 FloydHoareUtils]: At program point L228(lines 228 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-11-25 03:34:49,627 INFO L77 FloydHoareUtils]: At program point L296(lines 296 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-11-25 03:34:49,627 INFO L77 FloydHoareUtils]: At program point L164(lines 164 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,628 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 39 608) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,628 INFO L77 FloydHoareUtils]: At program point L364(lines 364 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,628 INFO L77 FloydHoareUtils]: At program point L233(lines 233 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-11-25 03:34:49,628 INFO L77 FloydHoareUtils]: At program point L101(lines 101 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-11-25 03:34:49,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 25.11 03:34:49 ImpRootNode [2024-11-25 03:34:49,643 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-25 03:34:49,644 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-25 03:34:49,644 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-25 03:34:49,644 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-25 03:34:49,645 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:31:20" (3/4) ... [2024-11-25 03:34:49,647 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-25 03:34:49,661 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 128 nodes and edges [2024-11-25 03:34:49,662 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-25 03:34:49,663 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-25 03:34:49,664 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-25 03:34:49,804 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853ba356-f2aa-4f19-8502-e13887dffd36/bin/ukojak-verify-ENZ3QT5qd3/witness.graphml [2024-11-25 03:34:49,805 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853ba356-f2aa-4f19-8502-e13887dffd36/bin/ukojak-verify-ENZ3QT5qd3/witness.yml [2024-11-25 03:34:49,805 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-25 03:34:49,806 INFO L158 Benchmark]: Toolchain (without parser) took 211815.06ms. Allocated memory was 117.4MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 91.1MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 356.1MB. Max. memory is 16.1GB. [2024-11-25 03:34:49,806 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 117.4MB. Free memory is still 72.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 03:34:49,807 INFO L158 Benchmark]: CACSL2BoogieTranslator took 579.51ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 64.9MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-25 03:34:49,807 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.42ms. Allocated memory is still 117.4MB. Free memory was 64.9MB in the beginning and 59.8MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-25 03:34:49,807 INFO L158 Benchmark]: Boogie Preprocessor took 51.35ms. Allocated memory is still 117.4MB. Free memory was 59.8MB in the beginning and 55.9MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 03:34:49,810 INFO L158 Benchmark]: RCFGBuilder took 2015.02ms. Allocated memory is still 117.4MB. Free memory was 55.7MB in the beginning and 28.1MB in the end (delta: 27.7MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. [2024-11-25 03:34:49,810 INFO L158 Benchmark]: CodeCheck took 208928.02ms. Allocated memory was 117.4MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 28.1MB in the beginning and 2.1GB in the end (delta: -2.1GB). Peak memory consumption was 279.1MB. Max. memory is 16.1GB. [2024-11-25 03:34:49,810 INFO L158 Benchmark]: Witness Printer took 161.24ms. Allocated memory is still 2.5GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-25 03:34:49,813 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 1 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 186.3s, OverallIterations: 146, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 430359 SdHoareTripleChecker+Valid, 1201.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 417971 mSDsluCounter, 52164 SdHoareTripleChecker+Invalid, 1023.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44199 mSDsCounter, 94764 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 892506 IncrementalHoareTripleChecker+Invalid, 987270 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94764 mSolverCounterUnsat, 7965 mSDtfsCounter, 892506 mSolverCounterSat, 12.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 176325 GetRequests, 166263 SyntacticMatches, 8918 SemanticMatches, 1144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837300 ImplicationChecksByTransitivity, 137.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.8s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 21.4s InterpolantComputationTime, 26000 NumberOfCodeBlocks, 26000 NumberOfCodeBlocksAsserted, 145 NumberOfCheckSat, 25855 ConstructedInterpolants, 0 QuantifiedInterpolants, 84118 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 145 InterpolantComputations, 121 PerfectInterpolantSequences, 20871/22035 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: 578]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 39]: Location Invariant Derived location invariant: ((((((a17 <= 8) && (a19 == 1)) || ((7 != a17) && (a19 != 1))) || ((((a11 == 1) && (a28 == 10)) && (a21 == 1)) && (7 == a17))) || (((((7 == a28) && (a25 == a11)) && (a21 == 1)) && (a11 == a19)) && (a11 != 1))) || ((a25 == 1) && (a19 != 1))) - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: ((((((a17 <= 8) && (a19 == 1)) || ((7 != a17) && (a19 != 1))) || ((((a11 == 1) && (a28 == 10)) && (a21 == 1)) && (7 == a17))) || (((((7 == a28) && (a25 == a11)) && (a21 == 1)) && (a11 == a19)) && (a11 != 1))) || ((a25 == 1) && (a19 != 1))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.46ms. Allocated memory is still 117.4MB. Free memory is still 72.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 579.51ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 64.9MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.42ms. Allocated memory is still 117.4MB. Free memory was 64.9MB in the beginning and 59.8MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.35ms. Allocated memory is still 117.4MB. Free memory was 59.8MB in the beginning and 55.9MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 2015.02ms. Allocated memory is still 117.4MB. Free memory was 55.7MB in the beginning and 28.1MB in the end (delta: 27.7MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. * CodeCheck took 208928.02ms. Allocated memory was 117.4MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 28.1MB in the beginning and 2.1GB in the end (delta: -2.1GB). Peak memory consumption was 279.1MB. Max. memory is 16.1GB. * Witness Printer took 161.24ms. Allocated memory is still 2.5GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-25 03:34:49,837 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_853ba356-f2aa-4f19-8502-e13887dffd36/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE