./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7848f3b-85a8-421d-8a3f-a414d540b6f2/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7848f3b-85a8-421d-8a3f-a414d540b6f2/bin/ukojak-verify-ImItNfHLgk/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7848f3b-85a8-421d-8a3f-a414d540b6f2/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7848f3b-85a8-421d-8a3f-a414d540b6f2/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label05.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7848f3b-85a8-421d-8a3f-a414d540b6f2/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7848f3b-85a8-421d-8a3f-a414d540b6f2/bin/ukojak-verify-ImItNfHLgk --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 5958333028b8f64162c92b3e987d78deaf3d77dc73071d1f6edce3e1a07212a4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 23:59:36,136 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:59:36,221 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7848f3b-85a8-421d-8a3f-a414d540b6f2/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-08 23:59:36,226 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:59:36,227 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 23:59:36,248 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:59:36,249 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:59:36,250 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-08 23:59:36,250 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:59:36,251 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:59:36,252 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:59:36,252 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:59:36,253 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:59:36,253 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:59:36,254 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:59:36,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:59:36,255 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:59:36,255 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:59:36,256 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:59:36,256 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:59:36,257 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:59:36,261 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:59:36,261 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:59:36,262 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 23:59:36,262 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 23:59:36,262 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 23:59:36,263 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:59:36,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 23:59:36,264 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:59:36,264 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:59:36,265 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:59:36,265 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 23:59:36,266 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:59:36,266 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7848f3b-85a8-421d-8a3f-a414d540b6f2/bin/ukojak-verify-ImItNfHLgk/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_b7848f3b-85a8-421d-8a3f-a414d540b6f2/bin/ukojak-verify-ImItNfHLgk 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 -> 5958333028b8f64162c92b3e987d78deaf3d77dc73071d1f6edce3e1a07212a4 [2024-11-08 23:59:36,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:59:36,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:59:36,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:59:36,624 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:59:36,626 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:59:36,627 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7848f3b-85a8-421d-8a3f-a414d540b6f2/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/eca-rers2012/Problem01_label05.c Unable to find full path for "g++" [2024-11-08 23:59:38,618 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:59:38,907 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:59:38,907 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7848f3b-85a8-421d-8a3f-a414d540b6f2/sv-benchmarks/c/eca-rers2012/Problem01_label05.c [2024-11-08 23:59:38,928 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7848f3b-85a8-421d-8a3f-a414d540b6f2/bin/ukojak-verify-ImItNfHLgk/data/990a56823/ace54298a591458a820593954f579910/FLAGb879e5306 [2024-11-08 23:59:39,207 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7848f3b-85a8-421d-8a3f-a414d540b6f2/bin/ukojak-verify-ImItNfHLgk/data/990a56823/ace54298a591458a820593954f579910 [2024-11-08 23:59:39,209 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:59:39,211 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:59:39,213 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:59:39,213 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:59:39,218 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:59:39,219 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:59:39" (1/1) ... [2024-11-08 23:59:39,220 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25f495de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:59:39, skipping insertion in model container [2024-11-08 23:59:39,220 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:59:39" (1/1) ... [2024-11-08 23:59:39,262 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:59:39,658 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_b7848f3b-85a8-421d-8a3f-a414d540b6f2/sv-benchmarks/c/eca-rers2012/Problem01_label05.c[17240,17253] [2024-11-08 23:59:39,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:59:39,732 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:59:39,846 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_b7848f3b-85a8-421d-8a3f-a414d540b6f2/sv-benchmarks/c/eca-rers2012/Problem01_label05.c[17240,17253] [2024-11-08 23:59:39,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:59:39,885 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:59:39,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:59:39 WrapperNode [2024-11-08 23:59:39,886 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:59:39,887 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:59:39,888 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:59:39,888 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:59:39,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:59:39" (1/1) ... [2024-11-08 23:59:39,913 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:59:39" (1/1) ... [2024-11-08 23:59:39,993 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-08 23:59:39,993 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:59:39,994 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:59:39,995 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:59:39,996 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:59:40,003 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:59:39" (1/1) ... [2024-11-08 23:59:40,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:59:39" (1/1) ... [2024-11-08 23:59:40,011 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:59:39" (1/1) ... [2024-11-08 23:59:40,013 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:59:39" (1/1) ... [2024-11-08 23:59:40,052 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:59:39" (1/1) ... [2024-11-08 23:59:40,065 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:59:39" (1/1) ... [2024-11-08 23:59:40,077 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:59:39" (1/1) ... [2024-11-08 23:59:40,084 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:59:39" (1/1) ... [2024-11-08 23:59:40,095 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:59:40,096 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:59:40,096 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:59:40,096 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:59:40,097 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:59:39" (1/1) ... [2024-11-08 23:59:40,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 23:59:40,115 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7848f3b-85a8-421d-8a3f-a414d540b6f2/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 23:59:40,129 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7848f3b-85a8-421d-8a3f-a414d540b6f2/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 23:59:40,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7848f3b-85a8-421d-8a3f-a414d540b6f2/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 23:59:40,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:59:40,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 23:59:40,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:59:40,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:59:40,254 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:59:40,256 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:59:41,400 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-08 23:59:41,401 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:59:41,726 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:59:41,727 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:59:41,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:59:41 BoogieIcfgContainer [2024-11-08 23:59:41,728 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:59:41,729 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 23:59:41,729 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 23:59:41,740 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 23:59:41,741 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:59:41" (1/1) ... [2024-11-08 23:59:41,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:59:41,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:59:41,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-11-08 23:59:41,825 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-11-08 23:59:41,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-08 23:59:41,828 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:59:41,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:59:42,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:42,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:59:43,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:59:43,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 145 states and 261 transitions. [2024-11-08 23:59:43,180 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 261 transitions. [2024-11-08 23:59:43,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-08 23:59:43,184 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:59:43,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:59:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:43,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:59:44,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:59:44,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 215 states and 339 transitions. [2024-11-08 23:59:44,291 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 339 transitions. [2024-11-08 23:59:44,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-08 23:59:44,293 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:59:44,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:59:44,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:44,405 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:59:44,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:59:44,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 220 states and 346 transitions. [2024-11-08 23:59:44,497 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 346 transitions. [2024-11-08 23:59:44,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-08 23:59:44,499 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:59:44,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:59:44,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:44,661 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 23:59:45,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:59:45,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 291 states and 425 transitions. [2024-11-08 23:59:45,310 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 425 transitions. [2024-11-08 23:59:45,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 23:59:45,312 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:59:45,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:59:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:45,508 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:59:45,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:59:45,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 307 states and 444 transitions. [2024-11-08 23:59:45,831 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 444 transitions. [2024-11-08 23:59:45,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-08 23:59:45,839 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:59:45,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:59:45,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:46,067 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 23:59:46,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:59:46,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 317 states and 457 transitions. [2024-11-08 23:59:46,342 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 457 transitions. [2024-11-08 23:59:46,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 23:59:46,343 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:59:46,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:59:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:46,473 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 23:59:46,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:59:46,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 338 states and 481 transitions. [2024-11-08 23:59:46,894 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 481 transitions. [2024-11-08 23:59:46,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 23:59:46,896 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:59:46,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:59:46,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:47,224 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 23:59:47,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:59:47,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 343 states and 489 transitions. [2024-11-08 23:59:47,694 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 489 transitions. [2024-11-08 23:59:47,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 23:59:47,696 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:59:47,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:59:47,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:47,989 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 23:59:48,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:59:48,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 353 states and 500 transitions. [2024-11-08 23:59:48,170 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 500 transitions. [2024-11-08 23:59:48,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 23:59:48,171 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:59:48,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:59:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:48,364 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 23:59:48,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:59:48,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 359 states and 506 transitions. [2024-11-08 23:59:48,543 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 506 transitions. [2024-11-08 23:59:48,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-08 23:59:48,545 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:59:48,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:59:48,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:48,631 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 23:59:48,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:59:48,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 365 states and 512 transitions. [2024-11-08 23:59:48,694 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 512 transitions. [2024-11-08 23:59:48,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-08 23:59:48,695 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:59:48,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:59:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:48,829 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-08 23:59:49,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:59:49,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 373 states and 525 transitions. [2024-11-08 23:59:49,138 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 525 transitions. [2024-11-08 23:59:49,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 23:59:49,139 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:59:49,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:59:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:49,244 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-08 23:59:49,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:59:49,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 382 states and 537 transitions. [2024-11-08 23:59:49,595 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 537 transitions. [2024-11-08 23:59:49,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 23:59:49,597 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:59:49,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:59:49,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:49,689 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-08 23:59:49,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:59:49,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 388 states and 544 transitions. [2024-11-08 23:59:49,856 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 544 transitions. [2024-11-08 23:59:49,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 23:59:49,857 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:59:49,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:59:49,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:50,009 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-08 23:59:50,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:59:50,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 390 states and 546 transitions. [2024-11-08 23:59:50,059 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 546 transitions. [2024-11-08 23:59:50,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 23:59:50,060 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:59:50,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:59:50,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:50,253 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-08 23:59:50,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:59:50,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 398 states and 556 transitions. [2024-11-08 23:59:50,652 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 556 transitions. [2024-11-08 23:59:50,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 23:59:50,654 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:59:50,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:59:50,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:50,876 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 46 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-08 23:59:50,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:59:50,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 400 states and 558 transitions. [2024-11-08 23:59:50,929 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 558 transitions. [2024-11-08 23:59:50,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 23:59:50,931 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:59:50,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:59:50,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:51,145 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 46 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-08 23:59:51,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:59:51,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 402 states and 560 transitions. [2024-11-08 23:59:51,198 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 560 transitions. [2024-11-08 23:59:51,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 23:59:51,200 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:59:51,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:59:51,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:51,448 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 69 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 23:59:52,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:59:52,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 413 states and 574 transitions. [2024-11-08 23:59:52,137 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 574 transitions. [2024-11-08 23:59:52,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 23:59:52,138 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:59:52,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:59:52,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:52,352 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 69 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 23:59:52,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:59:52,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 423 states and 585 transitions. [2024-11-08 23:59:52,615 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 585 transitions. [2024-11-08 23:59:52,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 23:59:52,617 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:59:52,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:59:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:52,827 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 23:59:53,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:59:53,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 440 states and 604 transitions. [2024-11-08 23:59:53,178 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 604 transitions. [2024-11-08 23:59:53,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 23:59:53,180 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:59:53,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:59:53,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:53,266 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 23:59:53,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:59:53,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 454 states and 618 transitions. [2024-11-08 23:59:53,376 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 618 transitions. [2024-11-08 23:59:53,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 23:59:53,378 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:59:53,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:59:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:53,553 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-08 23:59:54,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:59:54,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 484 states and 655 transitions. [2024-11-08 23:59:54,475 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 655 transitions. [2024-11-08 23:59:54,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 23:59:54,477 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:59:54,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:59:54,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:54,631 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-08 23:59:55,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:59:55,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 507 states and 679 transitions. [2024-11-08 23:59:55,321 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 679 transitions. [2024-11-08 23:59:55,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 23:59:55,323 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:59:55,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:59:55,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:55,438 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 23:59:55,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:59:55,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 536 states and 709 transitions. [2024-11-08 23:59:55,677 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 709 transitions. [2024-11-08 23:59:55,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-08 23:59:55,678 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:59:55,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:59:55,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:55,843 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 23:59:56,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:59:56,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 584 states and 761 transitions. [2024-11-08 23:59:56,543 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 761 transitions. [2024-11-08 23:59:56,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-08 23:59:56,545 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:59:56,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:59:56,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:56,714 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-08 23:59:56,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:59:56,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 598 states and 775 transitions. [2024-11-08 23:59:56,910 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 775 transitions. [2024-11-08 23:59:56,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-08 23:59:56,912 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:59:56,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:59:56,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:57,252 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 84 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 23:59:57,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:59:57,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 603 states and 783 transitions. [2024-11-08 23:59:57,793 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 783 transitions. [2024-11-08 23:59:57,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-08 23:59:57,794 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:59:57,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:59:57,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:58,149 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-08 23:59:59,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:59:59,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 632 states and 815 transitions. [2024-11-08 23:59:59,217 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 815 transitions. [2024-11-08 23:59:59,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-08 23:59:59,219 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:59:59,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:59:59,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:59,467 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 84 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 23:59:59,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 23:59:59,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 642 states and 826 transitions. [2024-11-08 23:59:59,771 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 826 transitions. [2024-11-08 23:59:59,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-08 23:59:59,772 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 23:59:59,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:59:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:00:00,010 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 84 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 00:00:00,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:00:00,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 648 states and 832 transitions. [2024-11-09 00:00:00,149 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 832 transitions. [2024-11-09 00:00:00,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-09 00:00:00,151 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:00:00,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:00:00,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:00:00,333 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-09 00:00:00,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:00:00,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 662 states and 848 transitions. [2024-11-09 00:00:00,956 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 848 transitions. [2024-11-09 00:00:00,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-09 00:00:00,957 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:00:00,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:00:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:00:01,129 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:00:01,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:00:01,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 701 states and 891 transitions. [2024-11-09 00:00:01,419 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 891 transitions. [2024-11-09 00:00:01,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-09 00:00:01,421 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:00:01,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:00:01,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:00:01,760 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:00:02,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:00:02,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 771 states and 969 transitions. [2024-11-09 00:00:02,812 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 969 transitions. [2024-11-09 00:00:02,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-09 00:00:02,814 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:00:02,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:00:02,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:00:03,336 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:00:05,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:00:05,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 840 states and 1059 transitions. [2024-11-09 00:00:05,399 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1059 transitions. [2024-11-09 00:00:05,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-09 00:00:05,401 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:00:05,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:00:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:00:05,722 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:00:07,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:00:07,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 908 states and 1131 transitions. [2024-11-09 00:00:07,441 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1131 transitions. [2024-11-09 00:00:07,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-09 00:00:07,444 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:00:07,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:00:07,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:00:07,596 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-09 00:00:07,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:00:07,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 909 states and 1131 transitions. [2024-11-09 00:00:07,949 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1131 transitions. [2024-11-09 00:00:07,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-09 00:00:07,951 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:00:07,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:00:07,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:00:08,186 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:00:08,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:00:08,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 937 states and 1161 transitions. [2024-11-09 00:00:08,900 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1161 transitions. [2024-11-09 00:00:08,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-09 00:00:08,901 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:00:08,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:00:08,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:00:09,198 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 101 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 00:00:10,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:00:10,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 971 states and 1204 transitions. [2024-11-09 00:00:10,476 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1204 transitions. [2024-11-09 00:00:10,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-09 00:00:10,478 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:00:10,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:00:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:00:10,723 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 101 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 00:00:11,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:00:11,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1246 states to 1010 states and 1246 transitions. [2024-11-09 00:00:11,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1246 transitions. [2024-11-09 00:00:11,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-09 00:00:11,806 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:00:11,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:00:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:00:12,067 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 101 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 00:00:12,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:00:12,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1016 states and 1252 transitions. [2024-11-09 00:00:12,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1252 transitions. [2024-11-09 00:00:12,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-09 00:00:12,277 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:00:12,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:00:12,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:00:12,696 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:00:14,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:00:14,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1087 states and 1323 transitions. [2024-11-09 00:00:14,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1323 transitions. [2024-11-09 00:00:14,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-09 00:00:14,100 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:00:14,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:00:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:00:14,340 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 126 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 00:00:15,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:00:15,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1106 states and 1344 transitions. [2024-11-09 00:00:15,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1344 transitions. [2024-11-09 00:00:15,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-09 00:00:15,190 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:00:15,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:00:15,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:00:15,812 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 97 proven. 32 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 00:00:17,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:00:17,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1137 states and 1385 transitions. [2024-11-09 00:00:17,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1385 transitions. [2024-11-09 00:00:17,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 00:00:17,827 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:00:17,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:00:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:00:18,142 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 87 proven. 3 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-09 00:00:18,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:00:18,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1140 states and 1390 transitions. [2024-11-09 00:00:18,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1390 transitions. [2024-11-09 00:00:18,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-09 00:00:18,744 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:00:18,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:00:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:00:18,937 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 97 proven. 29 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 00:00:19,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:00:19,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1157 states and 1410 transitions. [2024-11-09 00:00:19,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1410 transitions. [2024-11-09 00:00:19,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-09 00:00:19,881 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:00:19,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:00:19,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:00:20,045 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 97 proven. 29 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 00:00:20,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:00:20,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1176 states and 1431 transitions. [2024-11-09 00:00:20,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1431 transitions. [2024-11-09 00:00:20,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-09 00:00:20,885 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:00:20,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:00:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:00:21,094 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 97 proven. 29 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 00:00:21,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:00:21,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1179 states and 1433 transitions. [2024-11-09 00:00:21,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1433 transitions. [2024-11-09 00:00:21,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-09 00:00:21,732 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:00:21,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:00:21,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:00:21,904 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 127 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 00:00:22,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:00:22,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1195 states and 1453 transitions. [2024-11-09 00:00:22,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1453 transitions. [2024-11-09 00:00:22,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-09 00:00:22,232 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:00:22,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:00:22,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:00:22,580 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 106 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 00:00:23,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:00:23,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1206 states and 1466 transitions. [2024-11-09 00:00:23,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1466 transitions. [2024-11-09 00:00:23,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-09 00:00:23,472 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:00:23,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:00:23,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:00:23,679 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 106 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 00:00:23,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:00:23,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1470 states to 1210 states and 1470 transitions. [2024-11-09 00:00:23,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1470 transitions. [2024-11-09 00:00:23,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-09 00:00:23,959 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:00:23,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:00:23,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:00:24,234 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-09 00:00:24,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:00:24,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1231 states and 1496 transitions. [2024-11-09 00:00:24,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1496 transitions. [2024-11-09 00:00:24,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-09 00:00:24,912 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:00:24,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:00:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:00:25,173 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 114 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-09 00:00:26,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:00:26,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1272 states and 1542 transitions. [2024-11-09 00:00:26,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1542 transitions. [2024-11-09 00:00:26,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-09 00:00:26,894 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:00:26,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:00:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:00:27,506 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:00:28,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:00:28,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1305 states and 1583 transitions. [2024-11-09 00:00:28,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1583 transitions. [2024-11-09 00:00:28,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-09 00:00:28,973 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:00:28,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:00:29,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:00:29,492 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:00:30,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:00:30,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1319 states and 1600 transitions. [2024-11-09 00:00:30,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1600 transitions. [2024-11-09 00:00:30,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-09 00:00:30,692 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:00:30,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:00:30,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:00:31,098 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:00:32,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:00:32,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1621 states to 1338 states and 1621 transitions. [2024-11-09 00:00:32,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 1621 transitions. [2024-11-09 00:00:32,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-09 00:00:32,037 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:00:32,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:00:32,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:00:32,146 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-09 00:00:32,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:00:32,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1354 states and 1638 transitions. [2024-11-09 00:00:32,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1638 transitions. [2024-11-09 00:00:32,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-09 00:00:32,499 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:00:32,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:00:32,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:00:32,643 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-09 00:00:33,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:00:33,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1355 states and 1641 transitions. [2024-11-09 00:00:33,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1641 transitions. [2024-11-09 00:00:33,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-09 00:00:33,077 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:00:33,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:00:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:00:33,301 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 76 proven. 3 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-09 00:00:33,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:00:33,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1644 states to 1358 states and 1644 transitions. [2024-11-09 00:00:33,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1644 transitions. [2024-11-09 00:00:33,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-09 00:00:33,525 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:00:33,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:00:33,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:00:33,645 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-09 00:00:34,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:00:34,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1383 states and 1670 transitions. [2024-11-09 00:00:34,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 1670 transitions. [2024-11-09 00:00:34,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-09 00:00:34,010 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:00:34,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:00:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:00:34,673 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:00:38,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:00:38,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1442 states and 1742 transitions. [2024-11-09 00:00:38,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1442 states and 1742 transitions. [2024-11-09 00:00:38,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-09 00:00:38,799 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:00:38,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:00:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:00:39,214 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:00:41,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:00:41,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1458 states and 1766 transitions. [2024-11-09 00:00:41,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 1766 transitions. [2024-11-09 00:00:41,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-09 00:00:41,304 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:00:41,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:00:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:00:41,626 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:00:42,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:00:42,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1770 states to 1460 states and 1770 transitions. [2024-11-09 00:00:42,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 1770 transitions. [2024-11-09 00:00:42,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-09 00:00:42,279 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:00:42,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:00:42,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:00:42,755 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:00:43,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:00:43,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1462 states and 1772 transitions. [2024-11-09 00:00:43,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 1772 transitions. [2024-11-09 00:00:43,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-09 00:00:43,331 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:00:43,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:00:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:00:43,692 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:00:44,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:00:44,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1479 states and 1789 transitions. [2024-11-09 00:00:44,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 1789 transitions. [2024-11-09 00:00:44,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-09 00:00:44,310 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:00:44,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:00:44,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:00:44,677 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-09 00:00:45,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:00:45,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1832 states to 1514 states and 1832 transitions. [2024-11-09 00:00:45,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 1832 transitions. [2024-11-09 00:00:45,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-09 00:00:45,972 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:00:45,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:00:45,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:00:46,106 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-09 00:00:46,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:00:46,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1515 states and 1833 transitions. [2024-11-09 00:00:46,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 1833 transitions. [2024-11-09 00:00:46,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-09 00:00:46,189 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:00:46,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:00:46,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:00:46,611 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 120 proven. 51 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 00:00:46,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:00:46,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1516 states and 1834 transitions. [2024-11-09 00:00:46,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 1834 transitions. [2024-11-09 00:00:46,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-09 00:00:46,866 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:00:46,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:00:46,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:00:46,951 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-09 00:00:47,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:00:47,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1545 states and 1867 transitions. [2024-11-09 00:00:47,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 1867 transitions. [2024-11-09 00:00:47,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-09 00:00:47,681 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:00:47,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:00:47,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:00:47,921 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 188 proven. 6 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-09 00:00:49,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:00:49,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1564 states and 1886 transitions. [2024-11-09 00:00:49,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 1886 transitions. [2024-11-09 00:00:49,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-09 00:00:49,207 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:00:49,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:00:49,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:00:49,525 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 188 proven. 6 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-09 00:00:51,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:00:51,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1905 states to 1581 states and 1905 transitions. [2024-11-09 00:00:51,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 1905 transitions. [2024-11-09 00:00:51,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-09 00:00:51,174 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:00:51,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:00:51,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:00:51,352 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 188 proven. 6 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-09 00:00:52,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:00:52,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1907 states to 1584 states and 1907 transitions. [2024-11-09 00:00:52,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 1907 transitions. [2024-11-09 00:00:52,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-09 00:00:52,003 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:00:52,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:00:52,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:00:52,279 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 127 proven. 44 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 00:00:53,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:00:53,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1593 states and 1916 transitions. [2024-11-09 00:00:53,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 1916 transitions. [2024-11-09 00:00:53,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-09 00:00:53,205 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:00:53,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:00:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:00:53,748 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:00:55,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:00:55,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1608 states and 1936 transitions. [2024-11-09 00:00:55,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 1936 transitions. [2024-11-09 00:00:55,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-09 00:00:55,924 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:00:55,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:00:55,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:00:56,237 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:00:57,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:00:57,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1959 states to 1630 states and 1959 transitions. [2024-11-09 00:00:57,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 1959 transitions. [2024-11-09 00:00:57,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-09 00:00:57,348 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:00:57,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:00:57,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:00:57,720 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:00:58,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:00:58,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1979 states to 1649 states and 1979 transitions. [2024-11-09 00:00:58,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 1979 transitions. [2024-11-09 00:00:58,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-09 00:00:58,683 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:00:58,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:00:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:00:58,831 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-09 00:00:59,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:00:59,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1981 states to 1650 states and 1981 transitions. [2024-11-09 00:00:59,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 1981 transitions. [2024-11-09 00:00:59,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-09 00:00:59,230 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:00:59,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:00:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:01:00,185 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 191 proven. 38 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-09 00:01:01,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:01:01,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2003 states to 1667 states and 2003 transitions. [2024-11-09 00:01:01,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2003 transitions. [2024-11-09 00:01:01,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-09 00:01:01,329 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:01:01,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:01:01,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:01:01,798 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 191 proven. 38 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-09 00:01:04,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:01:04,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2045 states to 1702 states and 2045 transitions. [2024-11-09 00:01:04,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 2045 transitions. [2024-11-09 00:01:04,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-09 00:01:04,237 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:01:04,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:01:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:01:04,756 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 134 proven. 51 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 00:01:05,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:01:05,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 1709 states and 2052 transitions. [2024-11-09 00:01:05,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1709 states and 2052 transitions. [2024-11-09 00:01:05,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-09 00:01:05,394 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:01:05,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:01:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:01:05,701 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 159 proven. 46 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-09 00:01:07,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:01:07,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 1751 states and 2098 transitions. [2024-11-09 00:01:07,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2098 transitions. [2024-11-09 00:01:07,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-09 00:01:07,402 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:01:07,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:01:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:01:07,758 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 159 proven. 46 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-09 00:01:08,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:01:08,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2138 states to 1790 states and 2138 transitions. [2024-11-09 00:01:08,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1790 states and 2138 transitions. [2024-11-09 00:01:08,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-09 00:01:08,965 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:01:08,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:01:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:01:09,385 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 00:01:12,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:01:12,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2193 states to 1839 states and 2193 transitions. [2024-11-09 00:01:12,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 2193 transitions. [2024-11-09 00:01:12,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-09 00:01:12,063 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:01:12,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:01:12,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:01:12,405 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 159 proven. 46 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-09 00:01:14,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:01:14,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2209 states to 1855 states and 2209 transitions. [2024-11-09 00:01:14,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1855 states and 2209 transitions. [2024-11-09 00:01:14,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-09 00:01:14,011 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:01:14,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:01:14,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:01:14,332 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 00:01:16,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:01:16,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2232 states to 1877 states and 2232 transitions. [2024-11-09 00:01:16,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2232 transitions. [2024-11-09 00:01:16,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-09 00:01:16,224 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:01:16,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:01:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:01:16,662 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 00:01:17,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:01:17,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2236 states to 1882 states and 2236 transitions. [2024-11-09 00:01:17,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 2236 transitions. [2024-11-09 00:01:17,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-09 00:01:17,726 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:01:17,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:01:17,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:01:18,063 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 137 proven. 54 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 00:01:18,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:01:18,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2240 states to 1885 states and 2240 transitions. [2024-11-09 00:01:18,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1885 states and 2240 transitions. [2024-11-09 00:01:18,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-09 00:01:18,419 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:01:18,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:01:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:01:18,952 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-09 00:01:21,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:01:21,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2263 states to 1903 states and 2263 transitions. [2024-11-09 00:01:21,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1903 states and 2263 transitions. [2024-11-09 00:01:21,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-09 00:01:21,959 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:01:21,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:01:22,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:01:22,416 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-09 00:01:26,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:01:26,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2317 states to 1954 states and 2317 transitions. [2024-11-09 00:01:26,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2317 transitions. [2024-11-09 00:01:26,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-09 00:01:26,568 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:01:26,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:01:26,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:01:27,187 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:01:29,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:01:29,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2338 states to 1972 states and 2338 transitions. [2024-11-09 00:01:29,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1972 states and 2338 transitions. [2024-11-09 00:01:29,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-09 00:01:29,971 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:01:29,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:01:30,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:01:30,264 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:01:30,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:01:30,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2339 states to 1974 states and 2339 transitions. [2024-11-09 00:01:30,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1974 states and 2339 transitions. [2024-11-09 00:01:30,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-09 00:01:30,887 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:01:30,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:01:30,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:01:31,564 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 00:01:37,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:01:37,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2038 states and 2410 transitions. [2024-11-09 00:01:37,577 INFO L276 IsEmpty]: Start isEmpty. Operand 2038 states and 2410 transitions. [2024-11-09 00:01:37,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-09 00:01:37,579 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:01:37,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:01:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:01:37,863 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 00:01:43,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:01:43,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2482 states to 2101 states and 2482 transitions. [2024-11-09 00:01:43,433 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 2482 transitions. [2024-11-09 00:01:43,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-09 00:01:43,435 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:01:43,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:01:43,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:01:44,015 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 147 proven. 26 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-09 00:01:47,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:01:47,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2499 states to 2114 states and 2499 transitions. [2024-11-09 00:01:47,332 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 2499 transitions. [2024-11-09 00:01:47,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-09 00:01:47,335 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:01:47,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:01:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:01:48,513 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 119 proven. 137 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-09 00:01:54,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:01:54,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2662 states to 2254 states and 2662 transitions. [2024-11-09 00:01:54,600 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 2662 transitions. [2024-11-09 00:01:54,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-09 00:01:54,602 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:01:54,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:01:54,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:01:54,964 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 146 proven. 30 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-09 00:01:56,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:01:56,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2667 states to 2256 states and 2667 transitions. [2024-11-09 00:01:56,439 INFO L276 IsEmpty]: Start isEmpty. Operand 2256 states and 2667 transitions. [2024-11-09 00:01:56,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-09 00:01:56,441 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:01:56,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:01:56,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:01:56,710 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 58 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 00:01:57,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:01:57,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2262 states and 2674 transitions. [2024-11-09 00:01:57,849 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 2674 transitions. [2024-11-09 00:01:57,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-09 00:01:57,851 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:01:57,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:01:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:01:58,337 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:01:59,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:01:59,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2675 states to 2264 states and 2675 transitions. [2024-11-09 00:01:59,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 2675 transitions. [2024-11-09 00:01:59,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-09 00:01:59,169 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:01:59,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:01:59,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:01:59,885 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 129 proven. 142 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-09 00:02:03,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:02:03,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2808 states to 2385 states and 2808 transitions. [2024-11-09 00:02:03,753 INFO L276 IsEmpty]: Start isEmpty. Operand 2385 states and 2808 transitions. [2024-11-09 00:02:03,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-09 00:02:03,755 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:02:03,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:02:03,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:04,266 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 183 proven. 52 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-09 00:02:06,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:02:06,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2394 states and 2818 transitions. [2024-11-09 00:02:06,039 INFO L276 IsEmpty]: Start isEmpty. Operand 2394 states and 2818 transitions. [2024-11-09 00:02:06,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-09 00:02:06,041 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:02:06,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:02:06,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:06,398 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 183 proven. 52 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-09 00:02:07,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:02:07,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2838 states to 2413 states and 2838 transitions. [2024-11-09 00:02:07,361 INFO L276 IsEmpty]: Start isEmpty. Operand 2413 states and 2838 transitions. [2024-11-09 00:02:07,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-09 00:02:07,363 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:02:07,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:02:07,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:07,691 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 183 proven. 52 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-09 00:02:10,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:02:10,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2847 states to 2421 states and 2847 transitions. [2024-11-09 00:02:10,544 INFO L276 IsEmpty]: Start isEmpty. Operand 2421 states and 2847 transitions. [2024-11-09 00:02:10,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-09 00:02:10,546 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:02:10,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:02:10,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:10,681 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-09 00:02:11,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:02:11,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2857 states to 2428 states and 2857 transitions. [2024-11-09 00:02:11,552 INFO L276 IsEmpty]: Start isEmpty. Operand 2428 states and 2857 transitions. [2024-11-09 00:02:11,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-09 00:02:11,554 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:02:11,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:02:11,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:12,141 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 194 proven. 6 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-09 00:02:13,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:02:13,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2430 states and 2860 transitions. [2024-11-09 00:02:13,530 INFO L276 IsEmpty]: Start isEmpty. Operand 2430 states and 2860 transitions. [2024-11-09 00:02:13,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-09 00:02:13,532 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:02:13,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:02:13,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:13,603 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-09 00:02:14,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:02:14,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2866 states to 2435 states and 2866 transitions. [2024-11-09 00:02:14,211 INFO L276 IsEmpty]: Start isEmpty. Operand 2435 states and 2866 transitions. [2024-11-09 00:02:14,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-09 00:02:14,214 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:02:14,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:02:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:14,301 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-09 00:02:16,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:02:16,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2881 states to 2445 states and 2881 transitions. [2024-11-09 00:02:16,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2445 states and 2881 transitions. [2024-11-09 00:02:16,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-09 00:02:16,440 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:02:16,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:02:16,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:16,713 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 185 proven. 54 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-09 00:02:17,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:02:17,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2883 states to 2447 states and 2883 transitions. [2024-11-09 00:02:17,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 2883 transitions. [2024-11-09 00:02:17,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-09 00:02:17,496 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:02:17,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:02:17,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:17,774 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 185 proven. 54 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-09 00:02:18,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:02:18,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2886 states to 2449 states and 2886 transitions. [2024-11-09 00:02:18,347 INFO L276 IsEmpty]: Start isEmpty. Operand 2449 states and 2886 transitions. [2024-11-09 00:02:18,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-09 00:02:18,349 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:02:18,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:02:18,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:18,580 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-09 00:02:18,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:02:18,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2887 states to 2450 states and 2887 transitions. [2024-11-09 00:02:18,698 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 2887 transitions. [2024-11-09 00:02:18,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-09 00:02:18,701 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:02:18,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:02:18,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:18,828 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-09 00:02:20,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:02:20,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2452 states and 2889 transitions. [2024-11-09 00:02:20,029 INFO L276 IsEmpty]: Start isEmpty. Operand 2452 states and 2889 transitions. [2024-11-09 00:02:20,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-09 00:02:20,033 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:02:20,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:02:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:20,328 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 152 proven. 83 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-09 00:02:20,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:02:20,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2890 states to 2453 states and 2890 transitions. [2024-11-09 00:02:20,611 INFO L276 IsEmpty]: Start isEmpty. Operand 2453 states and 2890 transitions. [2024-11-09 00:02:20,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-09 00:02:20,614 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:02:20,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:02:20,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:21,258 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 172 proven. 137 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 00:02:23,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:02:23,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2917 states to 2475 states and 2917 transitions. [2024-11-09 00:02:23,941 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 2917 transitions. [2024-11-09 00:02:23,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-09 00:02:23,942 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:02:23,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:02:23,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:24,328 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 172 proven. 137 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 00:02:26,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:02:26,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2941 states to 2497 states and 2941 transitions. [2024-11-09 00:02:26,502 INFO L276 IsEmpty]: Start isEmpty. Operand 2497 states and 2941 transitions. [2024-11-09 00:02:26,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-09 00:02:26,503 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:02:26,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:02:26,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:27,094 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 171 proven. 38 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-09 00:02:29,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:02:29,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2971 states to 2522 states and 2971 transitions. [2024-11-09 00:02:29,450 INFO L276 IsEmpty]: Start isEmpty. Operand 2522 states and 2971 transitions. [2024-11-09 00:02:29,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-09 00:02:29,452 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:02:29,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:02:29,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:29,756 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 155 proven. 86 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-09 00:02:30,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:02:30,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2973 states to 2524 states and 2973 transitions. [2024-11-09 00:02:30,190 INFO L276 IsEmpty]: Start isEmpty. Operand 2524 states and 2973 transitions. [2024-11-09 00:02:30,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-11-09 00:02:30,191 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:02:30,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:02:30,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:30,584 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 174 proven. 116 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 00:02:31,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:02:31,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2979 states to 2529 states and 2979 transitions. [2024-11-09 00:02:31,652 INFO L276 IsEmpty]: Start isEmpty. Operand 2529 states and 2979 transitions. [2024-11-09 00:02:31,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-11-09 00:02:31,654 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:02:31,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:02:31,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:31,955 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 174 proven. 116 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 00:02:34,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:02:34,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2983 states to 2533 states and 2983 transitions. [2024-11-09 00:02:34,417 INFO L276 IsEmpty]: Start isEmpty. Operand 2533 states and 2983 transitions. [2024-11-09 00:02:34,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-11-09 00:02:34,419 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:02:34,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:02:34,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:35,110 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 182 proven. 112 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 00:02:37,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:02:37,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2992 states to 2539 states and 2992 transitions. [2024-11-09 00:02:37,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2539 states and 2992 transitions. [2024-11-09 00:02:37,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-11-09 00:02:37,163 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:02:37,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:02:37,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:37,476 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 182 proven. 112 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 00:02:41,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:02:41,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 2551 states and 3008 transitions. [2024-11-09 00:02:41,051 INFO L276 IsEmpty]: Start isEmpty. Operand 2551 states and 3008 transitions. [2024-11-09 00:02:41,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-11-09 00:02:41,053 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:02:41,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:02:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:41,659 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 178 proven. 30 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-09 00:02:42,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:02:42,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3009 states to 2552 states and 3009 transitions. [2024-11-09 00:02:42,871 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 3009 transitions. [2024-11-09 00:02:42,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-11-09 00:02:42,874 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:02:42,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:02:42,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:43,021 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-09 00:02:44,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:02:44,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3024 states to 2565 states and 3024 transitions. [2024-11-09 00:02:44,295 INFO L276 IsEmpty]: Start isEmpty. Operand 2565 states and 3024 transitions. [2024-11-09 00:02:44,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-11-09 00:02:44,298 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:02:44,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:02:44,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:44,430 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-09 00:02:46,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:02:46,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3036 states to 2573 states and 3036 transitions. [2024-11-09 00:02:46,095 INFO L276 IsEmpty]: Start isEmpty. Operand 2573 states and 3036 transitions. [2024-11-09 00:02:46,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-09 00:02:46,097 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:02:46,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:02:46,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:46,334 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 00:02:48,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:02:48,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3045 states to 2582 states and 3045 transitions. [2024-11-09 00:02:48,139 INFO L276 IsEmpty]: Start isEmpty. Operand 2582 states and 3045 transitions. [2024-11-09 00:02:48,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-09 00:02:48,141 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:02:48,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:02:48,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:48,542 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 159 proven. 90 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-09 00:02:48,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:02:48,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3046 states to 2583 states and 3046 transitions. [2024-11-09 00:02:48,878 INFO L276 IsEmpty]: Start isEmpty. Operand 2583 states and 3046 transitions. [2024-11-09 00:02:48,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-09 00:02:48,880 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:02:48,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:02:48,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:48,980 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-09 00:02:50,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:02:50,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3050 states to 2586 states and 3050 transitions. [2024-11-09 00:02:50,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2586 states and 3050 transitions. [2024-11-09 00:02:50,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-09 00:02:50,896 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:02:50,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:02:50,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:51,184 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 192 proven. 59 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-09 00:02:56,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:02:56,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3074 states to 2599 states and 3074 transitions. [2024-11-09 00:02:56,320 INFO L276 IsEmpty]: Start isEmpty. Operand 2599 states and 3074 transitions. [2024-11-09 00:02:56,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-09 00:02:56,322 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:02:56,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:02:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:56,611 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 192 proven. 59 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-09 00:02:57,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:02:57,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3075 states to 2600 states and 3075 transitions. [2024-11-09 00:02:57,529 INFO L276 IsEmpty]: Start isEmpty. Operand 2600 states and 3075 transitions. [2024-11-09 00:02:57,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-09 00:02:57,531 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:02:57,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:02:57,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:02:57,756 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 223 proven. 59 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-09 00:02:59,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:02:59,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3085 states to 2608 states and 3085 transitions. [2024-11-09 00:02:59,857 INFO L276 IsEmpty]: Start isEmpty. Operand 2608 states and 3085 transitions. [2024-11-09 00:02:59,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-09 00:02:59,859 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:02:59,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:02:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:00,179 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 223 proven. 59 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-09 00:03:02,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:03:02,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3087 states to 2610 states and 3087 transitions. [2024-11-09 00:03:02,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 3087 transitions. [2024-11-09 00:03:02,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-09 00:03:02,163 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:03:02,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:03:02,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:02,309 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-09 00:03:02,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:03:02,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 2624 states and 3104 transitions. [2024-11-09 00:03:02,795 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 3104 transitions. [2024-11-09 00:03:02,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-09 00:03:02,797 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:03:02,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:03:02,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:03,116 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 199 proven. 49 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-09 00:03:06,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:03:06,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3147 states to 2661 states and 3147 transitions. [2024-11-09 00:03:06,099 INFO L276 IsEmpty]: Start isEmpty. Operand 2661 states and 3147 transitions. [2024-11-09 00:03:06,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-09 00:03:06,101 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:03:06,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:03:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:06,392 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 196 proven. 61 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-09 00:03:10,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:03:10,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3169 states to 2677 states and 3169 transitions. [2024-11-09 00:03:10,325 INFO L276 IsEmpty]: Start isEmpty. Operand 2677 states and 3169 transitions. [2024-11-09 00:03:10,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-09 00:03:10,327 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:03:10,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:03:10,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:10,622 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 196 proven. 61 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-09 00:03:16,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:03:16,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3190 states to 2692 states and 3190 transitions. [2024-11-09 00:03:16,800 INFO L276 IsEmpty]: Start isEmpty. Operand 2692 states and 3190 transitions. [2024-11-09 00:03:16,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-09 00:03:16,802 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:03:16,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:03:16,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:17,250 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 196 proven. 61 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-09 00:03:19,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:03:19,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3192 states to 2695 states and 3192 transitions. [2024-11-09 00:03:19,745 INFO L276 IsEmpty]: Start isEmpty. Operand 2695 states and 3192 transitions. [2024-11-09 00:03:19,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-09 00:03:19,747 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:03:19,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:03:19,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:20,033 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 200 proven. 63 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-09 00:03:21,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:03:21,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3199 states to 2701 states and 3199 transitions. [2024-11-09 00:03:21,821 INFO L276 IsEmpty]: Start isEmpty. Operand 2701 states and 3199 transitions. [2024-11-09 00:03:21,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-09 00:03:21,823 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:03:21,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:03:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:21,905 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 266 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 00:03:24,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:03:24,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3210 states to 2710 states and 3210 transitions. [2024-11-09 00:03:24,786 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3210 transitions. [2024-11-09 00:03:24,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-09 00:03:24,788 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:03:24,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:03:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:25,113 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 132 proven. 166 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-09 00:03:27,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:03:27,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3303 states to 2800 states and 3303 transitions. [2024-11-09 00:03:27,523 INFO L276 IsEmpty]: Start isEmpty. Operand 2800 states and 3303 transitions. [2024-11-09 00:03:27,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-09 00:03:27,525 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:03:27,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:03:27,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:28,008 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 204 proven. 65 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-09 00:03:34,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:03:34,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3324 states to 2813 states and 3324 transitions. [2024-11-09 00:03:34,796 INFO L276 IsEmpty]: Start isEmpty. Operand 2813 states and 3324 transitions. [2024-11-09 00:03:34,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-09 00:03:34,799 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:03:34,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:03:34,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:35,369 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-09 00:03:46,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:03:46,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3427 states to 2901 states and 3427 transitions. [2024-11-09 00:03:46,633 INFO L276 IsEmpty]: Start isEmpty. Operand 2901 states and 3427 transitions. [2024-11-09 00:03:46,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-09 00:03:46,635 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:03:46,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:03:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:46,855 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-09 00:03:54,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:03:54,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3500 states to 2969 states and 3500 transitions. [2024-11-09 00:03:54,404 INFO L276 IsEmpty]: Start isEmpty. Operand 2969 states and 3500 transitions. [2024-11-09 00:03:54,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-09 00:03:54,406 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:03:54,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:03:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:54,762 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-09 00:03:55,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:03:55,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3502 states to 2971 states and 3502 transitions. [2024-11-09 00:03:55,964 INFO L276 IsEmpty]: Start isEmpty. Operand 2971 states and 3502 transitions. [2024-11-09 00:03:55,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-09 00:03:55,968 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:03:55,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:03:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:56,179 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-09 00:03:57,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:03:57,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3515 states to 2983 states and 3515 transitions. [2024-11-09 00:03:57,173 INFO L276 IsEmpty]: Start isEmpty. Operand 2983 states and 3515 transitions. [2024-11-09 00:03:57,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-09 00:03:57,175 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:03:57,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:03:57,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:57,487 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 173 proven. 104 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-11-09 00:03:57,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:03:57,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3516 states to 2984 states and 3516 transitions. [2024-11-09 00:03:57,934 INFO L276 IsEmpty]: Start isEmpty. Operand 2984 states and 3516 transitions. [2024-11-09 00:03:57,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-09 00:03:57,936 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:03:57,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:03:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:03:58,044 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-11-09 00:04:00,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:04:00,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3527 states to 2993 states and 3527 transitions. [2024-11-09 00:04:00,352 INFO L276 IsEmpty]: Start isEmpty. Operand 2993 states and 3527 transitions. [2024-11-09 00:04:00,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-09 00:04:00,355 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:04:00,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:04:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:00,448 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-11-09 00:04:00,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:04:00,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3532 states to 2999 states and 3532 transitions. [2024-11-09 00:04:00,934 INFO L276 IsEmpty]: Start isEmpty. Operand 2999 states and 3532 transitions. [2024-11-09 00:04:00,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-09 00:04:00,936 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:04:00,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:04:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:01,038 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-09 00:04:02,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:04:02,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3533 states to 3000 states and 3533 transitions. [2024-11-09 00:04:02,099 INFO L276 IsEmpty]: Start isEmpty. Operand 3000 states and 3533 transitions. [2024-11-09 00:04:02,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-09 00:04:02,101 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:04:02,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:04:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:02,991 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-09 00:04:06,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:04:06,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3570 states to 3029 states and 3570 transitions. [2024-11-09 00:04:06,926 INFO L276 IsEmpty]: Start isEmpty. Operand 3029 states and 3570 transitions. [2024-11-09 00:04:06,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-09 00:04:06,928 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:04:06,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:04:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:07,235 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-09 00:04:09,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:04:09,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3586 states to 3041 states and 3586 transitions. [2024-11-09 00:04:09,716 INFO L276 IsEmpty]: Start isEmpty. Operand 3041 states and 3586 transitions. [2024-11-09 00:04:09,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-09 00:04:09,720 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:04:09,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:04:09,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:10,195 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-09 00:04:13,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:04:13,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3610 states to 3064 states and 3610 transitions. [2024-11-09 00:04:13,575 INFO L276 IsEmpty]: Start isEmpty. Operand 3064 states and 3610 transitions. [2024-11-09 00:04:13,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-09 00:04:13,577 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:04:13,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:04:13,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:13,922 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-09 00:04:20,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:04:20,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3634 states to 3087 states and 3634 transitions. [2024-11-09 00:04:20,214 INFO L276 IsEmpty]: Start isEmpty. Operand 3087 states and 3634 transitions. [2024-11-09 00:04:20,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-09 00:04:20,218 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:04:20,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:04:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:20,619 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 209 proven. 6 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-11-09 00:04:23,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:04:23,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3654 states to 3101 states and 3654 transitions. [2024-11-09 00:04:23,605 INFO L276 IsEmpty]: Start isEmpty. Operand 3101 states and 3654 transitions. [2024-11-09 00:04:23,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-09 00:04:23,608 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:04:23,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:04:23,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:23,930 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 209 proven. 6 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-11-09 00:04:25,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:04:25,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3655 states to 3102 states and 3655 transitions. [2024-11-09 00:04:25,627 INFO L276 IsEmpty]: Start isEmpty. Operand 3102 states and 3655 transitions. [2024-11-09 00:04:25,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-09 00:04:25,629 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:04:25,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:04:25,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:25,922 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 209 proven. 6 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-11-09 00:04:27,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:04:27,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3656 states to 3103 states and 3656 transitions. [2024-11-09 00:04:27,193 INFO L276 IsEmpty]: Start isEmpty. Operand 3103 states and 3656 transitions. [2024-11-09 00:04:27,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-09 00:04:27,195 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:04:27,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:04:27,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:27,643 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 228 proven. 38 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-09 00:04:32,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:04:32,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3684 states to 3128 states and 3684 transitions. [2024-11-09 00:04:32,165 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 3684 transitions. [2024-11-09 00:04:32,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-09 00:04:32,167 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:04:32,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:04:32,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:32,257 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-11-09 00:04:33,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:04:33,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3686 states to 3129 states and 3686 transitions. [2024-11-09 00:04:33,685 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 3686 transitions. [2024-11-09 00:04:33,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-09 00:04:33,690 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:04:33,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:04:33,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:35,053 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:04:53,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:04:53,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3793 states to 3225 states and 3793 transitions. [2024-11-09 00:04:53,230 INFO L276 IsEmpty]: Start isEmpty. Operand 3225 states and 3793 transitions. [2024-11-09 00:04:53,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-09 00:04:53,238 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:04:53,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:04:53,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:04:53,999 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:05:01,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:05:01,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3827 states to 3257 states and 3827 transitions. [2024-11-09 00:05:01,019 INFO L276 IsEmpty]: Start isEmpty. Operand 3257 states and 3827 transitions. [2024-11-09 00:05:01,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-09 00:05:01,021 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:05:01,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:05:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:05:01,569 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 00:05:04,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:05:04,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3846 states to 3276 states and 3846 transitions. [2024-11-09 00:05:04,084 INFO L276 IsEmpty]: Start isEmpty. Operand 3276 states and 3846 transitions. [2024-11-09 00:05:04,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-11-09 00:05:04,088 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:05:04,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:05:04,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:05:04,499 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 215 proven. 6 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-09 00:05:05,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:05:05,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3850 states to 3278 states and 3850 transitions. [2024-11-09 00:05:05,613 INFO L276 IsEmpty]: Start isEmpty. Operand 3278 states and 3850 transitions. [2024-11-09 00:05:05,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-11-09 00:05:05,616 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:05:05,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:05:05,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:05:06,018 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 215 proven. 6 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-09 00:05:07,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:05:07,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3850 states to 3279 states and 3850 transitions. [2024-11-09 00:05:07,146 INFO L276 IsEmpty]: Start isEmpty. Operand 3279 states and 3850 transitions. [2024-11-09 00:05:07,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-09 00:05:07,148 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:05:07,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:05:07,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:05:07,407 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 251 proven. 64 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-09 00:05:08,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:05:08,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3859 states to 3287 states and 3859 transitions. [2024-11-09 00:05:08,727 INFO L276 IsEmpty]: Start isEmpty. Operand 3287 states and 3859 transitions. [2024-11-09 00:05:08,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-09 00:05:08,730 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:05:08,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:05:08,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:05:09,062 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 185 proven. 152 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 00:05:16,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:05:16,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3900 states to 3326 states and 3900 transitions. [2024-11-09 00:05:16,421 INFO L276 IsEmpty]: Start isEmpty. Operand 3326 states and 3900 transitions. [2024-11-09 00:05:16,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-09 00:05:16,423 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:05:16,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:05:16,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:05:16,506 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 00:05:17,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:05:17,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3906 states to 3332 states and 3906 transitions. [2024-11-09 00:05:17,666 INFO L276 IsEmpty]: Start isEmpty. Operand 3332 states and 3906 transitions. [2024-11-09 00:05:17,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-09 00:05:17,668 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:05:17,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:05:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:05:18,135 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 228 proven. 65 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-09 00:05:23,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:05:23,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3343 states and 3920 transitions. [2024-11-09 00:05:23,024 INFO L276 IsEmpty]: Start isEmpty. Operand 3343 states and 3920 transitions. [2024-11-09 00:05:23,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-09 00:05:23,028 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:05:23,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:05:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:05:23,681 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 125 proven. 170 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-09 00:05:34,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:05:34,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4057 states to 3470 states and 4057 transitions. [2024-11-09 00:05:34,326 INFO L276 IsEmpty]: Start isEmpty. Operand 3470 states and 4057 transitions. [2024-11-09 00:05:34,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-09 00:05:34,329 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:05:34,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:05:34,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:05:35,560 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-09 00:05:41,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:05:41,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4124 states to 3526 states and 4124 transitions. [2024-11-09 00:05:41,132 INFO L276 IsEmpty]: Start isEmpty. Operand 3526 states and 4124 transitions. [2024-11-09 00:05:41,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-09 00:05:41,135 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:05:41,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:05:41,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:05:41,546 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-09 00:05:43,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:05:43,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4136 states to 3536 states and 4136 transitions. [2024-11-09 00:05:43,253 INFO L276 IsEmpty]: Start isEmpty. Operand 3536 states and 4136 transitions. [2024-11-09 00:05:43,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-09 00:05:43,256 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:05:43,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:05:43,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:05:43,454 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 134 proven. 180 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-09 00:05:44,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:05:44,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4139 states to 3538 states and 4139 transitions. [2024-11-09 00:05:44,624 INFO L276 IsEmpty]: Start isEmpty. Operand 3538 states and 4139 transitions. [2024-11-09 00:05:44,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-09 00:05:44,627 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:05:44,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:05:44,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:05:45,010 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 134 proven. 180 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-09 00:05:45,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:05:45,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4143 states to 3542 states and 4143 transitions. [2024-11-09 00:05:45,623 INFO L276 IsEmpty]: Start isEmpty. Operand 3542 states and 4143 transitions. [2024-11-09 00:05:45,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-09 00:05:45,626 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:05:45,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:05:45,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:05:45,837 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 134 proven. 180 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-09 00:05:46,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:05:46,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4146 states to 3545 states and 4146 transitions. [2024-11-09 00:05:46,662 INFO L276 IsEmpty]: Start isEmpty. Operand 3545 states and 4146 transitions. [2024-11-09 00:05:46,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-09 00:05:46,665 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:05:46,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:05:46,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:05:47,642 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 279 proven. 206 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-09 00:05:53,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:05:53,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 3675 states and 4287 transitions. [2024-11-09 00:05:53,243 INFO L276 IsEmpty]: Start isEmpty. Operand 3675 states and 4287 transitions. [2024-11-09 00:05:53,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2024-11-09 00:05:53,246 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:05:53,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:05:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:05:54,077 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 299 proven. 141 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-09 00:05:59,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:05:59,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4382 states to 3760 states and 4382 transitions. [2024-11-09 00:05:59,045 INFO L276 IsEmpty]: Start isEmpty. Operand 3760 states and 4382 transitions. [2024-11-09 00:05:59,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2024-11-09 00:05:59,048 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:05:59,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:05:59,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:05:59,448 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 299 proven. 141 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-09 00:06:05,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:06:05,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4415 states to 3782 states and 4415 transitions. [2024-11-09 00:06:05,551 INFO L276 IsEmpty]: Start isEmpty. Operand 3782 states and 4415 transitions. [2024-11-09 00:06:05,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2024-11-09 00:06:05,554 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:06:05,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:06:05,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:06:05,947 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 179 proven. 204 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2024-11-09 00:06:06,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:06:06,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4418 states to 3786 states and 4418 transitions. [2024-11-09 00:06:06,519 INFO L276 IsEmpty]: Start isEmpty. Operand 3786 states and 4418 transitions. [2024-11-09 00:06:06,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2024-11-09 00:06:06,522 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:06:06,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:06:06,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:06:06,924 INFO L134 CoverageAnalysis]: Checked inductivity of 726 backedges. 238 proven. 242 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2024-11-09 00:06:08,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:06:08,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4434 states to 3802 states and 4434 transitions. [2024-11-09 00:06:08,048 INFO L276 IsEmpty]: Start isEmpty. Operand 3802 states and 4434 transitions. [2024-11-09 00:06:08,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2024-11-09 00:06:08,053 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-09 00:06:08,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:06:08,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:06:08,307 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 201 proven. 238 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2024-11-09 00:06:09,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-09 00:06:09,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4114 states to 3505 states and 4114 transitions. [2024-11-09 00:06:09,727 INFO L276 IsEmpty]: Start isEmpty. Operand 3505 states and 4114 transitions. [2024-11-09 00:06:09,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 00:06:09,730 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 177 iterations. [2024-11-09 00:06:09,741 INFO L729 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-11-09 00:06:45,217 INFO L77 FloydHoareUtils]: At program point L102(lines 102 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (not .cse9)) (.cse1 (= ~a12~0 8)) (.cse6 (= 14 ~a8~0)) (.cse2 (not .cse8)) (.cse5 (= ~a16~0 4)) (.cse10 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse2) (and .cse1 (= ~a8~0 13) .cse8 .cse9 .cse5) (and .cse0 .cse1 .cse7 .cse2 .cse4) (= ~a7~0 0) (and .cse10 (not (and .cse1 .cse4 (= ~a20~0 ~a7~0) .cse5))) (and .cse0 .cse1 .cse6 .cse2 .cse5) (and .cse10 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse10 (not (= ~a17~0 ~a7~0)))))) [2024-11-09 00:06:45,218 INFO L77 FloydHoareUtils]: At program point L598(line 598) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,218 INFO L77 FloydHoareUtils]: At program point L334(lines 334 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,219 INFO L77 FloydHoareUtils]: At program point L467-1(lines 40 585) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (= ~a17~0 1)) (.cse2 (= ~a20~0 1))) (and (not (and .cse0 (= 5 ~a16~0) .cse1 .cse2 (= ~a8~0 15))) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse1 .cse2 (= ~a16~0 4))) (= ~a7~0 1)))) [2024-11-09 00:06:45,219 INFO L77 FloydHoareUtils]: At program point L302(lines 302 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,219 INFO L77 FloydHoareUtils]: At program point L170(lines 170 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,220 INFO L75 FloydHoareUtils]: For program point L468(line 468) no Hoare annotation was computed. [2024-11-09 00:06:45,220 INFO L77 FloydHoareUtils]: At program point L204(lines 204 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,220 INFO L77 FloydHoareUtils]: At program point L72(lines 72 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,221 INFO L77 FloydHoareUtils]: At program point L271(lines 271 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,221 INFO L77 FloydHoareUtils]: At program point L139(lines 139 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,221 INFO L77 FloydHoareUtils]: At program point L371(lines 371 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,222 INFO L77 FloydHoareUtils]: At program point L107(lines 107 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (not .cse9)) (.cse1 (= ~a12~0 8)) (.cse6 (= 14 ~a8~0)) (.cse2 (not .cse8)) (.cse5 (= ~a16~0 4)) (.cse10 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse2) (and .cse1 (= ~a8~0 13) .cse8 .cse9 .cse5) (and .cse0 .cse1 .cse7 .cse2 .cse4) (= ~a7~0 0) (and .cse10 (not (and .cse1 .cse4 (= ~a20~0 ~a7~0) .cse5))) (and .cse0 .cse1 .cse6 .cse2 .cse5) (and .cse10 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse10 (not (= ~a17~0 ~a7~0)))))) [2024-11-09 00:06:45,222 INFO L77 FloydHoareUtils]: At program point L41(lines 41 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,222 INFO L77 FloydHoareUtils]: At program point L339(lines 339 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,223 INFO L77 FloydHoareUtils]: At program point L207(lines 207 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,223 INFO L77 FloydHoareUtils]: At program point L75(lines 75 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,223 INFO L77 FloydHoareUtils]: At program point L373(lines 373 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,224 INFO L77 FloydHoareUtils]: At program point L241(lines 241 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,224 INFO L77 FloydHoareUtils]: At program point L175(lines 175 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,224 INFO L77 FloydHoareUtils]: At program point L275(lines 275 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,225 INFO L77 FloydHoareUtils]: At program point L375(lines 375 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,225 INFO L77 FloydHoareUtils]: At program point L309(lines 309 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,225 INFO L77 FloydHoareUtils]: At program point L45(lines 45 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,226 INFO L77 FloydHoareUtils]: At program point L343(lines 343 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,226 INFO L77 FloydHoareUtils]: At program point L112(lines 112 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (not .cse9)) (.cse1 (= ~a12~0 8)) (.cse6 (= 14 ~a8~0)) (.cse2 (not .cse8)) (.cse5 (= ~a16~0 4)) (.cse10 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse2) (and .cse1 (= ~a8~0 13) .cse8 .cse9 .cse5) (and .cse0 .cse1 .cse7 .cse2 .cse4) (= ~a7~0 0) (and .cse10 (not (and .cse1 .cse4 (= ~a20~0 ~a7~0) .cse5))) (and .cse0 .cse1 .cse6 .cse2 .cse5) (and .cse10 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse10 (not (= ~a17~0 ~a7~0)))))) [2024-11-09 00:06:45,226 INFO L77 FloydHoareUtils]: At program point L278(lines 278 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,227 INFO L77 FloydHoareUtils]: At program point L146(lines 146 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,227 INFO L77 FloydHoareUtils]: At program point L213(lines 213 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,227 INFO L77 FloydHoareUtils]: At program point L82(lines 82 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,228 INFO L77 FloydHoareUtils]: At program point L347(lines 347 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,228 INFO L77 FloydHoareUtils]: At program point L248(lines 248 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,228 INFO L77 FloydHoareUtils]: At program point L183(lines 183 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,229 INFO L77 FloydHoareUtils]: At program point L150(lines 150 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,229 INFO L77 FloydHoareUtils]: At program point L382(lines 382 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,229 INFO L77 FloydHoareUtils]: At program point L316(lines 316 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,229 INFO L77 FloydHoareUtils]: At program point L283(lines 283 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,230 INFO L77 FloydHoareUtils]: At program point L118(lines 118 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (not .cse9)) (.cse1 (= ~a12~0 8)) (.cse6 (= 14 ~a8~0)) (.cse2 (not .cse8)) (.cse5 (= ~a16~0 4)) (.cse10 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse2) (and .cse1 (= ~a8~0 13) .cse8 .cse9 .cse5) (and .cse0 .cse1 .cse7 .cse2 .cse4) (= ~a7~0 0) (and .cse10 (not (and .cse1 .cse4 (= ~a20~0 ~a7~0) .cse5))) (and .cse0 .cse1 .cse6 .cse2 .cse5) (and .cse10 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse10 (not (= ~a17~0 ~a7~0)))))) [2024-11-09 00:06:45,230 INFO L77 FloydHoareUtils]: At program point L218(lines 218 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,230 INFO L77 FloydHoareUtils]: At program point L53(lines 53 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,231 INFO L77 FloydHoareUtils]: At program point L154(lines 154 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse8 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (not .cse10)) (.cse7 (= 14 ~a8~0)) (.cse2 (not .cse9)) (.cse5 (= ~a16~0 4)) (.cse6 (not .cse3)) (.cse1 (= ~a12~0 8))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (not (and (= ~a20~0 ~a7~0) .cse5)) .cse6) (and .cse6 (not (= |ULTIMATE.start_calculate_output_~input#1| 2))) (and .cse1 .cse7 .cse8 .cse2) (and .cse1 (= ~a8~0 13) .cse9 .cse10 .cse5) (and .cse0 .cse1 .cse8 .cse2 .cse4) (= ~a7~0 0) (and .cse6 (not (and .cse4 (= ~a17~0 ~a7~0)))) (and .cse0 .cse1 .cse7 .cse2 .cse5) (and .cse6 (not .cse1))))) [2024-11-09 00:06:45,231 INFO L77 FloydHoareUtils]: At program point L188(lines 188 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,231 INFO L77 FloydHoareUtils]: At program point L387(lines 387 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,232 INFO L77 FloydHoareUtils]: At program point L288(lines 288 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,232 INFO L77 FloydHoareUtils]: At program point L255(lines 255 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,232 INFO L77 FloydHoareUtils]: At program point L90(lines 90 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,232 INFO L77 FloydHoareUtils]: At program point L355(lines 355 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,233 INFO L77 FloydHoareUtils]: At program point L322(lines 322 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,233 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-09 00:06:45,233 INFO L77 FloydHoareUtils]: At program point L124(lines 124 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (not .cse9)) (.cse1 (= ~a12~0 8)) (.cse6 (= 14 ~a8~0)) (.cse2 (not .cse8)) (.cse5 (= ~a16~0 4)) (.cse10 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse2) (and .cse1 (= ~a8~0 13) .cse8 .cse9 .cse5) (and .cse0 .cse1 .cse7 .cse2 .cse4) (= ~a7~0 0) (and .cse10 (not (and .cse1 .cse4 (= ~a20~0 ~a7~0) .cse5))) (and .cse0 .cse1 .cse6 .cse2 .cse5) (and .cse10 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse10 (not (= ~a17~0 ~a7~0)))))) [2024-11-09 00:06:45,233 INFO L77 FloydHoareUtils]: At program point L587(lines 587 604) the Hoare annotation is: true [2024-11-09 00:06:45,233 INFO L77 FloydHoareUtils]: At program point L224(lines 224 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,234 INFO L77 FloydHoareUtils]: At program point L158(lines 158 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,234 INFO L77 FloydHoareUtils]: At program point L59(lines 59 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,234 INFO L77 FloydHoareUtils]: At program point L94(lines 94 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse0 (not .cse9)) (.cse1 (= ~a12~0 8)) (.cse6 (= 14 ~a8~0)) (.cse2 (not .cse8)) (.cse5 (= ~a16~0 4)) (.cse10 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse2) (and .cse1 (= ~a8~0 13) .cse8 .cse9 .cse5) (and .cse0 .cse1 .cse7 .cse2 .cse4) (= ~a7~0 0) (and .cse10 (not (and .cse1 .cse4 (= ~a20~0 ~a7~0) .cse5))) (and .cse0 .cse1 .cse6 .cse2 .cse5) (and .cse10 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (and .cse10 (not (= ~a17~0 ~a7~0)))))) [2024-11-09 00:06:45,235 INFO L77 FloydHoareUtils]: At program point L392(lines 392 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,235 INFO L77 FloydHoareUtils]: At program point L326(lines 326 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,235 INFO L77 FloydHoareUtils]: At program point L260(lines 260 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,236 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-09 00:06:45,236 INFO L77 FloydHoareUtils]: At program point L228(lines 228 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,236 INFO L77 FloydHoareUtils]: At program point L162(lines 162 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,237 INFO L77 FloydHoareUtils]: At program point L129(lines 129 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,237 INFO L77 FloydHoareUtils]: At program point L328(lines 328 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,237 INFO L77 FloydHoareUtils]: At program point L196(lines 196 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,237 INFO L77 FloydHoareUtils]: At program point L64(lines 64 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,238 INFO L77 FloydHoareUtils]: At program point L593-2(lines 593 603) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,238 INFO L77 FloydHoareUtils]: At program point L296(lines 296 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,238 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 40 585) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,239 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 468) no Hoare annotation was computed. [2024-11-09 00:06:45,239 INFO L77 FloydHoareUtils]: At program point L363(lines 363 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,239 INFO L77 FloydHoareUtils]: At program point L199(lines 199 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,239 INFO L77 FloydHoareUtils]: At program point L464-1(lines 40 585) the Hoare annotation is: (or (not (= ~a21~0 1)) (not (= ~a7~0 1)) (and (= ~a12~0 8) (= ~a8~0 13) (= ~a17~0 1) (= ~a20~0 1) (= ~a16~0 4))) [2024-11-09 00:06:45,240 INFO L77 FloydHoareUtils]: At program point L365(lines 365 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,240 INFO L77 FloydHoareUtils]: At program point L266(lines 266 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,240 INFO L77 FloydHoareUtils]: At program point L233(lines 233 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,240 INFO L77 FloydHoareUtils]: At program point L134(lines 134 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse5 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse4 (= ~a16~0 4))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (not (= ~a7~0 1)) (and .cse1 .cse5 .cse6 .cse2) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse2 .cse4)))) [2024-11-09 00:06:45,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 09.11 12:06:45 ImpRootNode [2024-11-09 00:06:45,264 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-09 00:06:45,264 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:06:45,265 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:06:45,265 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:06:45,266 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:59:41" (3/4) ... [2024-11-09 00:06:45,269 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 00:06:45,290 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 120 nodes and edges [2024-11-09 00:06:45,291 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-09 00:06:45,292 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 00:06:45,293 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 00:06:45,532 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7848f3b-85a8-421d-8a3f-a414d540b6f2/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-09 00:06:45,533 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7848f3b-85a8-421d-8a3f-a414d540b6f2/bin/ukojak-verify-ImItNfHLgk/witness.yml [2024-11-09 00:06:45,533 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:06:45,534 INFO L158 Benchmark]: Toolchain (without parser) took 426322.89ms. Allocated memory was 130.0MB in the beginning and 5.7GB in the end (delta: 5.6GB). Free memory was 74.4MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 740.1MB. Max. memory is 16.1GB. [2024-11-09 00:06:45,534 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 130.0MB. Free memory was 93.4MB in the beginning and 93.3MB in the end (delta: 28.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:06:45,535 INFO L158 Benchmark]: CACSL2BoogieTranslator took 673.31ms. Allocated memory was 130.0MB in the beginning and 178.3MB in the end (delta: 48.2MB). Free memory was 74.4MB in the beginning and 132.0MB in the end (delta: -57.6MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. [2024-11-09 00:06:45,536 INFO L158 Benchmark]: Boogie Procedure Inliner took 106.58ms. Allocated memory is still 178.3MB. Free memory was 132.0MB in the beginning and 126.6MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 00:06:45,536 INFO L158 Benchmark]: Boogie Preprocessor took 100.61ms. Allocated memory is still 178.3MB. Free memory was 126.6MB in the beginning and 122.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 00:06:45,537 INFO L158 Benchmark]: RCFGBuilder took 1632.26ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 122.4MB in the beginning and 146.1MB in the end (delta: -23.8MB). Peak memory consumption was 55.8MB. Max. memory is 16.1GB. [2024-11-09 00:06:45,537 INFO L158 Benchmark]: CodeCheck took 423535.06ms. Allocated memory was 213.9MB in the beginning and 5.7GB in the end (delta: 5.5GB). Free memory was 146.1MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 712.9MB. Max. memory is 16.1GB. [2024-11-09 00:06:45,538 INFO L158 Benchmark]: Witness Printer took 268.80ms. Allocated memory is still 5.7GB. Free memory was 4.9GB in the beginning and 4.9GB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 00:06:45,540 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: 388.0s, OverallIterations: 177, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 698262 SdHoareTripleChecker+Valid, 1960.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 695641 mSDsluCounter, 100951 SdHoareTripleChecker+Invalid, 1689.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 86185 mSDsCounter, 183770 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1538374 IncrementalHoareTripleChecker+Invalid, 1722144 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 183770 mSolverCounterUnsat, 14766 mSDtfsCounter, 1538374 mSolverCounterSat, 16.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 229191 GetRequests, 218174 SyntacticMatches, 9417 SemanticMatches, 1600 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1792898 ImplicationChecksByTransitivity, 293.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 1.4s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 53.2s InterpolantComputationTime, 34753 NumberOfCodeBlocks, 34753 NumberOfCodeBlocksAsserted, 176 NumberOfCheckSat, 34577 ConstructedInterpolants, 0 QuantifiedInterpolants, 206358 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 176 InterpolantComputations, 51 PerfectInterpolantSequences, 33226/41040 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 - PositiveResult [Line: 468]: 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: (((((((a21 != 1) || (((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a8 == 15)) && (a16 == 4))) || (a7 != 1)) || ((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a17 != 1))) || (((((a12 == 8) && (a8 == 13)) && (a17 == 1)) && (a20 == 1)) && (a16 == 4))) || (((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a8 == 15))) || (((((a20 != 1) && (a12 == 8)) && (14 == a8)) && (a17 != 1)) && (a16 == 4))) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: (((((((a21 != 1) || (((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a8 == 15)) && (a16 == 4))) || (a7 != 1)) || ((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a17 != 1))) || (((((a12 == 8) && (a8 == 13)) && (a17 == 1)) && (a20 == 1)) && (a16 == 4))) || (((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a8 == 15))) || (((((a20 != 1) && (a12 == 8)) && (14 == a8)) && (a17 != 1)) && (a16 == 4))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 130.0MB. Free memory was 93.4MB in the beginning and 93.3MB in the end (delta: 28.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 673.31ms. Allocated memory was 130.0MB in the beginning and 178.3MB in the end (delta: 48.2MB). Free memory was 74.4MB in the beginning and 132.0MB in the end (delta: -57.6MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 106.58ms. Allocated memory is still 178.3MB. Free memory was 132.0MB in the beginning and 126.6MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 100.61ms. Allocated memory is still 178.3MB. Free memory was 126.6MB in the beginning and 122.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1632.26ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 122.4MB in the beginning and 146.1MB in the end (delta: -23.8MB). Peak memory consumption was 55.8MB. Max. memory is 16.1GB. * CodeCheck took 423535.06ms. Allocated memory was 213.9MB in the beginning and 5.7GB in the end (delta: 5.5GB). Free memory was 146.1MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 712.9MB. Max. memory is 16.1GB. * Witness Printer took 268.80ms. Allocated memory is still 5.7GB. Free memory was 4.9GB in the beginning and 4.9GB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-09 00:06:45,588 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b7848f3b-85a8-421d-8a3f-a414d540b6f2/bin/ukojak-verify-ImItNfHLgk/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