./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label10.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_fab637df-2934-4fec-9f0a-03ebf91c4e73/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fab637df-2934-4fec-9f0a-03ebf91c4e73/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_fab637df-2934-4fec-9f0a-03ebf91c4e73/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fab637df-2934-4fec-9f0a-03ebf91c4e73/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label10.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fab637df-2934-4fec-9f0a-03ebf91c4e73/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_fab637df-2934-4fec-9f0a-03ebf91c4e73/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 5f4b32ab55ef7da7a1c45381b7a9ca93704fa76788ea88b9dbed6ebccc0ba509 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 01:50:49,566 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 01:50:49,618 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fab637df-2934-4fec-9f0a-03ebf91c4e73/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-06 01:50:49,622 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 01:50:49,622 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 01:50:49,640 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 01:50:49,640 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 01:50:49,640 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 01:50:49,641 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 01:50:49,641 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 01:50:49,641 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 01:50:49,641 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 01:50:49,641 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 01:50:49,641 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 01:50:49,641 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 01:50:49,641 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 01:50:49,642 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 01:50:49,642 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 01:50:49,642 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 01:50:49,642 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 01:50:49,642 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 01:50:49,642 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 01:50:49,642 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 01:50:49,642 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 01:50:49,642 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 01:50:49,642 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 01:50:49,642 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 01:50:49,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 01:50:49,643 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 01:50:49,643 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 01:50:49,643 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 01:50:49,643 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 01:50:49,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 01:50:49,643 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_fab637df-2934-4fec-9f0a-03ebf91c4e73/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 -> 5f4b32ab55ef7da7a1c45381b7a9ca93704fa76788ea88b9dbed6ebccc0ba509 [2024-12-06 01:50:49,868 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 01:50:49,876 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 01:50:49,878 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 01:50:49,879 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 01:50:49,880 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 01:50:49,881 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fab637df-2934-4fec-9f0a-03ebf91c4e73/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/eca-rers2012/Problem01_label10.c [2024-12-06 01:50:52,523 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fab637df-2934-4fec-9f0a-03ebf91c4e73/bin/ukojak-verify-CZk0znPC7b/data/beea32127/cbbe695b0c1f42b6937af0f9611d6d51/FLAG5f353c9bc [2024-12-06 01:50:52,789 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 01:50:52,790 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fab637df-2934-4fec-9f0a-03ebf91c4e73/sv-benchmarks/c/eca-rers2012/Problem01_label10.c [2024-12-06 01:50:52,800 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fab637df-2934-4fec-9f0a-03ebf91c4e73/bin/ukojak-verify-CZk0znPC7b/data/beea32127/cbbe695b0c1f42b6937af0f9611d6d51/FLAG5f353c9bc [2024-12-06 01:50:52,816 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fab637df-2934-4fec-9f0a-03ebf91c4e73/bin/ukojak-verify-CZk0znPC7b/data/beea32127/cbbe695b0c1f42b6937af0f9611d6d51 [2024-12-06 01:50:52,818 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 01:50:52,820 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 01:50:52,821 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 01:50:52,822 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 01:50:52,826 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 01:50:52,827 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:50:52" (1/1) ... [2024-12-06 01:50:52,828 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f65167d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:50:52, skipping insertion in model container [2024-12-06 01:50:52,828 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 01:50:52" (1/1) ... [2024-12-06 01:50:52,860 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 01:50:53,146 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_fab637df-2934-4fec-9f0a-03ebf91c4e73/sv-benchmarks/c/eca-rers2012/Problem01_label10.c[19224,19237] [2024-12-06 01:50:53,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 01:50:53,182 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 01:50:53,245 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_fab637df-2934-4fec-9f0a-03ebf91c4e73/sv-benchmarks/c/eca-rers2012/Problem01_label10.c[19224,19237] [2024-12-06 01:50:53,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 01:50:53,272 INFO L204 MainTranslator]: Completed translation [2024-12-06 01:50:53,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:50:53 WrapperNode [2024-12-06 01:50:53,273 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 01:50:53,274 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 01:50:53,274 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 01:50:53,274 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 01:50:53,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:50:53" (1/1) ... [2024-12-06 01:50:53,294 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:50:53" (1/1) ... [2024-12-06 01:50:53,324 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-12-06 01:50:53,324 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 01:50:53,325 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 01:50:53,325 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 01:50:53,325 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 01:50:53,333 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:50:53" (1/1) ... [2024-12-06 01:50:53,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:50:53" (1/1) ... [2024-12-06 01:50:53,336 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:50:53" (1/1) ... [2024-12-06 01:50:53,337 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:50:53" (1/1) ... [2024-12-06 01:50:53,353 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:50:53" (1/1) ... [2024-12-06 01:50:53,354 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:50:53" (1/1) ... [2024-12-06 01:50:53,361 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:50:53" (1/1) ... [2024-12-06 01:50:53,364 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:50:53" (1/1) ... [2024-12-06 01:50:53,367 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:50:53" (1/1) ... [2024-12-06 01:50:53,372 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 01:50:53,373 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 01:50:53,373 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 01:50:53,373 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 01:50:53,374 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 01:50:53" (1/1) ... [2024-12-06 01:50:53,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 01:50:53,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fab637df-2934-4fec-9f0a-03ebf91c4e73/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 01:50:53,404 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fab637df-2934-4fec-9f0a-03ebf91c4e73/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 01:50:53,408 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fab637df-2934-4fec-9f0a-03ebf91c4e73/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 01:50:53,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 01:50:53,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 01:50:53,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 01:50:53,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 01:50:53,502 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 01:50:53,504 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 01:50:54,380 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-12-06 01:50:54,381 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 01:50:54,548 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 01:50:54,548 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-06 01:50:54,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:50:54 BoogieIcfgContainer [2024-12-06 01:50:54,549 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 01:50:54,549 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 01:50:54,549 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 01:50:54,556 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 01:50:54,556 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:50:54" (1/1) ... [2024-12-06 01:50:54,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 01:50:54,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:50:54,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-12-06 01:50:54,607 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-12-06 01:50:54,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-12-06 01:50:54,610 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:50:54,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:50:54,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:50:55,251 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 01:50:55,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:50:55,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 145 states and 220 transitions. [2024-12-06 01:50:55,942 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 220 transitions. [2024-12-06 01:50:55,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-12-06 01:50:55,944 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:50:55,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:50:55,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:50:56,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:50:56,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:50:56,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 214 states and 297 transitions. [2024-12-06 01:50:56,883 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 297 transitions. [2024-12-06 01:50:56,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-12-06 01:50:56,885 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:50:56,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:50:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:50:57,158 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 01:50:57,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:50:57,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 283 states and 367 transitions. [2024-12-06 01:50:57,873 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 367 transitions. [2024-12-06 01:50:57,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-12-06 01:50:57,875 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:50:57,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:50:57,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:50:58,114 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:50:58,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:50:58,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 297 states and 386 transitions. [2024-12-06 01:50:58,625 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 386 transitions. [2024-12-06 01:50:58,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-12-06 01:50:58,629 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:50:58,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:50:58,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:50:58,733 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 01:50:58,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:50:58,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 306 states and 397 transitions. [2024-12-06 01:50:58,918 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 397 transitions. [2024-12-06 01:50:58,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-12-06 01:50:58,919 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:50:58,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:50:58,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:50:59,082 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 01:50:59,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:50:59,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 308 states and 399 transitions. [2024-12-06 01:50:59,147 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 399 transitions. [2024-12-06 01:50:59,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-12-06 01:50:59,148 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:50:59,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:50:59,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:50:59,286 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-06 01:51:00,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:00,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 334 states and 431 transitions. [2024-12-06 01:51:00,157 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 431 transitions. [2024-12-06 01:51:00,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-12-06 01:51:00,157 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:00,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:00,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:00,281 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 01:51:00,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:00,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 351 states and 451 transitions. [2024-12-06 01:51:00,853 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 451 transitions. [2024-12-06 01:51:00,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-12-06 01:51:00,854 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:00,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:00,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:01,025 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 01:51:01,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:01,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 380 states and 483 transitions. [2024-12-06 01:51:01,603 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 483 transitions. [2024-12-06 01:51:01,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-12-06 01:51:01,604 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:01,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:01,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:01,886 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 60 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 01:51:02,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:02,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 428 states and 537 transitions. [2024-12-06 01:51:02,891 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 537 transitions. [2024-12-06 01:51:02,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-12-06 01:51:02,893 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:02,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:02,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:03,076 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 01:51:03,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:03,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 431 states and 541 transitions. [2024-12-06 01:51:03,278 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 541 transitions. [2024-12-06 01:51:03,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-12-06 01:51:03,279 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:03,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:03,497 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 01:51:04,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:04,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 494 states and 612 transitions. [2024-12-06 01:51:04,859 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 612 transitions. [2024-12-06 01:51:04,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-12-06 01:51:04,860 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:04,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:04,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:04,978 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 01:51:05,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:05,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 496 states and 613 transitions. [2024-12-06 01:51:05,186 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 613 transitions. [2024-12-06 01:51:05,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-12-06 01:51:05,187 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:05,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:05,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:05,235 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-12-06 01:51:05,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:05,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 513 states and 633 transitions. [2024-12-06 01:51:05,608 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 633 transitions. [2024-12-06 01:51:05,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-12-06 01:51:05,609 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:05,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:05,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:05,754 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-06 01:51:05,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:05,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 514 states and 633 transitions. [2024-12-06 01:51:05,846 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 633 transitions. [2024-12-06 01:51:05,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-12-06 01:51:05,847 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:05,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:06,153 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 01:51:07,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:07,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 583 states and 718 transitions. [2024-12-06 01:51:07,370 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 718 transitions. [2024-12-06 01:51:07,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-12-06 01:51:07,371 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:07,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:07,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:07,621 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 01:51:08,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:08,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 602 states and 739 transitions. [2024-12-06 01:51:08,421 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 739 transitions. [2024-12-06 01:51:08,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-12-06 01:51:08,422 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:08,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:08,566 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 01:51:08,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:08,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 604 states and 740 transitions. [2024-12-06 01:51:08,820 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 740 transitions. [2024-12-06 01:51:08,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-06 01:51:08,821 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:08,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:08,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:08,958 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-06 01:51:09,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:09,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 606 states and 743 transitions. [2024-12-06 01:51:09,105 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 743 transitions. [2024-12-06 01:51:09,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-12-06 01:51:09,107 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:09,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:09,291 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 84 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-12-06 01:51:10,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:10,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 631 states and 770 transitions. [2024-12-06 01:51:10,090 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 770 transitions. [2024-12-06 01:51:10,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-12-06 01:51:10,092 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:10,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:10,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:10,169 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-12-06 01:51:10,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:10,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 656 states and 795 transitions. [2024-12-06 01:51:10,374 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 795 transitions. [2024-12-06 01:51:10,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-12-06 01:51:10,375 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:10,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:10,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:10,481 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 01:51:10,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:10,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 658 states and 796 transitions. [2024-12-06 01:51:10,725 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 796 transitions. [2024-12-06 01:51:10,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-12-06 01:51:10,726 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:10,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:10,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:10,816 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 01:51:11,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:11,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 705 states and 857 transitions. [2024-12-06 01:51:11,625 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 857 transitions. [2024-12-06 01:51:11,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-12-06 01:51:11,625 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:11,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:11,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:11,773 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 01:51:12,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:12,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 720 states and 876 transitions. [2024-12-06 01:51:12,354 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 876 transitions. [2024-12-06 01:51:12,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-12-06 01:51:12,355 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:12,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:12,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:12,716 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 01:51:15,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:15,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 804 states and 972 transitions. [2024-12-06 01:51:15,204 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 972 transitions. [2024-12-06 01:51:15,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-12-06 01:51:15,205 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:15,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:15,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:15,529 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:51:16,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:16,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 856 states and 1038 transitions. [2024-12-06 01:51:16,784 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1038 transitions. [2024-12-06 01:51:16,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-12-06 01:51:16,786 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:16,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:16,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:17,205 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 156 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 01:51:18,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:18,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 918 states and 1111 transitions. [2024-12-06 01:51:18,587 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1111 transitions. [2024-12-06 01:51:18,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-12-06 01:51:18,588 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:18,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:18,860 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 156 proven. 38 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 01:51:19,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:19,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 920 states and 1112 transitions. [2024-12-06 01:51:19,074 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1112 transitions. [2024-12-06 01:51:19,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 01:51:19,075 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:19,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:19,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:19,472 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:51:21,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:21,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1013 states and 1225 transitions. [2024-12-06 01:51:21,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1225 transitions. [2024-12-06 01:51:21,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 01:51:21,519 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:21,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:21,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:21,757 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 01:51:22,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:22,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1017 states and 1230 transitions. [2024-12-06 01:51:22,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1230 transitions. [2024-12-06 01:51:22,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-12-06 01:51:22,220 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:22,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:22,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:22,328 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-12-06 01:51:22,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:22,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1039 states and 1255 transitions. [2024-12-06 01:51:22,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1255 transitions. [2024-12-06 01:51:22,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-12-06 01:51:22,850 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:22,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:22,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:23,118 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 120 proven. 51 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-06 01:51:23,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:23,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1054 states and 1274 transitions. [2024-12-06 01:51:23,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1274 transitions. [2024-12-06 01:51:23,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-12-06 01:51:23,530 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:23,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:23,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:23,643 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 67 proven. 122 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 01:51:25,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:25,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1146 states and 1370 transitions. [2024-12-06 01:51:25,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1370 transitions. [2024-12-06 01:51:25,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-06 01:51:25,399 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:25,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:25,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:25,699 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:51:27,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:27,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1188 states and 1418 transitions. [2024-12-06 01:51:27,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1418 transitions. [2024-12-06 01:51:27,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-06 01:51:27,072 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:27,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:27,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:27,280 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:51:27,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:27,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 1221 states and 1456 transitions. [2024-12-06 01:51:27,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1456 transitions. [2024-12-06 01:51:27,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-12-06 01:51:27,963 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:27,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:28,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:28,193 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:51:28,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:28,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1222 states and 1457 transitions. [2024-12-06 01:51:28,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1457 transitions. [2024-12-06 01:51:28,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-12-06 01:51:28,512 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:28,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:28,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:28,834 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 01:51:29,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:29,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1282 states and 1530 transitions. [2024-12-06 01:51:29,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1530 transitions. [2024-12-06 01:51:29,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-12-06 01:51:29,938 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:29,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:30,050 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 01:51:31,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:31,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1320 states and 1573 transitions. [2024-12-06 01:51:31,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1573 transitions. [2024-12-06 01:51:31,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-06 01:51:31,059 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:31,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:31,379 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-06 01:51:32,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:32,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1341 states and 1601 transitions. [2024-12-06 01:51:32,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1601 transitions. [2024-12-06 01:51:32,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-06 01:51:32,416 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:32,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:32,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:32,690 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-06 01:51:34,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:34,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1637 states to 1375 states and 1637 transitions. [2024-12-06 01:51:34,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 1637 transitions. [2024-12-06 01:51:34,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-12-06 01:51:34,295 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:34,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:34,616 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:51:36,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:36,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1400 states and 1667 transitions. [2024-12-06 01:51:36,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 1667 transitions. [2024-12-06 01:51:36,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-12-06 01:51:36,152 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:36,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:36,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:36,465 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 138 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 01:51:37,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:37,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1416 states and 1683 transitions. [2024-12-06 01:51:37,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 1683 transitions. [2024-12-06 01:51:37,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-06 01:51:37,355 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:37,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:37,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:37,819 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 01:51:39,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:39,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1463 states and 1745 transitions. [2024-12-06 01:51:39,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 1745 transitions. [2024-12-06 01:51:39,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-06 01:51:39,747 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:39,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:40,013 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 01:51:40,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:40,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1473 states and 1754 transitions. [2024-12-06 01:51:40,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1473 states and 1754 transitions. [2024-12-06 01:51:40,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-06 01:51:40,799 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:40,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:40,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:41,098 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 01:51:41,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:41,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1475 states and 1759 transitions. [2024-12-06 01:51:41,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 1759 transitions. [2024-12-06 01:51:41,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-06 01:51:41,448 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:41,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:41,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:41,694 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 01:51:42,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:42,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1489 states and 1772 transitions. [2024-12-06 01:51:42,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 1772 transitions. [2024-12-06 01:51:42,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-12-06 01:51:42,336 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:42,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:42,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:42,585 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 01:51:42,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:42,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1492 states and 1775 transitions. [2024-12-06 01:51:42,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 1775 transitions. [2024-12-06 01:51:42,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-12-06 01:51:42,725 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:42,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:42,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:43,384 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 119 proven. 137 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 01:51:46,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:46,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1626 states and 1926 transitions. [2024-12-06 01:51:46,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 1926 transitions. [2024-12-06 01:51:46,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-06 01:51:46,586 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:46,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:46,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:46,833 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 58 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-12-06 01:51:47,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:47,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1651 states and 1952 transitions. [2024-12-06 01:51:47,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 1952 transitions. [2024-12-06 01:51:47,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-06 01:51:47,534 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:47,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:47,852 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 01:51:48,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:48,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1664 states and 1967 transitions. [2024-12-06 01:51:48,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 1967 transitions. [2024-12-06 01:51:48,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-06 01:51:48,317 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:48,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:48,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:48,626 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 01:51:49,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:49,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1667 states and 1971 transitions. [2024-12-06 01:51:49,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 1971 transitions. [2024-12-06 01:51:49,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-12-06 01:51:49,052 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:49,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:49,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:49,389 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 01:51:51,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:51,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 1755 states and 2072 transitions. [2024-12-06 01:51:51,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 2072 transitions. [2024-12-06 01:51:51,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-12-06 01:51:51,465 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:51,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:51,929 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 129 proven. 142 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 01:51:53,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:53,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2148 states to 1829 states and 2148 transitions. [2024-12-06 01:51:53,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2148 transitions. [2024-12-06 01:51:53,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-12-06 01:51:53,262 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:53,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:53,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:53,613 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 183 proven. 52 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-06 01:51:54,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:54,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 1850 states and 2170 transitions. [2024-12-06 01:51:54,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 2170 transitions. [2024-12-06 01:51:54,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-12-06 01:51:54,894 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:54,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:55,137 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 185 proven. 54 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-12-06 01:51:55,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:55,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2172 states to 1852 states and 2172 transitions. [2024-12-06 01:51:55,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1852 states and 2172 transitions. [2024-12-06 01:51:55,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-12-06 01:51:55,353 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:55,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:55,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:55,635 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 152 proven. 83 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-12-06 01:51:56,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:56,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2189 states to 1867 states and 2189 transitions. [2024-12-06 01:51:56,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1867 states and 2189 transitions. [2024-12-06 01:51:56,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-12-06 01:51:56,187 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:56,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:56,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:56,447 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 155 proven. 86 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-12-06 01:51:57,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:57,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 1904 states and 2234 transitions. [2024-12-06 01:51:57,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 2234 transitions. [2024-12-06 01:51:57,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-12-06 01:51:57,675 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:57,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:57,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:58,015 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 174 proven. 28 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 01:51:58,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:51:58,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 1915 states and 2246 transitions. [2024-12-06 01:51:58,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 2246 transitions. [2024-12-06 01:51:58,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-12-06 01:51:58,556 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:51:58,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:51:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:51:58,926 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 159 proven. 90 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-06 01:52:00,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:52:00,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 1947 states and 2284 transitions. [2024-12-06 01:52:00,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1947 states and 2284 transitions. [2024-12-06 01:52:00,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-12-06 01:52:00,767 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:52:00,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:52:00,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:52:01,057 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 162 proven. 93 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-12-06 01:52:01,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:52:01,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2287 states to 1950 states and 2287 transitions. [2024-12-06 01:52:01,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 2287 transitions. [2024-12-06 01:52:01,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-12-06 01:52:01,229 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:52:01,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:52:01,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:52:01,608 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 190 proven. 36 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 01:52:02,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:52:02,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2301 states to 1962 states and 2301 transitions. [2024-12-06 01:52:02,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2301 transitions. [2024-12-06 01:52:02,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-12-06 01:52:02,801 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:52:02,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:52:02,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:52:03,095 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 01:52:03,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:52:03,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2316 states to 1976 states and 2316 transitions. [2024-12-06 01:52:03,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 2316 transitions. [2024-12-06 01:52:03,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-12-06 01:52:03,653 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:52:03,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:52:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:52:03,920 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 01:52:05,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:52:05,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 2017 states and 2364 transitions. [2024-12-06 01:52:05,097 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 2364 transitions. [2024-12-06 01:52:05,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-12-06 01:52:05,098 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:52:05,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:52:05,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:52:05,542 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 199 proven. 49 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 01:52:07,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:52:07,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2419 states to 2056 states and 2419 transitions. [2024-12-06 01:52:07,946 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2419 transitions. [2024-12-06 01:52:07,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-06 01:52:07,948 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:52:07,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:52:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:52:08,253 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 01:52:08,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:52:08,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2070 states and 2434 transitions. [2024-12-06 01:52:08,783 INFO L276 IsEmpty]: Start isEmpty. Operand 2070 states and 2434 transitions. [2024-12-06 01:52:08,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-12-06 01:52:08,784 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:52:08,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:52:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:52:08,924 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-12-06 01:52:10,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:52:10,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2082 states and 2450 transitions. [2024-12-06 01:52:10,230 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 2450 transitions. [2024-12-06 01:52:10,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-12-06 01:52:10,231 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:52:10,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:52:10,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:52:10,370 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-12-06 01:52:10,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:52:10,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2452 states to 2084 states and 2452 transitions. [2024-12-06 01:52:10,809 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 2452 transitions. [2024-12-06 01:52:10,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-06 01:52:10,810 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:52:10,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:52:10,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:52:11,084 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-12-06 01:52:11,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:52:11,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2465 states to 2096 states and 2465 transitions. [2024-12-06 01:52:11,638 INFO L276 IsEmpty]: Start isEmpty. Operand 2096 states and 2465 transitions. [2024-12-06 01:52:11,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-06 01:52:11,640 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:52:11,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:52:11,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:52:12,111 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 01:52:17,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:52:17,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2560 states to 2173 states and 2560 transitions. [2024-12-06 01:52:17,429 INFO L276 IsEmpty]: Start isEmpty. Operand 2173 states and 2560 transitions. [2024-12-06 01:52:17,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-12-06 01:52:17,430 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:52:17,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:52:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:52:17,622 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 01:52:18,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:52:18,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2578 states to 2190 states and 2578 transitions. [2024-12-06 01:52:18,971 INFO L276 IsEmpty]: Start isEmpty. Operand 2190 states and 2578 transitions. [2024-12-06 01:52:18,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-12-06 01:52:18,972 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:52:18,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:52:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:52:19,295 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 01:52:19,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:52:19,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2587 states to 2199 states and 2587 transitions. [2024-12-06 01:52:19,447 INFO L276 IsEmpty]: Start isEmpty. Operand 2199 states and 2587 transitions. [2024-12-06 01:52:19,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-12-06 01:52:19,449 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:52:19,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:52:19,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:52:19,733 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 173 proven. 104 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-12-06 01:52:20,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:52:20,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2613 states to 2223 states and 2613 transitions. [2024-12-06 01:52:20,363 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 2613 transitions. [2024-12-06 01:52:20,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-12-06 01:52:20,364 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:52:20,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:52:20,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:52:20,797 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 01:52:23,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:52:23,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2669 states to 2265 states and 2669 transitions. [2024-12-06 01:52:23,190 INFO L276 IsEmpty]: Start isEmpty. Operand 2265 states and 2669 transitions. [2024-12-06 01:52:23,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-12-06 01:52:23,191 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:52:23,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:52:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:52:23,504 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 01:52:24,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:52:24,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2269 states and 2673 transitions. [2024-12-06 01:52:24,041 INFO L276 IsEmpty]: Start isEmpty. Operand 2269 states and 2673 transitions. [2024-12-06 01:52:24,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-12-06 01:52:24,043 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:52:24,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:52:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:52:24,283 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 207 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 01:52:26,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:52:26,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2694 states to 2284 states and 2694 transitions. [2024-12-06 01:52:26,930 INFO L276 IsEmpty]: Start isEmpty. Operand 2284 states and 2694 transitions. [2024-12-06 01:52:26,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-12-06 01:52:26,932 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:52:26,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:52:26,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:52:27,179 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 207 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 01:52:28,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:52:28,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2703 states to 2289 states and 2703 transitions. [2024-12-06 01:52:28,201 INFO L276 IsEmpty]: Start isEmpty. Operand 2289 states and 2703 transitions. [2024-12-06 01:52:28,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-12-06 01:52:28,203 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:52:28,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:52:28,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:52:28,500 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 01:52:29,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:52:29,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2709 states to 2292 states and 2709 transitions. [2024-12-06 01:52:29,149 INFO L276 IsEmpty]: Start isEmpty. Operand 2292 states and 2709 transitions. [2024-12-06 01:52:29,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 01:52:29,150 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:52:29,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:52:29,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:52:29,396 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 228 proven. 38 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-12-06 01:52:30,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:52:30,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2722 states to 2303 states and 2722 transitions. [2024-12-06 01:52:30,523 INFO L276 IsEmpty]: Start isEmpty. Operand 2303 states and 2722 transitions. [2024-12-06 01:52:30,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 01:52:30,524 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:52:30,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:52:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:52:31,098 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 01:52:35,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:52:35,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2770 states to 2344 states and 2770 transitions. [2024-12-06 01:52:35,100 INFO L276 IsEmpty]: Start isEmpty. Operand 2344 states and 2770 transitions. [2024-12-06 01:52:35,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 01:52:35,102 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:52:35,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:52:35,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:52:35,468 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 01:52:38,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:52:38,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2800 states to 2373 states and 2800 transitions. [2024-12-06 01:52:38,247 INFO L276 IsEmpty]: Start isEmpty. Operand 2373 states and 2800 transitions. [2024-12-06 01:52:38,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 01:52:38,248 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:52:38,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:52:38,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:52:38,617 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 01:52:39,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:52:39,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2802 states to 2376 states and 2802 transitions. [2024-12-06 01:52:39,417 INFO L276 IsEmpty]: Start isEmpty. Operand 2376 states and 2802 transitions. [2024-12-06 01:52:39,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 01:52:39,418 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:52:39,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:52:39,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:52:39,738 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 01:52:43,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:52:43,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2850 states to 2423 states and 2850 transitions. [2024-12-06 01:52:43,637 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 2850 transitions. [2024-12-06 01:52:43,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 01:52:43,639 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:52:43,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:52:43,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:52:43,777 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-12-06 01:52:44,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:52:44,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2850 states to 2424 states and 2850 transitions. [2024-12-06 01:52:44,332 INFO L276 IsEmpty]: Start isEmpty. Operand 2424 states and 2850 transitions. [2024-12-06 01:52:44,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 01:52:44,333 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:52:44,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:52:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:52:44,547 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-12-06 01:52:45,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:52:45,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2850 states to 2425 states and 2850 transitions. [2024-12-06 01:52:45,235 INFO L276 IsEmpty]: Start isEmpty. Operand 2425 states and 2850 transitions. [2024-12-06 01:52:45,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-12-06 01:52:45,239 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:52:45,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:52:45,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:52:45,401 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-12-06 01:52:45,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:52:45,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2851 states to 2426 states and 2851 transitions. [2024-12-06 01:52:45,799 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 2851 transitions. [2024-12-06 01:52:45,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-12-06 01:52:45,801 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:52:45,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:52:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:52:46,124 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 01:52:46,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:52:46,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2858 states to 2433 states and 2858 transitions. [2024-12-06 01:52:46,279 INFO L276 IsEmpty]: Start isEmpty. Operand 2433 states and 2858 transitions. [2024-12-06 01:52:46,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-12-06 01:52:46,280 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:52:46,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:52:46,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:52:46,795 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 224 proven. 65 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-12-06 01:52:48,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:52:48,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2456 states and 2889 transitions. [2024-12-06 01:52:48,987 INFO L276 IsEmpty]: Start isEmpty. Operand 2456 states and 2889 transitions. [2024-12-06 01:52:48,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-12-06 01:52:48,988 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:52:48,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:52:49,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:52:49,275 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 01:52:51,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:52:51,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2487 states and 2922 transitions. [2024-12-06 01:52:51,973 INFO L276 IsEmpty]: Start isEmpty. Operand 2487 states and 2922 transitions. [2024-12-06 01:52:51,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-06 01:52:51,974 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:52:51,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:52:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:52:52,269 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 01:52:52,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:52:52,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2926 states to 2490 states and 2926 transitions. [2024-12-06 01:52:52,427 INFO L276 IsEmpty]: Start isEmpty. Operand 2490 states and 2926 transitions. [2024-12-06 01:52:52,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-06 01:52:52,429 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:52:52,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:52:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:52:52,697 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 228 proven. 65 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-12-06 01:52:54,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:52:54,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2943 states to 2501 states and 2943 transitions. [2024-12-06 01:52:54,379 INFO L276 IsEmpty]: Start isEmpty. Operand 2501 states and 2943 transitions. [2024-12-06 01:52:54,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-06 01:52:54,380 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:52:54,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:52:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:52:54,651 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 228 proven. 65 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-12-06 01:52:55,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:52:55,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2944 states to 2502 states and 2944 transitions. [2024-12-06 01:52:55,225 INFO L276 IsEmpty]: Start isEmpty. Operand 2502 states and 2944 transitions. [2024-12-06 01:52:55,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-06 01:52:55,226 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:52:55,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:52:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:52:55,491 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 228 proven. 65 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-12-06 01:52:56,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:52:56,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2944 states to 2503 states and 2944 transitions. [2024-12-06 01:52:56,168 INFO L276 IsEmpty]: Start isEmpty. Operand 2503 states and 2944 transitions. [2024-12-06 01:52:56,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-06 01:52:56,169 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:52:56,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:52:56,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:52:56,437 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 228 proven. 65 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-12-06 01:52:57,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:52:57,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2946 states to 2504 states and 2946 transitions. [2024-12-06 01:52:57,056 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 2946 transitions. [2024-12-06 01:52:57,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-12-06 01:52:57,057 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:52:57,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:52:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:52:57,499 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 01:53:03,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:53:03,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 2629 states and 3098 transitions. [2024-12-06 01:53:03,177 INFO L276 IsEmpty]: Start isEmpty. Operand 2629 states and 3098 transitions. [2024-12-06 01:53:03,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-12-06 01:53:03,178 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:53:03,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:53:03,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:53:03,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 01:53:06,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:53:06,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3167 states to 2690 states and 3167 transitions. [2024-12-06 01:53:06,137 INFO L276 IsEmpty]: Start isEmpty. Operand 2690 states and 3167 transitions. [2024-12-06 01:53:06,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-12-06 01:53:06,139 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:53:06,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:53:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:53:06,451 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 01:53:06,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:53:06,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3173 states to 2695 states and 3173 transitions. [2024-12-06 01:53:06,853 INFO L276 IsEmpty]: Start isEmpty. Operand 2695 states and 3173 transitions. [2024-12-06 01:53:06,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-12-06 01:53:06,854 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:53:06,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:53:06,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:53:07,058 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 134 proven. 180 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-12-06 01:53:07,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:53:07,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3173 states to 2696 states and 3173 transitions. [2024-12-06 01:53:07,140 INFO L276 IsEmpty]: Start isEmpty. Operand 2696 states and 3173 transitions. [2024-12-06 01:53:07,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-12-06 01:53:07,142 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 01:53:07,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 01:53:07,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 01:53:07,621 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 01:53:10,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 01:53:10,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3221 states to 2748 states and 3221 transitions. [2024-12-06 01:53:10,138 INFO L276 IsEmpty]: Start isEmpty. Operand 2748 states and 3221 transitions. [2024-12-06 01:53:10,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-06 01:53:10,139 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 99 iterations. [2024-12-06 01:53:10,146 INFO L726 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-12-06 01:53:42,207 INFO L77 FloydHoareUtils]: At program point L102(lines 102 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-12-06 01:53:42,208 INFO L77 FloydHoareUtils]: At program point L598(line 598) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 01:53:42,208 INFO L77 FloydHoareUtils]: At program point L334(lines 334 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 01:53:42,208 INFO L77 FloydHoareUtils]: At program point L302(lines 302 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 01:53:42,208 INFO L77 FloydHoareUtils]: At program point L170(lines 170 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-12-06 01:53:42,209 INFO L77 FloydHoareUtils]: At program point L204(lines 204 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-12-06 01:53:42,209 INFO L77 FloydHoareUtils]: At program point L72(lines 72 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse1 (not .cse8)) (.cse2 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse5 (= ~a16~0 4)) (.cse3 (not .cse7)) (.cse0 (not (= ~a7~0 1)))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse8 .cse4) (and .cse0 (not (and .cse2 (= ~a16~0 6) .cse4))) (and .cse2 .cse9 .cse6 .cse3) (and .cse2 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse1 .cse2 .cse6 .cse3 .cse4) (and .cse1 .cse0) (and .cse1 .cse2 .cse9 .cse3 .cse5) (and .cse3 .cse0)))) [2024-12-06 01:53:42,209 INFO L77 FloydHoareUtils]: At program point L271(lines 271 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 01:53:42,209 INFO L77 FloydHoareUtils]: At program point L139(lines 139 400) the Hoare annotation is: (let ((.cse5 (= ~a7~0 1)) (.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse8 (= 5 ~a16~0)) (.cse2 (not .cse10)) (.cse11 (= 14 ~a8~0)) (.cse4 (not .cse9)) (.cse7 (= ~a16~0 4)) (.cse3 (= ~a12~0 8)) (.cse0 (not .cse5)) (.cse6 (= ~a8~0 15))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (not (= ~a21~0 1)) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse3 .cse8 .cse9 .cse10 .cse6) (and .cse3 .cse11 .cse8 .cse4) (and .cse3 (= ~a8~0 13) .cse9 .cse10 .cse7) (and .cse2 .cse3 .cse8 .cse4 .cse6) (and .cse0 (not .cse7)) (and .cse2 .cse3 .cse11 .cse4 .cse7) (and .cse0 (not .cse3)) (and .cse0 (not (and .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))))))) [2024-12-06 01:53:42,209 INFO L77 FloydHoareUtils]: At program point L371(lines 371 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 01:53:42,210 INFO L77 FloydHoareUtils]: At program point L107(lines 107 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-12-06 01:53:42,210 INFO L77 FloydHoareUtils]: At program point L41(lines 41 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 01:53:42,210 INFO L77 FloydHoareUtils]: At program point L339(lines 339 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 01:53:42,210 INFO L77 FloydHoareUtils]: At program point L207(lines 207 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-12-06 01:53:42,211 INFO L77 FloydHoareUtils]: At program point L75(lines 75 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse1 (not .cse8)) (.cse2 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse5 (= ~a16~0 4)) (.cse3 (not .cse7)) (.cse0 (not (= ~a7~0 1)))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse8 .cse4) (and .cse0 (not (and .cse2 (= ~a16~0 6) .cse4))) (and .cse2 .cse9 .cse6 .cse3) (and .cse2 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse1 .cse2 .cse6 .cse3 .cse4) (and .cse1 .cse0) (and .cse1 .cse2 .cse9 .cse3 .cse5) (and .cse3 .cse0)))) [2024-12-06 01:53:42,211 INFO L77 FloydHoareUtils]: At program point L373(lines 373 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 01:53:42,211 INFO L77 FloydHoareUtils]: At program point L241(lines 241 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 01:53:42,211 INFO L77 FloydHoareUtils]: At program point L175(lines 175 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-12-06 01:53:42,211 INFO L77 FloydHoareUtils]: At program point L275(lines 275 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 01:53:42,211 INFO L77 FloydHoareUtils]: At program point L375(lines 375 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 01:53:42,212 INFO L77 FloydHoareUtils]: At program point L309(lines 309 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 01:53:42,212 INFO L77 FloydHoareUtils]: At program point L45(lines 45 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 01:53:42,212 INFO L77 FloydHoareUtils]: At program point L343(lines 343 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 01:53:42,212 INFO L77 FloydHoareUtils]: At program point L112(lines 112 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-12-06 01:53:42,213 INFO L77 FloydHoareUtils]: At program point L278(lines 278 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 01:53:42,213 INFO L77 FloydHoareUtils]: At program point L146(lines 146 400) the Hoare annotation is: (let ((.cse5 (= ~a7~0 1)) (.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse8 (= 5 ~a16~0)) (.cse2 (not .cse10)) (.cse11 (= 14 ~a8~0)) (.cse4 (not .cse9)) (.cse7 (= ~a16~0 4)) (.cse3 (= ~a12~0 8)) (.cse0 (not .cse5)) (.cse6 (= ~a8~0 15))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (not (= ~a21~0 1)) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse3 .cse8 .cse9 .cse10 .cse6) (and .cse3 .cse11 .cse8 .cse4) (and .cse3 (= ~a8~0 13) .cse9 .cse10 .cse7) (and .cse2 .cse3 .cse8 .cse4 .cse6) (and .cse0 (not .cse7)) (and .cse2 .cse3 .cse11 .cse4 .cse7) (and .cse0 (not .cse3)) (and .cse0 (not (and .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))))))) [2024-12-06 01:53:42,213 INFO L77 FloydHoareUtils]: At program point L213(lines 213 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-12-06 01:53:42,213 INFO L77 FloydHoareUtils]: At program point L82(lines 82 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse1 (not .cse8)) (.cse2 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse5 (= ~a16~0 4)) (.cse3 (not .cse7)) (.cse0 (not (= ~a7~0 1)))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse8 .cse4) (and .cse0 (not (and .cse2 (= ~a16~0 6) .cse4))) (and .cse2 .cse9 .cse6 .cse3) (and .cse2 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse1 .cse2 .cse6 .cse3 .cse4) (and .cse1 .cse0) (and .cse1 .cse2 .cse9 .cse3 .cse5) (and .cse3 .cse0)))) [2024-12-06 01:53:42,213 INFO L77 FloydHoareUtils]: At program point L512-1(lines 40 585) the Hoare annotation is: (not (and (= ~a21~0 1) (= ~a7~0 1))) [2024-12-06 01:53:42,213 INFO L77 FloydHoareUtils]: At program point L347(lines 347 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 01:53:42,214 INFO L77 FloydHoareUtils]: At program point L248(lines 248 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 01:53:42,214 INFO L77 FloydHoareUtils]: At program point L183(lines 183 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-12-06 01:53:42,214 INFO L77 FloydHoareUtils]: At program point L150(lines 150 400) the Hoare annotation is: (let ((.cse5 (= ~a7~0 1)) (.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse8 (= 5 ~a16~0)) (.cse2 (not .cse10)) (.cse11 (= 14 ~a8~0)) (.cse4 (not .cse9)) (.cse7 (= ~a16~0 4)) (.cse3 (= ~a12~0 8)) (.cse0 (not .cse5)) (.cse6 (= ~a8~0 15))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (not (= ~a21~0 1)) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse3 .cse8 .cse9 .cse10 .cse6) (and .cse3 .cse11 .cse8 .cse4) (and .cse3 (= ~a8~0 13) .cse9 .cse10 .cse7) (and .cse2 .cse3 .cse8 .cse4 .cse6) (and .cse0 (not .cse7)) (and .cse2 .cse3 .cse11 .cse4 .cse7) (and .cse0 (not .cse3)) (and .cse0 (not (and .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))))))) [2024-12-06 01:53:42,214 INFO L77 FloydHoareUtils]: At program point L382(lines 382 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 01:53:42,214 INFO L77 FloydHoareUtils]: At program point L316(lines 316 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 01:53:42,215 INFO L77 FloydHoareUtils]: At program point L283(lines 283 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 01:53:42,215 INFO L77 FloydHoareUtils]: At program point L118(lines 118 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-12-06 01:53:42,215 INFO L77 FloydHoareUtils]: At program point L515-1(lines 40 585) the Hoare annotation is: (not (and (= ~a21~0 1) (= ~a7~0 1))) [2024-12-06 01:53:42,215 INFO L77 FloydHoareUtils]: At program point L218(lines 218 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-12-06 01:53:42,215 INFO L77 FloydHoareUtils]: At program point L53(lines 53 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 01:53:42,215 INFO L75 FloydHoareUtils]: For program point L516(line 516) no Hoare annotation was computed. [2024-12-06 01:53:42,216 INFO L77 FloydHoareUtils]: At program point L154(lines 154 400) the Hoare annotation is: (let ((.cse5 (= ~a7~0 1)) (.cse9 (= ~a17~0 1)) (.cse10 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 0)) (.cse8 (= 5 ~a16~0)) (.cse2 (not .cse10)) (.cse11 (= 14 ~a8~0)) (.cse4 (not .cse9)) (.cse7 (= ~a16~0 4)) (.cse3 (= ~a12~0 8)) (.cse0 (not .cse5)) (.cse6 (= ~a8~0 15))) (or (and .cse0 (not .cse1)) (and .cse1 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (not (= ~a21~0 1)) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse3 .cse8 .cse9 .cse10 .cse6) (and .cse3 .cse11 .cse8 .cse4) (and .cse3 (= ~a8~0 13) .cse9 .cse10 .cse7) (and .cse2 .cse3 .cse8 .cse4 .cse6) (and .cse0 (not .cse7)) (and .cse2 .cse3 .cse11 .cse4 .cse7) (and .cse0 (not .cse3)) (and .cse0 (not (and .cse6 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))))))) [2024-12-06 01:53:42,216 INFO L77 FloydHoareUtils]: At program point L188(lines 188 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-12-06 01:53:42,216 INFO L77 FloydHoareUtils]: At program point L387(lines 387 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 01:53:42,216 INFO L77 FloydHoareUtils]: At program point L288(lines 288 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 01:53:42,216 INFO L77 FloydHoareUtils]: At program point L255(lines 255 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 01:53:42,217 INFO L77 FloydHoareUtils]: At program point L90(lines 90 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse1 (not .cse8)) (.cse2 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse5 (= ~a16~0 4)) (.cse3 (not .cse7)) (.cse0 (not (= ~a7~0 1)))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse8 .cse4) (and .cse0 (not (and .cse2 (= ~a16~0 6) .cse4))) (and .cse2 .cse9 .cse6 .cse3) (and .cse2 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse1 .cse2 .cse6 .cse3 .cse4) (and .cse1 .cse0) (and .cse1 .cse2 .cse9 .cse3 .cse5) (and .cse3 .cse0)))) [2024-12-06 01:53:42,217 INFO L77 FloydHoareUtils]: At program point L355(lines 355 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 01:53:42,217 INFO L77 FloydHoareUtils]: At program point L322(lines 322 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 01:53:42,217 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-12-06 01:53:42,217 INFO L77 FloydHoareUtils]: At program point L124(lines 124 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-12-06 01:53:42,217 INFO L77 FloydHoareUtils]: At program point L587(lines 587 604) the Hoare annotation is: true [2024-12-06 01:53:42,217 INFO L77 FloydHoareUtils]: At program point L224(lines 224 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 01:53:42,218 INFO L77 FloydHoareUtils]: At program point L158(lines 158 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-12-06 01:53:42,218 INFO L77 FloydHoareUtils]: At program point L59(lines 59 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 01:53:42,218 INFO L77 FloydHoareUtils]: At program point L94(lines 94 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-12-06 01:53:42,218 INFO L77 FloydHoareUtils]: At program point L392(lines 392 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 01:53:42,219 INFO L77 FloydHoareUtils]: At program point L326(lines 326 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 01:53:42,219 INFO L77 FloydHoareUtils]: At program point L260(lines 260 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 01:53:42,219 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-12-06 01:53:42,219 INFO L77 FloydHoareUtils]: At program point L228(lines 228 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 01:53:42,219 INFO L77 FloydHoareUtils]: At program point L162(lines 162 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-12-06 01:53:42,219 INFO L77 FloydHoareUtils]: At program point L129(lines 129 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-12-06 01:53:42,220 INFO L77 FloydHoareUtils]: At program point L328(lines 328 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 01:53:42,220 INFO L77 FloydHoareUtils]: At program point L196(lines 196 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-12-06 01:53:42,220 INFO L77 FloydHoareUtils]: At program point L64(lines 64 400) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse1 (not .cse8)) (.cse2 (= ~a12~0 8)) (.cse9 (= 14 ~a8~0)) (.cse5 (= ~a16~0 4)) (.cse3 (not .cse7)) (.cse0 (not (= ~a7~0 1)))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse8 .cse4) (and .cse0 (not (and .cse2 (= ~a16~0 6) .cse4))) (and .cse2 .cse9 .cse6 .cse3) (and .cse2 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse1 .cse2 .cse6 .cse3 .cse4) (and .cse1 .cse0) (and .cse1 .cse2 .cse9 .cse3 .cse5) (and .cse3 .cse0)))) [2024-12-06 01:53:42,220 INFO L77 FloydHoareUtils]: At program point L593-2(lines 593 603) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 01:53:42,220 INFO L77 FloydHoareUtils]: At program point L296(lines 296 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 01:53:42,221 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 40 585) the Hoare annotation is: (not (let ((.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse3 (= ~a8~0 15)) (.cse0 (not .cse8)) (.cse6 (= 14 ~a8~0)) (.cse5 (= 5 ~a16~0)) (.cse2 (not .cse7)) (.cse1 (= ~a12~0 8)) (.cse4 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse0 .cse1 .cse5 .cse2 .cse3)) (not (and .cse0 .cse1 .cse6 .cse2 .cse4)) (not (and .cse1 .cse6 .cse5 .cse2)) (= ~a21~0 1) (not (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse4)) (= ~a7~0 1))))) [2024-12-06 01:53:42,221 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 516) no Hoare annotation was computed. [2024-12-06 01:53:42,221 INFO L77 FloydHoareUtils]: At program point L363(lines 363 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 01:53:42,221 INFO L77 FloydHoareUtils]: At program point L199(lines 199 400) the Hoare annotation is: (let ((.cse8 (= ~a17~0 1)) (.cse9 (= ~a20~0 1)) (.cse4 (= ~a7~0 1))) (let ((.cse7 (= 5 ~a16~0)) (.cse5 (= ~a8~0 15)) (.cse0 (not .cse4)) (.cse1 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse3 (not .cse8)) (.cse6 (= ~a16~0 4))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse0) (not (= ~a21~0 1)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse2 .cse10 .cse7 .cse3) (and .cse2 (= ~a8~0 13) .cse8 .cse9 .cse6) (and .cse1 .cse2 .cse7 .cse3 .cse5) (and (not (and .cse2 .cse5 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse0) (and .cse0 (not .cse6)) (and .cse1 .cse2 .cse10 .cse3 .cse6)))) [2024-12-06 01:53:42,221 INFO L77 FloydHoareUtils]: At program point L365(lines 365 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 01:53:42,222 INFO L77 FloydHoareUtils]: At program point L266(lines 266 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 01:53:42,222 INFO L77 FloydHoareUtils]: At program point L233(lines 233 400) the Hoare annotation is: (not (let ((.cse2 (= ~a17~0 1)) (.cse3 (= ~a20~0 1))) (let ((.cse4 (= ~a8~0 15)) (.cse5 (not .cse3)) (.cse8 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse6 (not .cse2)) (.cse0 (= ~a12~0 8)) (.cse7 (= ~a16~0 4))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (and .cse5 .cse0 .cse6 .cse4 .cse7)) (not (and .cse5 .cse0 .cse1 .cse6 .cse4)) (not (and .cse5 .cse0 .cse8 .cse6 .cse7)) (not (and .cse0 .cse8 .cse1 .cse6)) (= ~a21~0 1) (not (and .cse0 (= ~a8~0 13) .cse2 .cse3 .cse7)) (= ~a7~0 1))))) [2024-12-06 01:53:42,222 INFO L77 FloydHoareUtils]: At program point L134(lines 134 400) the Hoare annotation is: (let ((.cse3 (= ~a7~0 1)) (.cse7 (= ~a17~0 1)) (.cse8 (= ~a20~0 1))) (let ((.cse6 (= 5 ~a16~0)) (.cse4 (= ~a8~0 15)) (.cse12 (= ~a7~0 0)) (.cse11 (= ~a20~0 ~a7~0)) (.cse0 (not .cse8)) (.cse10 (= 14 ~a8~0)) (.cse2 (not .cse7)) (.cse5 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse9 (not .cse3))) (or (not (= ~a21~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse6 .cse7 .cse8 .cse4) (and .cse9 (<= ~a16~0 5) (not .cse5)) (and (not (and (= ~a16~0 6) .cse8 .cse4)) .cse9 .cse7) (and .cse1 .cse10 .cse6 .cse2) (and .cse9 (not .cse11) (< ~a16~0 5)) (and .cse12 (not (= |ULTIMATE.start_calculate_output_~input#1| 4)) .cse5) (and .cse1 (= ~a8~0 13) .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse6 .cse2 .cse4) (and .cse9 (not (and .cse4 (= ~a17~0 ~a7~0))) .cse5) (and .cse9 (not .cse12) .cse11) (and .cse2 .cse9 (< 5 ~a16~0)) (and .cse0 .cse1 .cse10 .cse2 .cse5) (and .cse9 (not .cse1)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 6)) .cse9 .cse8)))) [2024-12-06 01:53:42,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 01:53:42 ImpRootNode [2024-12-06 01:53:42,237 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 01:53:42,237 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 01:53:42,237 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 01:53:42,237 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 01:53:42,238 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 01:50:54" (3/4) ... [2024-12-06 01:53:42,240 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-06 01:53:42,252 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 119 nodes and edges [2024-12-06 01:53:42,253 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-12-06 01:53:42,254 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-12-06 01:53:42,254 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-12-06 01:53:42,366 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fab637df-2934-4fec-9f0a-03ebf91c4e73/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 01:53:42,366 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fab637df-2934-4fec-9f0a-03ebf91c4e73/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 01:53:42,366 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 01:53:42,367 INFO L158 Benchmark]: Toolchain (without parser) took 169546.87ms. Allocated memory was 117.4MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 90.2MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 267.5MB. Max. memory is 16.1GB. [2024-12-06 01:53:42,367 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 117.4MB. Free memory is still 72.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 01:53:42,367 INFO L158 Benchmark]: CACSL2BoogieTranslator took 451.86ms. Allocated memory is still 117.4MB. Free memory was 90.2MB in the beginning and 63.3MB in the end (delta: 26.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-06 01:53:42,368 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.80ms. Allocated memory is still 117.4MB. Free memory was 63.3MB in the beginning and 57.8MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 01:53:42,368 INFO L158 Benchmark]: Boogie Preprocessor took 47.32ms. Allocated memory is still 117.4MB. Free memory was 57.8MB in the beginning and 53.7MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 01:53:42,368 INFO L158 Benchmark]: RCFGBuilder took 1175.71ms. Allocated memory is still 117.4MB. Free memory was 53.7MB in the beginning and 31.2MB in the end (delta: 22.5MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. [2024-12-06 01:53:42,369 INFO L158 Benchmark]: CodeCheck took 167687.25ms. Allocated memory was 117.4MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 31.2MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 198.2MB. Max. memory is 16.1GB. [2024-12-06 01:53:42,369 INFO L158 Benchmark]: Witness Printer took 128.94ms. Allocated memory is still 1.7GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 01:53:42,371 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: 135.6s, OverallIterations: 99, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 305103 SdHoareTripleChecker+Valid, 689.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 304228 mSDsluCounter, 40207 SdHoareTripleChecker+Invalid, 593.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 34127 mSDsCounter, 65260 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 662145 IncrementalHoareTripleChecker+Invalid, 727405 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65260 mSolverCounterUnsat, 6080 mSDtfsCounter, 662145 mSolverCounterSat, 4.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 134965 GetRequests, 126673 SyntacticMatches, 7314 SemanticMatches, 978 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 643430 ImplicationChecksByTransitivity, 91.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.5s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 24.4s InterpolantComputationTime, 20057 NumberOfCodeBlocks, 20057 NumberOfCodeBlocksAsserted, 98 NumberOfCheckSat, 19959 ConstructedInterpolants, 0 QuantifiedInterpolants, 164905 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 98 InterpolantComputations, 21 PerfectInterpolantSequences, 18203/23675 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: 516]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 40]: Location Invariant Derived location invariant: !((((((!(((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a8 == 15)) && (a16 == 4)) && !(((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a8 == 15))) && !(((((a20 != 1) && (a12 == 8)) && (14 == a8)) && (a17 != 1)) && (a16 == 4))) && !((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a17 != 1))) && (a21 == 1)) && !(((((a12 == 8) && (a8 == 13)) && (a17 == 1)) && (a20 == 1)) && (a16 == 4))) && (a7 == 1)) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: !(((((((!(((((a12 == 8) && (5 == a16)) && (a17 == 1)) && (a20 == 1)) && (a8 == 15)) && !(((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a8 == 15)) && (a16 == 4))) && !(((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a8 == 15))) && !(((((a20 != 1) && (a12 == 8)) && (14 == a8)) && (a17 != 1)) && (a16 == 4))) && !((((a12 == 8) && (14 == a8)) && (5 == a16)) && (a17 != 1))) && (a21 == 1)) && !(((((a12 == 8) && (a8 == 13)) && (a17 == 1)) && (a20 == 1)) && (a16 == 4))) && (a7 == 1)) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 117.4MB. Free memory is still 72.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 451.86ms. Allocated memory is still 117.4MB. Free memory was 90.2MB in the beginning and 63.3MB in the end (delta: 26.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.80ms. Allocated memory is still 117.4MB. Free memory was 63.3MB in the beginning and 57.8MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.32ms. Allocated memory is still 117.4MB. Free memory was 57.8MB in the beginning and 53.7MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1175.71ms. Allocated memory is still 117.4MB. Free memory was 53.7MB in the beginning and 31.2MB in the end (delta: 22.5MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. * CodeCheck took 167687.25ms. Allocated memory was 117.4MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 31.2MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 198.2MB. Max. memory is 16.1GB. * Witness Printer took 128.94ms. Allocated memory is still 1.7GB. Free memory was 1.5GB in the beginning and 1.5GB 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 01:53:42,389 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fab637df-2934-4fec-9f0a-03ebf91c4e73/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