./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label18.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_ce0e91e0-a116-4396-a832-304bae3cb842/bin/ukojak-verify-ENZ3QT5qd3/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0e91e0-a116-4396-a832-304bae3cb842/bin/ukojak-verify-ENZ3QT5qd3/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0e91e0-a116-4396-a832-304bae3cb842/bin/ukojak-verify-ENZ3QT5qd3/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0e91e0-a116-4396-a832-304bae3cb842/bin/ukojak-verify-ENZ3QT5qd3/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label18.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0e91e0-a116-4396-a832-304bae3cb842/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0e91e0-a116-4396-a832-304bae3cb842/bin/ukojak-verify-ENZ3QT5qd3 --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 8fcc4bb7cd8f204722096b247511c17cd0d430fd3f99523a22a5bf87d5e044f6 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-25 02:13:38,450 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-25 02:13:38,528 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0e91e0-a116-4396-a832-304bae3cb842/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-25 02:13:38,533 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-25 02:13:38,533 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-25 02:13:38,578 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-25 02:13:38,579 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-25 02:13:38,579 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-25 02:13:38,579 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-25 02:13:38,579 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-25 02:13:38,579 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-25 02:13:38,580 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-25 02:13:38,580 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-25 02:13:38,580 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-25 02:13:38,580 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-25 02:13:38,580 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-25 02:13:38,580 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-25 02:13:38,580 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-25 02:13:38,580 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-25 02:13:38,580 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-25 02:13:38,581 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-25 02:13:38,583 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-25 02:13:38,583 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-25 02:13:38,583 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-25 02:13:38,583 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-25 02:13:38,584 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-25 02:13:38,584 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-25 02:13:38,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 02:13:38,584 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-25 02:13:38,584 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-25 02:13:38,585 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-25 02:13:38,585 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-25 02:13:38,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-25 02:13:38,585 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_ce0e91e0-a116-4396-a832-304bae3cb842/bin/ukojak-verify-ENZ3QT5qd3 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 -> 8fcc4bb7cd8f204722096b247511c17cd0d430fd3f99523a22a5bf87d5e044f6 [2024-11-25 02:13:38,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-25 02:13:38,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-25 02:13:38,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-25 02:13:38,932 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-25 02:13:38,933 INFO L274 PluginConnector]: CDTParser initialized [2024-11-25 02:13:38,934 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0e91e0-a116-4396-a832-304bae3cb842/bin/ukojak-verify-ENZ3QT5qd3/../../sv-benchmarks/c/eca-rers2012/Problem01_label18.c [2024-11-25 02:13:41,966 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0e91e0-a116-4396-a832-304bae3cb842/bin/ukojak-verify-ENZ3QT5qd3/data/a47b388a5/90f54957d85747bbb207bc7a1d9b8760/FLAG5ce637a7d [2024-11-25 02:13:42,338 INFO L384 CDTParser]: Found 1 translation units. [2024-11-25 02:13:42,340 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0e91e0-a116-4396-a832-304bae3cb842/sv-benchmarks/c/eca-rers2012/Problem01_label18.c [2024-11-25 02:13:42,358 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0e91e0-a116-4396-a832-304bae3cb842/bin/ukojak-verify-ENZ3QT5qd3/data/a47b388a5/90f54957d85747bbb207bc7a1d9b8760/FLAG5ce637a7d [2024-11-25 02:13:42,380 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0e91e0-a116-4396-a832-304bae3cb842/bin/ukojak-verify-ENZ3QT5qd3/data/a47b388a5/90f54957d85747bbb207bc7a1d9b8760 [2024-11-25 02:13:42,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-25 02:13:42,384 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-25 02:13:42,387 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-25 02:13:42,387 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-25 02:13:42,391 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-25 02:13:42,392 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 02:13:42" (1/1) ... [2024-11-25 02:13:42,394 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e0f80e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:13:42, skipping insertion in model container [2024-11-25 02:13:42,394 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 02:13:42" (1/1) ... [2024-11-25 02:13:42,449 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-25 02:13:42,837 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_ce0e91e0-a116-4396-a832-304bae3cb842/sv-benchmarks/c/eca-rers2012/Problem01_label18.c[17985,17998] [2024-11-25 02:13:42,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 02:13:42,896 INFO L200 MainTranslator]: Completed pre-run [2024-11-25 02:13:42,968 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_ce0e91e0-a116-4396-a832-304bae3cb842/sv-benchmarks/c/eca-rers2012/Problem01_label18.c[17985,17998] [2024-11-25 02:13:42,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 02:13:43,001 INFO L204 MainTranslator]: Completed translation [2024-11-25 02:13:43,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:13:43 WrapperNode [2024-11-25 02:13:43,004 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-25 02:13:43,006 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-25 02:13:43,006 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-25 02:13:43,006 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-25 02:13:43,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:13:43" (1/1) ... [2024-11-25 02:13:43,028 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:13:43" (1/1) ... [2024-11-25 02:13:43,083 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-25 02:13:43,083 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-25 02:13:43,084 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-25 02:13:43,084 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-25 02:13:43,084 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-25 02:13:43,094 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:13:43" (1/1) ... [2024-11-25 02:13:43,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:13:43" (1/1) ... [2024-11-25 02:13:43,102 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:13:43" (1/1) ... [2024-11-25 02:13:43,102 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:13:43" (1/1) ... [2024-11-25 02:13:43,126 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:13:43" (1/1) ... [2024-11-25 02:13:43,128 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:13:43" (1/1) ... [2024-11-25 02:13:43,135 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:13:43" (1/1) ... [2024-11-25 02:13:43,138 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:13:43" (1/1) ... [2024-11-25 02:13:43,141 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:13:43" (1/1) ... [2024-11-25 02:13:43,146 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-25 02:13:43,147 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-25 02:13:43,147 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-25 02:13:43,147 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-25 02:13:43,148 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:13:43" (1/1) ... [2024-11-25 02:13:43,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 02:13:43,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0e91e0-a116-4396-a832-304bae3cb842/bin/ukojak-verify-ENZ3QT5qd3/z3 [2024-11-25 02:13:43,193 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0e91e0-a116-4396-a832-304bae3cb842/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-25 02:13:43,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0e91e0-a116-4396-a832-304bae3cb842/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-25 02:13:43,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-25 02:13:43,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-25 02:13:43,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-25 02:13:43,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-25 02:13:43,306 INFO L234 CfgBuilder]: Building ICFG [2024-11-25 02:13:43,309 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-25 02:13:44,597 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-25 02:13:44,598 INFO L283 CfgBuilder]: Performing block encoding [2024-11-25 02:13:44,972 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-25 02:13:44,974 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-25 02:13:44,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 02:13:44 BoogieIcfgContainer [2024-11-25 02:13:44,975 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-25 02:13:44,975 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-25 02:13:44,976 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-25 02:13:44,986 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-25 02:13:44,986 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 02:13:44" (1/1) ... [2024-11-25 02:13:44,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-25 02:13:45,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:13:45,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-11-25 02:13:45,065 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-11-25 02:13:45,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-25 02:13:45,070 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:13:45,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:13:45,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:13:45,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:13:46,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:13:46,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 145 states and 219 transitions. [2024-11-25 02:13:46,513 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 219 transitions. [2024-11-25 02:13:46,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-25 02:13:46,515 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:13:46,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:13:46,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:13:46,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 02:13:47,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:13:47,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 146 states and 220 transitions. [2024-11-25 02:13:47,112 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2024-11-25 02:13:47,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-25 02:13:47,117 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:13:47,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:13:47,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:13:47,285 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:13:47,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:13:47,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 151 states and 227 transitions. [2024-11-25 02:13:47,381 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 227 transitions. [2024-11-25 02:13:47,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-25 02:13:47,384 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:13:47,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:13:47,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:13:47,872 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:13:48,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:13:48,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 226 states and 305 transitions. [2024-11-25 02:13:48,918 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 305 transitions. [2024-11-25 02:13:48,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-25 02:13:48,920 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:13:48,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:13:48,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:13:49,134 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:13:49,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:13:49,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 227 states and 307 transitions. [2024-11-25 02:13:49,304 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 307 transitions. [2024-11-25 02:13:49,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-25 02:13:49,307 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:13:49,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:13:49,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:13:49,495 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:13:49,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:13:49,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 230 states and 310 transitions. [2024-11-25 02:13:49,583 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 310 transitions. [2024-11-25 02:13:49,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-25 02:13:49,584 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:13:49,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:13:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:13:49,751 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 02:13:50,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:13:50,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 238 states and 323 transitions. [2024-11-25 02:13:50,261 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 323 transitions. [2024-11-25 02:13:50,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-25 02:13:50,264 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:13:50,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:13:50,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:13:50,419 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 02:13:50,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:13:50,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 243 states and 328 transitions. [2024-11-25 02:13:50,629 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 328 transitions. [2024-11-25 02:13:50,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-25 02:13:50,630 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:13:50,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:13:50,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:13:50,757 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:13:50,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:13:50,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 249 states and 335 transitions. [2024-11-25 02:13:50,952 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 335 transitions. [2024-11-25 02:13:50,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-25 02:13:50,953 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:13:50,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:13:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:13:51,227 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:13:51,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:13:51,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 257 states and 346 transitions. [2024-11-25 02:13:51,711 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 346 transitions. [2024-11-25 02:13:51,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-25 02:13:51,712 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:13:51,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:13:51,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:13:51,875 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:13:52,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:13:52,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 259 states and 348 transitions. [2024-11-25 02:13:52,101 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 348 transitions. [2024-11-25 02:13:52,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-25 02:13:52,102 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:13:52,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:13:52,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:13:52,218 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-25 02:13:52,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:13:52,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 268 states and 360 transitions. [2024-11-25 02:13:52,616 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 360 transitions. [2024-11-25 02:13:52,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-25 02:13:52,617 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:13:52,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:13:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:13:52,781 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-25 02:13:53,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:13:53,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 272 states and 365 transitions. [2024-11-25 02:13:53,058 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 365 transitions. [2024-11-25 02:13:53,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-25 02:13:53,059 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:13:53,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:13:53,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:13:53,249 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 02:13:53,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:13:53,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 275 states and 371 transitions. [2024-11-25 02:13:53,752 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 371 transitions. [2024-11-25 02:13:53,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-25 02:13:53,753 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:13:53,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:13:53,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:13:53,911 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 02:13:54,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:13:54,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 287 states and 387 transitions. [2024-11-25 02:13:54,598 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 387 transitions. [2024-11-25 02:13:54,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-25 02:13:54,599 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:13:54,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:13:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:13:54,775 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 02:13:54,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:13:54,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 288 states and 387 transitions. [2024-11-25 02:13:54,853 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 387 transitions. [2024-11-25 02:13:54,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-25 02:13:54,854 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:13:54,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:13:54,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:13:54,971 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:13:55,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:13:55,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 305 states and 406 transitions. [2024-11-25 02:13:55,217 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 406 transitions. [2024-11-25 02:13:55,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-25 02:13:55,218 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:13:55,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:13:55,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:13:55,468 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-25 02:13:56,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:13:56,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 320 states and 423 transitions. [2024-11-25 02:13:56,107 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 423 transitions. [2024-11-25 02:13:56,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-25 02:13:56,109 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:13:56,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:13:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:13:56,230 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 02:13:56,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:13:56,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 335 states and 439 transitions. [2024-11-25 02:13:56,512 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 439 transitions. [2024-11-25 02:13:56,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-25 02:13:56,514 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:13:56,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:13:56,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:13:56,644 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-25 02:13:56,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:13:56,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 349 states and 453 transitions. [2024-11-25 02:13:56,995 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 453 transitions. [2024-11-25 02:13:56,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-25 02:13:56,997 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:13:56,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:13:57,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:13:57,140 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-25 02:13:57,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:13:57,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 352 states and 457 transitions. [2024-11-25 02:13:57,235 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 457 transitions. [2024-11-25 02:13:57,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-25 02:13:57,238 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:13:57,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:13:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:13:57,428 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 02:13:58,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:13:58,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 360 states and 468 transitions. [2024-11-25 02:13:58,160 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 468 transitions. [2024-11-25 02:13:58,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-25 02:13:58,161 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:13:58,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:13:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:13:58,338 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-25 02:13:58,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:13:58,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 374 states and 482 transitions. [2024-11-25 02:13:58,667 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 482 transitions. [2024-11-25 02:13:58,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-25 02:13:58,669 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:13:58,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:13:58,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:13:58,866 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 02:13:59,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:13:59,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 382 states and 492 transitions. [2024-11-25 02:13:59,641 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 492 transitions. [2024-11-25 02:13:59,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-25 02:13:59,643 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:13:59,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:13:59,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:13:59,761 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 02:13:59,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:13:59,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 385 states and 496 transitions. [2024-11-25 02:13:59,962 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 496 transitions. [2024-11-25 02:13:59,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-25 02:13:59,963 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:13:59,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:13:59,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:00,284 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 61 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:14:00,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:00,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 387 states and 500 transitions. [2024-11-25 02:14:00,730 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 500 transitions. [2024-11-25 02:14:00,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-25 02:14:00,732 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:00,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:00,870 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:14:01,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:01,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 406 states and 521 transitions. [2024-11-25 02:14:01,107 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 521 transitions. [2024-11-25 02:14:01,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-25 02:14:01,108 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:01,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:01,235 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 02:14:01,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:01,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 408 states and 523 transitions. [2024-11-25 02:14:01,454 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 523 transitions. [2024-11-25 02:14:01,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-25 02:14:01,458 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:01,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:01,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:01,526 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-25 02:14:01,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:01,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 422 states and 537 transitions. [2024-11-25 02:14:01,656 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 537 transitions. [2024-11-25 02:14:01,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-25 02:14:01,657 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:01,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:01,736 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:14:01,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:01,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 430 states and 548 transitions. [2024-11-25 02:14:01,838 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 548 transitions. [2024-11-25 02:14:01,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-25 02:14:01,840 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:01,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:01,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:02,045 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-25 02:14:03,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:03,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 470 states and 590 transitions. [2024-11-25 02:14:03,059 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 590 transitions. [2024-11-25 02:14:03,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-25 02:14:03,061 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:03,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:03,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:03,205 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-25 02:14:03,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:03,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 475 states and 595 transitions. [2024-11-25 02:14:03,494 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 595 transitions. [2024-11-25 02:14:03,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-25 02:14:03,496 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:03,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:03,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:03,568 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-25 02:14:03,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:03,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 480 states and 601 transitions. [2024-11-25 02:14:03,716 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 601 transitions. [2024-11-25 02:14:03,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-25 02:14:03,717 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:03,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:03,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:03,975 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 60 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-25 02:14:04,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:04,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 483 states and 605 transitions. [2024-11-25 02:14:04,309 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 605 transitions. [2024-11-25 02:14:04,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-25 02:14:04,311 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:04,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:04,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:04,502 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 62 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-25 02:14:04,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:04,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 485 states and 608 transitions. [2024-11-25 02:14:04,776 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 608 transitions. [2024-11-25 02:14:04,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-25 02:14:04,778 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:04,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:04,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:05,148 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-25 02:14:05,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:05,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 488 states and 611 transitions. [2024-11-25 02:14:05,291 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 611 transitions. [2024-11-25 02:14:05,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-25 02:14:05,292 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:05,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:05,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:05,530 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:14:06,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:06,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 538 states and 666 transitions. [2024-11-25 02:14:06,463 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 666 transitions. [2024-11-25 02:14:06,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-25 02:14:06,465 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:06,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:06,632 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:14:06,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:06,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 540 states and 667 transitions. [2024-11-25 02:14:06,858 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 667 transitions. [2024-11-25 02:14:06,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-25 02:14:06,859 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:06,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:06,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:07,062 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-25 02:14:07,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:07,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 543 states and 670 transitions. [2024-11-25 02:14:07,163 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 670 transitions. [2024-11-25 02:14:07,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-25 02:14:07,164 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:07,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:07,307 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:14:07,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:07,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 563 states and 691 transitions. [2024-11-25 02:14:07,566 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 691 transitions. [2024-11-25 02:14:07,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-25 02:14:07,566 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:07,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:07,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:07,994 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:14:09,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:09,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 703 states and 846 transitions. [2024-11-25 02:14:09,705 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 846 transitions. [2024-11-25 02:14:09,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-25 02:14:09,706 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:09,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:09,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:10,135 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:14:11,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:11,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 772 states and 931 transitions. [2024-11-25 02:14:11,652 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 931 transitions. [2024-11-25 02:14:11,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-25 02:14:11,653 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:11,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:11,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:12,069 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:14:14,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:14,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 826 states and 992 transitions. [2024-11-25 02:14:14,337 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 992 transitions. [2024-11-25 02:14:14,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-25 02:14:14,338 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:14,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:14,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:14,541 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:14:15,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:15,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 843 states and 1011 transitions. [2024-11-25 02:14:15,394 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1011 transitions. [2024-11-25 02:14:15,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-25 02:14:15,395 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:15,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:15,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:15,622 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:14:15,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:15,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 845 states and 1012 transitions. [2024-11-25 02:14:15,962 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1012 transitions. [2024-11-25 02:14:15,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-25 02:14:15,963 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:15,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:15,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:16,299 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 82 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:14:16,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:16,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 858 states and 1027 transitions. [2024-11-25 02:14:16,779 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1027 transitions. [2024-11-25 02:14:16,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-25 02:14:16,780 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:16,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:16,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:16,882 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-25 02:14:17,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:17,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 872 states and 1044 transitions. [2024-11-25 02:14:17,371 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1044 transitions. [2024-11-25 02:14:17,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-25 02:14:17,372 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:17,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:17,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:17,472 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-25 02:14:17,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:17,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 893 states and 1063 transitions. [2024-11-25 02:14:17,809 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1063 transitions. [2024-11-25 02:14:17,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-25 02:14:17,810 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:17,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:18,190 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 99 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:14:19,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:19,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 923 states and 1097 transitions. [2024-11-25 02:14:19,149 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1097 transitions. [2024-11-25 02:14:19,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-25 02:14:19,150 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:19,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:19,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:19,305 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-25 02:14:19,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:19,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 937 states and 1109 transitions. [2024-11-25 02:14:19,688 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1109 transitions. [2024-11-25 02:14:19,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-25 02:14:19,691 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:19,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:19,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:20,065 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:14:20,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:20,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 954 states and 1127 transitions. [2024-11-25 02:14:20,725 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1127 transitions. [2024-11-25 02:14:20,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-25 02:14:20,726 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:20,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:20,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:20,916 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-25 02:14:21,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:21,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1000 states and 1180 transitions. [2024-11-25 02:14:21,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1180 transitions. [2024-11-25 02:14:21,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-25 02:14:21,502 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:21,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:21,590 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-25 02:14:21,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:21,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1001 states and 1180 transitions. [2024-11-25 02:14:21,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1180 transitions. [2024-11-25 02:14:21,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-25 02:14:21,620 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:21,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:21,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:21,961 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:14:23,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:23,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1267 states to 1072 states and 1267 transitions. [2024-11-25 02:14:23,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1267 transitions. [2024-11-25 02:14:23,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-25 02:14:23,992 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:23,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:24,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:24,241 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 108 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:14:24,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:24,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1277 states to 1081 states and 1277 transitions. [2024-11-25 02:14:24,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1277 transitions. [2024-11-25 02:14:24,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-25 02:14:24,677 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:24,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:24,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:24,919 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 109 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:14:26,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:26,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1121 states and 1324 transitions. [2024-11-25 02:14:26,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1324 transitions. [2024-11-25 02:14:26,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-25 02:14:26,427 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:26,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:27,125 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 130 proven. 49 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-25 02:14:29,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:29,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1214 states and 1439 transitions. [2024-11-25 02:14:29,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1439 transitions. [2024-11-25 02:14:29,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-25 02:14:29,463 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:29,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:29,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:29,838 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 130 proven. 49 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-25 02:14:30,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:30,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1442 states to 1216 states and 1442 transitions. [2024-11-25 02:14:30,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1442 transitions. [2024-11-25 02:14:30,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-25 02:14:30,119 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:30,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:30,191 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-25 02:14:30,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:30,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1473 states to 1243 states and 1473 transitions. [2024-11-25 02:14:30,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 1473 transitions. [2024-11-25 02:14:30,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-25 02:14:30,998 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:30,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:31,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:31,074 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-25 02:14:31,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:31,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1273 states and 1505 transitions. [2024-11-25 02:14:31,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 1505 transitions. [2024-11-25 02:14:31,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-25 02:14:31,797 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:31,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:31,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:31,861 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-25 02:14:32,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:32,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1289 states and 1520 transitions. [2024-11-25 02:14:32,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1520 transitions. [2024-11-25 02:14:32,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-25 02:14:32,096 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:32,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:32,346 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 142 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 02:14:33,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:33,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1318 states and 1552 transitions. [2024-11-25 02:14:33,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1552 transitions. [2024-11-25 02:14:33,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-25 02:14:33,295 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:33,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:33,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:33,680 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:14:34,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:34,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1334 states and 1569 transitions. [2024-11-25 02:14:34,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1569 transitions. [2024-11-25 02:14:34,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-25 02:14:34,494 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:34,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:34,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:34,751 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:14:35,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:35,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1339 states and 1573 transitions. [2024-11-25 02:14:35,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 1573 transitions. [2024-11-25 02:14:35,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-25 02:14:35,191 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:35,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:35,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:36,027 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 3 proven. 167 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 02:14:38,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:38,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1371 states and 1606 transitions. [2024-11-25 02:14:38,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1606 transitions. [2024-11-25 02:14:38,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-25 02:14:38,286 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:38,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:38,568 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 119 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:14:39,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:39,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1385 states and 1623 transitions. [2024-11-25 02:14:39,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 1623 transitions. [2024-11-25 02:14:39,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-25 02:14:39,385 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:39,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:39,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:39,559 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-25 02:14:39,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:39,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1386 states and 1624 transitions. [2024-11-25 02:14:39,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1624 transitions. [2024-11-25 02:14:39,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-25 02:14:39,820 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:39,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:39,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:39,990 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-25 02:14:42,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:42,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1427 states and 1667 transitions. [2024-11-25 02:14:42,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1667 transitions. [2024-11-25 02:14:42,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-25 02:14:42,067 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:42,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:42,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:42,629 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 69 proven. 124 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-25 02:14:46,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:46,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1851 states to 1587 states and 1851 transitions. [2024-11-25 02:14:46,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 1851 transitions. [2024-11-25 02:14:46,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-25 02:14:46,872 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:46,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:46,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:47,152 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 239 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:14:48,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:48,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1617 states and 1894 transitions. [2024-11-25 02:14:48,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 1894 transitions. [2024-11-25 02:14:48,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-25 02:14:48,513 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:48,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:48,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:48,796 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 239 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:14:49,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:49,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1895 states to 1618 states and 1895 transitions. [2024-11-25 02:14:49,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 1895 transitions. [2024-11-25 02:14:49,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-25 02:14:49,322 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:49,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:49,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:49,733 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-25 02:14:51,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:51,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1683 states and 1978 transitions. [2024-11-25 02:14:51,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 1978 transitions. [2024-11-25 02:14:51,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-25 02:14:51,237 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:51,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:51,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:52,159 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 136 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:14:54,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:54,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 1732 states and 2035 transitions. [2024-11-25 02:14:54,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2035 transitions. [2024-11-25 02:14:54,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-25 02:14:54,347 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:54,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:54,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:54,837 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 135 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:14:57,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:57,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 1780 states and 2089 transitions. [2024-11-25 02:14:57,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 2089 transitions. [2024-11-25 02:14:57,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-25 02:14:57,726 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:57,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:57,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:58,463 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-25 02:15:00,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:00,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 1832 states and 2156 transitions. [2024-11-25 02:15:00,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1832 states and 2156 transitions. [2024-11-25 02:15:00,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-25 02:15:00,078 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:00,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:00,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:00,337 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 139 proven. 55 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-25 02:15:01,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:01,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2195 states to 1870 states and 2195 transitions. [2024-11-25 02:15:01,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 2195 transitions. [2024-11-25 02:15:01,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-25 02:15:01,763 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:01,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:02,083 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 140 proven. 71 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-25 02:15:02,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:02,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 1876 states and 2202 transitions. [2024-11-25 02:15:02,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1876 states and 2202 transitions. [2024-11-25 02:15:02,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-25 02:15:02,273 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:02,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:02,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:02,400 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 227 proven. 9 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-25 02:15:02,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:02,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2214 states to 1885 states and 2214 transitions. [2024-11-25 02:15:02,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1885 states and 2214 transitions. [2024-11-25 02:15:02,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-25 02:15:02,965 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:02,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:02,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:03,107 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-25 02:15:04,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:04,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 1920 states and 2257 transitions. [2024-11-25 02:15:04,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1920 states and 2257 transitions. [2024-11-25 02:15:04,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-25 02:15:04,907 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:04,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:04,978 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-25 02:15:05,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:05,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2259 states to 1921 states and 2259 transitions. [2024-11-25 02:15:05,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1921 states and 2259 transitions. [2024-11-25 02:15:05,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-25 02:15:05,436 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:05,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:05,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:05,535 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-25 02:15:06,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:06,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2267 states to 1930 states and 2267 transitions. [2024-11-25 02:15:06,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 2267 transitions. [2024-11-25 02:15:06,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-25 02:15:06,053 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:06,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:06,504 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:15:07,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:07,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 1943 states and 2281 transitions. [2024-11-25 02:15:07,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1943 states and 2281 transitions. [2024-11-25 02:15:07,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-25 02:15:07,449 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:07,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:07,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:07,524 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-25 02:15:08,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:08,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2302 states to 1961 states and 2302 transitions. [2024-11-25 02:15:08,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1961 states and 2302 transitions. [2024-11-25 02:15:08,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-25 02:15:08,393 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:08,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:08,467 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-25 02:15:08,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:08,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 1977 states and 2318 transitions. [2024-11-25 02:15:08,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 2318 transitions. [2024-11-25 02:15:08,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-25 02:15:08,806 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:08,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:08,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:08,891 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-25 02:15:09,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:09,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 1986 states and 2326 transitions. [2024-11-25 02:15:09,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1986 states and 2326 transitions. [2024-11-25 02:15:09,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-25 02:15:09,314 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:09,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:09,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:09,740 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 86 proven. 141 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-25 02:15:12,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:12,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2082 states and 2428 transitions. [2024-11-25 02:15:12,785 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 2428 transitions. [2024-11-25 02:15:12,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-25 02:15:12,786 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:12,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:12,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:12,863 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-25 02:15:13,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:13,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2095 states and 2442 transitions. [2024-11-25 02:15:13,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2095 states and 2442 transitions. [2024-11-25 02:15:13,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-25 02:15:13,346 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:13,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:13,422 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-25 02:15:13,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:13,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2456 states to 2108 states and 2456 transitions. [2024-11-25 02:15:13,970 INFO L276 IsEmpty]: Start isEmpty. Operand 2108 states and 2456 transitions. [2024-11-25 02:15:13,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-25 02:15:13,972 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:13,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:15,060 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 174 proven. 28 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-25 02:15:17,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:17,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2131 states and 2481 transitions. [2024-11-25 02:15:17,347 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 2481 transitions. [2024-11-25 02:15:17,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-25 02:15:17,349 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:17,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:17,669 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 243 proven. 9 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-25 02:15:19,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:19,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2491 states to 2133 states and 2491 transitions. [2024-11-25 02:15:19,156 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 2491 transitions. [2024-11-25 02:15:19,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-25 02:15:19,157 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:19,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:19,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:19,337 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 243 proven. 9 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-25 02:15:20,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:20,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2520 states to 2161 states and 2520 transitions. [2024-11-25 02:15:20,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2161 states and 2520 transitions. [2024-11-25 02:15:20,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-25 02:15:20,587 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:20,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:20,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:20,674 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-25 02:15:22,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:22,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2537 states to 2163 states and 2537 transitions. [2024-11-25 02:15:22,043 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 2537 transitions. [2024-11-25 02:15:22,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-25 02:15:22,046 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:22,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:22,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:22,187 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-25 02:15:23,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:23,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2565 states to 2191 states and 2565 transitions. [2024-11-25 02:15:23,461 INFO L276 IsEmpty]: Start isEmpty. Operand 2191 states and 2565 transitions. [2024-11-25 02:15:23,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-25 02:15:23,463 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:23,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:23,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:23,544 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-25 02:15:24,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:24,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2572 states to 2193 states and 2572 transitions. [2024-11-25 02:15:24,710 INFO L276 IsEmpty]: Start isEmpty. Operand 2193 states and 2572 transitions. [2024-11-25 02:15:24,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-25 02:15:24,712 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:24,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:24,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:24,796 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-25 02:15:26,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:26,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2599 states to 2221 states and 2599 transitions. [2024-11-25 02:15:26,014 INFO L276 IsEmpty]: Start isEmpty. Operand 2221 states and 2599 transitions. [2024-11-25 02:15:26,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-25 02:15:26,015 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:26,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:26,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:26,526 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-25 02:15:28,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:28,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2646 states to 2260 states and 2646 transitions. [2024-11-25 02:15:28,214 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 2646 transitions. [2024-11-25 02:15:28,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-25 02:15:28,216 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:28,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:28,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:28,605 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 178 proven. 155 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-25 02:15:30,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:30,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2684 states to 2291 states and 2684 transitions. [2024-11-25 02:15:30,175 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 2684 transitions. [2024-11-25 02:15:30,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-25 02:15:30,178 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:30,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:30,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:30,336 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 219 proven. 100 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-25 02:15:32,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:32,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2727 states to 2330 states and 2727 transitions. [2024-11-25 02:15:32,072 INFO L276 IsEmpty]: Start isEmpty. Operand 2330 states and 2727 transitions. [2024-11-25 02:15:32,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-25 02:15:32,074 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:32,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:32,238 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 219 proven. 100 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-25 02:15:32,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:32,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2729 states to 2331 states and 2729 transitions. [2024-11-25 02:15:32,744 INFO L276 IsEmpty]: Start isEmpty. Operand 2331 states and 2729 transitions. [2024-11-25 02:15:32,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-25 02:15:32,745 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:32,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:32,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:33,209 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 186 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-25 02:15:33,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:33,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2737 states to 2337 states and 2737 transitions. [2024-11-25 02:15:33,953 INFO L276 IsEmpty]: Start isEmpty. Operand 2337 states and 2737 transitions. [2024-11-25 02:15:33,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-11-25 02:15:33,955 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:33,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:33,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:34,040 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-25 02:15:34,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:34,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2775 states to 2375 states and 2775 transitions. [2024-11-25 02:15:34,872 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 2775 transitions. [2024-11-25 02:15:34,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-11-25 02:15:34,875 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:34,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:34,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:35,497 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 106 proven. 160 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-25 02:15:37,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:37,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2892 states to 2483 states and 2892 transitions. [2024-11-25 02:15:37,843 INFO L276 IsEmpty]: Start isEmpty. Operand 2483 states and 2892 transitions. [2024-11-25 02:15:37,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-25 02:15:37,844 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:37,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:38,483 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 201 proven. 127 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 02:15:41,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:41,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2942 states to 2523 states and 2942 transitions. [2024-11-25 02:15:41,129 INFO L276 IsEmpty]: Start isEmpty. Operand 2523 states and 2942 transitions. [2024-11-25 02:15:41,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-25 02:15:41,132 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:41,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:41,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:41,644 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 166 proven. 97 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-25 02:15:44,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:44,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2977 states to 2547 states and 2977 transitions. [2024-11-25 02:15:44,223 INFO L276 IsEmpty]: Start isEmpty. Operand 2547 states and 2977 transitions. [2024-11-25 02:15:44,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-25 02:15:44,224 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:44,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:44,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:44,511 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 166 proven. 97 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-25 02:15:45,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:45,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2985 states to 2552 states and 2985 transitions. [2024-11-25 02:15:45,273 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 2985 transitions. [2024-11-25 02:15:45,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-25 02:15:45,276 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:45,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:45,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:45,767 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 166 proven. 97 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-25 02:15:46,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:46,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2985 states to 2553 states and 2985 transitions. [2024-11-25 02:15:46,596 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 2985 transitions. [2024-11-25 02:15:46,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-25 02:15:46,598 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:46,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:46,739 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-25 02:15:48,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:48,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3022 states to 2578 states and 3022 transitions. [2024-11-25 02:15:48,619 INFO L276 IsEmpty]: Start isEmpty. Operand 2578 states and 3022 transitions. [2024-11-25 02:15:48,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-25 02:15:48,622 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:48,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:48,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:48,763 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-25 02:15:49,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:49,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3026 states to 2579 states and 3026 transitions. [2024-11-25 02:15:49,402 INFO L276 IsEmpty]: Start isEmpty. Operand 2579 states and 3026 transitions. [2024-11-25 02:15:49,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-25 02:15:49,404 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:49,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:49,719 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 169 proven. 100 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-25 02:15:51,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:51,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3085 states to 2630 states and 3085 transitions. [2024-11-25 02:15:51,824 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 3085 transitions. [2024-11-25 02:15:51,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-25 02:15:51,825 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:51,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:51,965 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 261 proven. 9 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-25 02:15:54,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:54,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 2666 states and 3124 transitions. [2024-11-25 02:15:54,608 INFO L276 IsEmpty]: Start isEmpty. Operand 2666 states and 3124 transitions. [2024-11-25 02:15:54,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-25 02:15:54,610 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:54,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:54,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:54,703 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-25 02:15:58,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:58,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3201 states to 2721 states and 3201 transitions. [2024-11-25 02:15:58,520 INFO L276 IsEmpty]: Start isEmpty. Operand 2721 states and 3201 transitions. [2024-11-25 02:15:58,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-25 02:15:58,521 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:58,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:58,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:58,602 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-25 02:16:01,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:01,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3262 states to 2778 states and 3262 transitions. [2024-11-25 02:16:01,563 INFO L276 IsEmpty]: Start isEmpty. Operand 2778 states and 3262 transitions. [2024-11-25 02:16:01,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-25 02:16:01,564 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:01,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:01,645 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-25 02:16:02,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:02,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3264 states to 2779 states and 3264 transitions. [2024-11-25 02:16:02,304 INFO L276 IsEmpty]: Start isEmpty. Operand 2779 states and 3264 transitions. [2024-11-25 02:16:02,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-25 02:16:02,306 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:02,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:02,389 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-25 02:16:04,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:04,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3304 states to 2817 states and 3304 transitions. [2024-11-25 02:16:04,172 INFO L276 IsEmpty]: Start isEmpty. Operand 2817 states and 3304 transitions. [2024-11-25 02:16:04,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-25 02:16:04,173 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:04,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:04,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:04,280 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-25 02:16:04,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:04,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3305 states to 2818 states and 3305 transitions. [2024-11-25 02:16:04,870 INFO L276 IsEmpty]: Start isEmpty. Operand 2818 states and 3305 transitions. [2024-11-25 02:16:04,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-25 02:16:04,871 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:04,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:04,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:04,954 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-25 02:16:05,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:05,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3304 states to 2818 states and 3304 transitions. [2024-11-25 02:16:05,778 INFO L276 IsEmpty]: Start isEmpty. Operand 2818 states and 3304 transitions. [2024-11-25 02:16:05,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-25 02:16:05,779 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:05,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:05,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:05,878 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-25 02:16:07,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:07,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3310 states to 2820 states and 3310 transitions. [2024-11-25 02:16:07,211 INFO L276 IsEmpty]: Start isEmpty. Operand 2820 states and 3310 transitions. [2024-11-25 02:16:07,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-25 02:16:07,212 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:07,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:07,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:07,295 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-25 02:16:08,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:08,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3351 states to 2858 states and 3351 transitions. [2024-11-25 02:16:08,850 INFO L276 IsEmpty]: Start isEmpty. Operand 2858 states and 3351 transitions. [2024-11-25 02:16:08,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-25 02:16:08,852 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:08,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:08,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:08,933 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-25 02:16:09,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:09,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3375 states to 2883 states and 3375 transitions. [2024-11-25 02:16:09,380 INFO L276 IsEmpty]: Start isEmpty. Operand 2883 states and 3375 transitions. [2024-11-25 02:16:09,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-25 02:16:09,382 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:09,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:09,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:09,463 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-25 02:16:10,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:10,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3397 states to 2906 states and 3397 transitions. [2024-11-25 02:16:10,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2906 states and 3397 transitions. [2024-11-25 02:16:10,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-25 02:16:10,211 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:10,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:10,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:10,293 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-25 02:16:11,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:11,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3401 states to 2907 states and 3401 transitions. [2024-11-25 02:16:11,148 INFO L276 IsEmpty]: Start isEmpty. Operand 2907 states and 3401 transitions. [2024-11-25 02:16:11,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-25 02:16:11,149 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:11,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:11,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:11,233 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-25 02:16:11,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:11,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3414 states to 2920 states and 3414 transitions. [2024-11-25 02:16:11,899 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 3414 transitions. [2024-11-25 02:16:11,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-25 02:16:11,900 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:11,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:12,097 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 02:16:17,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:17,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3480 states to 2976 states and 3480 transitions. [2024-11-25 02:16:17,148 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 3480 transitions. [2024-11-25 02:16:17,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-25 02:16:17,149 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:17,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:17,513 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 02:16:20,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:20,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3518 states to 3012 states and 3518 transitions. [2024-11-25 02:16:20,134 INFO L276 IsEmpty]: Start isEmpty. Operand 3012 states and 3518 transitions. [2024-11-25 02:16:20,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-25 02:16:20,136 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:20,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:20,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:20,329 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 272 proven. 9 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 02:16:21,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:21,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3526 states to 3021 states and 3526 transitions. [2024-11-25 02:16:21,157 INFO L276 IsEmpty]: Start isEmpty. Operand 3021 states and 3526 transitions. [2024-11-25 02:16:21,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-25 02:16:21,159 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:21,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:21,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:21,445 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-25 02:16:22,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:22,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3533 states to 3027 states and 3533 transitions. [2024-11-25 02:16:22,326 INFO L276 IsEmpty]: Start isEmpty. Operand 3027 states and 3533 transitions. [2024-11-25 02:16:22,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-25 02:16:22,328 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:22,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:22,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:22,755 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 172 proven. 103 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-25 02:16:23,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:23,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3544 states to 3038 states and 3544 transitions. [2024-11-25 02:16:23,760 INFO L276 IsEmpty]: Start isEmpty. Operand 3038 states and 3544 transitions. [2024-11-25 02:16:23,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-25 02:16:23,762 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:23,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:23,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:24,052 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 179 proven. 104 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 02:16:27,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:27,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3585 states to 3070 states and 3585 transitions. [2024-11-25 02:16:27,676 INFO L276 IsEmpty]: Start isEmpty. Operand 3070 states and 3585 transitions. [2024-11-25 02:16:27,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-25 02:16:27,678 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:27,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:27,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:28,919 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 172 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:16:31,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:31,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3622 states to 3106 states and 3622 transitions. [2024-11-25 02:16:31,742 INFO L276 IsEmpty]: Start isEmpty. Operand 3106 states and 3622 transitions. [2024-11-25 02:16:31,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-25 02:16:31,743 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:31,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:31,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:32,232 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 02:16:36,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:36,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3727 states to 3199 states and 3727 transitions. [2024-11-25 02:16:36,404 INFO L276 IsEmpty]: Start isEmpty. Operand 3199 states and 3727 transitions. [2024-11-25 02:16:36,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-25 02:16:36,406 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:36,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:36,691 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 175 proven. 106 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-25 02:16:36,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:36,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3734 states to 3205 states and 3734 transitions. [2024-11-25 02:16:36,939 INFO L276 IsEmpty]: Start isEmpty. Operand 3205 states and 3734 transitions. [2024-11-25 02:16:36,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-25 02:16:36,941 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:36,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:36,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:37,025 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-25 02:16:39,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:39,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3774 states to 3241 states and 3774 transitions. [2024-11-25 02:16:39,313 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 3774 transitions. [2024-11-25 02:16:39,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-25 02:16:39,315 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:39,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:39,399 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-25 02:16:40,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:40,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3790 states to 3257 states and 3790 transitions. [2024-11-25 02:16:40,098 INFO L276 IsEmpty]: Start isEmpty. Operand 3257 states and 3790 transitions. [2024-11-25 02:16:40,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-11-25 02:16:40,100 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:40,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:40,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:40,186 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2024-11-25 02:16:41,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:41,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3806 states to 3273 states and 3806 transitions. [2024-11-25 02:16:41,073 INFO L276 IsEmpty]: Start isEmpty. Operand 3273 states and 3806 transitions. [2024-11-25 02:16:41,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-25 02:16:41,075 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:41,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:41,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:41,165 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-25 02:16:42,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:42,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3817 states to 3284 states and 3817 transitions. [2024-11-25 02:16:42,249 INFO L276 IsEmpty]: Start isEmpty. Operand 3284 states and 3817 transitions. [2024-11-25 02:16:42,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-25 02:16:42,251 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:42,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:42,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:42,541 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 186 proven. 111 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 02:16:44,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:44,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3847 states to 3314 states and 3847 transitions. [2024-11-25 02:16:44,665 INFO L276 IsEmpty]: Start isEmpty. Operand 3314 states and 3847 transitions. [2024-11-25 02:16:44,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-11-25 02:16:44,669 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:44,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:44,884 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 179 proven. 107 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-25 02:16:45,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:45,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3859 states to 3326 states and 3859 transitions. [2024-11-25 02:16:45,687 INFO L276 IsEmpty]: Start isEmpty. Operand 3326 states and 3859 transitions. [2024-11-25 02:16:45,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-25 02:16:45,690 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:45,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:45,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:45,890 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-11-25 02:16:47,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:47,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3875 states to 3340 states and 3875 transitions. [2024-11-25 02:16:47,294 INFO L276 IsEmpty]: Start isEmpty. Operand 3340 states and 3875 transitions. [2024-11-25 02:16:47,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-25 02:16:47,296 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:47,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:47,782 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 185 proven. 152 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-25 02:16:49,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:49,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3898 states to 3361 states and 3898 transitions. [2024-11-25 02:16:49,340 INFO L276 IsEmpty]: Start isEmpty. Operand 3361 states and 3898 transitions. [2024-11-25 02:16:49,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-25 02:16:49,344 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:49,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:49,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:49,431 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-11-25 02:16:50,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:50,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3917 states to 3381 states and 3917 transitions. [2024-11-25 02:16:50,973 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 3917 transitions. [2024-11-25 02:16:50,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-25 02:16:50,975 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:50,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:51,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:51,273 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 189 proven. 114 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-25 02:16:51,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:51,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3921 states to 3384 states and 3921 transitions. [2024-11-25 02:16:51,557 INFO L276 IsEmpty]: Start isEmpty. Operand 3384 states and 3921 transitions. [2024-11-25 02:16:51,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-25 02:16:51,560 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:51,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:52,270 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 125 proven. 170 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-25 02:16:58,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:58,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4068 states to 3513 states and 4068 transitions. [2024-11-25 02:16:58,955 INFO L276 IsEmpty]: Start isEmpty. Operand 3513 states and 4068 transitions. [2024-11-25 02:16:58,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-25 02:16:58,957 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:58,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:59,621 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 188 proven. 154 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-25 02:17:02,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:02,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4096 states to 3540 states and 4096 transitions. [2024-11-25 02:17:02,517 INFO L276 IsEmpty]: Start isEmpty. Operand 3540 states and 4096 transitions. [2024-11-25 02:17:02,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-11-25 02:17:02,519 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:02,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:17:02,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:02,733 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-25 02:17:05,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:05,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4129 states to 3567 states and 4129 transitions. [2024-11-25 02:17:05,080 INFO L276 IsEmpty]: Start isEmpty. Operand 3567 states and 4129 transitions. [2024-11-25 02:17:05,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-11-25 02:17:05,082 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:05,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:17:05,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:05,959 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 237 proven. 185 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-25 02:17:10,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:10,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4255 states to 3676 states and 4255 transitions. [2024-11-25 02:17:10,865 INFO L276 IsEmpty]: Start isEmpty. Operand 3676 states and 4255 transitions. [2024-11-25 02:17:10,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-25 02:17:10,867 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:10,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:17:10,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:11,974 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 02:17:16,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:16,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4314 states to 3724 states and 4314 transitions. [2024-11-25 02:17:16,696 INFO L276 IsEmpty]: Start isEmpty. Operand 3724 states and 4314 transitions. [2024-11-25 02:17:16,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-25 02:17:16,698 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:16,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:17:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:17,213 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 02:17:19,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:19,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4339 states to 3744 states and 4339 transitions. [2024-11-25 02:17:19,362 INFO L276 IsEmpty]: Start isEmpty. Operand 3744 states and 4339 transitions. [2024-11-25 02:17:19,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-25 02:17:19,364 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:19,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:17:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:19,893 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 298 proven. 152 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 02:17:20,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:20,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4351 states to 3753 states and 4351 transitions. [2024-11-25 02:17:20,840 INFO L276 IsEmpty]: Start isEmpty. Operand 3753 states and 4351 transitions. [2024-11-25 02:17:20,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-25 02:17:20,844 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:20,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:17:20,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:21,804 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 200 proven. 180 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-25 02:17:25,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:26,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4458 states to 3849 states and 4458 transitions. [2024-11-25 02:17:26,000 INFO L276 IsEmpty]: Start isEmpty. Operand 3849 states and 4458 transitions. [2024-11-25 02:17:26,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-11-25 02:17:26,003 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:26,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:17:26,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:26,517 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 369 proven. 9 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-25 02:17:30,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:30,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4480 states to 3867 states and 4480 transitions. [2024-11-25 02:17:30,115 INFO L276 IsEmpty]: Start isEmpty. Operand 3867 states and 4480 transitions. [2024-11-25 02:17:30,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2024-11-25 02:17:30,117 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:30,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:17:30,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:30,256 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 368 proven. 105 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-25 02:17:31,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:31,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4489 states to 3872 states and 4489 transitions. [2024-11-25 02:17:31,765 INFO L276 IsEmpty]: Start isEmpty. Operand 3872 states and 4489 transitions. [2024-11-25 02:17:31,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-25 02:17:31,767 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:31,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:17:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:31,907 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-25 02:17:32,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:32,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4515 states to 3898 states and 4515 transitions. [2024-11-25 02:17:32,432 INFO L276 IsEmpty]: Start isEmpty. Operand 3898 states and 4515 transitions. [2024-11-25 02:17:32,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-25 02:17:32,434 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:32,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:17:32,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:32,575 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-25 02:17:35,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:35,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4526 states to 3907 states and 4526 transitions. [2024-11-25 02:17:35,046 INFO L276 IsEmpty]: Start isEmpty. Operand 3907 states and 4526 transitions. [2024-11-25 02:17:35,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-25 02:17:35,049 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:35,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:17:35,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:36,092 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 279 proven. 206 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-25 02:17:44,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:44,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4590 states to 3963 states and 4590 transitions. [2024-11-25 02:17:44,378 INFO L276 IsEmpty]: Start isEmpty. Operand 3963 states and 4590 transitions. [2024-11-25 02:17:44,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-25 02:17:44,381 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 155 iterations. [2024-11-25 02:17:44,396 INFO L726 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-11-25 02:18:32,295 INFO L77 FloydHoareUtils]: At program point L102(lines 102 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-25 02:18:32,296 INFO L77 FloydHoareUtils]: At program point L598(line 598) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse7 (not .cse9)) (.cse4 (not (= ~a17~0 1))) (.cse2 (= ~a12~0 8)) (.cse1 (not .cse6)) (.cse8 (= ~a16~0 4)) (.cse5 (= ~a21~0 1)) (.cse3 (= 5 ~a16~0)) (.cse0 (= ~a8~0 13))) (or (and (not (= 14 ~a8~0)) (not .cse0)) (and .cse1 .cse0) (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (not .cse2)) (and .cse7 .cse0) (and .cse7 .cse2 .cse4 .cse5 .cse8) (and .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse1 .cse5 .cse9 .cse8) (and (not .cse5) .cse0) (and (not .cse3) .cse0)))) [2024-11-25 02:18:32,296 INFO L77 FloydHoareUtils]: At program point L334(lines 334 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 02:18:32,296 INFO L77 FloydHoareUtils]: At program point L302(lines 302 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 02:18:32,297 INFO L77 FloydHoareUtils]: At program point L170(lines 170 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-25 02:18:32,297 INFO L77 FloydHoareUtils]: At program point L204(lines 204 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-25 02:18:32,297 INFO L77 FloydHoareUtils]: At program point L72(lines 72 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse7 (not .cse9)) (.cse4 (not (= ~a17~0 1))) (.cse2 (= ~a12~0 8)) (.cse1 (not .cse6)) (.cse8 (= ~a16~0 4)) (.cse5 (= ~a21~0 1)) (.cse3 (= 5 ~a16~0)) (.cse0 (= ~a8~0 13))) (or (and (not (= 14 ~a8~0)) (not .cse0)) (and .cse1 .cse0) (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (not .cse2)) (and .cse7 .cse0) (and .cse7 .cse2 .cse4 .cse5 .cse8) (and .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse1 .cse5 .cse9 .cse8) (and (not .cse5) .cse0) (and (not .cse3) .cse0)))) [2024-11-25 02:18:32,298 INFO L77 FloydHoareUtils]: At program point L271(lines 271 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 02:18:32,298 INFO L77 FloydHoareUtils]: At program point L139(lines 139 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-25 02:18:32,298 INFO L77 FloydHoareUtils]: At program point L371(lines 371 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 02:18:32,299 INFO L77 FloydHoareUtils]: At program point L107(lines 107 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-25 02:18:32,299 INFO L77 FloydHoareUtils]: At program point L41(lines 41 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse7 (not .cse9)) (.cse4 (not (= ~a17~0 1))) (.cse2 (= ~a12~0 8)) (.cse1 (not .cse6)) (.cse8 (= ~a16~0 4)) (.cse5 (= ~a21~0 1)) (.cse3 (= 5 ~a16~0)) (.cse0 (= ~a8~0 13))) (or (and (not (= 14 ~a8~0)) (not .cse0)) (and .cse1 .cse0) (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (not .cse2)) (and .cse7 .cse0) (and .cse7 .cse2 .cse4 .cse5 .cse8) (and .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse1 .cse5 .cse9 .cse8) (and (not .cse5) .cse0) (and (not .cse3) .cse0)))) [2024-11-25 02:18:32,299 INFO L77 FloydHoareUtils]: At program point L339(lines 339 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 02:18:32,299 INFO L77 FloydHoareUtils]: At program point L207(lines 207 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 02:18:32,300 INFO L77 FloydHoareUtils]: At program point L75(lines 75 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse7 (not .cse9)) (.cse4 (not (= ~a17~0 1))) (.cse2 (= ~a12~0 8)) (.cse1 (not .cse6)) (.cse8 (= ~a16~0 4)) (.cse5 (= ~a21~0 1)) (.cse3 (= 5 ~a16~0)) (.cse0 (= ~a8~0 13))) (or (and (not (= 14 ~a8~0)) (not .cse0)) (and .cse1 .cse0) (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (not .cse2)) (and .cse7 .cse0) (and .cse7 .cse2 .cse4 .cse5 .cse8) (and .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse1 .cse5 .cse9 .cse8) (and (not .cse5) .cse0) (and (not .cse3) .cse0)))) [2024-11-25 02:18:32,300 INFO L77 FloydHoareUtils]: At program point L373(lines 373 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 02:18:32,300 INFO L77 FloydHoareUtils]: At program point L241(lines 241 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 02:18:32,300 INFO L77 FloydHoareUtils]: At program point L175(lines 175 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-25 02:18:32,301 INFO L77 FloydHoareUtils]: At program point L275(lines 275 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 02:18:32,301 INFO L77 FloydHoareUtils]: At program point L375(lines 375 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 02:18:32,301 INFO L77 FloydHoareUtils]: At program point L309(lines 309 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 02:18:32,301 INFO L77 FloydHoareUtils]: At program point L45(lines 45 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse7 (not .cse9)) (.cse4 (not (= ~a17~0 1))) (.cse2 (= ~a12~0 8)) (.cse1 (not .cse6)) (.cse8 (= ~a16~0 4)) (.cse5 (= ~a21~0 1)) (.cse3 (= 5 ~a16~0)) (.cse0 (= ~a8~0 13))) (or (and (not (= 14 ~a8~0)) (not .cse0)) (and .cse1 .cse0) (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (not .cse2)) (and .cse7 .cse0) (and .cse7 .cse2 .cse4 .cse5 .cse8) (and .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse1 .cse5 .cse9 .cse8) (and (not .cse5) .cse0) (and (not .cse3) .cse0)))) [2024-11-25 02:18:32,301 INFO L77 FloydHoareUtils]: At program point L343(lines 343 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 02:18:32,302 INFO L77 FloydHoareUtils]: At program point L112(lines 112 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-25 02:18:32,302 INFO L77 FloydHoareUtils]: At program point L278(lines 278 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 02:18:32,302 INFO L77 FloydHoareUtils]: At program point L146(lines 146 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-25 02:18:32,303 INFO L77 FloydHoareUtils]: At program point L213(lines 213 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 02:18:32,303 INFO L77 FloydHoareUtils]: At program point L82(lines 82 400) the Hoare annotation is: (let ((.cse5 (= ~a21~0 1)) (.cse9 (= ~a20~0 1)) (.cse6 (= ~a7~0 1))) (let ((.cse0 (not .cse6)) (.cse8 (= ~a16~0 4)) (.cse11 (<= 15 ~a8~0)) (.cse7 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse4 (not (= ~a17~0 1))) (.cse13 (= 14 ~a8~0)) (.cse10 (= ~a8~0 15)) (.cse12 (not .cse5)) (.cse3 (= 5 ~a16~0)) (.cse1 (= ~a8~0 13))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 (not .cse2)) (and .cse7 .cse1) (and .cse7 .cse2 .cse4 .cse5 .cse8) (and .cse2 .cse0 .cse5 .cse9 .cse8) (and (not (and .cse2 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse11) (and .cse12 .cse11) (and (<= ~a16~0 4) .cse11) (and (not (and .cse7 (<= ~a16~0 5))) .cse11) (and .cse7 .cse2 .cse13 .cse3 .cse4 .cse5) (and (not .cse13) (not .cse1) (< ~a8~0 15)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and .cse12 .cse1) (and (not .cse3) .cse1)))) [2024-11-25 02:18:32,303 INFO L77 FloydHoareUtils]: At program point L347(lines 347 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 02:18:32,303 INFO L77 FloydHoareUtils]: At program point L248(lines 248 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 02:18:32,304 INFO L77 FloydHoareUtils]: At program point L183(lines 183 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-25 02:18:32,304 INFO L77 FloydHoareUtils]: At program point L150(lines 150 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-25 02:18:32,304 INFO L77 FloydHoareUtils]: At program point L382(lines 382 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 02:18:32,304 INFO L77 FloydHoareUtils]: At program point L316(lines 316 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 02:18:32,305 INFO L77 FloydHoareUtils]: At program point L283(lines 283 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 02:18:32,305 INFO L77 FloydHoareUtils]: At program point L118(lines 118 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-25 02:18:32,305 INFO L77 FloydHoareUtils]: At program point L482-1(lines 40 585) the Hoare annotation is: (not (= 14 ~a8~0)) [2024-11-25 02:18:32,305 INFO L77 FloydHoareUtils]: At program point L218(lines 218 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 02:18:32,305 INFO L77 FloydHoareUtils]: At program point L53(lines 53 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse7 (not .cse9)) (.cse4 (not (= ~a17~0 1))) (.cse2 (= ~a12~0 8)) (.cse1 (not .cse6)) (.cse8 (= ~a16~0 4)) (.cse5 (= ~a21~0 1)) (.cse3 (= 5 ~a16~0)) (.cse0 (= ~a8~0 13))) (or (and (not (= 14 ~a8~0)) (not .cse0)) (and .cse1 .cse0) (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (not .cse2)) (and .cse7 .cse0) (and .cse7 .cse2 .cse4 .cse5 .cse8) (and .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse1 .cse5 .cse9 .cse8) (and (not .cse5) .cse0) (and (not .cse3) .cse0)))) [2024-11-25 02:18:32,306 INFO L77 FloydHoareUtils]: At program point L154(lines 154 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-25 02:18:32,306 INFO L77 FloydHoareUtils]: At program point L485-1(lines 40 585) the Hoare annotation is: (not (let ((.cse1 (= 5 ~a16~0)) (.cse4 (= ~a17~0 1)) (.cse0 (= ~a12~0 8)) (.cse2 (not (= ~a7~0 1))) (.cse3 (= ~a21~0 1)) (.cse5 (= ~a20~0 1))) (and (not (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~a20~0 ~a7~0))) (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)) (= 14 ~a8~0) (not (and .cse0 (= ~a16~0 6) .cse2 .cse3 .cse5 (= ~a17~0 ~a7~0)))))) [2024-11-25 02:18:32,306 INFO L77 FloydHoareUtils]: At program point L188(lines 188 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-25 02:18:32,306 INFO L75 FloydHoareUtils]: For program point L486(line 486) no Hoare annotation was computed. [2024-11-25 02:18:32,306 INFO L77 FloydHoareUtils]: At program point L387(lines 387 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 02:18:32,306 INFO L77 FloydHoareUtils]: At program point L288(lines 288 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 02:18:32,306 INFO L77 FloydHoareUtils]: At program point L255(lines 255 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 02:18:32,307 INFO L77 FloydHoareUtils]: At program point L90(lines 90 400) the Hoare annotation is: (let ((.cse5 (= ~a21~0 1)) (.cse9 (= ~a20~0 1)) (.cse6 (= ~a7~0 1))) (let ((.cse0 (not .cse6)) (.cse8 (= ~a16~0 4)) (.cse11 (<= 15 ~a8~0)) (.cse7 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse4 (not (= ~a17~0 1))) (.cse13 (= 14 ~a8~0)) (.cse10 (= ~a8~0 15)) (.cse12 (not .cse5)) (.cse3 (= 5 ~a16~0)) (.cse1 (= ~a8~0 13))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 (not .cse2)) (and .cse7 .cse1) (and .cse7 .cse2 .cse4 .cse5 .cse8) (and .cse2 .cse0 .cse5 .cse9 .cse8) (and (not (and .cse2 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse11) (and .cse12 .cse11) (and (<= ~a16~0 4) .cse11) (and (not (and .cse7 (<= ~a16~0 5))) .cse11) (and .cse7 .cse2 .cse13 .cse3 .cse4 .cse5) (and (not .cse13) (not .cse1) (< ~a8~0 15)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and .cse12 .cse1) (and (not .cse3) .cse1)))) [2024-11-25 02:18:32,307 INFO L77 FloydHoareUtils]: At program point L355(lines 355 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 02:18:32,307 INFO L77 FloydHoareUtils]: At program point L322(lines 322 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 02:18:32,307 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-25 02:18:32,307 INFO L77 FloydHoareUtils]: At program point L124(lines 124 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-25 02:18:32,307 INFO L77 FloydHoareUtils]: At program point L587(lines 587 604) the Hoare annotation is: true [2024-11-25 02:18:32,307 INFO L77 FloydHoareUtils]: At program point L224(lines 224 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 02:18:32,308 INFO L77 FloydHoareUtils]: At program point L158(lines 158 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-25 02:18:32,308 INFO L77 FloydHoareUtils]: At program point L59(lines 59 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse7 (not .cse9)) (.cse4 (not (= ~a17~0 1))) (.cse2 (= ~a12~0 8)) (.cse1 (not .cse6)) (.cse8 (= ~a16~0 4)) (.cse5 (= ~a21~0 1)) (.cse3 (= 5 ~a16~0)) (.cse0 (= ~a8~0 13))) (or (and (not (= 14 ~a8~0)) (not .cse0)) (and .cse1 .cse0) (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (not .cse2)) (and .cse7 .cse0) (and .cse7 .cse2 .cse4 .cse5 .cse8) (and .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse1 .cse5 .cse9 .cse8) (and (not .cse5) .cse0) (and (not .cse3) .cse0)))) [2024-11-25 02:18:32,308 INFO L77 FloydHoareUtils]: At program point L94(lines 94 400) the Hoare annotation is: (let ((.cse5 (= ~a21~0 1)) (.cse9 (= ~a20~0 1)) (.cse6 (= ~a7~0 1))) (let ((.cse0 (not .cse6)) (.cse8 (= ~a16~0 4)) (.cse11 (<= 15 ~a8~0)) (.cse7 (not .cse9)) (.cse2 (= ~a12~0 8)) (.cse4 (not (= ~a17~0 1))) (.cse13 (= 14 ~a8~0)) (.cse10 (= ~a8~0 15)) (.cse12 (not .cse5)) (.cse3 (= 5 ~a16~0)) (.cse1 (= ~a8~0 13))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 (not .cse2)) (and .cse7 .cse1) (and .cse7 .cse2 .cse4 .cse5 .cse8) (and .cse2 .cse0 .cse5 .cse9 .cse8) (and (not (and .cse2 .cse10 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse11) (and .cse12 .cse11) (and (<= ~a16~0 4) .cse11) (and (not (and .cse7 (<= ~a16~0 5))) .cse11) (and .cse7 .cse2 .cse13 .cse3 .cse4 .cse5) (and (not .cse13) (not .cse1) (< ~a8~0 15)) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse10) (and .cse12 .cse1) (and (not .cse3) .cse1)))) [2024-11-25 02:18:32,308 INFO L77 FloydHoareUtils]: At program point L392(lines 392 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 02:18:32,308 INFO L77 FloydHoareUtils]: At program point L326(lines 326 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 02:18:32,308 INFO L77 FloydHoareUtils]: At program point L260(lines 260 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 02:18:32,308 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-25 02:18:32,308 INFO L77 FloydHoareUtils]: At program point L228(lines 228 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 02:18:32,309 INFO L77 FloydHoareUtils]: At program point L162(lines 162 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-25 02:18:32,309 INFO L77 FloydHoareUtils]: At program point L129(lines 129 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-25 02:18:32,310 INFO L77 FloydHoareUtils]: At program point L328(lines 328 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 02:18:32,310 INFO L77 FloydHoareUtils]: At program point L196(lines 196 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-25 02:18:32,310 INFO L77 FloydHoareUtils]: At program point L64(lines 64 400) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse7 (not .cse9)) (.cse4 (not (= ~a17~0 1))) (.cse2 (= ~a12~0 8)) (.cse1 (not .cse6)) (.cse8 (= ~a16~0 4)) (.cse5 (= ~a21~0 1)) (.cse3 (= 5 ~a16~0)) (.cse0 (= ~a8~0 13))) (or (and (not (= 14 ~a8~0)) (not .cse0)) (and .cse1 .cse0) (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (not .cse2)) (and .cse7 .cse0) (and .cse7 .cse2 .cse4 .cse5 .cse8) (and .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse1 .cse5 .cse9 .cse8) (and (not .cse5) .cse0) (and (not .cse3) .cse0)))) [2024-11-25 02:18:32,310 INFO L77 FloydHoareUtils]: At program point L593-2(lines 593 603) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse7 (not .cse9)) (.cse4 (not (= ~a17~0 1))) (.cse2 (= ~a12~0 8)) (.cse1 (not .cse6)) (.cse8 (= ~a16~0 4)) (.cse5 (= ~a21~0 1)) (.cse3 (= 5 ~a16~0)) (.cse0 (= ~a8~0 13))) (or (and (not (= 14 ~a8~0)) (not .cse0)) (and .cse1 .cse0) (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (not .cse2)) (and .cse7 .cse0) (and .cse7 .cse2 .cse4 .cse5 .cse8) (and .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse1 .cse5 .cse9 .cse8) (and (not .cse5) .cse0) (and (not .cse3) .cse0)))) [2024-11-25 02:18:32,311 INFO L77 FloydHoareUtils]: At program point L296(lines 296 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 02:18:32,311 INFO L77 FloydHoareUtils]: At program point calculate_output_returnLabel#1(lines 40 585) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1)) (.cse9 (= ~a20~0 1))) (let ((.cse7 (not .cse9)) (.cse4 (not (= ~a17~0 1))) (.cse2 (= ~a12~0 8)) (.cse1 (not .cse6)) (.cse8 (= ~a16~0 4)) (.cse5 (= ~a21~0 1)) (.cse3 (= 5 ~a16~0)) (.cse0 (= ~a8~0 13))) (or (and (not (= 14 ~a8~0)) (not .cse0)) (and .cse1 .cse0) (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (not .cse2)) (and .cse7 .cse0) (and .cse7 .cse2 .cse4 .cse5 .cse8) (and .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse1 .cse5 .cse9 .cse8) (and (not .cse5) .cse0) (and (not .cse3) .cse0)))) [2024-11-25 02:18:32,311 INFO L75 FloydHoareUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 486) no Hoare annotation was computed. [2024-11-25 02:18:32,311 INFO L77 FloydHoareUtils]: At program point L363(lines 363 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 02:18:32,312 INFO L77 FloydHoareUtils]: At program point L199(lines 199 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-25 02:18:32,312 INFO L77 FloydHoareUtils]: At program point L365(lines 365 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 02:18:32,312 INFO L77 FloydHoareUtils]: At program point L266(lines 266 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 02:18:32,312 INFO L77 FloydHoareUtils]: At program point L233(lines 233 400) the Hoare annotation is: (not (let ((.cse3 (= ~a20~0 1))) (let ((.cse1 (= ~a7~0 1)) (.cse4 (= ~a16~0 4)) (.cse7 (not .cse3)) (.cse0 (= ~a12~0 8)) (.cse5 (= 5 ~a16~0)) (.cse6 (not (= ~a17~0 1))) (.cse2 (= ~a21~0 1))) (and (not (and .cse0 (not .cse1) .cse2 .cse3 .cse4)) (= 14 ~a8~0) (not (and .cse0 .cse5 .cse6 .cse2 .cse1)) (not (and .cse7 .cse0 .cse6 .cse2 .cse4)) (not (and .cse7 .cse0 .cse5 .cse6 .cse2)))))) [2024-11-25 02:18:32,312 INFO L77 FloydHoareUtils]: At program point L134(lines 134 400) the Hoare annotation is: (let ((.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a7~0 1)) (.cse6 (= ~a16~0 4)) (.cse5 (not .cse7)) (.cse0 (= ~a12~0 8)) (.cse10 (= 14 ~a8~0)) (.cse1 (= 5 ~a16~0)) (.cse3 (= ~a21~0 1)) (.cse2 (not (= ~a17~0 1))) (.cse9 (<= 15 ~a8~0)) (.cse8 (= ~a8~0 15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 (not .cse4) .cse3 .cse7 .cse6) (and (not (and .cse0 .cse3 .cse8 (= ~a20~0 ~a7~0) (= ~a17~0 ~a7~0))) .cse9) (and (<= ~a16~0 4) .cse9) (and (not .cse10) (< ~a8~0 15)) (and .cse5 .cse0 .cse10 .cse1 .cse2 .cse3) (and (not (and .cse2 (<= ~a16~0 5))) .cse9) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 5)) .cse8)))) [2024-11-25 02:18:32,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 25.11 02:18:32 ImpRootNode [2024-11-25 02:18:32,328 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-25 02:18:32,328 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-25 02:18:32,328 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-25 02:18:32,329 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-25 02:18:32,329 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 02:13:44" (3/4) ... [2024-11-25 02:18:32,331 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-25 02:18:32,345 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 120 nodes and edges [2024-11-25 02:18:32,346 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-25 02:18:32,347 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-25 02:18:32,348 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-25 02:18:32,516 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0e91e0-a116-4396-a832-304bae3cb842/bin/ukojak-verify-ENZ3QT5qd3/witness.graphml [2024-11-25 02:18:32,516 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0e91e0-a116-4396-a832-304bae3cb842/bin/ukojak-verify-ENZ3QT5qd3/witness.yml [2024-11-25 02:18:32,516 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-25 02:18:32,520 INFO L158 Benchmark]: Toolchain (without parser) took 290133.27ms. Allocated memory was 117.4MB in the beginning and 3.3GB in the end (delta: 3.2GB). Free memory was 93.0MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 630.6MB. Max. memory is 16.1GB. [2024-11-25 02:18:32,520 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 167.8MB. Free memory is still 102.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 02:18:32,520 INFO L158 Benchmark]: CACSL2BoogieTranslator took 618.15ms. Allocated memory is still 117.4MB. Free memory was 93.0MB in the beginning and 66.1MB in the end (delta: 26.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-25 02:18:32,521 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.71ms. Allocated memory is still 117.4MB. Free memory was 66.1MB in the beginning and 60.8MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-25 02:18:32,521 INFO L158 Benchmark]: Boogie Preprocessor took 62.78ms. Allocated memory is still 117.4MB. Free memory was 60.8MB in the beginning and 56.3MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 02:18:32,521 INFO L158 Benchmark]: RCFGBuilder took 1827.56ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 56.3MB in the beginning and 259.0MB in the end (delta: -202.7MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. [2024-11-25 02:18:32,521 INFO L158 Benchmark]: CodeCheck took 287352.45ms. Allocated memory was 352.3MB in the beginning and 3.3GB in the end (delta: 2.9GB). Free memory was 259.0MB in the beginning and 2.6GB in the end (delta: -2.4GB). Peak memory consumption was 553.8MB. Max. memory is 16.1GB. [2024-11-25 02:18:32,522 INFO L158 Benchmark]: Witness Printer took 188.15ms. Allocated memory is still 3.3GB. Free memory was 2.6GB in the beginning and 2.6GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-25 02:18:32,523 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 239.4s, OverallIterations: 155, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 577732 SdHoareTripleChecker+Valid, 1515.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 575260 mSDsluCounter, 79705 SdHoareTripleChecker+Invalid, 1295.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 68003 mSDsCounter, 99189 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1209314 IncrementalHoareTripleChecker+Invalid, 1308503 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 99189 mSolverCounterUnsat, 11702 mSDtfsCounter, 1209314 mSolverCounterSat, 12.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 199010 GetRequests, 190691 SyntacticMatches, 6943 SemanticMatches, 1376 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1222725 ImplicationChecksByTransitivity, 169.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 1.1s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 37.7s InterpolantComputationTime, 29738 NumberOfCodeBlocks, 29738 NumberOfCodeBlocksAsserted, 154 NumberOfCheckSat, 29584 ConstructedInterpolants, 0 QuantifiedInterpolants, 158253 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 154 InterpolantComputations, 78 PerfectInterpolantSequences, 29382/34852 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: 486]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 40]: Location Invariant Derived location invariant: (((((((((((14 != a8) && (a8 != 13)) || ((a7 != 1) && (a8 == 13))) || (((((a12 == 8) && (5 == a16)) && (a17 != 1)) && (a21 == 1)) && (a7 == 1))) || ((a8 == 13) && (a12 != 8))) || ((a20 != 1) && (a8 == 13))) || (((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a21 == 1)) && (a16 == 4))) || (((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1))) || (((((a12 == 8) && (a7 != 1)) && (a21 == 1)) && (a20 == 1)) && (a16 == 4))) || ((a21 != 1) && (a8 == 13))) || ((5 != a16) && (a8 == 13))) - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: (((((((((((14 != a8) && (a8 != 13)) || ((a7 != 1) && (a8 == 13))) || (((((a12 == 8) && (5 == a16)) && (a17 != 1)) && (a21 == 1)) && (a7 == 1))) || ((a8 == 13) && (a12 != 8))) || ((a20 != 1) && (a8 == 13))) || (((((a20 != 1) && (a12 == 8)) && (a17 != 1)) && (a21 == 1)) && (a16 == 4))) || (((((a20 != 1) && (a12 == 8)) && (5 == a16)) && (a17 != 1)) && (a21 == 1))) || (((((a12 == 8) && (a7 != 1)) && (a21 == 1)) && (a20 == 1)) && (a16 == 4))) || ((a21 != 1) && (a8 == 13))) || ((5 != a16) && (a8 == 13))) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39ms. Allocated memory is still 167.8MB. Free memory is still 102.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 618.15ms. Allocated memory is still 117.4MB. Free memory was 93.0MB in the beginning and 66.1MB in the end (delta: 26.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.71ms. Allocated memory is still 117.4MB. Free memory was 66.1MB in the beginning and 60.8MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.78ms. Allocated memory is still 117.4MB. Free memory was 60.8MB in the beginning and 56.3MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1827.56ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 56.3MB in the beginning and 259.0MB in the end (delta: -202.7MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. * CodeCheck took 287352.45ms. Allocated memory was 352.3MB in the beginning and 3.3GB in the end (delta: 2.9GB). Free memory was 259.0MB in the beginning and 2.6GB in the end (delta: -2.4GB). Peak memory consumption was 553.8MB. Max. memory is 16.1GB. * Witness Printer took 188.15ms. Allocated memory is still 3.3GB. Free memory was 2.6GB in the beginning and 2.6GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be correct! [2024-11-25 02:18:32,550 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce0e91e0-a116-4396-a832-304bae3cb842/bin/ukojak-verify-ENZ3QT5qd3/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