./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label24.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_530f950f-b2df-427c-aa9a-2703b5ac6be0/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_530f950f-b2df-427c-aa9a-2703b5ac6be0/bin/ukojak-verify-CZk0znPC7b/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_530f950f-b2df-427c-aa9a-2703b5ac6be0/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_530f950f-b2df-427c-aa9a-2703b5ac6be0/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label24.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_530f950f-b2df-427c-aa9a-2703b5ac6be0/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_530f950f-b2df-427c-aa9a-2703b5ac6be0/bin/ukojak-verify-CZk0znPC7b --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3b098f62dc80370f0e14e7fa6b354d0aae7e8d94738f84002290c368f38c01b4 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 00:54:32,058 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 00:54:32,114 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_530f950f-b2df-427c-aa9a-2703b5ac6be0/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-06 00:54:32,119 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 00:54:32,119 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 00:54:32,139 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 00:54:32,140 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 00:54:32,140 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 00:54:32,140 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 00:54:32,141 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 00:54:32,141 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 00:54:32,141 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 00:54:32,141 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 00:54:32,141 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 00:54:32,141 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 00:54:32,141 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 00:54:32,141 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 00:54:32,141 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 00:54:32,142 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 00:54:32,142 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 00:54:32,142 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 00:54:32,142 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 00:54:32,142 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 00:54:32,142 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 00:54:32,142 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 00:54:32,142 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 00:54:32,142 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 00:54:32,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 00:54:32,142 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 00:54:32,143 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 00:54:32,143 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 00:54:32,143 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 00:54:32,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 00:54:32,143 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_530f950f-b2df-427c-aa9a-2703b5ac6be0/bin/ukojak-verify-CZk0znPC7b Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3b098f62dc80370f0e14e7fa6b354d0aae7e8d94738f84002290c368f38c01b4 [2024-12-06 00:54:32,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 00:54:32,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 00:54:32,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 00:54:32,388 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 00:54:32,389 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 00:54:32,390 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_530f950f-b2df-427c-aa9a-2703b5ac6be0/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/eca-rers2012/Problem01_label24.c [2024-12-06 00:54:35,013 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_530f950f-b2df-427c-aa9a-2703b5ac6be0/bin/ukojak-verify-CZk0znPC7b/data/288c0c201/b0bbc723a2ad4b3cb720f44fcae7722d/FLAG5f0f2b72e [2024-12-06 00:54:35,290 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 00:54:35,290 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_530f950f-b2df-427c-aa9a-2703b5ac6be0/sv-benchmarks/c/eca-rers2012/Problem01_label24.c [2024-12-06 00:54:35,302 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_530f950f-b2df-427c-aa9a-2703b5ac6be0/bin/ukojak-verify-CZk0znPC7b/data/288c0c201/b0bbc723a2ad4b3cb720f44fcae7722d/FLAG5f0f2b72e [2024-12-06 00:54:35,594 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_530f950f-b2df-427c-aa9a-2703b5ac6be0/bin/ukojak-verify-CZk0znPC7b/data/288c0c201/b0bbc723a2ad4b3cb720f44fcae7722d [2024-12-06 00:54:35,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 00:54:35,597 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 00:54:35,598 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 00:54:35,598 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 00:54:35,601 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 00:54:35,601 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:54:35" (1/1) ... [2024-12-06 00:54:35,602 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68ba4ba6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:54:35, skipping insertion in model container [2024-12-06 00:54:35,602 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:54:35" (1/1) ... [2024-12-06 00:54:35,628 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 00:54:35,841 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_530f950f-b2df-427c-aa9a-2703b5ac6be0/sv-benchmarks/c/eca-rers2012/Problem01_label24.c[17735,17748] [2024-12-06 00:54:35,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 00:54:35,874 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 00:54:35,949 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_530f950f-b2df-427c-aa9a-2703b5ac6be0/sv-benchmarks/c/eca-rers2012/Problem01_label24.c[17735,17748] [2024-12-06 00:54:35,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 00:54:35,977 INFO L204 MainTranslator]: Completed translation [2024-12-06 00:54:35,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:54:35 WrapperNode [2024-12-06 00:54:35,977 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 00:54:35,978 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 00:54:35,978 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 00:54:35,978 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 00:54:35,984 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:54:35" (1/1) ... [2024-12-06 00:54:35,995 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:54:35" (1/1) ... [2024-12-06 00:54:36,027 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-12-06 00:54:36,027 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 00:54:36,028 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 00:54:36,028 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 00:54:36,028 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 00:54:36,034 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:54:35" (1/1) ... [2024-12-06 00:54:36,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:54:35" (1/1) ... [2024-12-06 00:54:36,037 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:54:35" (1/1) ... [2024-12-06 00:54:36,037 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:54:35" (1/1) ... [2024-12-06 00:54:36,055 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:54:35" (1/1) ... [2024-12-06 00:54:36,057 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:54:35" (1/1) ... [2024-12-06 00:54:36,064 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:54:35" (1/1) ... [2024-12-06 00:54:36,068 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:54:35" (1/1) ... [2024-12-06 00:54:36,072 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:54:35" (1/1) ... [2024-12-06 00:54:36,077 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 00:54:36,078 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 00:54:36,078 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 00:54:36,078 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 00:54:36,079 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:54:35" (1/1) ... [2024-12-06 00:54:36,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 00:54:36,095 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_530f950f-b2df-427c-aa9a-2703b5ac6be0/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 00:54:36,106 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_530f950f-b2df-427c-aa9a-2703b5ac6be0/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 00:54:36,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_530f950f-b2df-427c-aa9a-2703b5ac6be0/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 00:54:36,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 00:54:36,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 00:54:36,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 00:54:36,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 00:54:36,189 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 00:54:36,190 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 00:54:36,973 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-12-06 00:54:36,973 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 00:54:37,203 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 00:54:37,203 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-06 00:54:37,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:54:37 BoogieIcfgContainer [2024-12-06 00:54:37,204 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 00:54:37,204 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 00:54:37,205 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 00:54:37,213 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 00:54:37,213 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:54:37" (1/1) ... [2024-12-06 00:54:37,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 00:54:37,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:37,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-12-06 00:54:37,266 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-12-06 00:54:37,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-12-06 00:54:37,269 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:37,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:37,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:37,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:54:38,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:38,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 145 states and 261 transitions. [2024-12-06 00:54:38,196 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 261 transitions. [2024-12-06 00:54:38,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-12-06 00:54:38,198 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:38,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:38,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:38,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:54:39,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:39,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 215 states and 339 transitions. [2024-12-06 00:54:39,019 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 339 transitions. [2024-12-06 00:54:39,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-12-06 00:54:39,021 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:39,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:39,103 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:54:39,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:39,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 220 states and 346 transitions. [2024-12-06 00:54:39,177 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 346 transitions. [2024-12-06 00:54:39,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-12-06 00:54:39,179 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:39,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:39,537 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:54:40,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:40,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 295 states and 424 transitions. [2024-12-06 00:54:40,208 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 424 transitions. [2024-12-06 00:54:40,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-12-06 00:54:40,210 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:40,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:40,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:40,324 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:54:40,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:40,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 299 states and 429 transitions. [2024-12-06 00:54:40,445 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 429 transitions. [2024-12-06 00:54:40,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-12-06 00:54:40,446 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:40,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:40,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:40,663 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:54:41,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:41,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 310 states and 443 transitions. [2024-12-06 00:54:41,033 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 443 transitions. [2024-12-06 00:54:41,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-12-06 00:54:41,034 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:41,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:41,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:41,194 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:54:41,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:41,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 320 states and 455 transitions. [2024-12-06 00:54:41,522 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 455 transitions. [2024-12-06 00:54:41,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-12-06 00:54:41,523 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:41,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:41,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:41,621 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 00:54:41,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:41,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 328 states and 469 transitions. [2024-12-06 00:54:41,882 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 469 transitions. [2024-12-06 00:54:41,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-12-06 00:54:41,883 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:41,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:41,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:41,953 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 00:54:42,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:42,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 337 states and 481 transitions. [2024-12-06 00:54:42,248 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 481 transitions. [2024-12-06 00:54:42,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-12-06 00:54:42,250 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:42,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:42,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:42,323 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 00:54:42,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:42,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 343 states and 488 transitions. [2024-12-06 00:54:42,475 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 488 transitions. [2024-12-06 00:54:42,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-12-06 00:54:42,476 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:42,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:42,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:42,542 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 00:54:42,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:42,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 345 states and 490 transitions. [2024-12-06 00:54:42,581 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 490 transitions. [2024-12-06 00:54:42,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-12-06 00:54:42,582 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:42,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:42,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:42,682 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 00:54:43,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:43,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 353 states and 500 transitions. [2024-12-06 00:54:43,081 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 500 transitions. [2024-12-06 00:54:43,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-12-06 00:54:43,082 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:43,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:43,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:43,171 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 00:54:43,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:43,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 355 states and 502 transitions. [2024-12-06 00:54:43,215 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 502 transitions. [2024-12-06 00:54:43,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-12-06 00:54:43,216 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:43,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:43,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:43,304 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 00:54:43,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:43,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 357 states and 504 transitions. [2024-12-06 00:54:43,360 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 504 transitions. [2024-12-06 00:54:43,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-12-06 00:54:43,361 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:43,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:43,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:43,474 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 40 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:54:43,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:43,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 363 states and 513 transitions. [2024-12-06 00:54:43,999 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 513 transitions. [2024-12-06 00:54:44,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-12-06 00:54:44,000 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:44,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:44,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:44,141 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 40 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:54:44,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:44,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 373 states and 524 transitions. [2024-12-06 00:54:44,332 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 524 transitions. [2024-12-06 00:54:44,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-12-06 00:54:44,333 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:44,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:44,467 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 40 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:54:44,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:44,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 378 states and 529 transitions. [2024-12-06 00:54:44,652 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 529 transitions. [2024-12-06 00:54:44,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-12-06 00:54:44,652 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:44,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:44,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:44,778 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:54:45,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:45,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 395 states and 548 transitions. [2024-12-06 00:54:45,100 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 548 transitions. [2024-12-06 00:54:45,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-12-06 00:54:45,101 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:45,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:45,165 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 00:54:45,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:45,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 419 states and 575 transitions. [2024-12-06 00:54:45,797 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 575 transitions. [2024-12-06 00:54:45,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-12-06 00:54:45,798 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:45,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:45,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:45,891 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 00:54:46,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:46,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 448 states and 609 transitions. [2024-12-06 00:54:46,367 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 609 transitions. [2024-12-06 00:54:46,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-12-06 00:54:46,367 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:46,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:46,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:46,435 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 00:54:46,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:46,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 462 states and 623 transitions. [2024-12-06 00:54:46,582 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 623 transitions. [2024-12-06 00:54:46,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-12-06 00:54:46,583 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:46,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:46,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:46,782 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 00:54:47,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:47,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 491 states and 655 transitions. [2024-12-06 00:54:47,518 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 655 transitions. [2024-12-06 00:54:47,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-12-06 00:54:47,519 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:47,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:47,671 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 54 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:54:48,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:48,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 502 states and 669 transitions. [2024-12-06 00:54:48,232 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 669 transitions. [2024-12-06 00:54:48,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-12-06 00:54:48,233 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:48,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:48,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:48,353 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 00:54:48,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:48,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 530 states and 699 transitions. [2024-12-06 00:54:48,865 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 699 transitions. [2024-12-06 00:54:48,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-12-06 00:54:48,865 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:48,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:48,904 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 00:54:48,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:48,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 546 states and 718 transitions. [2024-12-06 00:54:48,996 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 718 transitions. [2024-12-06 00:54:48,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-12-06 00:54:48,996 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:48,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:49,155 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 71 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:54:50,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:50,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 594 states and 770 transitions. [2024-12-06 00:54:50,176 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 770 transitions. [2024-12-06 00:54:50,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-12-06 00:54:50,177 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:50,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:50,305 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 71 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:54:51,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:51,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 641 states and 825 transitions. [2024-12-06 00:54:51,014 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 825 transitions. [2024-12-06 00:54:51,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-12-06 00:54:51,015 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:51,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:51,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:51,089 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-12-06 00:54:51,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:51,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 644 states and 829 transitions. [2024-12-06 00:54:51,173 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 829 transitions. [2024-12-06 00:54:51,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-12-06 00:54:51,173 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:51,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:51,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:51,334 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-12-06 00:54:51,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:51,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 647 states and 833 transitions. [2024-12-06 00:54:51,572 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 833 transitions. [2024-12-06 00:54:51,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-12-06 00:54:51,573 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:51,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:51,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:51,700 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-12-06 00:54:52,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:52,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 666 states and 853 transitions. [2024-12-06 00:54:52,089 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 853 transitions. [2024-12-06 00:54:52,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-12-06 00:54:52,089 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:52,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:52,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:52,199 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:54:52,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:52,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 685 states and 871 transitions. [2024-12-06 00:54:52,639 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 871 transitions. [2024-12-06 00:54:52,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-12-06 00:54:52,640 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:52,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:52,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:52,751 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:54:53,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:53,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 704 states and 891 transitions. [2024-12-06 00:54:53,120 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 891 transitions. [2024-12-06 00:54:53,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-12-06 00:54:53,121 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:53,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:53,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:53,182 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 00:54:53,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:53,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 719 states and 908 transitions. [2024-12-06 00:54:53,318 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 908 transitions. [2024-12-06 00:54:53,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-12-06 00:54:53,319 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:53,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:53,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:53,397 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:54:53,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:53,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 758 states and 950 transitions. [2024-12-06 00:54:53,631 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 950 transitions. [2024-12-06 00:54:53,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-12-06 00:54:53,631 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:53,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:53,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:53,675 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-12-06 00:54:53,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:53,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 774 states and 967 transitions. [2024-12-06 00:54:53,950 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 967 transitions. [2024-12-06 00:54:53,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-12-06 00:54:53,951 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:53,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:53,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:53,994 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-12-06 00:54:54,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:54,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 791 states and 988 transitions. [2024-12-06 00:54:54,459 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 988 transitions. [2024-12-06 00:54:54,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-12-06 00:54:54,460 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:54,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:54,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:54,634 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:54:55,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:55,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 861 states and 1063 transitions. [2024-12-06 00:54:55,523 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1063 transitions. [2024-12-06 00:54:55,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-12-06 00:54:55,523 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:55,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:55,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:55,842 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:54:57,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:57,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 930 states and 1156 transitions. [2024-12-06 00:54:57,458 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1156 transitions. [2024-12-06 00:54:57,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-12-06 00:54:57,459 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:57,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:57,616 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:54:58,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:58,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 998 states and 1231 transitions. [2024-12-06 00:54:58,944 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1231 transitions. [2024-12-06 00:54:58,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-12-06 00:54:58,945 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:58,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:58,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:59,079 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:54:59,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:54:59,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1015 states and 1249 transitions. [2024-12-06 00:54:59,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1249 transitions. [2024-12-06 00:54:59,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-12-06 00:54:59,521 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:54:59,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:54:59,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:54:59,654 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:55:00,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:00,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1034 states and 1268 transitions. [2024-12-06 00:55:00,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1268 transitions. [2024-12-06 00:55:00,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-12-06 00:55:00,108 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:00,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:00,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:00,242 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:55:00,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:00,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1036 states and 1269 transitions. [2024-12-06 00:55:00,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1269 transitions. [2024-12-06 00:55:00,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-06 00:55:00,494 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:00,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:00,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:00,713 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 80 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:55:01,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:01,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1043 states and 1278 transitions. [2024-12-06 00:55:01,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1278 transitions. [2024-12-06 00:55:01,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-06 00:55:01,287 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:01,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:01,440 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 80 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:55:01,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:01,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1053 states and 1289 transitions. [2024-12-06 00:55:01,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1289 transitions. [2024-12-06 00:55:01,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-12-06 00:55:01,749 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:01,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:01,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:01,937 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 84 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 00:55:02,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:02,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1091 states and 1331 transitions. [2024-12-06 00:55:02,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1331 transitions. [2024-12-06 00:55:02,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-12-06 00:55:02,617 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:02,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:02,780 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 84 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 00:55:03,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:03,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1115 states and 1356 transitions. [2024-12-06 00:55:03,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1356 transitions. [2024-12-06 00:55:03,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-12-06 00:55:03,336 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:03,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:03,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:03,402 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-12-06 00:55:03,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:03,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1116 states and 1361 transitions. [2024-12-06 00:55:03,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1361 transitions. [2024-12-06 00:55:03,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-12-06 00:55:03,681 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:03,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:03,763 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-12-06 00:55:04,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:04,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1123 states and 1370 transitions. [2024-12-06 00:55:04,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1370 transitions. [2024-12-06 00:55:04,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-12-06 00:55:04,201 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:04,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:04,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:04,297 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-12-06 00:55:04,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:04,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1147 states and 1394 transitions. [2024-12-06 00:55:04,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1394 transitions. [2024-12-06 00:55:04,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-12-06 00:55:04,569 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:04,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:04,681 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-12-06 00:55:04,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:04,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1171 states and 1418 transitions. [2024-12-06 00:55:04,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1418 transitions. [2024-12-06 00:55:04,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-12-06 00:55:04,946 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:04,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:04,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:05,263 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 99 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:55:05,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:05,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1187 states and 1437 transitions. [2024-12-06 00:55:05,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1437 transitions. [2024-12-06 00:55:05,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-12-06 00:55:05,879 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:05,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:06,141 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 99 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:55:07,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:07,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1476 states to 1217 states and 1476 transitions. [2024-12-06 00:55:07,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1476 transitions. [2024-12-06 00:55:07,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-12-06 00:55:07,142 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:07,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:07,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:07,346 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 99 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:55:07,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:07,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1231 states and 1492 transitions. [2024-12-06 00:55:07,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1492 transitions. [2024-12-06 00:55:07,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-12-06 00:55:07,990 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:07,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:08,140 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 00:55:09,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:09,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1278 states and 1551 transitions. [2024-12-06 00:55:09,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 1551 transitions. [2024-12-06 00:55:09,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-12-06 00:55:09,075 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:09,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:09,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:09,158 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 00:55:09,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:09,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1308 states and 1585 transitions. [2024-12-06 00:55:09,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 1585 transitions. [2024-12-06 00:55:09,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-12-06 00:55:09,561 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:09,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:09,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:09,645 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 00:55:10,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:10,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1621 states to 1340 states and 1621 transitions. [2024-12-06 00:55:10,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1621 transitions. [2024-12-06 00:55:10,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-12-06 00:55:10,362 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:10,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:10,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:10,804 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:55:13,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:13,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1411 states and 1701 transitions. [2024-12-06 00:55:13,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1701 transitions. [2024-12-06 00:55:13,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-12-06 00:55:13,298 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:13,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:13,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:13,546 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:55:16,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:16,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1481 states and 1778 transitions. [2024-12-06 00:55:16,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 1778 transitions. [2024-12-06 00:55:16,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-12-06 00:55:16,297 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:16,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:16,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:16,702 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:55:18,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:18,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1533 states and 1842 transitions. [2024-12-06 00:55:18,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 1842 transitions. [2024-12-06 00:55:18,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-12-06 00:55:18,308 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:18,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:18,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:18,617 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:55:19,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:19,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1579 states and 1893 transitions. [2024-12-06 00:55:19,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 1893 transitions. [2024-12-06 00:55:19,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-12-06 00:55:19,397 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:19,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:19,866 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 156 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 00:55:21,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:21,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1640 states and 1966 transitions. [2024-12-06 00:55:21,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 1966 transitions. [2024-12-06 00:55:21,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-12-06 00:55:21,397 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:21,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:21,643 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 156 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 00:55:22,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:22,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2026 states to 1691 states and 2026 transitions. [2024-12-06 00:55:22,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 2026 transitions. [2024-12-06 00:55:22,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 00:55:22,935 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:22,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:22,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:23,466 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:55:25,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:25,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 1739 states and 2082 transitions. [2024-12-06 00:55:25,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2082 transitions. [2024-12-06 00:55:25,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 00:55:25,253 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:25,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:25,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:25,472 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:55:27,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:27,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2149 states to 1799 states and 2149 transitions. [2024-12-06 00:55:27,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2149 transitions. [2024-12-06 00:55:27,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 00:55:27,439 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:27,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:27,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:27,664 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:55:28,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:28,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 1801 states and 2155 transitions. [2024-12-06 00:55:28,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2155 transitions. [2024-12-06 00:55:28,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 00:55:28,110 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:28,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:28,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:28,472 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:55:28,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:28,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2159 states to 1803 states and 2159 transitions. [2024-12-06 00:55:28,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2159 transitions. [2024-12-06 00:55:28,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 00:55:28,813 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:28,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:28,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:28,962 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 117 proven. 46 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 00:55:29,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:29,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2187 states to 1827 states and 2187 transitions. [2024-12-06 00:55:29,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 2187 transitions. [2024-12-06 00:55:29,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 00:55:29,650 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:29,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:29,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:29,834 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 117 proven. 46 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 00:55:30,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:30,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2211 states to 1850 states and 2211 transitions. [2024-12-06 00:55:30,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 2211 transitions. [2024-12-06 00:55:30,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-12-06 00:55:30,887 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:30,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:31,121 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 120 proven. 51 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 00:55:31,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:31,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2212 states to 1851 states and 2212 transitions. [2024-12-06 00:55:31,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 2212 transitions. [2024-12-06 00:55:31,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-12-06 00:55:31,307 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:31,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:31,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:31,495 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-12-06 00:55:32,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:32,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 1921 states and 2284 transitions. [2024-12-06 00:55:32,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1921 states and 2284 transitions. [2024-12-06 00:55:32,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-06 00:55:32,254 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:32,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:32,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:32,605 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:55:34,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:34,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2340 states to 1968 states and 2340 transitions. [2024-12-06 00:55:34,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1968 states and 2340 transitions. [2024-12-06 00:55:34,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-06 00:55:34,275 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:34,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:34,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:34,486 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:55:35,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:35,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2388 states to 2011 states and 2388 transitions. [2024-12-06 00:55:35,881 INFO L276 IsEmpty]: Start isEmpty. Operand 2011 states and 2388 transitions. [2024-12-06 00:55:35,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-06 00:55:35,882 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:35,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:35,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:36,220 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:55:37,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:37,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2422 states to 2042 states and 2422 transitions. [2024-12-06 00:55:37,212 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 2422 transitions. [2024-12-06 00:55:37,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-06 00:55:37,214 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:37,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:37,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:37,428 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:55:37,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:37,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2424 states to 2043 states and 2424 transitions. [2024-12-06 00:55:37,776 INFO L276 IsEmpty]: Start isEmpty. Operand 2043 states and 2424 transitions. [2024-12-06 00:55:37,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-12-06 00:55:37,777 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:37,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:37,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:38,186 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-06 00:55:39,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:39,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2462 states to 2075 states and 2462 transitions. [2024-12-06 00:55:39,909 INFO L276 IsEmpty]: Start isEmpty. Operand 2075 states and 2462 transitions. [2024-12-06 00:55:39,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-12-06 00:55:39,910 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:39,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:39,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:40,158 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-06 00:55:41,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:41,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2498 states to 2106 states and 2498 transitions. [2024-12-06 00:55:41,099 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 2498 transitions. [2024-12-06 00:55:41,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-12-06 00:55:41,100 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:41,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:41,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:41,341 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-06 00:55:41,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:41,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2120 states and 2513 transitions. [2024-12-06 00:55:41,911 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 2513 transitions. [2024-12-06 00:55:41,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-12-06 00:55:41,912 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:41,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:41,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:42,154 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-06 00:55:42,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:42,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2517 states to 2124 states and 2517 transitions. [2024-12-06 00:55:42,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2124 states and 2517 transitions. [2024-12-06 00:55:42,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-12-06 00:55:42,624 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:42,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:42,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:43,115 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 136 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:55:45,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:45,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2158 states and 2555 transitions. [2024-12-06 00:55:45,227 INFO L276 IsEmpty]: Start isEmpty. Operand 2158 states and 2555 transitions. [2024-12-06 00:55:45,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-12-06 00:55:45,229 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:45,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:45,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:45,535 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 00:55:46,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:46,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2585 states to 2184 states and 2585 transitions. [2024-12-06 00:55:46,949 INFO L276 IsEmpty]: Start isEmpty. Operand 2184 states and 2585 transitions. [2024-12-06 00:55:46,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-06 00:55:46,950 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:46,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:47,406 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-06 00:55:48,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:48,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2594 states to 2190 states and 2594 transitions. [2024-12-06 00:55:48,527 INFO L276 IsEmpty]: Start isEmpty. Operand 2190 states and 2594 transitions. [2024-12-06 00:55:48,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-06 00:55:48,528 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:48,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:48,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:48,944 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-06 00:55:51,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:51,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2642 states to 2236 states and 2642 transitions. [2024-12-06 00:55:51,565 INFO L276 IsEmpty]: Start isEmpty. Operand 2236 states and 2642 transitions. [2024-12-06 00:55:51,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-06 00:55:51,566 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:51,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:51,807 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-06 00:55:52,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:52,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2250 states and 2658 transitions. [2024-12-06 00:55:52,436 INFO L276 IsEmpty]: Start isEmpty. Operand 2250 states and 2658 transitions. [2024-12-06 00:55:52,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-06 00:55:52,437 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:52,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:52,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:52,684 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-06 00:55:53,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:53,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2265 states and 2674 transitions. [2024-12-06 00:55:53,647 INFO L276 IsEmpty]: Start isEmpty. Operand 2265 states and 2674 transitions. [2024-12-06 00:55:53,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-06 00:55:53,648 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:53,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:53,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:53,921 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-06 00:55:55,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:55,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2691 states to 2282 states and 2691 transitions. [2024-12-06 00:55:55,147 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 2691 transitions. [2024-12-06 00:55:55,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-12-06 00:55:55,148 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:55,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:55,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:55,521 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:55:57,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:57,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2720 states to 2306 states and 2720 transitions. [2024-12-06 00:55:57,597 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 2720 transitions. [2024-12-06 00:55:57,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-12-06 00:55:57,598 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:57,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:57,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:57,835 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:55:59,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:55:59,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2758 states to 2339 states and 2758 transitions. [2024-12-06 00:55:59,213 INFO L276 IsEmpty]: Start isEmpty. Operand 2339 states and 2758 transitions. [2024-12-06 00:55:59,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-12-06 00:55:59,214 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:55:59,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:55:59,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:55:59,450 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:56:00,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:00,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2774 states to 2355 states and 2774 transitions. [2024-12-06 00:56:00,398 INFO L276 IsEmpty]: Start isEmpty. Operand 2355 states and 2774 transitions. [2024-12-06 00:56:00,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-12-06 00:56:00,400 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:00,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:00,640 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:56:01,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:01,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2774 states to 2356 states and 2774 transitions. [2024-12-06 00:56:01,203 INFO L276 IsEmpty]: Start isEmpty. Operand 2356 states and 2774 transitions. [2024-12-06 00:56:01,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-06 00:56:01,204 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:01,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:01,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:01,780 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-06 00:56:04,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:04,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2830 states to 2403 states and 2830 transitions. [2024-12-06 00:56:04,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2403 states and 2830 transitions. [2024-12-06 00:56:04,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-06 00:56:04,105 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:04,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:04,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:04,409 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-06 00:56:07,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:07,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2449 states and 2882 transitions. [2024-12-06 00:56:07,609 INFO L276 IsEmpty]: Start isEmpty. Operand 2449 states and 2882 transitions. [2024-12-06 00:56:07,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-06 00:56:07,610 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:07,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:07,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:07,850 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-06 00:56:09,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:09,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2900 states to 2466 states and 2900 transitions. [2024-12-06 00:56:09,374 INFO L276 IsEmpty]: Start isEmpty. Operand 2466 states and 2900 transitions. [2024-12-06 00:56:09,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-06 00:56:09,375 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:09,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:09,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:09,618 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-06 00:56:10,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:10,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2916 states to 2483 states and 2916 transitions. [2024-12-06 00:56:10,955 INFO L276 IsEmpty]: Start isEmpty. Operand 2483 states and 2916 transitions. [2024-12-06 00:56:10,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-12-06 00:56:10,957 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:10,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:10,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:11,791 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 119 proven. 137 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 00:56:16,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:16,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3062 states to 2606 states and 3062 transitions. [2024-12-06 00:56:16,378 INFO L276 IsEmpty]: Start isEmpty. Operand 2606 states and 3062 transitions. [2024-12-06 00:56:16,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-06 00:56:16,379 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:16,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:16,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:16,661 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 58 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-06 00:56:17,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:17,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3088 states to 2631 states and 3088 transitions. [2024-12-06 00:56:17,746 INFO L276 IsEmpty]: Start isEmpty. Operand 2631 states and 3088 transitions. [2024-12-06 00:56:17,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-06 00:56:17,748 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:17,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:18,019 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:56:18,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:18,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3089 states to 2633 states and 3089 transitions. [2024-12-06 00:56:18,217 INFO L276 IsEmpty]: Start isEmpty. Operand 2633 states and 3089 transitions. [2024-12-06 00:56:18,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-12-06 00:56:18,218 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:18,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:18,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:18,649 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 86 proven. 141 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-12-06 00:56:22,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:22,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3243 states to 2768 states and 3243 transitions. [2024-12-06 00:56:22,614 INFO L276 IsEmpty]: Start isEmpty. Operand 2768 states and 3243 transitions. [2024-12-06 00:56:22,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-12-06 00:56:22,615 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:22,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:22,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:23,230 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 129 proven. 142 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 00:56:24,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:24,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3319 states to 2842 states and 3319 transitions. [2024-12-06 00:56:24,789 INFO L276 IsEmpty]: Start isEmpty. Operand 2842 states and 3319 transitions. [2024-12-06 00:56:24,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-12-06 00:56:24,791 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:24,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:24,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:25,236 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 183 proven. 52 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-06 00:56:27,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:27,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3341 states to 2863 states and 3341 transitions. [2024-12-06 00:56:27,066 INFO L276 IsEmpty]: Start isEmpty. Operand 2863 states and 3341 transitions. [2024-12-06 00:56:27,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-12-06 00:56:27,067 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:27,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:27,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:27,333 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 183 proven. 52 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-06 00:56:28,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:28,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3361 states to 2883 states and 3361 transitions. [2024-12-06 00:56:28,695 INFO L276 IsEmpty]: Start isEmpty. Operand 2883 states and 3361 transitions. [2024-12-06 00:56:28,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-12-06 00:56:28,697 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:28,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:28,936 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 185 proven. 54 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-12-06 00:56:29,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:29,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3363 states to 2885 states and 3363 transitions. [2024-12-06 00:56:29,517 INFO L276 IsEmpty]: Start isEmpty. Operand 2885 states and 3363 transitions. [2024-12-06 00:56:29,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-12-06 00:56:29,520 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:29,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:29,909 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 185 proven. 54 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-12-06 00:56:30,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:30,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3365 states to 2887 states and 3365 transitions. [2024-12-06 00:56:30,126 INFO L276 IsEmpty]: Start isEmpty. Operand 2887 states and 3365 transitions. [2024-12-06 00:56:30,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-12-06 00:56:30,127 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:30,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:30,381 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 152 proven. 83 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-12-06 00:56:30,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:30,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3366 states to 2888 states and 3366 transitions. [2024-12-06 00:56:30,587 INFO L276 IsEmpty]: Start isEmpty. Operand 2888 states and 3366 transitions. [2024-12-06 00:56:30,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-12-06 00:56:30,589 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:30,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:30,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:31,165 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 171 proven. 38 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 00:56:32,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:32,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3395 states to 2913 states and 3395 transitions. [2024-12-06 00:56:32,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2913 states and 3395 transitions. [2024-12-06 00:56:32,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-12-06 00:56:32,568 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:32,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:32,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:32,825 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 155 proven. 86 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-12-06 00:56:33,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:33,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3397 states to 2915 states and 3397 transitions. [2024-12-06 00:56:33,144 INFO L276 IsEmpty]: Start isEmpty. Operand 2915 states and 3397 transitions. [2024-12-06 00:56:33,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-12-06 00:56:33,146 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:33,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:33,499 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 00:56:34,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:34,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3407 states to 2918 states and 3407 transitions. [2024-12-06 00:56:34,864 INFO L276 IsEmpty]: Start isEmpty. Operand 2918 states and 3407 transitions. [2024-12-06 00:56:34,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-12-06 00:56:34,865 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:34,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:34,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:35,127 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 159 proven. 90 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-06 00:56:35,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:35,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3408 states to 2919 states and 3408 transitions. [2024-12-06 00:56:35,336 INFO L276 IsEmpty]: Start isEmpty. Operand 2919 states and 3408 transitions. [2024-12-06 00:56:35,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-12-06 00:56:35,337 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:35,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:35,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:35,716 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 223 proven. 59 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 00:56:36,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:36,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3410 states to 2921 states and 3410 transitions. [2024-12-06 00:56:36,412 INFO L276 IsEmpty]: Start isEmpty. Operand 2921 states and 3410 transitions. [2024-12-06 00:56:36,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-12-06 00:56:36,413 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:36,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:36,554 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-12-06 00:56:38,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:38,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3458 states to 2962 states and 3458 transitions. [2024-12-06 00:56:38,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2962 states and 3458 transitions. [2024-12-06 00:56:38,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-12-06 00:56:38,188 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:38,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:38,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:38,507 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 199 proven. 49 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 00:56:40,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:40,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3511 states to 3001 states and 3511 transitions. [2024-12-06 00:56:40,720 INFO L276 IsEmpty]: Start isEmpty. Operand 3001 states and 3511 transitions. [2024-12-06 00:56:40,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-06 00:56:40,722 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:40,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:40,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:41,072 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 00:56:46,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:46,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3595 states to 3075 states and 3595 transitions. [2024-12-06 00:56:46,243 INFO L276 IsEmpty]: Start isEmpty. Operand 3075 states and 3595 transitions. [2024-12-06 00:56:46,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-06 00:56:46,244 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:46,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:46,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:46,643 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 00:56:51,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:51,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3680 states to 3144 states and 3680 transitions. [2024-12-06 00:56:51,512 INFO L276 IsEmpty]: Start isEmpty. Operand 3144 states and 3680 transitions. [2024-12-06 00:56:51,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-06 00:56:51,514 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:51,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:51,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:51,714 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 00:56:53,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:53,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3701 states to 3161 states and 3701 transitions. [2024-12-06 00:56:53,453 INFO L276 IsEmpty]: Start isEmpty. Operand 3161 states and 3701 transitions. [2024-12-06 00:56:53,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-06 00:56:53,455 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:53,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:53,652 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 00:56:58,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:56:58,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3783 states to 3229 states and 3783 transitions. [2024-12-06 00:56:58,727 INFO L276 IsEmpty]: Start isEmpty. Operand 3229 states and 3783 transitions. [2024-12-06 00:56:58,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-06 00:56:58,729 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:56:58,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:56:58,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:56:59,002 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 00:57:01,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:57:01,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3823 states to 3265 states and 3823 transitions. [2024-12-06 00:57:01,069 INFO L276 IsEmpty]: Start isEmpty. Operand 3265 states and 3823 transitions. [2024-12-06 00:57:01,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-06 00:57:01,071 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:57:01,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:57:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:57:01,261 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 00:57:03,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:57:03,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3875 states to 3311 states and 3875 transitions. [2024-12-06 00:57:03,590 INFO L276 IsEmpty]: Start isEmpty. Operand 3311 states and 3875 transitions. [2024-12-06 00:57:03,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-06 00:57:03,592 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:57:03,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:57:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:57:03,783 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 00:57:05,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:57:05,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3895 states to 3328 states and 3895 transitions. [2024-12-06 00:57:05,647 INFO L276 IsEmpty]: Start isEmpty. Operand 3328 states and 3895 transitions. [2024-12-06 00:57:05,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-12-06 00:57:05,649 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:57:05,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:57:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:57:05,975 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 173 proven. 104 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-12-06 00:57:06,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:57:06,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3896 states to 3329 states and 3896 transitions. [2024-12-06 00:57:06,194 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 3896 transitions. [2024-12-06 00:57:06,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-12-06 00:57:06,196 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:57:06,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:57:06,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:57:06,858 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 00:57:10,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:57:10,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3943 states to 3365 states and 3943 transitions. [2024-12-06 00:57:10,014 INFO L276 IsEmpty]: Start isEmpty. Operand 3365 states and 3943 transitions. [2024-12-06 00:57:10,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-12-06 00:57:10,016 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:57:10,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:57:10,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:57:10,313 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 00:57:13,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:57:13,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3980 states to 3398 states and 3980 transitions. [2024-12-06 00:57:13,256 INFO L276 IsEmpty]: Start isEmpty. Operand 3398 states and 3980 transitions. [2024-12-06 00:57:13,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-12-06 00:57:13,259 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:57:13,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:57:13,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:57:13,573 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 00:57:15,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:57:15,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4022 states to 3437 states and 4022 transitions. [2024-12-06 00:57:15,146 INFO L276 IsEmpty]: Start isEmpty. Operand 3437 states and 4022 transitions. [2024-12-06 00:57:15,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-12-06 00:57:15,148 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:57:15,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:57:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:57:15,398 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 00:57:16,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:57:16,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4024 states to 3438 states and 4024 transitions. [2024-12-06 00:57:16,159 INFO L276 IsEmpty]: Start isEmpty. Operand 3438 states and 4024 transitions. [2024-12-06 00:57:16,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 00:57:16,161 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:57:16,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:57:16,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:57:16,416 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 228 proven. 38 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 00:57:18,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:57:18,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4037 states to 3449 states and 4037 transitions. [2024-12-06 00:57:18,039 INFO L276 IsEmpty]: Start isEmpty. Operand 3449 states and 4037 transitions. [2024-12-06 00:57:18,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 00:57:18,041 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:57:18,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:57:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:57:18,692 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:57:25,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:57:25,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4107 states to 3510 states and 4107 transitions. [2024-12-06 00:57:25,231 INFO L276 IsEmpty]: Start isEmpty. Operand 3510 states and 4107 transitions. [2024-12-06 00:57:25,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 00:57:25,233 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:57:25,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:57:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:57:25,578 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:57:28,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:57:28,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4144 states to 3544 states and 4144 transitions. [2024-12-06 00:57:28,420 INFO L276 IsEmpty]: Start isEmpty. Operand 3544 states and 4144 transitions. [2024-12-06 00:57:28,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 00:57:28,421 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:57:28,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:57:28,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:57:28,748 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:57:30,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:57:30,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4175 states to 3574 states and 4175 transitions. [2024-12-06 00:57:30,526 INFO L276 IsEmpty]: Start isEmpty. Operand 3574 states and 4175 transitions. [2024-12-06 00:57:30,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 00:57:30,527 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:57:30,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:57:30,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:57:30,845 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:57:34,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:57:34,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4222 states to 3620 states and 4222 transitions. [2024-12-06 00:57:34,316 INFO L276 IsEmpty]: Start isEmpty. Operand 3620 states and 4222 transitions. [2024-12-06 00:57:34,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 00:57:34,318 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:57:34,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:57:34,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:57:34,645 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:57:38,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:57:38,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4255 states to 3652 states and 4255 transitions. [2024-12-06 00:57:38,227 INFO L276 IsEmpty]: Start isEmpty. Operand 3652 states and 4255 transitions. [2024-12-06 00:57:38,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 00:57:38,229 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:57:38,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:57:38,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:57:38,671 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:57:39,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:57:39,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4257 states to 3654 states and 4257 transitions. [2024-12-06 00:57:39,496 INFO L276 IsEmpty]: Start isEmpty. Operand 3654 states and 4257 transitions. [2024-12-06 00:57:39,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 00:57:39,498 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:57:39,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:57:39,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:57:39,834 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 00:57:41,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:57:41,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4271 states to 3669 states and 4271 transitions. [2024-12-06 00:57:41,675 INFO L276 IsEmpty]: Start isEmpty. Operand 3669 states and 4271 transitions. [2024-12-06 00:57:41,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 00:57:41,677 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:57:41,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:57:41,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:57:41,889 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-12-06 00:57:42,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:57:42,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 3686 states and 4287 transitions. [2024-12-06 00:57:42,966 INFO L276 IsEmpty]: Start isEmpty. Operand 3686 states and 4287 transitions. [2024-12-06 00:57:42,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 00:57:42,968 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:57:42,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:57:42,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:57:43,089 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-12-06 00:57:43,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:57:43,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 3687 states and 4287 transitions. [2024-12-06 00:57:43,881 INFO L276 IsEmpty]: Start isEmpty. Operand 3687 states and 4287 transitions. [2024-12-06 00:57:43,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 00:57:43,883 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:57:43,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:57:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:57:44,003 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-12-06 00:57:44,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:57:44,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 3688 states and 4287 transitions. [2024-12-06 00:57:44,715 INFO L276 IsEmpty]: Start isEmpty. Operand 3688 states and 4287 transitions. [2024-12-06 00:57:44,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-12-06 00:57:44,716 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:57:44,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:57:44,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:57:45,033 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 185 proven. 152 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-06 00:57:48,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:57:48,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4320 states to 3719 states and 4320 transitions. [2024-12-06 00:57:48,364 INFO L276 IsEmpty]: Start isEmpty. Operand 3719 states and 4320 transitions. [2024-12-06 00:57:48,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-06 00:57:48,366 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:57:48,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:57:48,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:57:48,824 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-12-06 00:57:50,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:57:50,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4335 states to 3731 states and 4335 transitions. [2024-12-06 00:57:50,774 INFO L276 IsEmpty]: Start isEmpty. Operand 3731 states and 4335 transitions. [2024-12-06 00:57:50,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-06 00:57:50,776 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:57:50,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:57:50,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:57:51,469 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 125 proven. 170 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-12-06 00:57:57,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:57:57,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4484 states to 3858 states and 4484 transitions. [2024-12-06 00:57:57,457 INFO L276 IsEmpty]: Start isEmpty. Operand 3858 states and 4484 transitions. [2024-12-06 00:57:57,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-12-06 00:57:57,459 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:57:57,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:57:57,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:57:58,223 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 00:58:01,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:58:01,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4553 states to 3919 states and 4553 transitions. [2024-12-06 00:58:01,445 INFO L276 IsEmpty]: Start isEmpty. Operand 3919 states and 4553 transitions. [2024-12-06 00:58:01,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-12-06 00:58:01,447 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:58:01,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:58:01,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:58:01,758 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 00:58:02,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:58:02,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4559 states to 3924 states and 4559 transitions. [2024-12-06 00:58:02,190 INFO L276 IsEmpty]: Start isEmpty. Operand 3924 states and 4559 transitions. [2024-12-06 00:58:02,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-12-06 00:58:02,192 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:58:02,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:58:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:58:02,315 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2024-12-06 00:58:02,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:58:02,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4559 states to 3925 states and 4559 transitions. [2024-12-06 00:58:02,508 INFO L276 IsEmpty]: Start isEmpty. Operand 3925 states and 4559 transitions. [2024-12-06 00:58:02,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-12-06 00:58:02,511 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 00:58:02,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 00:58:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 00:58:03,167 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 279 proven. 206 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-12-06 00:58:06,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 00:58:06,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4609 states to 3977 states and 4609 transitions. [2024-12-06 00:58:06,243 INFO L276 IsEmpty]: Start isEmpty. Operand 3977 states and 4609 transitions. [2024-12-06 00:58:06,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-06 00:58:06,245 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 141 iterations. [2024-12-06 00:58:06,251 INFO L726 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-12-06 00:58:45,292 INFO L77 FloydHoareUtils]: At program point L102(lines 102 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,293 INFO L77 FloydHoareUtils]: At program point L598(line 598) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,293 INFO L77 FloydHoareUtils]: At program point L334(lines 334 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,293 INFO L77 FloydHoareUtils]: At program point L302(lines 302 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,293 INFO L77 FloydHoareUtils]: At program point L170(lines 170 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,293 INFO L77 FloydHoareUtils]: At program point L204(lines 204 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,293 INFO L77 FloydHoareUtils]: At program point L72(lines 72 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,293 INFO L77 FloydHoareUtils]: At program point L271(lines 271 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,293 INFO L77 FloydHoareUtils]: At program point L139(lines 139 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,294 INFO L77 FloydHoareUtils]: At program point L371(lines 371 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,294 INFO L77 FloydHoareUtils]: At program point L107(lines 107 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,294 INFO L77 FloydHoareUtils]: At program point L41(lines 41 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,294 INFO L77 FloydHoareUtils]: At program point L339(lines 339 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,295 INFO L77 FloydHoareUtils]: At program point L207(lines 207 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,295 INFO L77 FloydHoareUtils]: At program point L75(lines 75 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,295 INFO L77 FloydHoareUtils]: At program point L373(lines 373 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,295 INFO L77 FloydHoareUtils]: At program point L241(lines 241 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,295 INFO L77 FloydHoareUtils]: At program point L175(lines 175 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,295 INFO L77 FloydHoareUtils]: At program point L275(lines 275 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,295 INFO L77 FloydHoareUtils]: At program point L375(lines 375 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,295 INFO L77 FloydHoareUtils]: At program point L309(lines 309 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,295 INFO L77 FloydHoareUtils]: At program point L45(lines 45 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,295 INFO L77 FloydHoareUtils]: At program point L343(lines 343 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,296 INFO L77 FloydHoareUtils]: At program point L112(lines 112 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,296 INFO L77 FloydHoareUtils]: At program point L476-1(lines 40 585) the Hoare annotation is: (not (and (< 13 ~a8~0) (= ~a7~0 1))) [2024-12-06 00:58:45,296 INFO L77 FloydHoareUtils]: At program point L278(lines 278 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,296 INFO L77 FloydHoareUtils]: At program point L146(lines 146 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,296 INFO L77 FloydHoareUtils]: At program point L213(lines 213 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,296 INFO L77 FloydHoareUtils]: At program point L82(lines 82 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,296 INFO L77 FloydHoareUtils]: At program point L479-1(lines 40 585) the Hoare annotation is: (not (and (< 13 ~a8~0) (= ~a7~0 1))) [2024-12-06 00:58:45,296 INFO L77 FloydHoareUtils]: At program point L347(lines 347 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,297 INFO L77 FloydHoareUtils]: At program point L248(lines 248 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,297 INFO L75 FloydHoareUtils]: For program point L480(line 480) no Hoare annotation was computed. [2024-12-06 00:58:45,297 INFO L77 FloydHoareUtils]: At program point L183(lines 183 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,297 INFO L77 FloydHoareUtils]: At program point L150(lines 150 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,297 INFO L77 FloydHoareUtils]: At program point L382(lines 382 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,297 INFO L77 FloydHoareUtils]: At program point L316(lines 316 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,297 INFO L77 FloydHoareUtils]: At program point L283(lines 283 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,298 INFO L77 FloydHoareUtils]: At program point L118(lines 118 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,298 INFO L77 FloydHoareUtils]: At program point L218(lines 218 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,298 INFO L77 FloydHoareUtils]: At program point L53(lines 53 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,298 INFO L77 FloydHoareUtils]: At program point L154(lines 154 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,298 INFO L77 FloydHoareUtils]: At program point L188(lines 188 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,298 INFO L77 FloydHoareUtils]: At program point L387(lines 387 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,298 INFO L77 FloydHoareUtils]: At program point L288(lines 288 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,299 INFO L77 FloydHoareUtils]: At program point L255(lines 255 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,299 INFO L77 FloydHoareUtils]: At program point L90(lines 90 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,299 INFO L77 FloydHoareUtils]: At program point L355(lines 355 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,299 INFO L77 FloydHoareUtils]: At program point L322(lines 322 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,299 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-12-06 00:58:45,299 INFO L77 FloydHoareUtils]: At program point L124(lines 124 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,299 INFO L77 FloydHoareUtils]: At program point L587(lines 587 604) the Hoare annotation is: true [2024-12-06 00:58:45,299 INFO L77 FloydHoareUtils]: At program point L224(lines 224 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,299 INFO L77 FloydHoareUtils]: At program point L158(lines 158 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,300 INFO L77 FloydHoareUtils]: At program point L59(lines 59 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,300 INFO L77 FloydHoareUtils]: At program point L94(lines 94 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,300 INFO L77 FloydHoareUtils]: At program point L392(lines 392 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,300 INFO L77 FloydHoareUtils]: At program point L326(lines 326 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,300 INFO L77 FloydHoareUtils]: At program point L260(lines 260 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,300 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-12-06 00:58:45,300 INFO L77 FloydHoareUtils]: At program point L228(lines 228 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,301 INFO L77 FloydHoareUtils]: At program point L162(lines 162 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,301 INFO L77 FloydHoareUtils]: At program point L129(lines 129 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,301 INFO L77 FloydHoareUtils]: At program point L328(lines 328 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,301 INFO L77 FloydHoareUtils]: At program point L196(lines 196 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,301 INFO L77 FloydHoareUtils]: At program point L64(lines 64 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,301 INFO L77 FloydHoareUtils]: At program point L593-2(lines 593 603) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,301 INFO L77 FloydHoareUtils]: At program point L296(lines 296 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,301 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 40 585) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,302 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 480) no Hoare annotation was computed. [2024-12-06 00:58:45,302 INFO L77 FloydHoareUtils]: At program point L363(lines 363 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,302 INFO L77 FloydHoareUtils]: At program point L199(lines 199 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,302 INFO L77 FloydHoareUtils]: At program point L365(lines 365 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,302 INFO L77 FloydHoareUtils]: At program point L266(lines 266 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,302 INFO L77 FloydHoareUtils]: At program point L233(lines 233 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,302 INFO L77 FloydHoareUtils]: At program point L134(lines 134 400) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-12-06 00:58:45,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 12:58:45 ImpRootNode [2024-12-06 00:58:45,315 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 00:58:45,316 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 00:58:45,316 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 00:58:45,316 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 00:58:45,316 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:54:37" (3/4) ... [2024-12-06 00:58:45,318 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-06 00:58:45,330 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 119 nodes and edges [2024-12-06 00:58:45,331 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-12-06 00:58:45,332 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-12-06 00:58:45,333 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-12-06 00:58:45,444 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_530f950f-b2df-427c-aa9a-2703b5ac6be0/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 00:58:45,444 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_530f950f-b2df-427c-aa9a-2703b5ac6be0/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 00:58:45,445 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 00:58:45,445 INFO L158 Benchmark]: Toolchain (without parser) took 249848.34ms. Allocated memory was 142.6MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 115.0MB in the beginning and 2.3GB in the end (delta: -2.1GB). Peak memory consumption was 368.8MB. Max. memory is 16.1GB. [2024-12-06 00:58:45,445 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 142.6MB. Free memory is still 83.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 00:58:45,445 INFO L158 Benchmark]: CACSL2BoogieTranslator took 380.20ms. Allocated memory is still 142.6MB. Free memory was 115.0MB in the beginning and 87.8MB in the end (delta: 27.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-06 00:58:45,446 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.79ms. Allocated memory is still 142.6MB. Free memory was 87.8MB in the beginning and 82.5MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 00:58:45,446 INFO L158 Benchmark]: Boogie Preprocessor took 49.96ms. Allocated memory is still 142.6MB. Free memory was 82.5MB in the beginning and 78.4MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 00:58:45,446 INFO L158 Benchmark]: RCFGBuilder took 1125.72ms. Allocated memory is still 142.6MB. Free memory was 78.2MB in the beginning and 65.3MB in the end (delta: 12.9MB). Peak memory consumption was 34.9MB. Max. memory is 16.1GB. [2024-12-06 00:58:45,446 INFO L158 Benchmark]: CodeCheck took 248110.58ms. Allocated memory was 142.6MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 65.3MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 309.0MB. Max. memory is 16.1GB. [2024-12-06 00:58:45,446 INFO L158 Benchmark]: Witness Printer took 128.97ms. Allocated memory is still 2.7GB. Free memory was 2.3GB in the beginning and 2.3GB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 00:58:45,448 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, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 209.0s, OverallIterations: 141, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 555067 SdHoareTripleChecker+Valid, 1140.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 552986 mSDsluCounter, 73420 SdHoareTripleChecker+Invalid, 979.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 62762 mSDsCounter, 116292 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1194882 IncrementalHoareTripleChecker+Invalid, 1311174 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 116292 mSolverCounterUnsat, 10658 mSDtfsCounter, 1194882 mSolverCounterSat, 6.9s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 177913 GetRequests, 167827 SyntacticMatches, 8706 SemanticMatches, 1380 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1411136 ImplicationChecksByTransitivity, 151.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.7s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 32.2s InterpolantComputationTime, 25839 NumberOfCodeBlocks, 25839 NumberOfCodeBlocksAsserted, 140 NumberOfCheckSat, 25699 ConstructedInterpolants, 0 QuantifiedInterpolants, 199020 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 140 InterpolantComputations, 38 PerfectInterpolantSequences, 21411/27152 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: 480]: 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: 40]: Location Invariant Derived location invariant: !(((((!((((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1)) && (a8 == 15)) && !((((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a21 == 1)) && (a8 == 15)) && (a16 == 4))) && !(((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1))) && (13 < a8)) && (a7 == 1)) && !((((((a20 != 1) && (a12 == 8)) && (14 == a8)) && (a17 != 1)) && (a21 == 1)) && (a16 == 4))) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: !(((((!((((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1)) && (a8 == 15)) && !((((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a21 == 1)) && (a8 == 15)) && (a16 == 4))) && !(((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1))) && (13 < a8)) && (a7 == 1)) && !((((((a20 != 1) && (a12 == 8)) && (14 == a8)) && (a17 != 1)) && (a21 == 1)) && (a16 == 4))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 142.6MB. Free memory is still 83.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 380.20ms. Allocated memory is still 142.6MB. Free memory was 115.0MB in the beginning and 87.8MB in the end (delta: 27.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.79ms. Allocated memory is still 142.6MB. Free memory was 87.8MB in the beginning and 82.5MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.96ms. Allocated memory is still 142.6MB. Free memory was 82.5MB in the beginning and 78.4MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1125.72ms. Allocated memory is still 142.6MB. Free memory was 78.2MB in the beginning and 65.3MB in the end (delta: 12.9MB). Peak memory consumption was 34.9MB. Max. memory is 16.1GB. * CodeCheck took 248110.58ms. Allocated memory was 142.6MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 65.3MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 309.0MB. Max. memory is 16.1GB. * Witness Printer took 128.97ms. Allocated memory is still 2.7GB. Free memory was 2.3GB in the beginning and 2.3GB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-12-06 00:58:45,462 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_530f950f-b2df-427c-aa9a-2703b5ac6be0/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE