./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label19.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a19e39e-e617-4ac2-9ff3-bb006021eea4/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a19e39e-e617-4ac2-9ff3-bb006021eea4/bin/ukojak-verify-CZk0znPC7b/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a19e39e-e617-4ac2-9ff3-bb006021eea4/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a19e39e-e617-4ac2-9ff3-bb006021eea4/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label19.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a19e39e-e617-4ac2-9ff3-bb006021eea4/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a19e39e-e617-4ac2-9ff3-bb006021eea4/bin/ukojak-verify-CZk0znPC7b --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e9fc1c4ac9b5c9b782fe33ece5b0fcbdb6337af474d3fecce508816632ae710b --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 05:14:19,539 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 05:14:19,603 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a19e39e-e617-4ac2-9ff3-bb006021eea4/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-06 05:14:19,607 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 05:14:19,608 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 05:14:19,629 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 05:14:19,630 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 05:14:19,630 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 05:14:19,631 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 05:14:19,631 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 05:14:19,631 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 05:14:19,631 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 05:14:19,631 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 05:14:19,632 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 05:14:19,632 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 05:14:19,632 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 05:14:19,632 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 05:14:19,632 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 05:14:19,632 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 05:14:19,632 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 05:14:19,632 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 05:14:19,632 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 05:14:19,632 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 05:14:19,633 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 05:14:19,633 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 05:14:19,633 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 05:14:19,633 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 05:14:19,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 05:14:19,633 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 05:14:19,633 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 05:14:19,633 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 05:14:19,633 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 05:14:19,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 05:14:19,634 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a19e39e-e617-4ac2-9ff3-bb006021eea4/bin/ukojak-verify-CZk0znPC7b Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e9fc1c4ac9b5c9b782fe33ece5b0fcbdb6337af474d3fecce508816632ae710b [2024-12-06 05:14:19,912 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 05:14:19,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 05:14:19,923 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 05:14:19,924 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 05:14:19,925 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 05:14:19,926 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a19e39e-e617-4ac2-9ff3-bb006021eea4/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/eca-rers2012/Problem01_label19.c [2024-12-06 05:14:22,604 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a19e39e-e617-4ac2-9ff3-bb006021eea4/bin/ukojak-verify-CZk0znPC7b/data/665a0e28f/a468793fb6d34d0ebecb6260ad2d447f/FLAG8d7573351 [2024-12-06 05:14:22,843 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 05:14:22,844 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a19e39e-e617-4ac2-9ff3-bb006021eea4/sv-benchmarks/c/eca-rers2012/Problem01_label19.c [2024-12-06 05:14:22,856 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a19e39e-e617-4ac2-9ff3-bb006021eea4/bin/ukojak-verify-CZk0znPC7b/data/665a0e28f/a468793fb6d34d0ebecb6260ad2d447f/FLAG8d7573351 [2024-12-06 05:14:22,868 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a19e39e-e617-4ac2-9ff3-bb006021eea4/bin/ukojak-verify-CZk0znPC7b/data/665a0e28f/a468793fb6d34d0ebecb6260ad2d447f [2024-12-06 05:14:22,870 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 05:14:22,871 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 05:14:22,873 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 05:14:22,873 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 05:14:22,876 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 05:14:22,877 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:14:22" (1/1) ... [2024-12-06 05:14:22,877 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11ff16cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:22, skipping insertion in model container [2024-12-06 05:14:22,878 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:14:22" (1/1) ... [2024-12-06 05:14:22,904 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 05:14:23,134 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_3a19e39e-e617-4ac2-9ff3-bb006021eea4/sv-benchmarks/c/eca-rers2012/Problem01_label19.c[16251,16264] [2024-12-06 05:14:23,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 05:14:23,179 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 05:14:23,244 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_3a19e39e-e617-4ac2-9ff3-bb006021eea4/sv-benchmarks/c/eca-rers2012/Problem01_label19.c[16251,16264] [2024-12-06 05:14:23,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 05:14:23,272 INFO L204 MainTranslator]: Completed translation [2024-12-06 05:14:23,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:23 WrapperNode [2024-12-06 05:14:23,273 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 05:14:23,274 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 05:14:23,274 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 05:14:23,274 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 05:14:23,279 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:23" (1/1) ... [2024-12-06 05:14:23,293 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:23" (1/1) ... [2024-12-06 05:14:23,336 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-12-06 05:14:23,336 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 05:14:23,336 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 05:14:23,337 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 05:14:23,337 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 05:14:23,345 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:23" (1/1) ... [2024-12-06 05:14:23,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:23" (1/1) ... [2024-12-06 05:14:23,350 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:23" (1/1) ... [2024-12-06 05:14:23,350 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:23" (1/1) ... [2024-12-06 05:14:23,370 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:23" (1/1) ... [2024-12-06 05:14:23,372 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:23" (1/1) ... [2024-12-06 05:14:23,379 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:23" (1/1) ... [2024-12-06 05:14:23,383 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:23" (1/1) ... [2024-12-06 05:14:23,386 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:23" (1/1) ... [2024-12-06 05:14:23,391 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 05:14:23,392 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 05:14:23,392 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 05:14:23,392 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 05:14:23,393 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:23" (1/1) ... [2024-12-06 05:14:23,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 05:14:23,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a19e39e-e617-4ac2-9ff3-bb006021eea4/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 05:14:23,422 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a19e39e-e617-4ac2-9ff3-bb006021eea4/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 05:14:23,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a19e39e-e617-4ac2-9ff3-bb006021eea4/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 05:14:23,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 05:14:23,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 05:14:23,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 05:14:23,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 05:14:23,505 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 05:14:23,507 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 05:14:24,447 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-12-06 05:14:24,447 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 05:14:24,653 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 05:14:24,653 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-06 05:14:24,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:14:24 BoogieIcfgContainer [2024-12-06 05:14:24,654 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 05:14:24,655 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 05:14:24,655 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 05:14:24,663 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 05:14:24,663 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:14:24" (1/1) ... [2024-12-06 05:14:24,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 05:14:24,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:24,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-12-06 05:14:24,718 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-12-06 05:14:24,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-12-06 05:14:24,722 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:24,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:24,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:25,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:14:25,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:25,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 145 states and 219 transitions. [2024-12-06 05:14:25,857 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 219 transitions. [2024-12-06 05:14:25,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-12-06 05:14:25,859 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:25,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:25,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:26,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 05:14:26,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:26,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 146 states and 220 transitions. [2024-12-06 05:14:26,362 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2024-12-06 05:14:26,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-12-06 05:14:26,364 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:26,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:26,482 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:14:26,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:26,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 151 states and 227 transitions. [2024-12-06 05:14:26,587 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 227 transitions. [2024-12-06 05:14:26,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-12-06 05:14:26,589 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:26,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:26,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:26,786 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:14:27,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:27,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 221 states and 299 transitions. [2024-12-06 05:14:27,360 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 299 transitions. [2024-12-06 05:14:27,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-12-06 05:14:27,362 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:27,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:27,511 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:14:27,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:27,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 233 states and 314 transitions. [2024-12-06 05:14:27,718 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 314 transitions. [2024-12-06 05:14:27,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-12-06 05:14:27,719 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:27,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:27,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:27,913 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:14:28,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:28,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 249 states and 335 transitions. [2024-12-06 05:14:28,465 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 335 transitions. [2024-12-06 05:14:28,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-12-06 05:14:28,468 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:28,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:28,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:28,565 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 05:14:28,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:28,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 262 states and 350 transitions. [2024-12-06 05:14:28,817 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 350 transitions. [2024-12-06 05:14:28,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-12-06 05:14:28,818 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:28,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:28,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:28,906 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 05:14:29,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:29,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 270 states and 364 transitions. [2024-12-06 05:14:29,297 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 364 transitions. [2024-12-06 05:14:29,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-12-06 05:14:29,298 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:29,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:29,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:29,366 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 05:14:29,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:29,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 276 states and 372 transitions. [2024-12-06 05:14:29,537 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 372 transitions. [2024-12-06 05:14:29,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-12-06 05:14:29,538 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:29,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:29,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:29,640 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 05:14:29,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:29,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 285 states and 383 transitions. [2024-12-06 05:14:29,937 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 383 transitions. [2024-12-06 05:14:29,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-12-06 05:14:29,938 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:29,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:29,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:30,049 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:14:30,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:30,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 302 states and 402 transitions. [2024-12-06 05:14:30,389 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 402 transitions. [2024-12-06 05:14:30,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-12-06 05:14:30,390 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:30,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:30,621 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 05:14:31,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:31,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 317 states and 421 transitions. [2024-12-06 05:14:31,208 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 421 transitions. [2024-12-06 05:14:31,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-12-06 05:14:31,210 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:31,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:31,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:31,382 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 05:14:31,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:31,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 324 states and 427 transitions. [2024-12-06 05:14:31,689 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 427 transitions. [2024-12-06 05:14:31,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-12-06 05:14:31,690 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:31,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:31,819 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 05:14:32,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:32,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 347 states and 452 transitions. [2024-12-06 05:14:32,269 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 452 transitions. [2024-12-06 05:14:32,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-12-06 05:14:32,270 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:32,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:32,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:32,361 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-12-06 05:14:32,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:32,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 348 states and 454 transitions. [2024-12-06 05:14:32,507 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 454 transitions. [2024-12-06 05:14:32,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-12-06 05:14:32,508 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:32,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:32,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:32,613 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 05:14:33,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:33,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 364 states and 474 transitions. [2024-12-06 05:14:33,127 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 474 transitions. [2024-12-06 05:14:33,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-12-06 05:14:33,129 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:33,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:33,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:33,242 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 05:14:33,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:33,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 394 states and 508 transitions. [2024-12-06 05:14:33,941 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 508 transitions. [2024-12-06 05:14:33,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-12-06 05:14:33,942 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:33,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:33,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:34,069 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 05:14:34,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:34,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 408 states and 522 transitions. [2024-12-06 05:14:34,235 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 522 transitions. [2024-12-06 05:14:34,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-12-06 05:14:34,236 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:34,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:34,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:34,354 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 05:14:34,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:34,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 411 states and 526 transitions. [2024-12-06 05:14:34,429 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 526 transitions. [2024-12-06 05:14:34,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-12-06 05:14:34,430 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:34,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:34,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:34,626 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 58 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:14:35,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:35,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 419 states and 536 transitions. [2024-12-06 05:14:35,023 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 536 transitions. [2024-12-06 05:14:35,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-12-06 05:14:35,024 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:35,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:35,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:35,151 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 58 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:14:35,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:35,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 424 states and 541 transitions. [2024-12-06 05:14:35,237 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 541 transitions. [2024-12-06 05:14:35,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-12-06 05:14:35,238 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:35,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:35,291 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:14:35,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:35,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 447 states and 565 transitions. [2024-12-06 05:14:35,464 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 565 transitions. [2024-12-06 05:14:35,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-12-06 05:14:35,465 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:35,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:35,517 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 05:14:35,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:35,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 457 states and 577 transitions. [2024-12-06 05:14:35,663 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 577 transitions. [2024-12-06 05:14:35,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-12-06 05:14:35,665 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:35,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:35,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:35,761 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-06 05:14:35,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:35,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 458 states and 578 transitions. [2024-12-06 05:14:35,796 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 578 transitions. [2024-12-06 05:14:35,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-12-06 05:14:35,797 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:35,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:36,026 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 61 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:14:36,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:36,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 471 states and 593 transitions. [2024-12-06 05:14:36,636 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 593 transitions. [2024-12-06 05:14:36,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-12-06 05:14:36,637 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:36,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:36,696 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 05:14:36,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:36,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 485 states and 609 transitions. [2024-12-06 05:14:36,772 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 609 transitions. [2024-12-06 05:14:36,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-12-06 05:14:36,774 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:36,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:36,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:36,871 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 05:14:37,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:37,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 504 states and 629 transitions. [2024-12-06 05:14:37,025 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 629 transitions. [2024-12-06 05:14:37,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-12-06 05:14:37,026 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:37,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:37,250 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 91 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:14:37,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:37,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 521 states and 648 transitions. [2024-12-06 05:14:37,712 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 648 transitions. [2024-12-06 05:14:37,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-12-06 05:14:37,713 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:37,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:37,944 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 62 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 05:14:39,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:39,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 566 states and 699 transitions. [2024-12-06 05:14:39,119 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 699 transitions. [2024-12-06 05:14:39,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-12-06 05:14:39,120 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:39,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:39,240 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 62 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 05:14:39,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:39,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 571 states and 704 transitions. [2024-12-06 05:14:39,368 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 704 transitions. [2024-12-06 05:14:39,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-12-06 05:14:39,369 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:39,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:39,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:39,433 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 05:14:39,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:39,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 577 states and 711 transitions. [2024-12-06 05:14:39,526 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 711 transitions. [2024-12-06 05:14:39,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-12-06 05:14:39,527 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:39,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:39,675 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-06 05:14:39,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:39,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 593 states and 726 transitions. [2024-12-06 05:14:39,865 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 726 transitions. [2024-12-06 05:14:39,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-12-06 05:14:39,866 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:39,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:40,054 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-12-06 05:14:40,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:40,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 610 states and 743 transitions. [2024-12-06 05:14:40,346 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 743 transitions. [2024-12-06 05:14:40,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-12-06 05:14:40,347 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:40,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:40,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:40,510 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:14:41,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:41,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 660 states and 798 transitions. [2024-12-06 05:14:41,338 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 798 transitions. [2024-12-06 05:14:41,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-12-06 05:14:41,338 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:41,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:41,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:41,397 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 05:14:41,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:41,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 668 states and 809 transitions. [2024-12-06 05:14:41,463 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 809 transitions. [2024-12-06 05:14:41,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-12-06 05:14:41,464 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:41,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:41,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:41,547 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-12-06 05:14:42,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:42,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 703 states and 846 transitions. [2024-12-06 05:14:42,117 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 846 transitions. [2024-12-06 05:14:42,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-12-06 05:14:42,118 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:42,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:42,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:42,268 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-12-06 05:14:42,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:42,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 706 states and 849 transitions. [2024-12-06 05:14:42,374 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 849 transitions. [2024-12-06 05:14:42,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-12-06 05:14:42,375 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:42,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:42,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:42,455 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-12-06 05:14:42,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:42,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 714 states and 859 transitions. [2024-12-06 05:14:42,780 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 859 transitions. [2024-12-06 05:14:42,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-12-06 05:14:42,780 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:42,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:42,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:42,867 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:14:43,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:43,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 734 states and 880 transitions. [2024-12-06 05:14:43,080 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 880 transitions. [2024-12-06 05:14:43,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-12-06 05:14:43,080 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:43,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:43,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:43,167 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-12-06 05:14:43,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:43,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 739 states and 886 transitions. [2024-12-06 05:14:43,242 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 886 transitions. [2024-12-06 05:14:43,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-12-06 05:14:43,244 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:43,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:43,505 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:14:44,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:44,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 809 states and 963 transitions. [2024-12-06 05:14:44,572 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 963 transitions. [2024-12-06 05:14:44,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-12-06 05:14:44,573 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:44,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:44,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:44,931 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:14:46,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:46,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 878 states and 1048 transitions. [2024-12-06 05:14:46,492 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1048 transitions. [2024-12-06 05:14:46,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-12-06 05:14:46,492 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:46,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:46,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:46,560 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:14:46,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:46,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 899 states and 1073 transitions. [2024-12-06 05:14:46,762 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1073 transitions. [2024-12-06 05:14:46,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-12-06 05:14:46,762 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:46,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:47,105 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:14:49,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:49,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 953 states and 1134 transitions. [2024-12-06 05:14:49,473 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1134 transitions. [2024-12-06 05:14:49,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-12-06 05:14:49,474 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:49,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:49,653 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:14:50,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:50,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1022 states and 1208 transitions. [2024-12-06 05:14:50,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1208 transitions. [2024-12-06 05:14:50,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-12-06 05:14:50,715 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:50,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:50,993 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:14:52,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:52,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1093 states and 1279 transitions. [2024-12-06 05:14:52,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1279 transitions. [2024-12-06 05:14:52,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-12-06 05:14:52,196 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:52,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:52,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:52,395 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:14:53,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:53,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1110 states and 1296 transitions. [2024-12-06 05:14:53,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1296 transitions. [2024-12-06 05:14:53,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-12-06 05:14:53,159 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:53,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:53,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:53,470 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 82 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:14:54,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:54,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1118 states and 1307 transitions. [2024-12-06 05:14:54,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1307 transitions. [2024-12-06 05:14:54,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-12-06 05:14:54,137 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:54,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:54,334 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 82 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:14:54,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:54,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1123 states and 1312 transitions. [2024-12-06 05:14:54,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1312 transitions. [2024-12-06 05:14:54,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-12-06 05:14:54,574 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:54,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:54,660 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-12-06 05:14:54,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:54,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1124 states and 1315 transitions. [2024-12-06 05:14:54,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1315 transitions. [2024-12-06 05:14:54,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-12-06 05:14:54,944 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:54,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:54,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:55,041 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-12-06 05:14:55,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:55,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1127 states and 1320 transitions. [2024-12-06 05:14:55,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1320 transitions. [2024-12-06 05:14:55,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-12-06 05:14:55,222 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:55,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:55,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:55,332 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-12-06 05:14:56,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:56,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1161 states and 1355 transitions. [2024-12-06 05:14:56,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1355 transitions. [2024-12-06 05:14:56,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-12-06 05:14:56,321 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:56,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:56,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:56,499 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 05:14:57,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:57,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1196 states and 1396 transitions. [2024-12-06 05:14:57,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1396 transitions. [2024-12-06 05:14:57,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-12-06 05:14:57,717 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:57,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:57,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:57,828 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-12-06 05:14:57,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:57,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1198 states and 1397 transitions. [2024-12-06 05:14:57,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1397 transitions. [2024-12-06 05:14:57,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-12-06 05:14:57,961 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:57,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:57,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:58,095 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 05:14:58,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:58,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1199 states and 1398 transitions. [2024-12-06 05:14:58,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1398 transitions. [2024-12-06 05:14:58,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-12-06 05:14:58,433 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:58,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:58,618 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-06 05:14:59,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:14:59,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1229 states and 1430 transitions. [2024-12-06 05:14:59,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1430 transitions. [2024-12-06 05:14:59,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-12-06 05:14:59,516 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:14:59,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:14:59,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:14:59,864 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:15:00,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:15:00,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1259 states and 1467 transitions. [2024-12-06 05:15:00,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 1467 transitions. [2024-12-06 05:15:00,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-12-06 05:15:00,935 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:15:00,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:15:00,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:15:01,019 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-06 05:15:01,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:15:01,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1291 states and 1502 transitions. [2024-12-06 05:15:01,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1502 transitions. [2024-12-06 05:15:01,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-12-06 05:15:01,917 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:15:01,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:15:01,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:15:02,308 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:15:04,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:15:04,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1362 states and 1589 transitions. [2024-12-06 05:15:04,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1589 transitions. [2024-12-06 05:15:04,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-12-06 05:15:04,401 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:15:04,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:15:04,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:15:05,074 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 130 proven. 49 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-12-06 05:15:07,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:15:07,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1709 states to 1457 states and 1709 transitions. [2024-12-06 05:15:07,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 1709 transitions. [2024-12-06 05:15:07,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-12-06 05:15:07,460 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:15:07,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:15:07,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:15:07,586 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 112 proven. 6 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-12-06 05:15:08,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:15:08,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1740 states to 1482 states and 1740 transitions. [2024-12-06 05:15:08,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 1740 transitions. [2024-12-06 05:15:08,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-12-06 05:15:08,574 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:15:08,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:15:08,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:15:08,714 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 112 proven. 6 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-12-06 05:15:09,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:15:09,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1496 states and 1755 transitions. [2024-12-06 05:15:09,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 1755 transitions. [2024-12-06 05:15:09,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-12-06 05:15:09,140 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:15:09,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:15:09,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:15:09,321 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 05:15:10,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:15:10,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1805 states to 1536 states and 1805 transitions. [2024-12-06 05:15:10,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1536 states and 1805 transitions. [2024-12-06 05:15:10,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-12-06 05:15:10,979 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:15:10,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:15:11,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:15:11,100 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 05:15:11,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:15:11,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1545 states and 1815 transitions. [2024-12-06 05:15:11,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 1815 transitions. [2024-12-06 05:15:11,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-12-06 05:15:11,570 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:15:11,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:15:11,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:15:11,659 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-12-06 05:15:12,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:15:12,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1832 states to 1561 states and 1832 transitions. [2024-12-06 05:15:12,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 1832 transitions. [2024-12-06 05:15:12,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-12-06 05:15:12,057 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:15:12,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:15:12,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:15:12,116 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-12-06 05:15:12,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:15:12,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1570 states and 1841 transitions. [2024-12-06 05:15:12,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 1841 transitions. [2024-12-06 05:15:12,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-12-06 05:15:12,387 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:15:12,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:15:12,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:15:12,630 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 142 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 05:15:13,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:15:13,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1586 states and 1859 transitions. [2024-12-06 05:15:13,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 1859 transitions. [2024-12-06 05:15:13,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 05:15:13,371 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:15:13,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:15:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:15:13,645 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:15:14,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:15:14,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1602 states and 1877 transitions. [2024-12-06 05:15:14,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 1877 transitions. [2024-12-06 05:15:14,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 05:15:14,813 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:15:14,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:15:14,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:15:15,083 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:15:15,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:15:15,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1881 states to 1607 states and 1881 transitions. [2024-12-06 05:15:15,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 1881 transitions. [2024-12-06 05:15:15,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-12-06 05:15:15,450 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:15:15,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:15:15,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:15:16,141 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 3 proven. 167 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-06 05:15:18,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:15:18,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1639 states and 1914 transitions. [2024-12-06 05:15:18,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1639 states and 1914 transitions. [2024-12-06 05:15:18,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-12-06 05:15:18,399 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:15:18,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:15:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:15:18,729 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 119 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:15:19,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:15:19,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1652 states and 1931 transitions. [2024-12-06 05:15:19,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 1931 transitions. [2024-12-06 05:15:19,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-12-06 05:15:19,267 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:15:19,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:15:19,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:15:19,404 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-12-06 05:15:19,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:15:19,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1932 states to 1654 states and 1932 transitions. [2024-12-06 05:15:19,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 1932 transitions. [2024-12-06 05:15:19,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-06 05:15:19,654 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:15:19,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:15:19,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:15:20,050 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 152 proven. 65 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-12-06 05:15:22,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:15:22,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2013 states to 1716 states and 2013 transitions. [2024-12-06 05:15:22,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 2013 transitions. [2024-12-06 05:15:22,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-06 05:15:22,139 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:15:22,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:15:22,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:15:22,377 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-12-06 05:15:23,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:15:23,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 1725 states and 2024 transitions. [2024-12-06 05:15:23,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1725 states and 2024 transitions. [2024-12-06 05:15:23,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-06 05:15:23,203 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:15:23,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:15:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:15:23,864 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 69 proven. 124 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-06 05:15:27,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:15:27,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2204 states to 1885 states and 2204 transitions. [2024-12-06 05:15:27,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1885 states and 2204 transitions. [2024-12-06 05:15:27,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-12-06 05:15:27,224 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:15:27,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:15:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:15:27,604 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 239 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:15:29,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:15:29,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 1915 states and 2254 transitions. [2024-12-06 05:15:29,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 2254 transitions. [2024-12-06 05:15:29,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-12-06 05:15:29,232 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:15:29,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:15:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:15:29,438 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 239 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:15:30,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:15:30,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2256 states to 1918 states and 2256 transitions. [2024-12-06 05:15:30,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1918 states and 2256 transitions. [2024-12-06 05:15:30,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-12-06 05:15:30,101 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:15:30,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:15:30,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:15:30,342 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 239 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:15:30,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:15:30,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2271 states to 1931 states and 2271 transitions. [2024-12-06 05:15:30,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2271 transitions. [2024-12-06 05:15:30,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-12-06 05:15:30,779 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:15:30,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:15:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:15:31,064 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-06 05:15:32,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:15:32,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 1943 states and 2284 transitions. [2024-12-06 05:15:32,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1943 states and 2284 transitions. [2024-12-06 05:15:32,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-12-06 05:15:32,491 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:15:32,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:15:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:15:33,275 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 136 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:15:34,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:15:34,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2336 states to 1985 states and 2336 transitions. [2024-12-06 05:15:34,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 2336 transitions. [2024-12-06 05:15:34,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-06 05:15:34,578 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:15:34,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:15:34,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:15:34,841 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 136 proven. 65 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-12-06 05:15:35,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:15:35,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2350 states to 1998 states and 2350 transitions. [2024-12-06 05:15:35,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 2350 transitions. [2024-12-06 05:15:35,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-06 05:15:35,565 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:15:35,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:15:35,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:15:35,791 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 136 proven. 65 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-12-06 05:15:36,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:15:36,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2351 states to 1999 states and 2351 transitions. [2024-12-06 05:15:36,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1999 states and 2351 transitions. [2024-12-06 05:15:36,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-06 05:15:36,348 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:15:36,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:15:36,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:15:36,984 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-12-06 05:15:38,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:15:38,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2051 states and 2418 transitions. [2024-12-06 05:15:38,830 INFO L276 IsEmpty]: Start isEmpty. Operand 2051 states and 2418 transitions. [2024-12-06 05:15:38,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-06 05:15:38,832 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:15:38,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:15:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:15:39,129 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 139 proven. 55 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-06 05:15:42,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:15:42,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2125 states and 2507 transitions. [2024-12-06 05:15:42,244 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 2507 transitions. [2024-12-06 05:15:42,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-06 05:15:42,246 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:15:42,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:15:42,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:15:42,555 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 140 proven. 71 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-12-06 05:15:42,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:15:42,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2514 states to 2131 states and 2514 transitions. [2024-12-06 05:15:42,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 2514 transitions. [2024-12-06 05:15:42,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-12-06 05:15:42,781 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:15:42,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:15:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:15:43,029 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 227 proven. 9 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-12-06 05:15:43,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:15:43,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2539 states to 2154 states and 2539 transitions. [2024-12-06 05:15:43,555 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 2539 transitions. [2024-12-06 05:15:43,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-06 05:15:43,556 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:15:43,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:15:43,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:15:43,627 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-12-06 05:15:45,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:15:45,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2584 states to 2189 states and 2584 transitions. [2024-12-06 05:15:45,805 INFO L276 IsEmpty]: Start isEmpty. Operand 2189 states and 2584 transitions. [2024-12-06 05:15:45,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-06 05:15:45,806 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:15:45,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:15:45,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:15:45,895 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-12-06 05:15:47,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:15:47,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2615 states to 2215 states and 2615 transitions. [2024-12-06 05:15:47,908 INFO L276 IsEmpty]: Start isEmpty. Operand 2215 states and 2615 transitions. [2024-12-06 05:15:47,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-06 05:15:47,911 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:15:47,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:15:47,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:15:48,244 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:15:48,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:15:48,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2629 states to 2228 states and 2629 transitions. [2024-12-06 05:15:48,847 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 2629 transitions. [2024-12-06 05:15:48,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-12-06 05:15:48,849 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:15:48,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:15:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:15:48,917 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-12-06 05:15:50,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:15:50,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2666 states to 2262 states and 2666 transitions. [2024-12-06 05:15:50,455 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 2666 transitions. [2024-12-06 05:15:50,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-12-06 05:15:50,457 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:15:50,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:15:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:15:50,905 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 86 proven. 141 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-12-06 05:15:52,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:15:52,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2759 states to 2348 states and 2759 transitions. [2024-12-06 05:15:52,654 INFO L276 IsEmpty]: Start isEmpty. Operand 2348 states and 2759 transitions. [2024-12-06 05:15:52,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-12-06 05:15:52,655 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:15:52,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:15:52,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:15:52,747 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 05:15:53,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:15:53,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2775 states to 2361 states and 2775 transitions. [2024-12-06 05:15:53,225 INFO L276 IsEmpty]: Start isEmpty. Operand 2361 states and 2775 transitions. [2024-12-06 05:15:53,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-12-06 05:15:53,227 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:15:53,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:15:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:15:53,375 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 05:15:53,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:15:53,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2776 states to 2362 states and 2776 transitions. [2024-12-06 05:15:53,465 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 2776 transitions. [2024-12-06 05:15:53,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-12-06 05:15:53,467 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:15:53,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:15:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:15:53,556 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-12-06 05:15:54,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:15:54,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2799 states to 2386 states and 2799 transitions. [2024-12-06 05:15:54,800 INFO L276 IsEmpty]: Start isEmpty. Operand 2386 states and 2799 transitions. [2024-12-06 05:15:54,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-12-06 05:15:54,802 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:15:54,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:15:54,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:15:55,141 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 156 proven. 87 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-12-06 05:15:58,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:15:58,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2840 states to 2420 states and 2840 transitions. [2024-12-06 05:15:58,364 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 2840 transitions. [2024-12-06 05:15:58,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-12-06 05:15:58,366 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:15:58,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:15:58,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:15:58,508 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 243 proven. 9 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-12-06 05:16:00,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:16:00,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2848 states to 2422 states and 2848 transitions. [2024-12-06 05:16:00,292 INFO L276 IsEmpty]: Start isEmpty. Operand 2422 states and 2848 transitions. [2024-12-06 05:16:00,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-12-06 05:16:00,295 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:16:00,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:16:00,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:16:00,520 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 243 proven. 9 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-12-06 05:16:02,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:16:02,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2877 states to 2450 states and 2877 transitions. [2024-12-06 05:16:02,108 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 2877 transitions. [2024-12-06 05:16:02,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-12-06 05:16:02,110 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:16:02,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:16:02,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:16:02,293 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 243 proven. 9 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-12-06 05:16:02,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:16:02,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2877 states to 2451 states and 2877 transitions. [2024-12-06 05:16:02,699 INFO L276 IsEmpty]: Start isEmpty. Operand 2451 states and 2877 transitions. [2024-12-06 05:16:02,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-12-06 05:16:02,701 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:16:02,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:16:02,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:16:02,800 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-12-06 05:16:05,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:16:05,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2908 states to 2468 states and 2908 transitions. [2024-12-06 05:16:05,015 INFO L276 IsEmpty]: Start isEmpty. Operand 2468 states and 2908 transitions. [2024-12-06 05:16:05,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-12-06 05:16:05,016 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:16:05,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:16:05,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:16:05,170 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-12-06 05:16:05,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:16:05,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2481 states and 2922 transitions. [2024-12-06 05:16:05,763 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 2922 transitions. [2024-12-06 05:16:05,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-12-06 05:16:05,765 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:16:05,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:16:05,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:16:05,866 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-12-06 05:16:06,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:16:06,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2936 states to 2495 states and 2936 transitions. [2024-12-06 05:16:06,845 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 2936 transitions. [2024-12-06 05:16:06,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-12-06 05:16:06,846 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:16:06,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:16:06,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:16:06,923 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-12-06 05:16:08,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:16:08,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2958 states to 2510 states and 2958 transitions. [2024-12-06 05:16:08,235 INFO L276 IsEmpty]: Start isEmpty. Operand 2510 states and 2958 transitions. [2024-12-06 05:16:08,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-12-06 05:16:08,237 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:16:08,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:16:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:16:08,401 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-12-06 05:16:09,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:16:09,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2985 states to 2538 states and 2985 transitions. [2024-12-06 05:16:09,622 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 2985 transitions. [2024-12-06 05:16:09,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-12-06 05:16:09,625 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:16:09,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:16:09,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:16:09,882 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 186 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 05:16:10,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:16:10,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2993 states to 2544 states and 2993 transitions. [2024-12-06 05:16:10,411 INFO L276 IsEmpty]: Start isEmpty. Operand 2544 states and 2993 transitions. [2024-12-06 05:16:10,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-12-06 05:16:10,413 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:16:10,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:16:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:16:10,675 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 186 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 05:16:11,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:16:11,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3006 states to 2558 states and 3006 transitions. [2024-12-06 05:16:11,439 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 3006 transitions. [2024-12-06 05:16:11,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-12-06 05:16:11,441 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:16:11,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:16:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:16:11,963 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 106 proven. 160 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-12-06 05:16:15,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:16:15,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 2666 states and 3135 transitions. [2024-12-06 05:16:15,509 INFO L276 IsEmpty]: Start isEmpty. Operand 2666 states and 3135 transitions. [2024-12-06 05:16:15,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-12-06 05:16:15,511 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:16:15,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:16:15,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:16:16,590 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 201 proven. 127 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 05:16:19,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:16:19,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3191 states to 2709 states and 3191 transitions. [2024-12-06 05:16:19,411 INFO L276 IsEmpty]: Start isEmpty. Operand 2709 states and 3191 transitions. [2024-12-06 05:16:19,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-12-06 05:16:19,413 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:16:19,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:16:19,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:16:19,724 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 201 proven. 127 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 05:16:20,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:16:20,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3205 states to 2720 states and 3205 transitions. [2024-12-06 05:16:20,848 INFO L276 IsEmpty]: Start isEmpty. Operand 2720 states and 3205 transitions. [2024-12-06 05:16:20,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-12-06 05:16:20,850 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:16:20,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:16:20,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:16:21,162 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 201 proven. 127 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 05:16:21,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:16:21,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3227 states to 2734 states and 3227 transitions. [2024-12-06 05:16:21,900 INFO L276 IsEmpty]: Start isEmpty. Operand 2734 states and 3227 transitions. [2024-12-06 05:16:21,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-12-06 05:16:21,901 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:16:21,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:16:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:16:22,206 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 201 proven. 127 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 05:16:22,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:16:22,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3239 states to 2743 states and 3239 transitions. [2024-12-06 05:16:22,942 INFO L276 IsEmpty]: Start isEmpty. Operand 2743 states and 3239 transitions. [2024-12-06 05:16:22,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-12-06 05:16:22,944 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:16:22,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:16:22,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:16:23,386 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 201 proven. 127 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 05:16:24,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:16:24,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3250 states to 2752 states and 3250 transitions. [2024-12-06 05:16:24,118 INFO L276 IsEmpty]: Start isEmpty. Operand 2752 states and 3250 transitions. [2024-12-06 05:16:24,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-12-06 05:16:24,120 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:16:24,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:16:24,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:16:24,464 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 166 proven. 97 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-12-06 05:16:25,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:16:25,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3280 states to 2777 states and 3280 transitions. [2024-12-06 05:16:25,695 INFO L276 IsEmpty]: Start isEmpty. Operand 2777 states and 3280 transitions. [2024-12-06 05:16:25,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-12-06 05:16:25,697 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:16:25,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:16:25,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:16:25,842 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-12-06 05:16:27,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:16:27,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3303 states to 2793 states and 3303 transitions. [2024-12-06 05:16:27,462 INFO L276 IsEmpty]: Start isEmpty. Operand 2793 states and 3303 transitions. [2024-12-06 05:16:27,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-12-06 05:16:27,464 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:16:27,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:16:27,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:16:27,606 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-12-06 05:16:28,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:16:28,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3304 states to 2794 states and 3304 transitions. [2024-12-06 05:16:28,122 INFO L276 IsEmpty]: Start isEmpty. Operand 2794 states and 3304 transitions. [2024-12-06 05:16:28,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-12-06 05:16:28,123 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:16:28,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:16:28,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:16:28,238 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-12-06 05:16:28,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:16:28,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3313 states to 2803 states and 3313 transitions. [2024-12-06 05:16:28,745 INFO L276 IsEmpty]: Start isEmpty. Operand 2803 states and 3313 transitions. [2024-12-06 05:16:28,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-12-06 05:16:28,746 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:16:28,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:16:28,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:16:28,865 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-12-06 05:16:29,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:16:29,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3321 states to 2812 states and 3321 transitions. [2024-12-06 05:16:29,403 INFO L276 IsEmpty]: Start isEmpty. Operand 2812 states and 3321 transitions. [2024-12-06 05:16:29,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-06 05:16:29,405 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:16:29,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:16:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:16:29,815 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 169 proven. 100 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-12-06 05:16:31,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:16:31,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3380 states to 2863 states and 3380 transitions. [2024-12-06 05:16:31,876 INFO L276 IsEmpty]: Start isEmpty. Operand 2863 states and 3380 transitions. [2024-12-06 05:16:31,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-06 05:16:31,878 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:16:31,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:16:31,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:16:32,033 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 261 proven. 9 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-12-06 05:16:33,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:16:33,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3422 states to 2896 states and 3422 transitions. [2024-12-06 05:16:33,853 INFO L276 IsEmpty]: Start isEmpty. Operand 2896 states and 3422 transitions. [2024-12-06 05:16:33,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-06 05:16:33,855 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:16:33,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:16:33,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:16:34,012 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 261 proven. 9 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-12-06 05:16:36,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:16:36,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3441 states to 2914 states and 3441 transitions. [2024-12-06 05:16:36,106 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 3441 transitions. [2024-12-06 05:16:36,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-06 05:16:36,108 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:16:36,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:16:36,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:16:36,264 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 261 proven. 9 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-12-06 05:16:38,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:16:38,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 2932 states and 3459 transitions. [2024-12-06 05:16:38,210 INFO L276 IsEmpty]: Start isEmpty. Operand 2932 states and 3459 transitions. [2024-12-06 05:16:38,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-06 05:16:38,213 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:16:38,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:16:38,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:16:38,312 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 05:16:42,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:16:42,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3521 states to 2974 states and 3521 transitions. [2024-12-06 05:16:42,592 INFO L276 IsEmpty]: Start isEmpty. Operand 2974 states and 3521 transitions. [2024-12-06 05:16:42,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-06 05:16:42,596 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:16:42,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:16:42,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:16:42,758 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 05:16:46,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:16:46,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3575 states to 3013 states and 3575 transitions. [2024-12-06 05:16:46,164 INFO L276 IsEmpty]: Start isEmpty. Operand 3013 states and 3575 transitions. [2024-12-06 05:16:46,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-06 05:16:46,165 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:16:46,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:16:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:16:46,264 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 05:16:47,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:16:47,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3594 states to 3028 states and 3594 transitions. [2024-12-06 05:16:47,747 INFO L276 IsEmpty]: Start isEmpty. Operand 3028 states and 3594 transitions. [2024-12-06 05:16:47,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-06 05:16:47,749 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:16:47,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:16:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:16:47,850 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 05:16:49,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:16:49,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3619 states to 3051 states and 3619 transitions. [2024-12-06 05:16:49,315 INFO L276 IsEmpty]: Start isEmpty. Operand 3051 states and 3619 transitions. [2024-12-06 05:16:49,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-06 05:16:49,317 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:16:49,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:16:49,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:16:49,414 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 05:16:50,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:16:50,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3634 states to 3065 states and 3634 transitions. [2024-12-06 05:16:50,240 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 3634 transitions. [2024-12-06 05:16:50,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-06 05:16:50,243 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:16:50,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:16:50,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:16:50,369 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 05:16:51,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:16:51,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3648 states to 3079 states and 3648 transitions. [2024-12-06 05:16:51,073 INFO L276 IsEmpty]: Start isEmpty. Operand 3079 states and 3648 transitions. [2024-12-06 05:16:51,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-06 05:16:51,074 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:16:51,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:16:51,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:16:51,150 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 05:16:52,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:16:52,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3670 states to 3095 states and 3670 transitions. [2024-12-06 05:16:52,686 INFO L276 IsEmpty]: Start isEmpty. Operand 3095 states and 3670 transitions. [2024-12-06 05:16:52,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-06 05:16:52,688 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:16:52,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:16:52,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:16:52,769 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 05:16:53,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:16:53,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3685 states to 3109 states and 3685 transitions. [2024-12-06 05:16:53,577 INFO L276 IsEmpty]: Start isEmpty. Operand 3109 states and 3685 transitions. [2024-12-06 05:16:53,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-06 05:16:53,578 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:16:53,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:16:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:16:53,733 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 05:16:55,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:16:55,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3703 states to 3124 states and 3703 transitions. [2024-12-06 05:16:55,298 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 3703 transitions. [2024-12-06 05:16:55,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-06 05:16:55,300 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:16:55,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:16:55,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:16:55,399 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 05:16:56,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:16:56,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3717 states to 3138 states and 3717 transitions. [2024-12-06 05:16:56,152 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 3717 transitions. [2024-12-06 05:16:56,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-06 05:16:56,154 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:16:56,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:16:56,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:16:56,289 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 05:16:57,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:16:57,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3731 states to 3152 states and 3731 transitions. [2024-12-06 05:16:57,067 INFO L276 IsEmpty]: Start isEmpty. Operand 3152 states and 3731 transitions. [2024-12-06 05:16:57,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-12-06 05:16:57,069 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:16:57,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:16:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:16:57,170 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-12-06 05:17:00,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:17:00,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3760 states to 3170 states and 3760 transitions. [2024-12-06 05:17:00,052 INFO L276 IsEmpty]: Start isEmpty. Operand 3170 states and 3760 transitions. [2024-12-06 05:17:00,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-12-06 05:17:00,055 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:17:00,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:17:00,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:17:00,256 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-12-06 05:17:01,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:17:01,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3770 states to 3179 states and 3770 transitions. [2024-12-06 05:17:01,105 INFO L276 IsEmpty]: Start isEmpty. Operand 3179 states and 3770 transitions. [2024-12-06 05:17:01,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-12-06 05:17:01,107 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:17:01,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:17:01,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:17:01,207 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-12-06 05:17:01,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:17:01,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3785 states to 3193 states and 3785 transitions. [2024-12-06 05:17:01,988 INFO L276 IsEmpty]: Start isEmpty. Operand 3193 states and 3785 transitions. [2024-12-06 05:17:01,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-12-06 05:17:01,990 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:17:01,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:17:02,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:17:02,090 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-12-06 05:17:02,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:17:02,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3786 states to 3195 states and 3786 transitions. [2024-12-06 05:17:02,862 INFO L276 IsEmpty]: Start isEmpty. Operand 3195 states and 3786 transitions. [2024-12-06 05:17:02,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-12-06 05:17:02,864 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:17:02,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:17:02,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:17:02,952 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-12-06 05:17:03,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:17:03,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3787 states to 3197 states and 3787 transitions. [2024-12-06 05:17:03,644 INFO L276 IsEmpty]: Start isEmpty. Operand 3197 states and 3787 transitions. [2024-12-06 05:17:03,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-06 05:17:03,646 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:17:03,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:17:03,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:17:03,832 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 05:17:06,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:17:06,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3828 states to 3227 states and 3828 transitions. [2024-12-06 05:17:06,457 INFO L276 IsEmpty]: Start isEmpty. Operand 3227 states and 3828 transitions. [2024-12-06 05:17:06,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-06 05:17:06,459 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:17:06,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:17:06,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:17:06,688 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 05:17:09,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:17:09,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3860 states to 3260 states and 3860 transitions. [2024-12-06 05:17:09,452 INFO L276 IsEmpty]: Start isEmpty. Operand 3260 states and 3860 transitions. [2024-12-06 05:17:09,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-06 05:17:09,454 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:17:09,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:17:09,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:17:09,703 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 05:17:12,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:17:12,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3896 states to 3295 states and 3896 transitions. [2024-12-06 05:17:12,723 INFO L276 IsEmpty]: Start isEmpty. Operand 3295 states and 3896 transitions. [2024-12-06 05:17:12,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-06 05:17:12,725 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:17:12,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:17:12,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:17:13,094 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-12-06 05:17:13,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:17:13,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3902 states to 3301 states and 3902 transitions. [2024-12-06 05:17:13,910 INFO L276 IsEmpty]: Start isEmpty. Operand 3301 states and 3902 transitions. [2024-12-06 05:17:13,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-12-06 05:17:13,912 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:17:13,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:17:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:17:14,251 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 179 proven. 104 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 05:17:17,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:17:17,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3940 states to 3333 states and 3940 transitions. [2024-12-06 05:17:17,676 INFO L276 IsEmpty]: Start isEmpty. Operand 3333 states and 3940 transitions. [2024-12-06 05:17:17,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-12-06 05:17:17,678 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:17:17,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:17:17,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:17:18,183 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 05:17:20,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:17:20,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4001 states to 3386 states and 4001 transitions. [2024-12-06 05:17:20,915 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 4001 transitions. [2024-12-06 05:17:20,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-12-06 05:17:20,917 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:17:20,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:17:20,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:17:21,240 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 05:17:23,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:17:23,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4033 states to 3416 states and 4033 transitions. [2024-12-06 05:17:23,431 INFO L276 IsEmpty]: Start isEmpty. Operand 3416 states and 4033 transitions. [2024-12-06 05:17:23,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-12-06 05:17:23,433 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:17:23,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:17:23,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:17:23,786 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 175 proven. 106 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-12-06 05:17:24,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:17:24,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4040 states to 3422 states and 4040 transitions. [2024-12-06 05:17:24,094 INFO L276 IsEmpty]: Start isEmpty. Operand 3422 states and 4040 transitions. [2024-12-06 05:17:24,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 05:17:24,097 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:17:24,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:17:24,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:17:24,201 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-12-06 05:17:26,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:17:26,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4058 states to 3438 states and 4058 transitions. [2024-12-06 05:17:26,165 INFO L276 IsEmpty]: Start isEmpty. Operand 3438 states and 4058 transitions. [2024-12-06 05:17:26,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 05:17:26,168 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:17:26,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:17:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:17:26,272 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-12-06 05:17:28,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:17:28,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4080 states to 3458 states and 4080 transitions. [2024-12-06 05:17:28,308 INFO L276 IsEmpty]: Start isEmpty. Operand 3458 states and 4080 transitions. [2024-12-06 05:17:28,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 05:17:28,310 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:17:28,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:17:28,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:17:29,323 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 05:17:32,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:17:32,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4121 states to 3497 states and 4121 transitions. [2024-12-06 05:17:32,739 INFO L276 IsEmpty]: Start isEmpty. Operand 3497 states and 4121 transitions. [2024-12-06 05:17:32,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-12-06 05:17:32,741 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:17:32,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:17:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:17:32,828 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2024-12-06 05:17:34,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:17:34,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4138 states to 3513 states and 4138 transitions. [2024-12-06 05:17:34,606 INFO L276 IsEmpty]: Start isEmpty. Operand 3513 states and 4138 transitions. [2024-12-06 05:17:34,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-12-06 05:17:34,609 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:17:34,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:17:34,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:17:34,976 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 186 proven. 111 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 05:17:35,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:17:35,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4145 states to 3520 states and 4145 transitions. [2024-12-06 05:17:35,502 INFO L276 IsEmpty]: Start isEmpty. Operand 3520 states and 4145 transitions. [2024-12-06 05:17:35,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-12-06 05:17:35,504 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:17:35,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:17:35,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:17:35,765 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 179 proven. 109 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-12-06 05:17:36,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:17:36,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4157 states to 3532 states and 4157 transitions. [2024-12-06 05:17:36,729 INFO L276 IsEmpty]: Start isEmpty. Operand 3532 states and 4157 transitions. [2024-12-06 05:17:36,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-12-06 05:17:36,732 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:17:36,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:17:36,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:17:36,839 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-12-06 05:17:38,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:17:38,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4173 states to 3546 states and 4173 transitions. [2024-12-06 05:17:38,652 INFO L276 IsEmpty]: Start isEmpty. Operand 3546 states and 4173 transitions. [2024-12-06 05:17:38,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-12-06 05:17:38,655 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:17:38,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:17:38,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:17:39,019 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 185 proven. 152 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-06 05:17:40,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:17:40,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4196 states to 3567 states and 4196 transitions. [2024-12-06 05:17:40,803 INFO L276 IsEmpty]: Start isEmpty. Operand 3567 states and 4196 transitions. [2024-12-06 05:17:40,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-06 05:17:40,806 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:17:40,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:17:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:17:40,913 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-12-06 05:17:43,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:17:43,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4215 states to 3587 states and 4215 transitions. [2024-12-06 05:17:43,064 INFO L276 IsEmpty]: Start isEmpty. Operand 3587 states and 4215 transitions. [2024-12-06 05:17:43,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-06 05:17:43,069 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:17:43,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:17:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:17:43,662 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 189 proven. 114 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 05:17:44,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:17:44,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4219 states to 3590 states and 4219 transitions. [2024-12-06 05:17:44,098 INFO L276 IsEmpty]: Start isEmpty. Operand 3590 states and 4219 transitions. [2024-12-06 05:17:44,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-06 05:17:44,101 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:17:44,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:17:44,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:17:44,764 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 125 proven. 170 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-12-06 05:17:50,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:17:50,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4345 states to 3700 states and 4345 transitions. [2024-12-06 05:17:50,766 INFO L276 IsEmpty]: Start isEmpty. Operand 3700 states and 4345 transitions. [2024-12-06 05:17:50,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-12-06 05:17:50,768 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:17:50,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:17:50,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:17:51,552 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 237 proven. 185 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-12-06 05:17:56,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:17:56,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4478 states to 3818 states and 4478 transitions. [2024-12-06 05:17:56,727 INFO L276 IsEmpty]: Start isEmpty. Operand 3818 states and 4478 transitions. [2024-12-06 05:17:56,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-12-06 05:17:56,730 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:17:56,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:17:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:17:57,750 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 05:18:03,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:18:03,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4548 states to 3866 states and 4548 transitions. [2024-12-06 05:18:03,321 INFO L276 IsEmpty]: Start isEmpty. Operand 3866 states and 4548 transitions. [2024-12-06 05:18:03,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-12-06 05:18:03,323 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:18:03,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:18:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:18:03,658 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 05:18:05,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:18:05,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4559 states to 3877 states and 4559 transitions. [2024-12-06 05:18:05,036 INFO L276 IsEmpty]: Start isEmpty. Operand 3877 states and 4559 transitions. [2024-12-06 05:18:05,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-12-06 05:18:05,153 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:18:05,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:18:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:18:05,616 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 05:18:06,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:18:06,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4569 states to 3886 states and 4569 transitions. [2024-12-06 05:18:06,544 INFO L276 IsEmpty]: Start isEmpty. Operand 3886 states and 4569 transitions. [2024-12-06 05:18:06,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-12-06 05:18:06,546 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:18:06,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:18:06,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:18:06,849 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 05:18:07,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:18:07,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4579 states to 3895 states and 4579 transitions. [2024-12-06 05:18:07,621 INFO L276 IsEmpty]: Start isEmpty. Operand 3895 states and 4579 transitions. [2024-12-06 05:18:07,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-12-06 05:18:07,623 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:18:07,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:18:07,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:18:08,581 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 200 proven. 180 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 05:18:14,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:18:14,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4697 states to 4001 states and 4697 transitions. [2024-12-06 05:18:14,584 INFO L276 IsEmpty]: Start isEmpty. Operand 4001 states and 4697 transitions. [2024-12-06 05:18:14,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2024-12-06 05:18:14,585 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:18:14,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:18:14,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:18:15,052 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 385 proven. 9 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-12-06 05:18:16,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:18:16,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4700 states to 4005 states and 4700 transitions. [2024-12-06 05:18:16,709 INFO L276 IsEmpty]: Start isEmpty. Operand 4005 states and 4700 transitions. [2024-12-06 05:18:16,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-12-06 05:18:16,711 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 05:18:16,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 05:18:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 05:18:17,753 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 279 proven. 206 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-12-06 05:18:23,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 05:18:23,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4757 states to 4049 states and 4757 transitions. [2024-12-06 05:18:23,908 INFO L276 IsEmpty]: Start isEmpty. Operand 4049 states and 4757 transitions. [2024-12-06 05:18:23,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-06 05:18:23,910 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 164 iterations. [2024-12-06 05:18:23,917 INFO L726 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-12-06 05:19:03,763 INFO L77 FloydHoareUtils]: At program point L102(lines 102 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (<= ~a8~0 13) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (not .cse3) .cse9) (and (<= ~a16~0 4) .cse9) (and .cse5 .cse0 (= 14 ~a8~0) .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-12-06 05:19:03,763 INFO L77 FloydHoareUtils]: At program point L598(line 598) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-12-06 05:19:03,763 INFO L77 FloydHoareUtils]: At program point L334(lines 334 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-12-06 05:19:03,763 INFO L77 FloydHoareUtils]: At program point L302(lines 302 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-12-06 05:19:03,763 INFO L77 FloydHoareUtils]: At program point L170(lines 170 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse10 (not .cse8)) (.cse9 (<= 15 ~a8~0)) (.cse2 (= ~a12~0 8)) (.cse11 (= 14 ~a8~0)) (.cse4 (not (= ~a17~0 1))) (.cse7 (not .cse6)) (.cse5 (= ~a21~0 1)) (.cse1 (= ~a16~0 4)) (.cse3 (= 5 ~a16~0)) (.cse0 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6) (<= ~a8~0 13) (and .cse2 .cse7 .cse5 .cse8 .cse1) (and (not (and .cse2 .cse5 .cse0 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9 (not .cse1)) (and .cse10 .cse2 .cse11 .cse3 .cse4 .cse5) (and .cse10 .cse2 .cse4 .cse5 .cse6 .cse1) (and (not (and .cse4 (<= ~a16~0 5))) .cse9) (and .cse2 .cse11 .cse4 .cse7 .cse5 .cse1) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse3 .cse0)))) [2024-12-06 05:19:03,764 INFO L77 FloydHoareUtils]: At program point L204(lines 204 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse10 (not .cse8)) (.cse9 (<= 15 ~a8~0)) (.cse2 (= ~a12~0 8)) (.cse11 (= 14 ~a8~0)) (.cse4 (not (= ~a17~0 1))) (.cse7 (not .cse6)) (.cse5 (= ~a21~0 1)) (.cse1 (= ~a16~0 4)) (.cse3 (= 5 ~a16~0)) (.cse0 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6) (<= ~a8~0 13) (and .cse2 .cse7 .cse5 .cse8 .cse1) (and (not (and .cse2 .cse5 .cse0 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9 (not .cse1)) (and .cse10 .cse2 .cse11 .cse3 .cse4 .cse5) (and .cse10 .cse2 .cse4 .cse5 .cse6 .cse1) (and (not (and .cse4 (<= ~a16~0 5))) .cse9) (and .cse2 .cse11 .cse4 .cse7 .cse5 .cse1) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse3 .cse0)))) [2024-12-06 05:19:03,764 INFO L77 FloydHoareUtils]: At program point L72(lines 72 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-12-06 05:19:03,764 INFO L77 FloydHoareUtils]: At program point L271(lines 271 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-12-06 05:19:03,765 INFO L77 FloydHoareUtils]: At program point L139(lines 139 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (<= ~a8~0 13) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (not .cse3) .cse9) (and (<= ~a16~0 4) .cse9) (and .cse5 .cse0 (= 14 ~a8~0) .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-12-06 05:19:03,765 INFO L77 FloydHoareUtils]: At program point L371(lines 371 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-12-06 05:19:03,765 INFO L77 FloydHoareUtils]: At program point L107(lines 107 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (<= ~a8~0 13) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (not .cse3) .cse9) (and (<= ~a16~0 4) .cse9) (and .cse5 .cse0 (= 14 ~a8~0) .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-12-06 05:19:03,765 INFO L77 FloydHoareUtils]: At program point L41(lines 41 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-12-06 05:19:03,765 INFO L77 FloydHoareUtils]: At program point L339(lines 339 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-12-06 05:19:03,765 INFO L77 FloydHoareUtils]: At program point L207(lines 207 400) the Hoare annotation is: (let ((.cse4 (= ~a7~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse1 (= 5 ~a16~0)) (.cse7 (not .cse9)) (.cse0 (= ~a12~0 8)) (.cse2 (not (= ~a17~0 1))) (.cse8 (not .cse4)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse5) (<= ~a8~0 13) (and (not (and .cse0 (= ~a8~0 15) (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0) .cse6)) .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse8 .cse3 .cse9 .cse6) (and (not .cse3) .cse5) (and .cse7 .cse0 .cse2 .cse3 .cse4 .cse6) (and .cse0 (= 14 ~a8~0) .cse2 .cse8 .cse3 .cse6) (and .cse9 .cse5)))) [2024-12-06 05:19:03,766 INFO L77 FloydHoareUtils]: At program point L75(lines 75 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-12-06 05:19:03,766 INFO L77 FloydHoareUtils]: At program point L373(lines 373 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-12-06 05:19:03,766 INFO L77 FloydHoareUtils]: At program point L241(lines 241 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-12-06 05:19:03,766 INFO L77 FloydHoareUtils]: At program point L175(lines 175 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse10 (not .cse8)) (.cse9 (<= 15 ~a8~0)) (.cse2 (= ~a12~0 8)) (.cse11 (= 14 ~a8~0)) (.cse4 (not (= ~a17~0 1))) (.cse7 (not .cse6)) (.cse5 (= ~a21~0 1)) (.cse1 (= ~a16~0 4)) (.cse3 (= 5 ~a16~0)) (.cse0 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6) (<= ~a8~0 13) (and .cse2 .cse7 .cse5 .cse8 .cse1) (and (not (and .cse2 .cse5 .cse0 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9 (not .cse1)) (and .cse10 .cse2 .cse11 .cse3 .cse4 .cse5) (and .cse10 .cse2 .cse4 .cse5 .cse6 .cse1) (and (not (and .cse4 (<= ~a16~0 5))) .cse9) (and .cse2 .cse11 .cse4 .cse7 .cse5 .cse1) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse3 .cse0)))) [2024-12-06 05:19:03,766 INFO L77 FloydHoareUtils]: At program point L440-1(lines 40 585) the Hoare annotation is: (not (and (< 13 ~a8~0) (< ~a8~0 15))) [2024-12-06 05:19:03,767 INFO L77 FloydHoareUtils]: At program point L275(lines 275 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-12-06 05:19:03,767 INFO L77 FloydHoareUtils]: At program point L375(lines 375 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-12-06 05:19:03,767 INFO L77 FloydHoareUtils]: At program point L309(lines 309 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-12-06 05:19:03,767 INFO L77 FloydHoareUtils]: At program point L45(lines 45 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-12-06 05:19:03,767 INFO L77 FloydHoareUtils]: At program point L343(lines 343 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-12-06 05:19:03,768 INFO L77 FloydHoareUtils]: At program point L112(lines 112 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (<= ~a8~0 13) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (not .cse3) .cse9) (and (<= ~a16~0 4) .cse9) (and .cse5 .cse0 (= 14 ~a8~0) .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-12-06 05:19:03,768 INFO L77 FloydHoareUtils]: At program point L443-1(lines 40 585) the Hoare annotation is: (not (let ((.cse0 (= ~a12~0 8)) (.cse1 (not (= ~a7~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (= 5 ~a16~0) .cse1 .cse2 (= ~a17~0 1) (= ~a20~0 ~a7~0))) (not (and .cse0 (= ~a16~0 6) .cse1 .cse2 (= ~a20~0 1) (= ~a17~0 ~a7~0))) (< 13 ~a8~0) (< ~a8~0 15)))) [2024-12-06 05:19:03,768 INFO L77 FloydHoareUtils]: At program point L278(lines 278 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-12-06 05:19:03,768 INFO L77 FloydHoareUtils]: At program point L146(lines 146 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (<= ~a8~0 13) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (not .cse3) .cse9) (and (<= ~a16~0 4) .cse9) (and .cse5 .cse0 (= 14 ~a8~0) .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-12-06 05:19:03,768 INFO L75 FloydHoareUtils]: For program point L444(line 444) no Hoare annotation was computed. [2024-12-06 05:19:03,768 INFO L77 FloydHoareUtils]: At program point L213(lines 213 400) the Hoare annotation is: (let ((.cse4 (= ~a7~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse1 (= 5 ~a16~0)) (.cse7 (not .cse9)) (.cse0 (= ~a12~0 8)) (.cse2 (not (= ~a17~0 1))) (.cse8 (not .cse4)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse5) (<= ~a8~0 13) (and (not (and .cse0 (= ~a8~0 15) (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0) .cse6)) .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse8 .cse3 .cse9 .cse6) (and (not .cse3) .cse5) (and .cse7 .cse0 .cse2 .cse3 .cse4 .cse6) (and .cse0 (= 14 ~a8~0) .cse2 .cse8 .cse3 .cse6) (and .cse9 .cse5)))) [2024-12-06 05:19:03,768 INFO L77 FloydHoareUtils]: At program point L82(lines 82 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (<= ~a8~0 13) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (not .cse3) .cse9) (and (<= ~a16~0 4) .cse9) (and .cse5 .cse0 (= 14 ~a8~0) .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-12-06 05:19:03,769 INFO L77 FloydHoareUtils]: At program point L347(lines 347 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-12-06 05:19:03,769 INFO L77 FloydHoareUtils]: At program point L248(lines 248 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-12-06 05:19:03,769 INFO L77 FloydHoareUtils]: At program point L183(lines 183 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse10 (not .cse8)) (.cse9 (<= 15 ~a8~0)) (.cse2 (= ~a12~0 8)) (.cse11 (= 14 ~a8~0)) (.cse4 (not (= ~a17~0 1))) (.cse7 (not .cse6)) (.cse5 (= ~a21~0 1)) (.cse1 (= ~a16~0 4)) (.cse3 (= 5 ~a16~0)) (.cse0 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6) (<= ~a8~0 13) (and .cse2 .cse7 .cse5 .cse8 .cse1) (and (not (and .cse2 .cse5 .cse0 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9 (not .cse1)) (and .cse10 .cse2 .cse11 .cse3 .cse4 .cse5) (and .cse10 .cse2 .cse4 .cse5 .cse6 .cse1) (and (not (and .cse4 (<= ~a16~0 5))) .cse9) (and .cse2 .cse11 .cse4 .cse7 .cse5 .cse1) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse3 .cse0)))) [2024-12-06 05:19:03,769 INFO L77 FloydHoareUtils]: At program point L150(lines 150 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (<= ~a8~0 13) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (not .cse3) .cse9) (and (<= ~a16~0 4) .cse9) (and .cse5 .cse0 (= 14 ~a8~0) .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-12-06 05:19:03,769 INFO L77 FloydHoareUtils]: At program point L382(lines 382 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-12-06 05:19:03,770 INFO L77 FloydHoareUtils]: At program point L316(lines 316 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-12-06 05:19:03,770 INFO L77 FloydHoareUtils]: At program point L283(lines 283 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-12-06 05:19:03,770 INFO L77 FloydHoareUtils]: At program point L118(lines 118 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (<= ~a8~0 13) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (not .cse3) .cse9) (and (<= ~a16~0 4) .cse9) (and .cse5 .cse0 (= 14 ~a8~0) .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-12-06 05:19:03,771 INFO L77 FloydHoareUtils]: At program point L218(lines 218 400) the Hoare annotation is: (let ((.cse4 (= ~a7~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse1 (= 5 ~a16~0)) (.cse7 (not .cse9)) (.cse0 (= ~a12~0 8)) (.cse2 (not (= ~a17~0 1))) (.cse8 (not .cse4)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (<= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse5) (<= ~a8~0 13) (and (not (and .cse0 (= ~a8~0 15) (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0) .cse6)) .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse8 .cse3 .cse9 .cse6) (and (not .cse3) .cse5) (and .cse7 .cse0 .cse2 .cse3 .cse4 .cse6) (and .cse0 (= 14 ~a8~0) .cse2 .cse8 .cse3 .cse6) (and .cse9 .cse5)))) [2024-12-06 05:19:03,771 INFO L77 FloydHoareUtils]: At program point L53(lines 53 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-12-06 05:19:03,771 INFO L77 FloydHoareUtils]: At program point L154(lines 154 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (<= ~a8~0 13) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (not .cse3) .cse9) (and (<= ~a16~0 4) .cse9) (and .cse5 .cse0 (= 14 ~a8~0) .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-12-06 05:19:03,771 INFO L77 FloydHoareUtils]: At program point L188(lines 188 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse10 (not .cse8)) (.cse9 (<= 15 ~a8~0)) (.cse2 (= ~a12~0 8)) (.cse11 (= 14 ~a8~0)) (.cse4 (not (= ~a17~0 1))) (.cse7 (not .cse6)) (.cse5 (= ~a21~0 1)) (.cse1 (= ~a16~0 4)) (.cse3 (= 5 ~a16~0)) (.cse0 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6) (<= ~a8~0 13) (and .cse2 .cse7 .cse5 .cse8 .cse1) (and (not (and .cse2 .cse5 .cse0 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9 (not .cse1)) (and .cse10 .cse2 .cse11 .cse3 .cse4 .cse5) (and .cse10 .cse2 .cse4 .cse5 .cse6 .cse1) (and (not (and .cse4 (<= ~a16~0 5))) .cse9) (and .cse2 .cse11 .cse4 .cse7 .cse5 .cse1) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse3 .cse0)))) [2024-12-06 05:19:03,771 INFO L77 FloydHoareUtils]: At program point L387(lines 387 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-12-06 05:19:03,772 INFO L77 FloydHoareUtils]: At program point L288(lines 288 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-12-06 05:19:03,772 INFO L77 FloydHoareUtils]: At program point L255(lines 255 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-12-06 05:19:03,772 INFO L77 FloydHoareUtils]: At program point L90(lines 90 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (<= ~a8~0 13) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (not .cse3) .cse9) (and (<= ~a16~0 4) .cse9) (and .cse5 .cse0 (= 14 ~a8~0) .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-12-06 05:19:03,772 INFO L77 FloydHoareUtils]: At program point L355(lines 355 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-12-06 05:19:03,772 INFO L77 FloydHoareUtils]: At program point L322(lines 322 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-12-06 05:19:03,772 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-12-06 05:19:03,773 INFO L77 FloydHoareUtils]: At program point L124(lines 124 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (<= ~a8~0 13) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (not .cse3) .cse9) (and (<= ~a16~0 4) .cse9) (and .cse5 .cse0 (= 14 ~a8~0) .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-12-06 05:19:03,773 INFO L77 FloydHoareUtils]: At program point L587(lines 587 604) the Hoare annotation is: true [2024-12-06 05:19:03,773 INFO L77 FloydHoareUtils]: At program point L224(lines 224 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-12-06 05:19:03,773 INFO L77 FloydHoareUtils]: At program point L158(lines 158 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse10 (not .cse8)) (.cse9 (<= 15 ~a8~0)) (.cse2 (= ~a12~0 8)) (.cse11 (= 14 ~a8~0)) (.cse4 (not (= ~a17~0 1))) (.cse7 (not .cse6)) (.cse5 (= ~a21~0 1)) (.cse1 (= ~a16~0 4)) (.cse3 (= 5 ~a16~0)) (.cse0 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6) (<= ~a8~0 13) (and .cse2 .cse7 .cse5 .cse8 .cse1) (and (not (and .cse2 .cse5 .cse0 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9 (not .cse1)) (and .cse10 .cse2 .cse11 .cse3 .cse4 .cse5) (and .cse10 .cse2 .cse4 .cse5 .cse6 .cse1) (and (not (and .cse4 (<= ~a16~0 5))) .cse9) (and .cse2 .cse11 .cse4 .cse7 .cse5 .cse1) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse3 .cse0)))) [2024-12-06 05:19:03,773 INFO L77 FloydHoareUtils]: At program point L59(lines 59 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-12-06 05:19:03,773 INFO L77 FloydHoareUtils]: At program point L94(lines 94 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (<= ~a8~0 13) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (not .cse3) .cse9) (and (<= ~a16~0 4) .cse9) (and .cse5 .cse0 (= 14 ~a8~0) .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-12-06 05:19:03,774 INFO L77 FloydHoareUtils]: At program point L392(lines 392 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-12-06 05:19:03,774 INFO L77 FloydHoareUtils]: At program point L326(lines 326 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-12-06 05:19:03,774 INFO L77 FloydHoareUtils]: At program point L260(lines 260 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-12-06 05:19:03,774 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-12-06 05:19:03,774 INFO L77 FloydHoareUtils]: At program point L228(lines 228 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-12-06 05:19:03,774 INFO L77 FloydHoareUtils]: At program point L162(lines 162 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse10 (not .cse8)) (.cse9 (<= 15 ~a8~0)) (.cse2 (= ~a12~0 8)) (.cse11 (= 14 ~a8~0)) (.cse4 (not (= ~a17~0 1))) (.cse7 (not .cse6)) (.cse5 (= ~a21~0 1)) (.cse1 (= ~a16~0 4)) (.cse3 (= 5 ~a16~0)) (.cse0 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6) (<= ~a8~0 13) (and .cse2 .cse7 .cse5 .cse8 .cse1) (and (not (and .cse2 .cse5 .cse0 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9 (not .cse1)) (and .cse10 .cse2 .cse11 .cse3 .cse4 .cse5) (and .cse10 .cse2 .cse4 .cse5 .cse6 .cse1) (and (not (and .cse4 (<= ~a16~0 5))) .cse9) (and .cse2 .cse11 .cse4 .cse7 .cse5 .cse1) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse3 .cse0)))) [2024-12-06 05:19:03,775 INFO L77 FloydHoareUtils]: At program point L129(lines 129 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (<= ~a8~0 13) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (not .cse3) .cse9) (and (<= ~a16~0 4) .cse9) (and .cse5 .cse0 (= 14 ~a8~0) .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-12-06 05:19:03,775 INFO L77 FloydHoareUtils]: At program point L328(lines 328 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-12-06 05:19:03,775 INFO L77 FloydHoareUtils]: At program point L196(lines 196 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse10 (not .cse8)) (.cse9 (<= 15 ~a8~0)) (.cse2 (= ~a12~0 8)) (.cse11 (= 14 ~a8~0)) (.cse4 (not (= ~a17~0 1))) (.cse7 (not .cse6)) (.cse5 (= ~a21~0 1)) (.cse1 (= ~a16~0 4)) (.cse3 (= 5 ~a16~0)) (.cse0 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6) (<= ~a8~0 13) (and .cse2 .cse7 .cse5 .cse8 .cse1) (and (not (and .cse2 .cse5 .cse0 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9 (not .cse1)) (and .cse10 .cse2 .cse11 .cse3 .cse4 .cse5) (and .cse10 .cse2 .cse4 .cse5 .cse6 .cse1) (and (not (and .cse4 (<= ~a16~0 5))) .cse9) (and .cse2 .cse11 .cse4 .cse7 .cse5 .cse1) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse3 .cse0)))) [2024-12-06 05:19:03,775 INFO L77 FloydHoareUtils]: At program point L64(lines 64 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-12-06 05:19:03,775 INFO L77 FloydHoareUtils]: At program point L593-2(lines 593 603) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-12-06 05:19:03,776 INFO L77 FloydHoareUtils]: At program point L296(lines 296 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-12-06 05:19:03,776 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 40 585) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-12-06 05:19:03,776 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 444) no Hoare annotation was computed. [2024-12-06 05:19:03,776 INFO L77 FloydHoareUtils]: At program point L363(lines 363 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-12-06 05:19:03,776 INFO L77 FloydHoareUtils]: At program point L199(lines 199 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse10 (not .cse8)) (.cse9 (<= 15 ~a8~0)) (.cse2 (= ~a12~0 8)) (.cse11 (= 14 ~a8~0)) (.cse4 (not (= ~a17~0 1))) (.cse7 (not .cse6)) (.cse5 (= ~a21~0 1)) (.cse1 (= ~a16~0 4)) (.cse3 (= 5 ~a16~0)) (.cse0 (= ~a8~0 15))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6) (<= ~a8~0 13) (and .cse2 .cse7 .cse5 .cse8 .cse1) (and (not (and .cse2 .cse5 .cse0 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9 (not .cse1)) (and .cse10 .cse2 .cse11 .cse3 .cse4 .cse5) (and .cse10 .cse2 .cse4 .cse5 .cse6 .cse1) (and (not (and .cse4 (<= ~a16~0 5))) .cse9) (and .cse2 .cse11 .cse4 .cse7 .cse5 .cse1) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse3 .cse0)))) [2024-12-06 05:19:03,777 INFO L77 FloydHoareUtils]: At program point L365(lines 365 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-12-06 05:19:03,777 INFO L77 FloydHoareUtils]: At program point L266(lines 266 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-12-06 05:19:03,777 INFO L77 FloydHoareUtils]: At program point L233(lines 233 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (< 13 ~a8~0) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)) (< ~a8~0 15))))) [2024-12-06 05:19:03,777 INFO L77 FloydHoareUtils]: At program point L134(lines 134 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (<= ~a8~0 13) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (not .cse3) .cse9) (and (<= ~a16~0 4) .cse9) (and .cse5 .cse0 (= 14 ~a8~0) .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-12-06 05:19:03,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 05:19:03 ImpRootNode [2024-12-06 05:19:03,790 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 05:19:03,790 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 05:19:03,790 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 05:19:03,790 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 05:19:03,791 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:14:24" (3/4) ... [2024-12-06 05:19:03,793 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-06 05:19:03,807 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 118 nodes and edges [2024-12-06 05:19:03,808 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-12-06 05:19:03,809 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-12-06 05:19:03,809 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-12-06 05:19:03,930 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a19e39e-e617-4ac2-9ff3-bb006021eea4/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 05:19:03,930 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a19e39e-e617-4ac2-9ff3-bb006021eea4/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 05:19:03,931 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 05:19:03,932 INFO L158 Benchmark]: Toolchain (without parser) took 281060.06ms. Allocated memory was 142.6MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 115.1MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-12-06 05:19:03,932 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 142.6MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 05:19:03,932 INFO L158 Benchmark]: CACSL2BoogieTranslator took 400.57ms. Allocated memory is still 142.6MB. Free memory was 114.9MB in the beginning and 87.9MB in the end (delta: 27.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-12-06 05:19:03,932 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.35ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 82.0MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 05:19:03,932 INFO L158 Benchmark]: Boogie Preprocessor took 54.59ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 77.8MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 05:19:03,933 INFO L158 Benchmark]: RCFGBuilder took 1262.33ms. Allocated memory is still 142.6MB. Free memory was 77.8MB in the beginning and 62.1MB in the end (delta: 15.8MB). Peak memory consumption was 35.2MB. Max. memory is 16.1GB. [2024-12-06 05:19:03,933 INFO L158 Benchmark]: CodeCheck took 279134.91ms. Allocated memory was 142.6MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 62.1MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-12-06 05:19:03,933 INFO L158 Benchmark]: Witness Printer took 140.48ms. Allocated memory is still 2.5GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 05:19:03,935 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: 239.2s, OverallIterations: 164, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 673948 SdHoareTripleChecker+Valid, 1555.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 671677 mSDsluCounter, 98817 SdHoareTripleChecker+Invalid, 1321.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 84378 mSDsCounter, 117166 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1408805 IncrementalHoareTripleChecker+Invalid, 1525971 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 117166 mSolverCounterUnsat, 14439 mSDtfsCounter, 1408805 mSolverCounterSat, 12.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 209459 GetRequests, 199950 SyntacticMatches, 8037 SemanticMatches, 1472 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1393033 ImplicationChecksByTransitivity, 173.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 1.0s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 34.2s InterpolantComputationTime, 31552 NumberOfCodeBlocks, 31552 NumberOfCodeBlocksAsserted, 163 NumberOfCheckSat, 31389 ConstructedInterpolants, 0 QuantifiedInterpolants, 159082 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 163 InterpolantComputations, 83 PerfectInterpolantSequences, 30625/36062 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - PositiveResult [Line: 444]: 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: !(((((!(((((a12 == 8) && (a7 != 1)) && (a21 == 1)) && (a20 == 1)) && (a16 == 4)) && !(((((a12 == 8) && (5 == a16)) && (a17 != 1)) && (a21 == 1)) && (a7 == 1))) && !(((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a21 == 1)) && (a16 == 4))) && (13 < a8)) && !(((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1))) && (a8 < 15)) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: !(((((!(((((a12 == 8) && (a7 != 1)) && (a21 == 1)) && (a20 == 1)) && (a16 == 4)) && !(((((a12 == 8) && (5 == a16)) && (a17 != 1)) && (a21 == 1)) && (a7 == 1))) && !(((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a21 == 1)) && (a16 == 4))) && (13 < a8)) && !(((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1))) && (a8 < 15)) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 142.6MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 400.57ms. Allocated memory is still 142.6MB. Free memory was 114.9MB in the beginning and 87.9MB in the end (delta: 27.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.35ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 82.0MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.59ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 77.8MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1262.33ms. Allocated memory is still 142.6MB. Free memory was 77.8MB in the beginning and 62.1MB in the end (delta: 15.8MB). Peak memory consumption was 35.2MB. Max. memory is 16.1GB. * CodeCheck took 279134.91ms. Allocated memory was 142.6MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 62.1MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 140.48ms. Allocated memory is still 2.5GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-12-06 05:19:03,955 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a19e39e-e617-4ac2-9ff3-bb006021eea4/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE