./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label14.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc38f469-bfb2-43b8-821c-4167f9b4c63d/bin/ukojak-verify-ImItNfHLgk/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc38f469-bfb2-43b8-821c-4167f9b4c63d/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_fc38f469-bfb2-43b8-821c-4167f9b4c63d/bin/ukojak-verify-ImItNfHLgk/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc38f469-bfb2-43b8-821c-4167f9b4c63d/bin/ukojak-verify-ImItNfHLgk/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label14.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc38f469-bfb2-43b8-821c-4167f9b4c63d/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_fc38f469-bfb2-43b8-821c-4167f9b4c63d/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 250149b8db46a8cfd93cca5c9e51a3336d18e5ed9ae8a2faf72fd582a53985cf --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 19:31:33,433 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:31:33,550 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc38f469-bfb2-43b8-821c-4167f9b4c63d/bin/ukojak-verify-ImItNfHLgk/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-08 19:31:33,554 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:31:33,555 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-08 19:31:33,589 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:31:33,591 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:31:33,591 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-08 19:31:33,592 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:31:33,594 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:31:33,594 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:31:33,595 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:31:33,595 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:31:33,595 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:31:33,596 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:31:33,596 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:31:33,599 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:31:33,599 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:31:33,600 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:31:33,600 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:31:33,600 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:31:33,601 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:31:33,601 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:31:33,601 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-08 19:31:33,606 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-08 19:31:33,606 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-08 19:31:33,606 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:31:33,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 19:31:33,607 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:31:33,607 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:31:33,607 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:31:33,607 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-08 19:31:33,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:31:33,608 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_fc38f469-bfb2-43b8-821c-4167f9b4c63d/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_fc38f469-bfb2-43b8-821c-4167f9b4c63d/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 -> 250149b8db46a8cfd93cca5c9e51a3336d18e5ed9ae8a2faf72fd582a53985cf [2024-11-08 19:31:33,913 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:31:33,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:31:33,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:31:33,946 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:31:33,946 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:31:33,948 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc38f469-bfb2-43b8-821c-4167f9b4c63d/bin/ukojak-verify-ImItNfHLgk/../../sv-benchmarks/c/eca-rers2012/Problem01_label14.c Unable to find full path for "g++" [2024-11-08 19:31:35,912 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:31:36,232 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:31:36,232 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc38f469-bfb2-43b8-821c-4167f9b4c63d/sv-benchmarks/c/eca-rers2012/Problem01_label14.c [2024-11-08 19:31:36,249 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc38f469-bfb2-43b8-821c-4167f9b4c63d/bin/ukojak-verify-ImItNfHLgk/data/5456ebb12/2543b19af4da413eb0d0f6c5ad8a4a3d/FLAGd058bd700 [2024-11-08 19:31:36,266 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc38f469-bfb2-43b8-821c-4167f9b4c63d/bin/ukojak-verify-ImItNfHLgk/data/5456ebb12/2543b19af4da413eb0d0f6c5ad8a4a3d [2024-11-08 19:31:36,269 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:31:36,270 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:31:36,272 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:31:36,272 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:31:36,277 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:31:36,278 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:31:36" (1/1) ... [2024-11-08 19:31:36,279 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@417614f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:31:36, skipping insertion in model container [2024-11-08 19:31:36,280 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:31:36" (1/1) ... [2024-11-08 19:31:36,331 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:31:36,739 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_fc38f469-bfb2-43b8-821c-4167f9b4c63d/sv-benchmarks/c/eca-rers2012/Problem01_label14.c[21834,21847] [2024-11-08 19:31:36,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:31:36,791 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:31:36,929 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_fc38f469-bfb2-43b8-821c-4167f9b4c63d/sv-benchmarks/c/eca-rers2012/Problem01_label14.c[21834,21847] [2024-11-08 19:31:36,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:31:36,958 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:31:36,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:31:36 WrapperNode [2024-11-08 19:31:36,958 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:31:36,959 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:31:36,960 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:31:36,960 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:31:36,968 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:31:36" (1/1) ... [2024-11-08 19:31:36,985 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:31:36" (1/1) ... [2024-11-08 19:31:37,059 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-08 19:31:37,060 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:31:37,061 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:31:37,061 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:31:37,061 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:31:37,071 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:31:36" (1/1) ... [2024-11-08 19:31:37,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:31:36" (1/1) ... [2024-11-08 19:31:37,076 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:31:36" (1/1) ... [2024-11-08 19:31:37,077 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:31:36" (1/1) ... [2024-11-08 19:31:37,097 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:31:36" (1/1) ... [2024-11-08 19:31:37,105 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:31:36" (1/1) ... [2024-11-08 19:31:37,110 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:31:36" (1/1) ... [2024-11-08 19:31:37,114 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:31:36" (1/1) ... [2024-11-08 19:31:37,122 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:31:37,123 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:31:37,123 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:31:37,127 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:31:37,128 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:31:36" (1/1) ... [2024-11-08 19:31:37,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-08 19:31:37,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc38f469-bfb2-43b8-821c-4167f9b4c63d/bin/ukojak-verify-ImItNfHLgk/z3 [2024-11-08 19:31:37,164 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc38f469-bfb2-43b8-821c-4167f9b4c63d/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-08 19:31:37,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc38f469-bfb2-43b8-821c-4167f9b4c63d/bin/ukojak-verify-ImItNfHLgk/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-08 19:31:37,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:31:37,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 19:31:37,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:31:37,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:31:37,299 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:31:37,302 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:31:38,487 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-08 19:31:38,487 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:31:38,743 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:31:38,743 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:31:38,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:31:38 BoogieIcfgContainer [2024-11-08 19:31:38,743 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:31:38,744 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-08 19:31:38,744 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-08 19:31:38,756 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-08 19:31:38,757 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:31:38" (1/1) ... [2024-11-08 19:31:38,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:31:38,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:31:38,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-11-08 19:31:38,840 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-11-08 19:31:38,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-08 19:31:38,845 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:31:38,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:31:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:39,816 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 19:31:40,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:31:40,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 145 states and 220 transitions. [2024-11-08 19:31:40,645 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 220 transitions. [2024-11-08 19:31:40,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-08 19:31:40,647 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:31:40,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:31:40,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:40,792 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 19:31:41,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:31:41,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 214 states and 297 transitions. [2024-11-08 19:31:41,852 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 297 transitions. [2024-11-08 19:31:41,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-08 19:31:41,857 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:31:41,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:31:41,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:42,335 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:31:43,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:31:43,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 283 states and 367 transitions. [2024-11-08 19:31:43,365 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 367 transitions. [2024-11-08 19:31:43,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-08 19:31:43,367 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:31:43,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:31:43,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:43,708 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:31:44,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:31:44,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 297 states and 386 transitions. [2024-11-08 19:31:44,326 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 386 transitions. [2024-11-08 19:31:44,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-08 19:31:44,330 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:31:44,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:31:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:44,497 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 19:31:44,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:31:44,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 306 states and 397 transitions. [2024-11-08 19:31:44,767 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 397 transitions. [2024-11-08 19:31:44,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 19:31:44,769 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:31:44,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:31:44,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:45,053 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 19:31:45,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:31:45,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 308 states and 399 transitions. [2024-11-08 19:31:45,164 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 399 transitions. [2024-11-08 19:31:45,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-08 19:31:45,166 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:31:45,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:31:45,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:45,383 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 19:31:46,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:31:46,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 334 states and 431 transitions. [2024-11-08 19:31:46,493 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 431 transitions. [2024-11-08 19:31:46,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-08 19:31:46,494 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:31:46,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:31:46,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:46,682 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 19:31:47,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:31:47,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 351 states and 451 transitions. [2024-11-08 19:31:47,465 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 451 transitions. [2024-11-08 19:31:47,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 19:31:47,466 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:31:47,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:31:47,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:47,811 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 19:31:48,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:31:48,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 380 states and 483 transitions. [2024-11-08 19:31:48,607 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 483 transitions. [2024-11-08 19:31:48,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-08 19:31:48,609 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:31:48,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:31:48,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:48,974 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 60 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 19:31:50,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:31:50,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 428 states and 537 transitions. [2024-11-08 19:31:50,281 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 537 transitions. [2024-11-08 19:31:50,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 19:31:50,283 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:31:50,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:31:50,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:50,639 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-08 19:31:50,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:31:50,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 431 states and 541 transitions. [2024-11-08 19:31:50,896 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 541 transitions. [2024-11-08 19:31:50,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-08 19:31:50,898 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:31:50,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:31:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:51,319 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:31:53,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:31:53,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 494 states and 612 transitions. [2024-11-08 19:31:53,369 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 612 transitions. [2024-11-08 19:31:53,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-08 19:31:53,371 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:31:53,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:31:53,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:53,633 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:31:53,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:31:53,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 496 states and 613 transitions. [2024-11-08 19:31:53,921 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 613 transitions. [2024-11-08 19:31:53,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-08 19:31:53,923 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:31:53,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:31:53,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:54,104 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 19:31:54,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:31:54,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 511 states and 629 transitions. [2024-11-08 19:31:54,783 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 629 transitions. [2024-11-08 19:31:54,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-08 19:31:54,785 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:31:54,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:31:54,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:55,122 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 19:31:55,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:31:55,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 512 states and 629 transitions. [2024-11-08 19:31:55,241 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 629 transitions. [2024-11-08 19:31:55,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-08 19:31:55,244 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:31:55,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:31:55,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:55,773 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-08 19:31:57,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:31:57,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 581 states and 713 transitions. [2024-11-08 19:31:57,443 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 713 transitions. [2024-11-08 19:31:57,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 19:31:57,446 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:31:57,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:31:57,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:57,795 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:31:58,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:31:58,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 600 states and 736 transitions. [2024-11-08 19:31:58,884 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 736 transitions. [2024-11-08 19:31:58,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 19:31:58,886 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:31:58,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:31:58,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:59,177 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:31:59,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:31:59,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 602 states and 737 transitions. [2024-11-08 19:31:59,481 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 737 transitions. [2024-11-08 19:31:59,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 19:31:59,483 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:31:59,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:31:59,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:59,688 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 19:31:59,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:31:59,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 604 states and 740 transitions. [2024-11-08 19:31:59,938 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 740 transitions. [2024-11-08 19:31:59,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 19:31:59,940 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:31:59,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:31:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:00,285 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 84 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 19:32:01,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:01,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 645 states and 784 transitions. [2024-11-08 19:32:01,436 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 784 transitions. [2024-11-08 19:32:01,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-08 19:32:01,438 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:01,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:01,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:01,606 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-08 19:32:02,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:02,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 670 states and 809 transitions. [2024-11-08 19:32:02,017 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 809 transitions. [2024-11-08 19:32:02,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-08 19:32:02,019 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:02,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:02,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:02,233 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 19:32:02,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:02,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 672 states and 810 transitions. [2024-11-08 19:32:02,613 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 810 transitions. [2024-11-08 19:32:02,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-08 19:32:02,616 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:02,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:02,788 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 19:32:03,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:03,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 718 states and 868 transitions. [2024-11-08 19:32:03,699 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 868 transitions. [2024-11-08 19:32:03,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-08 19:32:03,701 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:03,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:03,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:03,950 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 19:32:04,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:04,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 733 states and 887 transitions. [2024-11-08 19:32:04,703 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 887 transitions. [2024-11-08 19:32:04,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-08 19:32:04,705 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:04,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:04,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:05,367 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:32:08,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:08,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 817 states and 985 transitions. [2024-11-08 19:32:08,468 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 985 transitions. [2024-11-08 19:32:08,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-08 19:32:08,470 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:08,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:08,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:09,047 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-08 19:32:11,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:11,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 869 states and 1051 transitions. [2024-11-08 19:32:11,127 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1051 transitions. [2024-11-08 19:32:11,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-08 19:32:11,129 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:11,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:11,867 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 156 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 19:32:13,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:13,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 931 states and 1123 transitions. [2024-11-08 19:32:13,621 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1123 transitions. [2024-11-08 19:32:13,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-08 19:32:13,622 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:13,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:13,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:14,138 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 156 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 19:32:14,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:14,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 933 states and 1124 transitions. [2024-11-08 19:32:14,517 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1124 transitions. [2024-11-08 19:32:14,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-08 19:32:14,519 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:14,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:15,318 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-08 19:32:17,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:17,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1009 states and 1218 transitions. [2024-11-08 19:32:17,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1218 transitions. [2024-11-08 19:32:17,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-08 19:32:17,427 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:17,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:17,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:17,884 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-08 19:32:19,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:19,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1028 states and 1239 transitions. [2024-11-08 19:32:19,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1239 transitions. [2024-11-08 19:32:19,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-08 19:32:19,043 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:19,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:19,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:19,255 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-08 19:32:20,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:20,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1051 states and 1265 transitions. [2024-11-08 19:32:20,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1265 transitions. [2024-11-08 19:32:20,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-08 19:32:20,238 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:20,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:20,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:20,700 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-08 19:32:21,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:21,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1066 states and 1284 transitions. [2024-11-08 19:32:21,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1284 transitions. [2024-11-08 19:32:21,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-08 19:32:21,210 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:21,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:21,451 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-08 19:32:23,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:23,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1136 states and 1356 transitions. [2024-11-08 19:32:23,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1356 transitions. [2024-11-08 19:32:23,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-08 19:32:23,912 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:23,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:24,294 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-08 19:32:25,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:25,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1199 states and 1427 transitions. [2024-11-08 19:32:25,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1427 transitions. [2024-11-08 19:32:25,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-08 19:32:25,966 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:25,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:26,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:26,345 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-08 19:32:27,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:27,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1233 states and 1466 transitions. [2024-11-08 19:32:27,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1466 transitions. [2024-11-08 19:32:27,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-08 19:32:27,563 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:27,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:27,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:28,128 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-08 19:32:29,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:29,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1293 states and 1539 transitions. [2024-11-08 19:32:29,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1539 transitions. [2024-11-08 19:32:29,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-08 19:32:29,437 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:29,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:29,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:29,798 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-08 19:32:31,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:31,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1314 states and 1562 transitions. [2024-11-08 19:32:31,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1562 transitions. [2024-11-08 19:32:31,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 19:32:31,515 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:31,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:31,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:31,920 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-08 19:32:33,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:33,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1336 states and 1591 transitions. [2024-11-08 19:32:33,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 1591 transitions. [2024-11-08 19:32:33,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-08 19:32:33,838 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:33,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:34,169 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-08 19:32:36,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:36,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1369 states and 1626 transitions. [2024-11-08 19:32:36,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1626 transitions. [2024-11-08 19:32:36,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-08 19:32:36,229 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:36,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:36,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:36,645 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-08 19:32:38,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:38,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1394 states and 1656 transitions. [2024-11-08 19:32:38,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1656 transitions. [2024-11-08 19:32:38,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-08 19:32:38,800 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:38,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:38,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:39,091 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-08 19:32:40,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:40,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1410 states and 1672 transitions. [2024-11-08 19:32:40,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 1672 transitions. [2024-11-08 19:32:40,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-08 19:32:40,228 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:40,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:40,807 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-08 19:32:43,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:43,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1457 states and 1734 transitions. [2024-11-08 19:32:43,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 1734 transitions. [2024-11-08 19:32:43,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-08 19:32:43,458 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:43,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:43,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:43,818 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-08 19:32:44,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:44,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1466 states and 1742 transitions. [2024-11-08 19:32:44,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 1742 transitions. [2024-11-08 19:32:44,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-08 19:32:44,519 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:44,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:44,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:44,824 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-08 19:32:46,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:46,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1483 states and 1763 transitions. [2024-11-08 19:32:46,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 1763 transitions. [2024-11-08 19:32:46,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-08 19:32:46,173 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:46,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:46,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:46,672 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 140 proven. 71 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-08 19:32:46,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:46,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1486 states and 1766 transitions. [2024-11-08 19:32:46,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 1766 transitions. [2024-11-08 19:32:46,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-08 19:32:46,845 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:46,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:46,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:47,673 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-08 19:32:51,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:51,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1923 states to 1620 states and 1923 transitions. [2024-11-08 19:32:51,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 1923 transitions. [2024-11-08 19:32:51,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-08 19:32:51,628 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:51,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:51,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:51,916 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-08 19:32:53,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:53,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1648 states and 1952 transitions. [2024-11-08 19:32:53,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 1952 transitions. [2024-11-08 19:32:53,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-08 19:32:53,030 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:53,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:53,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:53,370 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-08 19:32:54,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:54,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1661 states and 1967 transitions. [2024-11-08 19:32:54,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 1967 transitions. [2024-11-08 19:32:54,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-08 19:32:54,008 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:54,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:54,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:54,465 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-08 19:32:54,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:54,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1664 states and 1971 transitions. [2024-11-08 19:32:54,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 1971 transitions. [2024-11-08 19:32:54,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-08 19:32:54,998 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:54,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:55,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:55,409 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 86 proven. 141 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-08 19:32:58,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:32:58,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 1752 states and 2072 transitions. [2024-11-08 19:32:58,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 2072 transitions. [2024-11-08 19:32:58,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-08 19:32:58,420 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:32:58,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:32:58,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:32:59,053 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-08 19:33:00,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:33:00,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2148 states to 1826 states and 2148 transitions. [2024-11-08 19:33:00,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states and 2148 transitions. [2024-11-08 19:33:00,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-08 19:33:00,765 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:33:00,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:00,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:01,438 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-08 19:33:03,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:33:03,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 1847 states and 2170 transitions. [2024-11-08 19:33:03,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 2170 transitions. [2024-11-08 19:33:03,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-08 19:33:03,235 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:33:03,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:03,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:03,561 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-08 19:33:03,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:33:03,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2172 states to 1849 states and 2172 transitions. [2024-11-08 19:33:03,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 2172 transitions. [2024-11-08 19:33:03,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-08 19:33:03,835 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:33:03,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:03,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:04,255 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-08 19:33:04,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:33:04,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2189 states to 1864 states and 2189 transitions. [2024-11-08 19:33:04,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 2189 transitions. [2024-11-08 19:33:04,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-08 19:33:04,911 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:33:04,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:05,388 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-08 19:33:06,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:33:06,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 1901 states and 2234 transitions. [2024-11-08 19:33:06,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1901 states and 2234 transitions. [2024-11-08 19:33:06,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-08 19:33:06,967 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:33:06,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:06,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:07,447 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 174 proven. 28 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-08 19:33:08,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:33:08,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 1912 states and 2246 transitions. [2024-11-08 19:33:08,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 2246 transitions. [2024-11-08 19:33:08,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-08 19:33:08,165 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:33:08,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:08,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:08,740 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-08 19:33:09,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:33:09,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2252 states to 1915 states and 2252 transitions. [2024-11-08 19:33:09,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 2252 transitions. [2024-11-08 19:33:09,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-08 19:33:09,693 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:33:09,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:09,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:09,892 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-08 19:33:10,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:33:10,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2255 states to 1918 states and 2255 transitions. [2024-11-08 19:33:10,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1918 states and 2255 transitions. [2024-11-08 19:33:10,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-11-08 19:33:10,083 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:33:10,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:10,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:10,738 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 190 proven. 36 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-08 19:33:12,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:33:12,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2270 states to 1931 states and 2270 transitions. [2024-11-08 19:33:12,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2270 transitions. [2024-11-08 19:33:12,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-08 19:33:12,684 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:33:12,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:13,099 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 166 proven. 97 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-08 19:33:13,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:33:13,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2286 states to 1945 states and 2286 transitions. [2024-11-08 19:33:13,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1945 states and 2286 transitions. [2024-11-08 19:33:13,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-08 19:33:13,919 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:33:13,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:14,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,300 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-08 19:33:15,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:33:15,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2334 states to 1986 states and 2334 transitions. [2024-11-08 19:33:15,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1986 states and 2334 transitions. [2024-11-08 19:33:15,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-08 19:33:15,894 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:33:15,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:15,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:16,392 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-08 19:33:19,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:33:19,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2386 states to 2025 states and 2386 transitions. [2024-11-08 19:33:19,518 INFO L276 IsEmpty]: Start isEmpty. Operand 2025 states and 2386 transitions. [2024-11-08 19:33:19,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-08 19:33:19,521 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:33:19,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:19,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:19,921 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 169 proven. 100 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-08 19:33:20,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:33:20,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 2039 states and 2401 transitions. [2024-11-08 19:33:20,646 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 2401 transitions. [2024-11-08 19:33:20,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-08 19:33:20,648 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:33:20,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:20,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:21,025 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 169 proven. 100 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-08 19:33:21,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:33:21,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2404 states to 2042 states and 2404 transitions. [2024-11-08 19:33:21,737 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 2404 transitions. [2024-11-08 19:33:21,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-08 19:33:21,738 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:33:21,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:21,905 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-08 19:33:23,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:33:23,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2417 states to 2054 states and 2417 transitions. [2024-11-08 19:33:23,450 INFO L276 IsEmpty]: Start isEmpty. Operand 2054 states and 2417 transitions. [2024-11-08 19:33:23,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-08 19:33:23,451 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:33:23,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:23,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:23,614 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-08 19:33:24,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:33:24,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2421 states to 2056 states and 2421 transitions. [2024-11-08 19:33:24,374 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2421 transitions. [2024-11-08 19:33:24,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-08 19:33:24,375 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:33:24,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:24,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:24,702 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-08 19:33:25,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:33:25,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2433 states to 2068 states and 2433 transitions. [2024-11-08 19:33:25,442 INFO L276 IsEmpty]: Start isEmpty. Operand 2068 states and 2433 transitions. [2024-11-08 19:33:25,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-08 19:33:25,444 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:33:25,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:26,031 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-08 19:33:33,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:33:33,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2526 states to 2145 states and 2526 transitions. [2024-11-08 19:33:33,170 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 2526 transitions. [2024-11-08 19:33:33,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-08 19:33:33,172 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:33:33,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:33,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:33,407 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-08 19:33:34,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:33:34,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2527 states to 2147 states and 2527 transitions. [2024-11-08 19:33:34,167 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 2527 transitions. [2024-11-08 19:33:34,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-08 19:33:34,169 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:33:34,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:34,504 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-08 19:33:34,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:33:34,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2530 states to 2150 states and 2530 transitions. [2024-11-08 19:33:34,915 INFO L276 IsEmpty]: Start isEmpty. Operand 2150 states and 2530 transitions. [2024-11-08 19:33:34,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-08 19:33:34,918 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:33:34,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:34,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:35,291 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 179 proven. 104 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-08 19:33:35,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:33:35,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2539 states to 2159 states and 2539 transitions. [2024-11-08 19:33:35,496 INFO L276 IsEmpty]: Start isEmpty. Operand 2159 states and 2539 transitions. [2024-11-08 19:33:35,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-08 19:33:35,497 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:33:35,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:35,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:35,826 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-08 19:33:36,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:33:36,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2565 states to 2183 states and 2565 transitions. [2024-11-08 19:33:36,708 INFO L276 IsEmpty]: Start isEmpty. Operand 2183 states and 2565 transitions. [2024-11-08 19:33:36,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-08 19:33:36,709 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:33:36,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:37,176 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-08 19:33:42,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:33:42,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2661 states to 2260 states and 2661 transitions. [2024-11-08 19:33:42,642 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 2661 transitions. [2024-11-08 19:33:42,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-08 19:33:42,644 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:33:42,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:42,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:43,084 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-08 19:33:43,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:33:43,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2665 states to 2264 states and 2665 transitions. [2024-11-08 19:33:43,811 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 2665 transitions. [2024-11-08 19:33:43,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-08 19:33:43,812 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:33:43,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:43,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:43,976 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-11-08 19:33:44,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:33:44,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2668 states to 2267 states and 2668 transitions. [2024-11-08 19:33:44,156 INFO L276 IsEmpty]: Start isEmpty. Operand 2267 states and 2668 transitions. [2024-11-08 19:33:44,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-08 19:33:44,159 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:33:44,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:44,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:44,339 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-11-08 19:33:44,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:33:44,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2671 states to 2270 states and 2671 transitions. [2024-11-08 19:33:44,671 INFO L276 IsEmpty]: Start isEmpty. Operand 2270 states and 2671 transitions. [2024-11-08 19:33:44,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-08 19:33:44,673 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:33:44,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:45,042 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 175 proven. 106 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-08 19:33:45,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:33:45,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2273 states and 2674 transitions. [2024-11-08 19:33:45,277 INFO L276 IsEmpty]: Start isEmpty. Operand 2273 states and 2674 transitions. [2024-11-08 19:33:45,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-08 19:33:45,279 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:33:45,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:45,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:45,657 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-08 19:33:47,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:33:47,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2687 states to 2284 states and 2687 transitions. [2024-11-08 19:33:47,556 INFO L276 IsEmpty]: Start isEmpty. Operand 2284 states and 2687 transitions. [2024-11-08 19:33:47,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-08 19:33:47,559 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:33:47,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:48,244 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-08 19:33:56,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:33:56,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2751 states to 2341 states and 2751 transitions. [2024-11-08 19:33:56,562 INFO L276 IsEmpty]: Start isEmpty. Operand 2341 states and 2751 transitions. [2024-11-08 19:33:56,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-08 19:33:56,564 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:33:56,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:56,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:56,949 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-08 19:34:02,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:34:02,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2799 states to 2388 states and 2799 transitions. [2024-11-08 19:34:02,719 INFO L276 IsEmpty]: Start isEmpty. Operand 2388 states and 2799 transitions. [2024-11-08 19:34:02,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-08 19:34:02,721 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:34:02,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:34:02,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:34:03,120 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-08 19:34:04,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:34:04,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2814 states to 2403 states and 2814 transitions. [2024-11-08 19:34:04,747 INFO L276 IsEmpty]: Start isEmpty. Operand 2403 states and 2814 transitions. [2024-11-08 19:34:04,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-08 19:34:04,750 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:34:04,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:34:04,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:34:04,903 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-11-08 19:34:05,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:34:05,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2816 states to 2404 states and 2816 transitions. [2024-11-08 19:34:05,761 INFO L276 IsEmpty]: Start isEmpty. Operand 2404 states and 2816 transitions. [2024-11-08 19:34:05,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-08 19:34:05,764 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:34:05,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:34:05,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:34:05,944 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-11-08 19:34:06,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:34:06,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2816 states to 2405 states and 2816 transitions. [2024-11-08 19:34:06,672 INFO L276 IsEmpty]: Start isEmpty. Operand 2405 states and 2816 transitions. [2024-11-08 19:34:06,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-08 19:34:06,675 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:34:06,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:34:06,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:34:07,009 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 186 proven. 111 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-08 19:34:07,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:34:07,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2823 states to 2412 states and 2823 transitions. [2024-11-08 19:34:07,217 INFO L276 IsEmpty]: Start isEmpty. Operand 2412 states and 2823 transitions. [2024-11-08 19:34:07,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-11-08 19:34:07,218 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:34:07,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:34:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:34:07,369 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 253 proven. 64 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-08 19:34:08,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:34:08,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2824 states to 2413 states and 2824 transitions. [2024-11-08 19:34:08,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2413 states and 2824 transitions. [2024-11-08 19:34:08,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-08 19:34:08,105 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:34:08,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:34:08,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:34:08,624 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-08 19:34:12,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:34:12,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2857 states to 2444 states and 2857 transitions. [2024-11-08 19:34:12,347 INFO L276 IsEmpty]: Start isEmpty. Operand 2444 states and 2857 transitions. [2024-11-08 19:34:12,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-08 19:34:12,348 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:34:12,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:34:12,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:34:12,836 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 189 proven. 114 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-08 19:34:13,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:34:13,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2861 states to 2447 states and 2861 transitions. [2024-11-08 19:34:13,050 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 2861 transitions. [2024-11-08 19:34:13,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-08 19:34:13,051 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:34:13,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:34:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:34:13,439 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-08 19:34:15,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:34:15,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2883 states to 2460 states and 2883 transitions. [2024-11-08 19:34:15,750 INFO L276 IsEmpty]: Start isEmpty. Operand 2460 states and 2883 transitions. [2024-11-08 19:34:15,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-08 19:34:15,752 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:34:15,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:34:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:34:16,061 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-08 19:34:18,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:34:18,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2900 states to 2471 states and 2900 transitions. [2024-11-08 19:34:18,079 INFO L276 IsEmpty]: Start isEmpty. Operand 2471 states and 2900 transitions. [2024-11-08 19:34:18,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-08 19:34:18,082 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:34:18,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:34:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:34:18,605 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-08 19:34:29,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:34:29,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3046 states to 2598 states and 3046 transitions. [2024-11-08 19:34:29,022 INFO L276 IsEmpty]: Start isEmpty. Operand 2598 states and 3046 transitions. [2024-11-08 19:34:29,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-08 19:34:29,024 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:34:29,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:34:29,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:34:29,937 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-08 19:34:33,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:34:33,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 2659 states and 3115 transitions. [2024-11-08 19:34:33,275 INFO L276 IsEmpty]: Start isEmpty. Operand 2659 states and 3115 transitions. [2024-11-08 19:34:33,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-08 19:34:33,277 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:34:33,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:34:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:34:33,655 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-08 19:34:34,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:34:34,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 2664 states and 3121 transitions. [2024-11-08 19:34:34,167 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 3121 transitions. [2024-11-08 19:34:34,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-08 19:34:34,169 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:34:34,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:34:34,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:34:34,453 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2024-11-08 19:34:34,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:34:34,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 2665 states and 3121 transitions. [2024-11-08 19:34:34,697 INFO L276 IsEmpty]: Start isEmpty. Operand 2665 states and 3121 transitions. [2024-11-08 19:34:34,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-08 19:34:34,699 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-08 19:34:34,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:34:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:34:35,310 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-08 19:34:39,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-08 19:34:39,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3170 states to 2717 states and 3170 transitions. [2024-11-08 19:34:39,415 INFO L276 IsEmpty]: Start isEmpty. Operand 2717 states and 3170 transitions. [2024-11-08 19:34:39,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 19:34:39,417 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 95 iterations. [2024-11-08 19:34:39,426 INFO L729 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-11-08 19:35:20,223 INFO L77 FloydHoareUtils]: At program point L102(lines 102 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,224 INFO L77 FloydHoareUtils]: At program point L598(line 598) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,224 INFO L77 FloydHoareUtils]: At program point L334(lines 334 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,225 INFO L77 FloydHoareUtils]: At program point L302(lines 302 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,225 INFO L77 FloydHoareUtils]: At program point L170(lines 170 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-08 19:35:20,225 INFO L77 FloydHoareUtils]: At program point L204(lines 204 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-08 19:35:20,226 INFO L77 FloydHoareUtils]: At program point L72(lines 72 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,226 INFO L77 FloydHoareUtils]: At program point L271(lines 271 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,227 INFO L77 FloydHoareUtils]: At program point L139(lines 139 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,227 INFO L77 FloydHoareUtils]: At program point L371(lines 371 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,227 INFO L77 FloydHoareUtils]: At program point L107(lines 107 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,227 INFO L77 FloydHoareUtils]: At program point L41(lines 41 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,228 INFO L77 FloydHoareUtils]: At program point L339(lines 339 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,228 INFO L77 FloydHoareUtils]: At program point L207(lines 207 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-08 19:35:20,228 INFO L77 FloydHoareUtils]: At program point L75(lines 75 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,229 INFO L77 FloydHoareUtils]: At program point L373(lines 373 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,229 INFO L77 FloydHoareUtils]: At program point L241(lines 241 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,229 INFO L77 FloydHoareUtils]: At program point L175(lines 175 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-08 19:35:20,230 INFO L77 FloydHoareUtils]: At program point L275(lines 275 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,230 INFO L77 FloydHoareUtils]: At program point L375(lines 375 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,230 INFO L77 FloydHoareUtils]: At program point L309(lines 309 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,231 INFO L77 FloydHoareUtils]: At program point L45(lines 45 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,231 INFO L77 FloydHoareUtils]: At program point L343(lines 343 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,231 INFO L77 FloydHoareUtils]: At program point L112(lines 112 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,232 INFO L77 FloydHoareUtils]: At program point L575-1(lines 40 585) the Hoare annotation is: (not (and (< 13 ~a8~0) (= ~a7~0 1))) [2024-11-08 19:35:20,232 INFO L77 FloydHoareUtils]: At program point L278(lines 278 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,232 INFO L77 FloydHoareUtils]: At program point L146(lines 146 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,233 INFO L77 FloydHoareUtils]: At program point L213(lines 213 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-08 19:35:20,233 INFO L77 FloydHoareUtils]: At program point L82(lines 82 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,233 INFO L77 FloydHoareUtils]: At program point L578-1(lines 40 585) the Hoare annotation is: (not (and (< 13 ~a8~0) (= ~a7~0 1))) [2024-11-08 19:35:20,234 INFO L77 FloydHoareUtils]: At program point L347(lines 347 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,234 INFO L77 FloydHoareUtils]: At program point L248(lines 248 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,234 INFO L75 FloydHoareUtils]: For program point L579(line 579) no Hoare annotation was computed. [2024-11-08 19:35:20,234 INFO L77 FloydHoareUtils]: At program point L183(lines 183 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-08 19:35:20,235 INFO L77 FloydHoareUtils]: At program point L150(lines 150 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,235 INFO L77 FloydHoareUtils]: At program point L382(lines 382 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,235 INFO L77 FloydHoareUtils]: At program point L316(lines 316 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,235 INFO L77 FloydHoareUtils]: At program point L283(lines 283 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,236 INFO L77 FloydHoareUtils]: At program point L118(lines 118 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,236 INFO L77 FloydHoareUtils]: At program point L218(lines 218 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-08 19:35:20,236 INFO L77 FloydHoareUtils]: At program point L53(lines 53 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,237 INFO L77 FloydHoareUtils]: At program point L154(lines 154 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,237 INFO L77 FloydHoareUtils]: At program point L188(lines 188 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-08 19:35:20,237 INFO L77 FloydHoareUtils]: At program point L387(lines 387 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,237 INFO L77 FloydHoareUtils]: At program point L288(lines 288 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,238 INFO L77 FloydHoareUtils]: At program point L255(lines 255 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,238 INFO L77 FloydHoareUtils]: At program point L90(lines 90 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,238 INFO L77 FloydHoareUtils]: At program point L355(lines 355 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,239 INFO L77 FloydHoareUtils]: At program point L322(lines 322 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,239 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-08 19:35:20,239 INFO L77 FloydHoareUtils]: At program point L124(lines 124 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,239 INFO L77 FloydHoareUtils]: At program point L587(lines 587 604) the Hoare annotation is: true [2024-11-08 19:35:20,240 INFO L77 FloydHoareUtils]: At program point L224(lines 224 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,240 INFO L77 FloydHoareUtils]: At program point L158(lines 158 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-08 19:35:20,240 INFO L77 FloydHoareUtils]: At program point L59(lines 59 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,241 INFO L77 FloydHoareUtils]: At program point L94(lines 94 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,241 INFO L77 FloydHoareUtils]: At program point L392(lines 392 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,241 INFO L77 FloydHoareUtils]: At program point L326(lines 326 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,241 INFO L77 FloydHoareUtils]: At program point L260(lines 260 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,242 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-08 19:35:20,242 INFO L77 FloydHoareUtils]: At program point L228(lines 228 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,242 INFO L77 FloydHoareUtils]: At program point L162(lines 162 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-08 19:35:20,242 INFO L77 FloydHoareUtils]: At program point L129(lines 129 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,243 INFO L77 FloydHoareUtils]: At program point L328(lines 328 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,243 INFO L77 FloydHoareUtils]: At program point L196(lines 196 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-08 19:35:20,243 INFO L77 FloydHoareUtils]: At program point L64(lines 64 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,243 INFO L77 FloydHoareUtils]: At program point L593-2(lines 593 603) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,243 INFO L77 FloydHoareUtils]: At program point L296(lines 296 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,244 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 40 585) the Hoare annotation is: (not (let ((.cse5 (= ~a8~0 15)) (.cse2 (= 5 ~a16~0)) (.cse0 (not (= ~a20~0 1))) (.cse1 (= ~a12~0 8)) (.cse7 (= 14 ~a8~0)) (.cse3 (not (= ~a17~0 1))) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6)) (not (and .cse1 .cse7 .cse2 .cse3 .cse4)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse6))))) [2024-11-08 19:35:20,244 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2024-11-08 19:35:20,244 INFO L77 FloydHoareUtils]: At program point L363(lines 363 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,245 INFO L77 FloydHoareUtils]: At program point L199(lines 199 400) the Hoare annotation is: (let ((.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1)) (.cse5 (= ~a7~0 1))) (let ((.cse11 (= 14 ~a8~0)) (.cse0 (not .cse5)) (.cse7 (= ~a16~0 4)) (.cse1 (not .cse10)) (.cse2 (= ~a12~0 8)) (.cse8 (= 5 ~a16~0)) (.cse3 (not .cse9)) (.cse4 (= ~a21~0 1)) (.cse6 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (<= ~a8~0 13) (and .cse2 .cse8 .cse4 .cse9 .cse10 .cse6) (and .cse0 (not (and .cse2 .cse4 .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0)))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse7) (and .cse2 .cse11 .cse8 .cse3 .cse4) (and .cse0 (not .cse7)) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse6)))) [2024-11-08 19:35:20,245 INFO L77 FloydHoareUtils]: At program point L365(lines 365 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,245 INFO L77 FloydHoareUtils]: At program point L266(lines 266 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,246 INFO L77 FloydHoareUtils]: At program point L233(lines 233 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,246 INFO L77 FloydHoareUtils]: At program point L134(lines 134 400) the Hoare annotation is: (not (let ((.cse3 (= ~a17~0 1)) (.cse4 (= ~a20~0 1))) (let ((.cse5 (= ~a8~0 15)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse4)) (.cse0 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse7 (not .cse3)) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (not (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse5)) (not (and .cse6 .cse0 .cse7 .cse2 .cse5 .cse8)) (not (and .cse0 .cse9 .cse1 .cse7 .cse2)) (< 13 ~a8~0) (= ~a7~0 1) (not (and .cse6 .cse0 .cse9 .cse7 .cse2 .cse8)))))) [2024-11-08 19:35:20,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.11 07:35:20 ImpRootNode [2024-11-08 19:35:20,266 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-08 19:35:20,266 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:35:20,267 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:35:20,267 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:35:20,267 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:31:38" (3/4) ... [2024-11-08 19:35:20,270 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 19:35:20,286 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 118 nodes and edges [2024-11-08 19:35:20,290 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-11-08 19:35:20,291 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 19:35:20,292 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 19:35:20,500 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc38f469-bfb2-43b8-821c-4167f9b4c63d/bin/ukojak-verify-ImItNfHLgk/witness.graphml [2024-11-08 19:35:20,500 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc38f469-bfb2-43b8-821c-4167f9b4c63d/bin/ukojak-verify-ImItNfHLgk/witness.yml [2024-11-08 19:35:20,501 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:35:20,501 INFO L158 Benchmark]: Toolchain (without parser) took 224231.19ms. Allocated memory was 138.4MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 107.5MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 232.1MB. Max. memory is 16.1GB. [2024-11-08 19:35:20,502 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 111.1MB. Free memory is still 70.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:35:20,502 INFO L158 Benchmark]: CACSL2BoogieTranslator took 687.04ms. Allocated memory is still 138.4MB. Free memory was 107.0MB in the beginning and 77.0MB in the end (delta: 30.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-08 19:35:20,502 INFO L158 Benchmark]: Boogie Procedure Inliner took 100.59ms. Allocated memory is still 138.4MB. Free memory was 77.0MB in the beginning and 71.2MB in the end (delta: 5.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 19:35:20,502 INFO L158 Benchmark]: Boogie Preprocessor took 61.44ms. Allocated memory is still 138.4MB. Free memory was 71.2MB in the beginning and 66.5MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 19:35:20,503 INFO L158 Benchmark]: RCFGBuilder took 1620.86ms. Allocated memory was 138.4MB in the beginning and 167.8MB in the end (delta: 29.4MB). Free memory was 66.5MB in the beginning and 119.5MB in the end (delta: -53.0MB). Peak memory consumption was 36.0MB. Max. memory is 16.1GB. [2024-11-08 19:35:20,503 INFO L158 Benchmark]: CodeCheck took 221521.63ms. Allocated memory was 167.8MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 119.5MB in the beginning and 2.0GB in the end (delta: -1.8GB). Peak memory consumption was 200.8MB. Max. memory is 16.1GB. [2024-11-08 19:35:20,503 INFO L158 Benchmark]: Witness Printer took 234.32ms. Allocated memory is still 2.2GB. Free memory was 2.0GB in the beginning and 1.9GB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 19:35:20,505 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: 180.6s, OverallIterations: 95, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 285153 SdHoareTripleChecker+Valid, 852.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 284314 mSDsluCounter, 37093 SdHoareTripleChecker+Invalid, 736.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31471 mSDsCounter, 61896 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 619827 IncrementalHoareTripleChecker+Invalid, 681723 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61896 mSolverCounterUnsat, 5622 mSDtfsCounter, 619827 mSolverCounterSat, 7.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 128586 GetRequests, 120707 SyntacticMatches, 6935 SemanticMatches, 944 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645716 ImplicationChecksByTransitivity, 121.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.8s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 33.1s InterpolantComputationTime, 19125 NumberOfCodeBlocks, 19125 NumberOfCodeBlocksAsserted, 94 NumberOfCheckSat, 19031 ConstructedInterpolants, 0 QuantifiedInterpolants, 148231 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 94 InterpolantComputations, 27 PerfectInterpolantSequences, 17841/22559 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: 579]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 40]: Location Invariant Derived location invariant: !(((((!((((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1)) && (a8 == 15)) && !((((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a21 == 1)) && (a8 == 15)) && (a16 == 4))) && !(((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1))) && (13 < a8)) && (a7 == 1)) && !((((((a20 != 1) && (a12 == 8)) && (14 == a8)) && (a17 != 1)) && (a21 == 1)) && (a16 == 4))) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: !((((((!((((((a12 == 8) && (5 == a16)) && (a21 == 1)) && (a17 == 1)) && (a20 == 1)) && (a8 == 15)) && !((((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1)) && (a8 == 15))) && !((((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a21 == 1)) && (a8 == 15)) && (a16 == 4))) && !(((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1))) && (13 < a8)) && (a7 == 1)) && !((((((a20 != 1) && (a12 == 8)) && (14 == a8)) && (a17 != 1)) && (a21 == 1)) && (a16 == 4))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 111.1MB. Free memory is still 70.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 687.04ms. Allocated memory is still 138.4MB. Free memory was 107.0MB in the beginning and 77.0MB in the end (delta: 30.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 100.59ms. Allocated memory is still 138.4MB. Free memory was 77.0MB in the beginning and 71.2MB in the end (delta: 5.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.44ms. Allocated memory is still 138.4MB. Free memory was 71.2MB in the beginning and 66.5MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1620.86ms. Allocated memory was 138.4MB in the beginning and 167.8MB in the end (delta: 29.4MB). Free memory was 66.5MB in the beginning and 119.5MB in the end (delta: -53.0MB). Peak memory consumption was 36.0MB. Max. memory is 16.1GB. * CodeCheck took 221521.63ms. Allocated memory was 167.8MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 119.5MB in the beginning and 2.0GB in the end (delta: -1.8GB). Peak memory consumption was 200.8MB. Max. memory is 16.1GB. * Witness Printer took 234.32ms. Allocated memory is still 2.2GB. Free memory was 2.0GB in the beginning and 1.9GB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-08 19:35:20,539 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc38f469-bfb2-43b8-821c-4167f9b4c63d/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