./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label36.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_cf3846b1-99a4-47b4-8cc1-49ebb59c856d/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3846b1-99a4-47b4-8cc1-49ebb59c856d/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_cf3846b1-99a4-47b4-8cc1-49ebb59c856d/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3846b1-99a4-47b4-8cc1-49ebb59c856d/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label36.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3846b1-99a4-47b4-8cc1-49ebb59c856d/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_cf3846b1-99a4-47b4-8cc1-49ebb59c856d/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 16921798414ec528dd37161230657dad4883a0777e5a6c6f07453756efda755c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-06 03:02:10,044 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-06 03:02:10,097 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3846b1-99a4-47b4-8cc1-49ebb59c856d/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-06 03:02:10,101 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-06 03:02:10,102 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-06 03:02:10,120 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-06 03:02:10,121 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-06 03:02:10,121 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-06 03:02:10,122 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-06 03:02:10,122 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-06 03:02:10,122 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-06 03:02:10,122 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-06 03:02:10,122 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-06 03:02:10,122 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-06 03:02:10,122 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-06 03:02:10,122 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-06 03:02:10,122 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-06 03:02:10,122 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-06 03:02:10,123 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-06 03:02:10,123 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-06 03:02:10,123 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-06 03:02:10,123 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-06 03:02:10,123 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-06 03:02:10,123 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-06 03:02:10,123 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-06 03:02:10,123 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-06 03:02:10,123 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-06 03:02:10,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 03:02:10,124 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-06 03:02:10,124 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-06 03:02:10,124 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-06 03:02:10,124 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-06 03:02:10,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-06 03:02:10,124 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_cf3846b1-99a4-47b4-8cc1-49ebb59c856d/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 -> 16921798414ec528dd37161230657dad4883a0777e5a6c6f07453756efda755c [2024-12-06 03:02:10,351 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-06 03:02:10,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-06 03:02:10,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-06 03:02:10,363 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-06 03:02:10,363 INFO L274 PluginConnector]: CDTParser initialized [2024-12-06 03:02:10,365 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3846b1-99a4-47b4-8cc1-49ebb59c856d/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/eca-rers2012/Problem02_label36.c [2024-12-06 03:02:13,037 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3846b1-99a4-47b4-8cc1-49ebb59c856d/bin/ukojak-verify-CZk0znPC7b/data/555320347/914cc6fc709e43c88eea01beb8764825/FLAG5db45e335 [2024-12-06 03:02:13,273 INFO L384 CDTParser]: Found 1 translation units. [2024-12-06 03:02:13,274 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3846b1-99a4-47b4-8cc1-49ebb59c856d/sv-benchmarks/c/eca-rers2012/Problem02_label36.c [2024-12-06 03:02:13,286 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3846b1-99a4-47b4-8cc1-49ebb59c856d/bin/ukojak-verify-CZk0znPC7b/data/555320347/914cc6fc709e43c88eea01beb8764825/FLAG5db45e335 [2024-12-06 03:02:13,299 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3846b1-99a4-47b4-8cc1-49ebb59c856d/bin/ukojak-verify-CZk0znPC7b/data/555320347/914cc6fc709e43c88eea01beb8764825 [2024-12-06 03:02:13,301 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-06 03:02:13,302 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-06 03:02:13,303 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-06 03:02:13,303 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-06 03:02:13,307 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-06 03:02:13,307 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 03:02:13" (1/1) ... [2024-12-06 03:02:13,308 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27b4aea1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:02:13, skipping insertion in model container [2024-12-06 03:02:13,309 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 03:02:13" (1/1) ... [2024-12-06 03:02:13,337 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-06 03:02:13,569 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_cf3846b1-99a4-47b4-8cc1-49ebb59c856d/sv-benchmarks/c/eca-rers2012/Problem02_label36.c[20425,20438] [2024-12-06 03:02:13,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 03:02:13,593 INFO L200 MainTranslator]: Completed pre-run [2024-12-06 03:02:13,678 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_cf3846b1-99a4-47b4-8cc1-49ebb59c856d/sv-benchmarks/c/eca-rers2012/Problem02_label36.c[20425,20438] [2024-12-06 03:02:13,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-06 03:02:13,695 INFO L204 MainTranslator]: Completed translation [2024-12-06 03:02:13,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:02:13 WrapperNode [2024-12-06 03:02:13,696 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-06 03:02:13,696 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-06 03:02:13,697 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-06 03:02:13,697 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-06 03:02:13,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:02:13" (1/1) ... [2024-12-06 03:02:13,713 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:02:13" (1/1) ... [2024-12-06 03:02:13,752 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2024-12-06 03:02:13,752 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-06 03:02:13,753 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-06 03:02:13,753 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-06 03:02:13,753 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-06 03:02:13,760 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:02:13" (1/1) ... [2024-12-06 03:02:13,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:02:13" (1/1) ... [2024-12-06 03:02:13,764 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:02:13" (1/1) ... [2024-12-06 03:02:13,764 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:02:13" (1/1) ... [2024-12-06 03:02:13,780 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:02:13" (1/1) ... [2024-12-06 03:02:13,782 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:02:13" (1/1) ... [2024-12-06 03:02:13,789 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:02:13" (1/1) ... [2024-12-06 03:02:13,792 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:02:13" (1/1) ... [2024-12-06 03:02:13,795 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:02:13" (1/1) ... [2024-12-06 03:02:13,800 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-06 03:02:13,801 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-06 03:02:13,801 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-06 03:02:13,801 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-06 03:02:13,802 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 03:02:13" (1/1) ... [2024-12-06 03:02:13,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-06 03:02:13,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3846b1-99a4-47b4-8cc1-49ebb59c856d/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-06 03:02:13,829 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3846b1-99a4-47b4-8cc1-49ebb59c856d/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-06 03:02:13,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3846b1-99a4-47b4-8cc1-49ebb59c856d/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-06 03:02:13,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-06 03:02:13,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-06 03:02:13,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-06 03:02:13,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-06 03:02:13,906 INFO L234 CfgBuilder]: Building ICFG [2024-12-06 03:02:13,908 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-06 03:02:14,793 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-12-06 03:02:14,793 INFO L283 CfgBuilder]: Performing block encoding [2024-12-06 03:02:15,101 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-06 03:02:15,101 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-06 03:02:15,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 03:02:15 BoogieIcfgContainer [2024-12-06 03:02:15,102 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-06 03:02:15,103 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-06 03:02:15,103 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-06 03:02:15,113 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-06 03:02:15,113 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 03:02:15" (1/1) ... [2024-12-06 03:02:15,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-06 03:02:15,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:15,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 85 states and 162 transitions. [2024-12-06 03:02:15,176 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 162 transitions. [2024-12-06 03:02:15,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-12-06 03:02:15,180 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:15,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:15,576 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 03:02:16,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:16,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 163 states and 240 transitions. [2024-12-06 03:02:16,111 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 240 transitions. [2024-12-06 03:02:16,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-12-06 03:02:16,113 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:16,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:16,412 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 03:02:16,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:16,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 166 states and 245 transitions. [2024-12-06 03:02:16,487 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 245 transitions. [2024-12-06 03:02:16,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-12-06 03:02:16,488 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:16,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:16,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:16,618 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 03:02:16,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:16,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 167 states and 248 transitions. [2024-12-06 03:02:16,778 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 248 transitions. [2024-12-06 03:02:16,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-12-06 03:02:16,780 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:16,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:16,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:16,923 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:02:17,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:17,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 184 states and 274 transitions. [2024-12-06 03:02:17,121 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 274 transitions. [2024-12-06 03:02:17,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-12-06 03:02:17,123 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:17,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:17,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:17,248 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:02:17,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:17,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 202 states and 296 transitions. [2024-12-06 03:02:17,550 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 296 transitions. [2024-12-06 03:02:17,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-12-06 03:02:17,553 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:17,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:17,654 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:02:18,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:18,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 220 states and 323 transitions. [2024-12-06 03:02:18,200 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 323 transitions. [2024-12-06 03:02:18,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-12-06 03:02:18,201 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:18,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:18,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:18,276 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:02:18,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:18,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 223 states and 327 transitions. [2024-12-06 03:02:18,380 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 327 transitions. [2024-12-06 03:02:18,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-12-06 03:02:18,381 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:18,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:18,486 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 03:02:18,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:18,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 241 states and 348 transitions. [2024-12-06 03:02:18,912 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 348 transitions. [2024-12-06 03:02:18,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-12-06 03:02:18,913 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:18,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:18,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:19,011 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 03:02:19,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:19,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 244 states and 351 transitions. [2024-12-06 03:02:19,153 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 351 transitions. [2024-12-06 03:02:19,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-12-06 03:02:19,163 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:19,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:19,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:19,294 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:02:19,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:19,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 264 states and 375 transitions. [2024-12-06 03:02:19,716 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 375 transitions. [2024-12-06 03:02:19,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-12-06 03:02:19,717 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:19,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:19,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:19,865 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-12-06 03:02:20,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:20,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 268 states and 382 transitions. [2024-12-06 03:02:20,205 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 382 transitions. [2024-12-06 03:02:20,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-12-06 03:02:20,206 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:20,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:20,541 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:02:21,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:21,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 372 states and 496 transitions. [2024-12-06 03:02:21,755 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 496 transitions. [2024-12-06 03:02:21,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-12-06 03:02:21,756 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:21,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:21,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:21,931 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:02:22,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:22,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 388 states and 518 transitions. [2024-12-06 03:02:22,432 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 518 transitions. [2024-12-06 03:02:22,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-12-06 03:02:22,433 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:22,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:22,506 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:02:22,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:22,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 391 states and 521 transitions. [2024-12-06 03:02:22,650 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 521 transitions. [2024-12-06 03:02:22,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-12-06 03:02:22,651 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:22,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:22,742 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:02:23,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:23,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 415 states and 550 transitions. [2024-12-06 03:02:23,398 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 550 transitions. [2024-12-06 03:02:23,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-12-06 03:02:23,399 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:23,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:23,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:23,524 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:02:23,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:23,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 429 states and 563 transitions. [2024-12-06 03:02:23,787 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 563 transitions. [2024-12-06 03:02:23,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-12-06 03:02:23,789 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:23,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:23,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:23,922 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:02:24,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:24,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 454 states and 598 transitions. [2024-12-06 03:02:24,540 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 598 transitions. [2024-12-06 03:02:24,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-12-06 03:02:24,541 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:24,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:24,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:24,590 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:02:24,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:24,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 468 states and 618 transitions. [2024-12-06 03:02:24,874 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 618 transitions. [2024-12-06 03:02:24,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-12-06 03:02:24,875 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:24,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:24,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:24,921 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:02:25,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:25,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 474 states and 626 transitions. [2024-12-06 03:02:25,205 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 626 transitions. [2024-12-06 03:02:25,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-12-06 03:02:25,207 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:25,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:25,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:25,258 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:02:25,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:25,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 475 states and 626 transitions. [2024-12-06 03:02:25,364 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 626 transitions. [2024-12-06 03:02:25,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-12-06 03:02:25,365 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:25,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:25,521 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 33 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:02:26,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:26,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 504 states and 668 transitions. [2024-12-06 03:02:26,446 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 668 transitions. [2024-12-06 03:02:26,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-12-06 03:02:26,447 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:26,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:26,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:26,546 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 33 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:02:26,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:26,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 518 states and 682 transitions. [2024-12-06 03:02:26,793 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 682 transitions. [2024-12-06 03:02:26,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-12-06 03:02:26,794 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:26,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:26,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:26,885 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 33 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:02:27,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:27,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 524 states and 689 transitions. [2024-12-06 03:02:27,192 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 689 transitions. [2024-12-06 03:02:27,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-12-06 03:02:27,193 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:27,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:27,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:27,236 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:02:27,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:27,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 538 states and 706 transitions. [2024-12-06 03:02:27,757 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 706 transitions. [2024-12-06 03:02:27,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-12-06 03:02:27,758 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:27,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:27,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:27,808 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:02:27,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:27,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 544 states and 712 transitions. [2024-12-06 03:02:27,918 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 712 transitions. [2024-12-06 03:02:27,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-12-06 03:02:27,919 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:27,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:27,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:27,960 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:02:28,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:28,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 549 states and 717 transitions. [2024-12-06 03:02:28,146 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 717 transitions. [2024-12-06 03:02:28,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-12-06 03:02:28,147 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:28,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:28,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:28,200 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:02:28,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:28,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 555 states and 723 transitions. [2024-12-06 03:02:28,545 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 723 transitions. [2024-12-06 03:02:28,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-12-06 03:02:28,545 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:28,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:28,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:28,590 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:02:28,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:28,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 563 states and 732 transitions. [2024-12-06 03:02:28,847 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 732 transitions. [2024-12-06 03:02:28,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-12-06 03:02:28,847 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:28,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:28,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:28,890 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:02:29,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:29,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 568 states and 736 transitions. [2024-12-06 03:02:29,070 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 736 transitions. [2024-12-06 03:02:29,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-12-06 03:02:29,070 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:29,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:29,115 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-12-06 03:02:29,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:29,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 597 states and 774 transitions. [2024-12-06 03:02:29,765 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 774 transitions. [2024-12-06 03:02:29,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-12-06 03:02:29,765 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:29,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:29,809 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-12-06 03:02:30,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:30,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 614 states and 791 transitions. [2024-12-06 03:02:30,119 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 791 transitions. [2024-12-06 03:02:30,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-12-06 03:02:30,120 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:30,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:30,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:30,202 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:02:30,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:30,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 636 states and 816 transitions. [2024-12-06 03:02:30,312 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 816 transitions. [2024-12-06 03:02:30,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-12-06 03:02:30,312 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:30,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:30,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:30,359 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 03:02:30,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:30,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 649 states and 833 transitions. [2024-12-06 03:02:30,703 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 833 transitions. [2024-12-06 03:02:30,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-12-06 03:02:30,704 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:30,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:30,751 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 03:02:30,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:30,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 659 states and 843 transitions. [2024-12-06 03:02:30,987 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 843 transitions. [2024-12-06 03:02:30,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-12-06 03:02:30,989 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:30,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:31,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:31,049 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-06 03:02:31,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:31,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 664 states and 847 transitions. [2024-12-06 03:02:31,209 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 847 transitions. [2024-12-06 03:02:31,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-12-06 03:02:31,210 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:31,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:31,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:31,249 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:02:31,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:31,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 670 states and 853 transitions. [2024-12-06 03:02:31,604 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 853 transitions. [2024-12-06 03:02:31,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-12-06 03:02:31,605 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:31,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:31,678 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 03:02:32,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:32,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 701 states and 886 transitions. [2024-12-06 03:02:32,179 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 886 transitions. [2024-12-06 03:02:32,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-12-06 03:02:32,181 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:32,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:32,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:32,257 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-12-06 03:02:32,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:32,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 706 states and 890 transitions. [2024-12-06 03:02:32,482 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 890 transitions. [2024-12-06 03:02:32,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-12-06 03:02:32,483 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:32,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:32,538 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:02:32,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:32,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 715 states and 899 transitions. [2024-12-06 03:02:32,633 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 899 transitions. [2024-12-06 03:02:32,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-12-06 03:02:32,633 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:32,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:32,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:32,746 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:02:34,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:34,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 747 states and 938 transitions. [2024-12-06 03:02:34,091 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 938 transitions. [2024-12-06 03:02:34,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-12-06 03:02:34,092 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:34,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:34,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:34,151 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:02:34,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:34,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 758 states and 950 transitions. [2024-12-06 03:02:34,680 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 950 transitions. [2024-12-06 03:02:34,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-12-06 03:02:34,680 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:34,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:34,727 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-12-06 03:02:34,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:34,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 765 states and 959 transitions. [2024-12-06 03:02:34,863 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 959 transitions. [2024-12-06 03:02:34,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-12-06 03:02:34,864 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:34,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:34,922 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 03:02:34,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:34,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 769 states and 965 transitions. [2024-12-06 03:02:34,974 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 965 transitions. [2024-12-06 03:02:34,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-12-06 03:02:34,975 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:34,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:34,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:35,036 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 03:02:35,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:35,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 770 states and 966 transitions. [2024-12-06 03:02:35,075 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 966 transitions. [2024-12-06 03:02:35,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-12-06 03:02:35,075 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:35,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:35,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:35,145 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:02:35,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:35,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 801 states and 998 transitions. [2024-12-06 03:02:35,295 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 998 transitions. [2024-12-06 03:02:35,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-12-06 03:02:35,296 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:35,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:35,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:35,392 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-12-06 03:02:35,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:35,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 808 states and 1008 transitions. [2024-12-06 03:02:35,649 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1008 transitions. [2024-12-06 03:02:35,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-12-06 03:02:35,650 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:35,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:35,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:35,731 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-12-06 03:02:35,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:35,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 813 states and 1012 transitions. [2024-12-06 03:02:35,994 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1012 transitions. [2024-12-06 03:02:35,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-12-06 03:02:35,995 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:35,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:36,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:36,085 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-12-06 03:02:36,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:36,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 820 states and 1020 transitions. [2024-12-06 03:02:36,377 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1020 transitions. [2024-12-06 03:02:36,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-12-06 03:02:36,378 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:36,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:36,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:36,656 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:02:38,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:38,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 887 states and 1097 transitions. [2024-12-06 03:02:38,267 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1097 transitions. [2024-12-06 03:02:38,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-12-06 03:02:38,268 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:38,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:38,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:38,452 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 03:02:39,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:39,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 912 states and 1128 transitions. [2024-12-06 03:02:39,663 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1128 transitions. [2024-12-06 03:02:39,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-12-06 03:02:39,664 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:39,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:39,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:39,727 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 03:02:40,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:40,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 935 states and 1153 transitions. [2024-12-06 03:02:40,619 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1153 transitions. [2024-12-06 03:02:40,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-12-06 03:02:40,620 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:40,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:40,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:40,685 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 03:02:40,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:40,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 940 states and 1157 transitions. [2024-12-06 03:02:40,995 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1157 transitions. [2024-12-06 03:02:40,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-12-06 03:02:40,995 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:40,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:41,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:41,041 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 03:02:41,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:41,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 945 states and 1161 transitions. [2024-12-06 03:02:41,326 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1161 transitions. [2024-12-06 03:02:41,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-12-06 03:02:41,327 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:41,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:41,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:41,372 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 03:02:41,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:41,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 946 states and 1162 transitions. [2024-12-06 03:02:41,416 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1162 transitions. [2024-12-06 03:02:41,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-12-06 03:02:41,417 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:41,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:41,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:41,796 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 71 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:02:44,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:44,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1013 states and 1239 transitions. [2024-12-06 03:02:44,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1239 transitions. [2024-12-06 03:02:44,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-12-06 03:02:44,665 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:44,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:44,797 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 71 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:02:45,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:45,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1035 states and 1260 transitions. [2024-12-06 03:02:45,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1260 transitions. [2024-12-06 03:02:45,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-12-06 03:02:45,665 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:45,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:45,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:45,794 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 71 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:02:46,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:46,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1040 states and 1264 transitions. [2024-12-06 03:02:46,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1264 transitions. [2024-12-06 03:02:46,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-06 03:02:46,190 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:46,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:46,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:46,452 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 72 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:02:47,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:47,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1045 states and 1270 transitions. [2024-12-06 03:02:47,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1270 transitions. [2024-12-06 03:02:47,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-12-06 03:02:47,371 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:47,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:47,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:47,426 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:02:47,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:47,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1277 states to 1051 states and 1277 transitions. [2024-12-06 03:02:47,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1277 transitions. [2024-12-06 03:02:47,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-12-06 03:02:47,744 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:47,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:47,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:47,976 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 75 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:02:50,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:50,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1113 states and 1349 transitions. [2024-12-06 03:02:50,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1349 transitions. [2024-12-06 03:02:50,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-12-06 03:02:50,461 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:50,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:50,593 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 75 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:02:50,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:50,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1118 states and 1353 transitions. [2024-12-06 03:02:50,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1353 transitions. [2024-12-06 03:02:50,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-12-06 03:02:50,872 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:50,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:50,913 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:02:51,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:51,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1133 states and 1370 transitions. [2024-12-06 03:02:51,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1370 transitions. [2024-12-06 03:02:51,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-12-06 03:02:51,636 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:51,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:51,677 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:02:51,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:51,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1136 states and 1374 transitions. [2024-12-06 03:02:51,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1374 transitions. [2024-12-06 03:02:51,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-12-06 03:02:51,930 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:51,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:51,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:51,971 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:02:52,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:52,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1141 states and 1378 transitions. [2024-12-06 03:02:52,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1378 transitions. [2024-12-06 03:02:52,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-12-06 03:02:52,298 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:52,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:52,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:52,523 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:02:55,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:55,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1177 states and 1417 transitions. [2024-12-06 03:02:55,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1417 transitions. [2024-12-06 03:02:55,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-12-06 03:02:55,128 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:55,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:55,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:55,179 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:02:56,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:56,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1188 states and 1432 transitions. [2024-12-06 03:02:56,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1432 transitions. [2024-12-06 03:02:56,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-12-06 03:02:56,389 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:56,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:56,441 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-12-06 03:02:56,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:56,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1189 states and 1432 transitions. [2024-12-06 03:02:56,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 1432 transitions. [2024-12-06 03:02:56,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-12-06 03:02:56,491 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:56,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:56,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:56,572 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 03:02:57,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:57,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1202 states and 1445 transitions. [2024-12-06 03:02:57,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1445 transitions. [2024-12-06 03:02:57,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-12-06 03:02:57,071 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:57,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:57,125 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 03:02:57,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:57,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1212 states and 1454 transitions. [2024-12-06 03:02:57,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1454 transitions. [2024-12-06 03:02:57,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-12-06 03:02:57,396 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:57,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:57,461 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-12-06 03:02:58,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:58,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 1291 states and 1549 transitions. [2024-12-06 03:02:58,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1549 transitions. [2024-12-06 03:02:58,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-12-06 03:02:58,139 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:58,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:58,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:58,225 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-12-06 03:02:58,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:58,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1292 states and 1551 transitions. [2024-12-06 03:02:58,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1551 transitions. [2024-12-06 03:02:58,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-12-06 03:02:58,654 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:58,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:58,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:58,870 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:02:59,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:59,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1302 states and 1563 transitions. [2024-12-06 03:02:59,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1563 transitions. [2024-12-06 03:02:59,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-12-06 03:02:59,213 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:59,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:59,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:59,257 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-12-06 03:02:59,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:59,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1303 states and 1564 transitions. [2024-12-06 03:02:59,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1303 states and 1564 transitions. [2024-12-06 03:02:59,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-12-06 03:02:59,593 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:59,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:59,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:59,680 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:02:59,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:02:59,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1306 states and 1567 transitions. [2024-12-06 03:02:59,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1567 transitions. [2024-12-06 03:02:59,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-12-06 03:02:59,729 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:02:59,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:02:59,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:02:59,791 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-12-06 03:03:00,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:00,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1329 states and 1593 transitions. [2024-12-06 03:03:00,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1593 transitions. [2024-12-06 03:03:00,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-12-06 03:03:00,509 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:00,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:00,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:00,661 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-12-06 03:03:00,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:00,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1331 states and 1595 transitions. [2024-12-06 03:03:00,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1595 transitions. [2024-12-06 03:03:00,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-12-06 03:03:00,732 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:00,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:00,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:00,810 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:03:03,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:03,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1644 states to 1372 states and 1644 transitions. [2024-12-06 03:03:03,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1644 transitions. [2024-12-06 03:03:03,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-12-06 03:03:03,006 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:03,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:03,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:03,054 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:03:04,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:04,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1407 states and 1684 transitions. [2024-12-06 03:03:04,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1407 states and 1684 transitions. [2024-12-06 03:03:04,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-12-06 03:03:04,877 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:04,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:04,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:04,925 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:03:05,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:05,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1688 states to 1412 states and 1688 transitions. [2024-12-06 03:03:05,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 1688 transitions. [2024-12-06 03:03:05,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-12-06 03:03:05,312 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:05,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:05,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:05,359 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:03:05,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:05,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1413 states and 1693 transitions. [2024-12-06 03:03:05,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 1693 transitions. [2024-12-06 03:03:05,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-12-06 03:03:05,791 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:05,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:05,838 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:03:06,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:06,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1417 states and 1696 transitions. [2024-12-06 03:03:06,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 1696 transitions. [2024-12-06 03:03:06,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-12-06 03:03:06,268 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:06,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:06,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:06,336 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-12-06 03:03:07,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:07,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1428 states and 1718 transitions. [2024-12-06 03:03:07,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1718 transitions. [2024-12-06 03:03:07,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-12-06 03:03:07,803 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:07,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:07,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:07,886 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-12-06 03:03:08,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:08,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1728 states to 1435 states and 1728 transitions. [2024-12-06 03:03:08,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 1728 transitions. [2024-12-06 03:03:08,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-12-06 03:03:08,058 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:08,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:08,120 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-12-06 03:03:08,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:08,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1448 states and 1742 transitions. [2024-12-06 03:03:08,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 1742 transitions. [2024-12-06 03:03:08,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-12-06 03:03:08,944 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:08,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:08,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:09,005 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-12-06 03:03:09,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:09,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1746 states to 1453 states and 1746 transitions. [2024-12-06 03:03:09,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 1746 transitions. [2024-12-06 03:03:09,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-12-06 03:03:09,248 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:09,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:09,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:09,308 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-12-06 03:03:09,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:09,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1463 states and 1756 transitions. [2024-12-06 03:03:09,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 1756 transitions. [2024-12-06 03:03:09,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-12-06 03:03:09,721 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:09,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:09,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:09,823 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-12-06 03:03:10,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:10,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1468 states and 1760 transitions. [2024-12-06 03:03:10,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 1760 transitions. [2024-12-06 03:03:10,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-12-06 03:03:10,118 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:10,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:10,251 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-12-06 03:03:11,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:11,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1498 states and 1793 transitions. [2024-12-06 03:03:11,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 1793 transitions. [2024-12-06 03:03:11,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-12-06 03:03:11,185 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:11,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:11,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:11,317 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-12-06 03:03:12,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:12,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1518 states and 1815 transitions. [2024-12-06 03:03:12,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 1815 transitions. [2024-12-06 03:03:12,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-12-06 03:03:12,462 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:12,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:12,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:12,574 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-12-06 03:03:13,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:13,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1832 states to 1535 states and 1832 transitions. [2024-12-06 03:03:13,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 1832 transitions. [2024-12-06 03:03:13,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-12-06 03:03:13,193 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:13,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:13,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:13,440 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 03:03:13,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:13,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1545 states and 1844 transitions. [2024-12-06 03:03:13,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 1844 transitions. [2024-12-06 03:03:13,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-12-06 03:03:13,883 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:13,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:13,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:14,018 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-12-06 03:03:15,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:15,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1865 states to 1562 states and 1865 transitions. [2024-12-06 03:03:15,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 1865 transitions. [2024-12-06 03:03:15,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-12-06 03:03:15,081 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:15,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:15,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:15,273 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 03:03:15,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:15,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1881 states to 1575 states and 1881 transitions. [2024-12-06 03:03:15,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 1881 transitions. [2024-12-06 03:03:15,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-12-06 03:03:15,945 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:15,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:15,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:15,999 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-12-06 03:03:16,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:16,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1592 states and 1897 transitions. [2024-12-06 03:03:16,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 1897 transitions. [2024-12-06 03:03:16,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-12-06 03:03:16,717 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:16,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:16,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:16,813 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-12-06 03:03:16,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:16,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1909 states to 1604 states and 1909 transitions. [2024-12-06 03:03:16,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 1909 transitions. [2024-12-06 03:03:16,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-12-06 03:03:16,894 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:16,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:16,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:16,948 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-12-06 03:03:17,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:17,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1913 states to 1609 states and 1913 transitions. [2024-12-06 03:03:17,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 1913 transitions. [2024-12-06 03:03:17,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-12-06 03:03:17,716 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:17,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:17,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:17,777 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-12-06 03:03:17,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:17,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1915 states to 1611 states and 1915 transitions. [2024-12-06 03:03:17,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 1915 transitions. [2024-12-06 03:03:17,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-12-06 03:03:17,825 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:17,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:17,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:17,889 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-12-06 03:03:18,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:18,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1620 states and 1931 transitions. [2024-12-06 03:03:18,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 1931 transitions. [2024-12-06 03:03:18,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-12-06 03:03:18,618 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:18,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:18,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:18,718 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-12-06 03:03:19,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:19,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1640 states and 1952 transitions. [2024-12-06 03:03:19,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 1952 transitions. [2024-12-06 03:03:19,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-12-06 03:03:19,949 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:19,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:19,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:20,052 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-12-06 03:03:20,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:20,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1654 states and 1965 transitions. [2024-12-06 03:03:20,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 1965 transitions. [2024-12-06 03:03:20,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-12-06 03:03:20,479 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:20,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:20,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:21,076 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 03:03:25,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:25,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 1813 states and 2155 transitions. [2024-12-06 03:03:25,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 2155 transitions. [2024-12-06 03:03:25,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-12-06 03:03:25,961 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:25,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:26,160 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 03:03:29,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:29,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2206 states to 1852 states and 2206 transitions. [2024-12-06 03:03:29,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1852 states and 2206 transitions. [2024-12-06 03:03:29,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-12-06 03:03:29,276 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:29,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:29,461 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 03:03:30,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:30,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2227 states to 1872 states and 2227 transitions. [2024-12-06 03:03:30,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1872 states and 2227 transitions. [2024-12-06 03:03:30,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-12-06 03:03:30,997 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:30,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:31,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:31,180 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 03:03:33,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:33,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2271 states to 1911 states and 2271 transitions. [2024-12-06 03:03:33,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1911 states and 2271 transitions. [2024-12-06 03:03:33,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-12-06 03:03:33,508 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:33,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:33,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:33,772 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-12-06 03:03:34,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:34,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2275 states to 1916 states and 2275 transitions. [2024-12-06 03:03:34,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 2275 transitions. [2024-12-06 03:03:34,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-12-06 03:03:34,456 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:34,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:34,548 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-12-06 03:03:35,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:35,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 1943 states and 2306 transitions. [2024-12-06 03:03:35,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1943 states and 2306 transitions. [2024-12-06 03:03:35,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-12-06 03:03:35,041 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:35,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:35,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:35,108 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 03:03:35,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:35,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 1955 states and 2318 transitions. [2024-12-06 03:03:35,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1955 states and 2318 transitions. [2024-12-06 03:03:35,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-12-06 03:03:35,956 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:35,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:35,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:36,125 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:03:37,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:37,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2341 states to 1975 states and 2341 transitions. [2024-12-06 03:03:37,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 2341 transitions. [2024-12-06 03:03:37,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-12-06 03:03:37,663 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:37,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:37,758 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 142 proven. 8 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-12-06 03:03:39,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:39,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2368 states to 1993 states and 2368 transitions. [2024-12-06 03:03:39,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 2368 transitions. [2024-12-06 03:03:39,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-06 03:03:39,006 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:39,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:39,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:39,097 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-12-06 03:03:39,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:39,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2374 states to 1999 states and 2374 transitions. [2024-12-06 03:03:39,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1999 states and 2374 transitions. [2024-12-06 03:03:39,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-06 03:03:39,707 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:39,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:39,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:39,781 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-12-06 03:03:41,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:41,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2389 states to 2011 states and 2389 transitions. [2024-12-06 03:03:41,192 INFO L276 IsEmpty]: Start isEmpty. Operand 2011 states and 2389 transitions. [2024-12-06 03:03:41,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-06 03:03:41,193 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:41,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:41,289 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-12-06 03:03:41,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:41,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2390 states to 2012 states and 2390 transitions. [2024-12-06 03:03:41,824 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 2390 transitions. [2024-12-06 03:03:41,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-12-06 03:03:41,825 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:41,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:41,912 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-12-06 03:03:42,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:42,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2394 states to 2017 states and 2394 transitions. [2024-12-06 03:03:42,571 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 2394 transitions. [2024-12-06 03:03:42,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-12-06 03:03:42,573 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:42,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:43,563 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 93 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-06 03:03:47,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:47,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2178 states and 2568 transitions. [2024-12-06 03:03:47,486 INFO L276 IsEmpty]: Start isEmpty. Operand 2178 states and 2568 transitions. [2024-12-06 03:03:47,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-12-06 03:03:47,487 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:47,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:47,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:47,757 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2024-12-06 03:03:52,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:52,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2727 states to 2328 states and 2727 transitions. [2024-12-06 03:03:52,040 INFO L276 IsEmpty]: Start isEmpty. Operand 2328 states and 2727 transitions. [2024-12-06 03:03:52,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-12-06 03:03:52,041 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:52,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:52,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:52,119 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 03:03:52,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:52,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2732 states to 2333 states and 2732 transitions. [2024-12-06 03:03:52,649 INFO L276 IsEmpty]: Start isEmpty. Operand 2333 states and 2732 transitions. [2024-12-06 03:03:52,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-12-06 03:03:52,651 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:52,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:52,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:52,735 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-12-06 03:03:53,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:53,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2732 states to 2334 states and 2732 transitions. [2024-12-06 03:03:53,310 INFO L276 IsEmpty]: Start isEmpty. Operand 2334 states and 2732 transitions. [2024-12-06 03:03:53,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-12-06 03:03:53,311 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:53,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:53,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:53,448 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-12-06 03:03:54,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:54,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2742 states to 2344 states and 2742 transitions. [2024-12-06 03:03:54,146 INFO L276 IsEmpty]: Start isEmpty. Operand 2344 states and 2742 transitions. [2024-12-06 03:03:54,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-12-06 03:03:54,147 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:54,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:54,232 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-12-06 03:03:54,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:54,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2746 states to 2349 states and 2746 transitions. [2024-12-06 03:03:54,594 INFO L276 IsEmpty]: Start isEmpty. Operand 2349 states and 2746 transitions. [2024-12-06 03:03:54,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-12-06 03:03:54,596 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:54,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:54,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:54,753 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-12-06 03:03:56,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:56,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2773 states to 2375 states and 2773 transitions. [2024-12-06 03:03:56,043 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 2773 transitions. [2024-12-06 03:03:56,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-12-06 03:03:56,044 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:56,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:56,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:56,122 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2024-12-06 03:03:56,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:56,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2773 states to 2376 states and 2773 transitions. [2024-12-06 03:03:56,214 INFO L276 IsEmpty]: Start isEmpty. Operand 2376 states and 2773 transitions. [2024-12-06 03:03:56,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-12-06 03:03:56,215 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:56,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:56,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:56,960 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-12-06 03:03:58,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:58,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2783 states to 2383 states and 2783 transitions. [2024-12-06 03:03:58,715 INFO L276 IsEmpty]: Start isEmpty. Operand 2383 states and 2783 transitions. [2024-12-06 03:03:58,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-12-06 03:03:58,716 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:58,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:58,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:58,809 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-12-06 03:03:59,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:03:59,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2787 states to 2388 states and 2787 transitions. [2024-12-06 03:03:59,055 INFO L276 IsEmpty]: Start isEmpty. Operand 2388 states and 2787 transitions. [2024-12-06 03:03:59,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-12-06 03:03:59,056 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:03:59,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:03:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:03:59,146 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-12-06 03:04:00,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:04:00,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2799 states to 2400 states and 2799 transitions. [2024-12-06 03:04:00,938 INFO L276 IsEmpty]: Start isEmpty. Operand 2400 states and 2799 transitions. [2024-12-06 03:04:00,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-12-06 03:04:00,940 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:04:00,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:04:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:04:01,030 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-12-06 03:04:01,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:04:01,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2805 states to 2406 states and 2805 transitions. [2024-12-06 03:04:01,933 INFO L276 IsEmpty]: Start isEmpty. Operand 2406 states and 2805 transitions. [2024-12-06 03:04:01,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-12-06 03:04:01,934 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:04:01,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:04:01,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:04:02,041 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-12-06 03:04:03,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:04:03,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2812 states to 2412 states and 2812 transitions. [2024-12-06 03:04:03,170 INFO L276 IsEmpty]: Start isEmpty. Operand 2412 states and 2812 transitions. [2024-12-06 03:04:03,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-12-06 03:04:03,172 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:04:03,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:04:03,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:04:03,264 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-12-06 03:04:03,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:04:03,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2418 states and 2818 transitions. [2024-12-06 03:04:03,680 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 2818 transitions. [2024-12-06 03:04:03,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-12-06 03:04:03,682 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:04:03,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:04:03,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:04:03,777 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-12-06 03:04:05,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:04:05,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2826 states to 2424 states and 2826 transitions. [2024-12-06 03:04:05,488 INFO L276 IsEmpty]: Start isEmpty. Operand 2424 states and 2826 transitions. [2024-12-06 03:04:05,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2024-12-06 03:04:05,489 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:04:05,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:04:05,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:04:05,898 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 316 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-12-06 03:04:06,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:04:06,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2906 states to 2503 states and 2906 transitions. [2024-12-06 03:04:07,000 INFO L276 IsEmpty]: Start isEmpty. Operand 2503 states and 2906 transitions. [2024-12-06 03:04:07,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2024-12-06 03:04:07,001 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:04:07,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:04:07,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:04:07,621 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 328 proven. 16 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-12-06 03:04:12,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:04:12,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3021 states to 2607 states and 3021 transitions. [2024-12-06 03:04:12,887 INFO L276 IsEmpty]: Start isEmpty. Operand 2607 states and 3021 transitions. [2024-12-06 03:04:12,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2024-12-06 03:04:12,889 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:04:12,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:04:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:04:13,125 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 328 proven. 16 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-12-06 03:04:16,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:04:16,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3059 states to 2644 states and 3059 transitions. [2024-12-06 03:04:16,708 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 3059 transitions. [2024-12-06 03:04:16,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2024-12-06 03:04:16,710 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:04:16,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:04:16,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:04:16,944 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 328 proven. 16 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-12-06 03:04:19,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:04:19,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3091 states to 2678 states and 3091 transitions. [2024-12-06 03:04:19,482 INFO L276 IsEmpty]: Start isEmpty. Operand 2678 states and 3091 transitions. [2024-12-06 03:04:19,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2024-12-06 03:04:19,483 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:04:19,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:04:19,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:04:19,720 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 328 proven. 16 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-12-06 03:04:20,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:04:20,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3095 states to 2683 states and 3095 transitions. [2024-12-06 03:04:20,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2683 states and 3095 transitions. [2024-12-06 03:04:20,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-12-06 03:04:20,577 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:04:20,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:04:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:04:20,863 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 214 proven. 4 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2024-12-06 03:04:21,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:04:21,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3107 states to 2690 states and 3107 transitions. [2024-12-06 03:04:21,913 INFO L276 IsEmpty]: Start isEmpty. Operand 2690 states and 3107 transitions. [2024-12-06 03:04:21,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-12-06 03:04:21,914 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:04:21,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:04:21,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:04:22,018 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-12-06 03:04:22,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:04:22,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3112 states to 2696 states and 3112 transitions. [2024-12-06 03:04:22,377 INFO L276 IsEmpty]: Start isEmpty. Operand 2696 states and 3112 transitions. [2024-12-06 03:04:22,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-12-06 03:04:22,378 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:04:22,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:04:22,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:04:22,481 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-12-06 03:04:23,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:04:23,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3118 states to 2702 states and 3118 transitions. [2024-12-06 03:04:23,532 INFO L276 IsEmpty]: Start isEmpty. Operand 2702 states and 3118 transitions. [2024-12-06 03:04:23,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-12-06 03:04:23,534 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:04:23,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:04:23,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:04:23,720 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-12-06 03:04:24,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:04:24,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 2704 states and 3122 transitions. [2024-12-06 03:04:24,198 INFO L276 IsEmpty]: Start isEmpty. Operand 2704 states and 3122 transitions. [2024-12-06 03:04:24,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-12-06 03:04:24,200 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:04:24,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:04:24,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:04:24,302 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-12-06 03:04:25,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:04:25,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 2705 states and 3126 transitions. [2024-12-06 03:04:25,159 INFO L276 IsEmpty]: Start isEmpty. Operand 2705 states and 3126 transitions. [2024-12-06 03:04:25,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-12-06 03:04:25,161 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:04:25,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:04:25,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:04:25,263 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-12-06 03:04:27,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:04:27,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 2716 states and 3136 transitions. [2024-12-06 03:04:27,448 INFO L276 IsEmpty]: Start isEmpty. Operand 2716 states and 3136 transitions. [2024-12-06 03:04:27,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-12-06 03:04:27,450 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:04:27,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:04:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:04:27,645 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-12-06 03:04:28,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:04:28,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 2719 states and 3138 transitions. [2024-12-06 03:04:28,355 INFO L276 IsEmpty]: Start isEmpty. Operand 2719 states and 3138 transitions. [2024-12-06 03:04:28,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-12-06 03:04:28,356 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:04:28,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:04:28,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:04:28,460 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-12-06 03:04:29,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:04:29,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3142 states to 2724 states and 3142 transitions. [2024-12-06 03:04:29,346 INFO L276 IsEmpty]: Start isEmpty. Operand 2724 states and 3142 transitions. [2024-12-06 03:04:29,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2024-12-06 03:04:29,347 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-06 03:04:29,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-06 03:04:29,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-06 03:04:29,454 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2024-12-06 03:04:29,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-06 03:04:29,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2463 states to 2154 states and 2463 transitions. [2024-12-06 03:04:29,931 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 2463 transitions. [2024-12-06 03:04:29,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-12-06 03:04:29,932 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 143 iterations. [2024-12-06 03:04:29,940 INFO L726 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-12-06 03:04:47,026 INFO L77 FloydHoareUtils]: At program point L301(lines 301 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-12-06 03:04:47,027 INFO L77 FloydHoareUtils]: At program point L235(lines 235 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-12-06 03:04:47,027 INFO L77 FloydHoareUtils]: At program point L169(lines 169 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,027 INFO L77 FloydHoareUtils]: At program point L303(lines 303 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-12-06 03:04:47,027 INFO L77 FloydHoareUtils]: At program point L105(lines 105 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,027 INFO L77 FloydHoareUtils]: At program point L40(lines 40 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,027 INFO L77 FloydHoareUtils]: At program point L371(lines 371 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,028 INFO L77 FloydHoareUtils]: At program point L307(lines 307 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-12-06 03:04:47,028 INFO L77 FloydHoareUtils]: At program point L175(lines 175 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,028 INFO L77 FloydHoareUtils]: At program point L109(lines 109 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,028 INFO L77 FloydHoareUtils]: At program point L242(lines 242 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-12-06 03:04:47,028 INFO L77 FloydHoareUtils]: At program point L45(lines 45 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,028 INFO L77 FloydHoareUtils]: At program point L574-1(lines 39 608) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not (= 7 ~a17~0)) .cse1) (and (= ~a25~0 1) .cse1)))) [2024-12-06 03:04:47,029 INFO L77 FloydHoareUtils]: At program point L244(lines 244 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-12-06 03:04:47,029 INFO L77 FloydHoareUtils]: At program point L179(lines 179 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,029 INFO L77 FloydHoareUtils]: At program point L378(lines 378 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,029 INFO L77 FloydHoareUtils]: At program point L48(lines 48 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,029 INFO L77 FloydHoareUtils]: At program point L577-1(lines 39 608) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not (= 7 ~a17~0)) .cse1) (and (= ~a25~0 1) .cse1)))) [2024-12-06 03:04:47,029 INFO L77 FloydHoareUtils]: At program point L247(lines 247 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-12-06 03:04:47,029 INFO L75 FloydHoareUtils]: For program point L578(line 578) no Hoare annotation was computed. [2024-12-06 03:04:47,029 INFO L77 FloydHoareUtils]: At program point L116(lines 116 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,030 INFO L77 FloydHoareUtils]: At program point L52(lines 52 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,030 INFO L77 FloydHoareUtils]: At program point L185(lines 185 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,030 INFO L77 FloydHoareUtils]: At program point L385(lines 385 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,030 INFO L77 FloydHoareUtils]: At program point L319(lines 319 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-12-06 03:04:47,030 INFO L77 FloydHoareUtils]: At program point L189(lines 189 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,030 INFO L77 FloydHoareUtils]: At program point L123(lines 123 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,030 INFO L77 FloydHoareUtils]: At program point L57(lines 57 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,031 INFO L77 FloydHoareUtils]: At program point L388(lines 388 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,031 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-12-06 03:04:47,031 INFO L77 FloydHoareUtils]: At program point L390(lines 390 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,031 INFO L77 FloydHoareUtils]: At program point L324(lines 324 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-12-06 03:04:47,031 INFO L77 FloydHoareUtils]: At program point L258(lines 258 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-12-06 03:04:47,031 INFO L77 FloydHoareUtils]: At program point L60(lines 60 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,031 INFO L77 FloydHoareUtils]: At program point L195(lines 195 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,031 INFO L77 FloydHoareUtils]: At program point L129(lines 129 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,032 INFO L77 FloydHoareUtils]: At program point L64(lines 64 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,032 INFO L77 FloydHoareUtils]: At program point L263(lines 263 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-12-06 03:04:47,032 INFO L77 FloydHoareUtils]: At program point L197(lines 197 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,032 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 578) no Hoare annotation was computed. [2024-12-06 03:04:47,032 INFO L77 FloydHoareUtils]: At program point L199(lines 199 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,032 INFO L77 FloydHoareUtils]: At program point L133(lines 133 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,032 INFO L77 FloydHoareUtils]: At program point L399(lines 399 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,032 INFO L77 FloydHoareUtils]: At program point L201(lines 201 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,033 INFO L77 FloydHoareUtils]: At program point L69(lines 69 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,033 INFO L77 FloydHoareUtils]: At program point L269(lines 269 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-12-06 03:04:47,033 INFO L77 FloydHoareUtils]: At program point L204(lines 204 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,033 INFO L77 FloydHoareUtils]: At program point L271(lines 271 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-12-06 03:04:47,033 INFO L77 FloydHoareUtils]: At program point L404(lines 404 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,033 INFO L77 FloydHoareUtils]: At program point L338(lines 338 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-12-06 03:04:47,033 INFO L77 FloydHoareUtils]: At program point L140(lines 140 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,033 INFO L77 FloydHoareUtils]: At program point L75(lines 75 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,033 INFO L77 FloydHoareUtils]: At program point L208(lines 208 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,033 INFO L77 FloydHoareUtils]: At program point L341(lines 341 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,033 INFO L77 FloydHoareUtils]: At program point L408(lines 408 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,033 INFO L77 FloydHoareUtils]: At program point L144(lines 144 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,034 INFO L77 FloydHoareUtils]: At program point L79(lines 79 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,034 INFO L77 FloydHoareUtils]: At program point L212(lines 212 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,034 INFO L77 FloydHoareUtils]: At program point L610(lines 610 627) the Hoare annotation is: true [2024-12-06 03:04:47,034 INFO L77 FloydHoareUtils]: At program point L412(lines 412 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,034 INFO L77 FloydHoareUtils]: At program point L347(lines 347 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,034 INFO L77 FloydHoareUtils]: At program point L149(lines 149 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,034 INFO L77 FloydHoareUtils]: At program point L414(lines 414 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,034 INFO L77 FloydHoareUtils]: At program point L84(lines 84 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,034 INFO L77 FloydHoareUtils]: At program point L417(lines 417 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,034 INFO L77 FloydHoareUtils]: At program point L153(lines 153 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,034 INFO L77 FloydHoareUtils]: At program point L616-2(lines 616 626) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,034 INFO L77 FloydHoareUtils]: At program point L286(lines 286 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-12-06 03:04:47,034 INFO L77 FloydHoareUtils]: At program point L419(lines 419 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,034 INFO L77 FloydHoareUtils]: At program point L222(lines 222 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,034 INFO L77 FloydHoareUtils]: At program point L290(lines 290 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-12-06 03:04:47,034 INFO L77 FloydHoareUtils]: At program point L158(lines 158 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,035 INFO L77 FloydHoareUtils]: At program point L92(lines 92 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,035 INFO L77 FloydHoareUtils]: At program point L621(line 621) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,035 INFO L77 FloydHoareUtils]: At program point L225(lines 225 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,035 INFO L77 FloydHoareUtils]: At program point L359(lines 359 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,035 INFO L77 FloydHoareUtils]: At program point L293(lines 293 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-12-06 03:04:47,035 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-12-06 03:04:47,035 INFO L77 FloydHoareUtils]: At program point L228(lines 228 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-12-06 03:04:47,035 INFO L77 FloydHoareUtils]: At program point L296(lines 296 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-12-06 03:04:47,035 INFO L77 FloydHoareUtils]: At program point L164(lines 164 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,035 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 39 608) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,036 INFO L77 FloydHoareUtils]: At program point L364(lines 364 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,036 INFO L77 FloydHoareUtils]: At program point L233(lines 233 423) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse2 (not .cse7)) (.cse0 (= ~a17~0 8)) (.cse4 (= ~a28~0 10)) (.cse5 (= ~a21~0 1)) (.cse6 (not .cse3))) (or (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse0) (and (not .cse1) .cse2) (and .cse3 .cse4 .cse5 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse5 (= ~a11~0 ~a19~0) .cse6) (and (= ~a25~0 1) .cse2) (and (<= ~a17~0 8) .cse7 (not (and .cse0 .cse4 .cse5 .cse6)))))) [2024-12-06 03:04:47,036 INFO L77 FloydHoareUtils]: At program point L101(lines 101 423) the Hoare annotation is: (let ((.cse0 (= ~a19~0 1))) (let ((.cse1 (= 7 ~a17~0)) (.cse4 (= ~a21~0 1)) (.cse3 (= ~a11~0 1)) (.cse2 (not .cse0))) (or (and (<= ~a17~0 8) .cse0) (and (not .cse1) .cse2) (and .cse3 (= ~a28~0 10) .cse4 .cse1) (and (= 7 ~a28~0) (= ~a25~0 ~a11~0) .cse4 (= ~a11~0 ~a19~0) (not .cse3)) (and (= ~a25~0 1) .cse2)))) [2024-12-06 03:04:47,047 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 06.12 03:04:47 ImpRootNode [2024-12-06 03:04:47,047 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-06 03:04:47,048 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-06 03:04:47,048 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-06 03:04:47,048 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-06 03:04:47,048 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 03:02:15" (3/4) ... [2024-12-06 03:04:47,050 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-12-06 03:04:47,062 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 128 nodes and edges [2024-12-06 03:04:47,062 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-12-06 03:04:47,063 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-12-06 03:04:47,064 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-12-06 03:04:47,159 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3846b1-99a4-47b4-8cc1-49ebb59c856d/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-06 03:04:47,160 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3846b1-99a4-47b4-8cc1-49ebb59c856d/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-06 03:04:47,160 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-06 03:04:47,161 INFO L158 Benchmark]: Toolchain (without parser) took 153858.24ms. Allocated memory was 117.4MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 90.7MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 564.1MB. Max. memory is 16.1GB. [2024-12-06 03:04:47,161 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 117.4MB. Free memory is still 73.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 03:04:47,161 INFO L158 Benchmark]: CACSL2BoogieTranslator took 392.71ms. Allocated memory is still 117.4MB. Free memory was 90.7MB in the beginning and 64.9MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-12-06 03:04:47,161 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.82ms. Allocated memory is still 117.4MB. Free memory was 64.7MB in the beginning and 59.8MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 03:04:47,162 INFO L158 Benchmark]: Boogie Preprocessor took 47.27ms. Allocated memory is still 117.4MB. Free memory was 59.8MB in the beginning and 55.7MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-06 03:04:47,162 INFO L158 Benchmark]: RCFGBuilder took 1301.17ms. Allocated memory was 117.4MB in the beginning and 192.9MB in the end (delta: 75.5MB). Free memory was 55.7MB in the beginning and 105.9MB in the end (delta: -50.2MB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB. [2024-12-06 03:04:47,162 INFO L158 Benchmark]: CodeCheck took 151944.39ms. Allocated memory was 192.9MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 105.9MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 495.5MB. Max. memory is 16.1GB. [2024-12-06 03:04:47,162 INFO L158 Benchmark]: Witness Printer took 112.14ms. Allocated memory is still 2.2GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-06 03:04:47,164 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, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 134.8s, OverallIterations: 143, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 413226 SdHoareTripleChecker+Valid, 802.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 401096 mSDsluCounter, 50490 SdHoareTripleChecker+Invalid, 682.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 42770 mSDsCounter, 92052 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 857645 IncrementalHoareTripleChecker+Invalid, 949697 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 92052 mSolverCounterUnsat, 7720 mSDtfsCounter, 857645 mSolverCounterSat, 6.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 170282 GetRequests, 160836 SyntacticMatches, 8304 SemanticMatches, 1142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 825831 ImplicationChecksByTransitivity, 99.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.6s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 15.3s InterpolantComputationTime, 25130 NumberOfCodeBlocks, 25130 NumberOfCodeBlocksAsserted, 142 NumberOfCheckSat, 24988 ConstructedInterpolants, 0 QuantifiedInterpolants, 80155 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 142 InterpolantComputations, 119 PerfectInterpolantSequences, 19742/20890 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: 578]: 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: 39]: Location Invariant Derived location invariant: ((((((a17 <= 8) && (a19 == 1)) || ((7 != a17) && (a19 != 1))) || ((((a11 == 1) && (a28 == 10)) && (a21 == 1)) && (7 == a17))) || (((((7 == a28) && (a25 == a11)) && (a21 == 1)) && (a11 == a19)) && (a11 != 1))) || ((a25 == 1) && (a19 != 1))) - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: ((((((a17 <= 8) && (a19 == 1)) || ((7 != a17) && (a19 != 1))) || ((((a11 == 1) && (a28 == 10)) && (a21 == 1)) && (7 == a17))) || (((((7 == a28) && (a25 == a11)) && (a21 == 1)) && (a11 == a19)) && (a11 != 1))) || ((a25 == 1) && (a19 != 1))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 117.4MB. Free memory is still 73.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 392.71ms. Allocated memory is still 117.4MB. Free memory was 90.7MB in the beginning and 64.9MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.82ms. Allocated memory is still 117.4MB. Free memory was 64.7MB in the beginning and 59.8MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.27ms. Allocated memory is still 117.4MB. Free memory was 59.8MB in the beginning and 55.7MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1301.17ms. Allocated memory was 117.4MB in the beginning and 192.9MB in the end (delta: 75.5MB). Free memory was 55.7MB in the beginning and 105.9MB in the end (delta: -50.2MB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB. * CodeCheck took 151944.39ms. Allocated memory was 192.9MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 105.9MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 495.5MB. Max. memory is 16.1GB. * Witness Printer took 112.14ms. Allocated memory is still 2.2GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-12-06 03:04:47,179 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3846b1-99a4-47b4-8cc1-49ebb59c856d/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