./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label57.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984ff5e-943a-4ea2-a66a-095c3d6c0941/bin/ukojak-verify-Qdu7aM0XO9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984ff5e-943a-4ea2-a66a-095c3d6c0941/bin/ukojak-verify-Qdu7aM0XO9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984ff5e-943a-4ea2-a66a-095c3d6c0941/bin/ukojak-verify-Qdu7aM0XO9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984ff5e-943a-4ea2-a66a-095c3d6c0941/bin/ukojak-verify-Qdu7aM0XO9/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label57.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984ff5e-943a-4ea2-a66a-095c3d6c0941/bin/ukojak-verify-Qdu7aM0XO9/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984ff5e-943a-4ea2-a66a-095c3d6c0941/bin/ukojak-verify-Qdu7aM0XO9 --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 0128e00bf508dfedd424bfda3d692f75ea10f378731858e87047f02277f2ca04 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 23:43:12,213 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 23:43:12,279 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984ff5e-943a-4ea2-a66a-095c3d6c0941/bin/ukojak-verify-Qdu7aM0XO9/config/svcomp-Reach-32bit-Kojak_Default.epf [2023-12-02 23:43:12,283 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 23:43:12,284 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2023-12-02 23:43:12,306 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 23:43:12,307 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 23:43:12,308 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2023-12-02 23:43:12,308 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 23:43:12,309 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 23:43:12,310 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 23:43:12,310 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 23:43:12,310 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 23:43:12,311 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 23:43:12,311 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 23:43:12,312 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 23:43:12,312 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 23:43:12,313 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 23:43:12,313 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 23:43:12,314 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 23:43:12,314 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 23:43:12,315 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 23:43:12,316 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2023-12-02 23:43:12,316 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2023-12-02 23:43:12,316 INFO L153 SettingsManager]: * Theory for external solver=ALL [2023-12-02 23:43:12,317 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 23:43:12,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-12-02 23:43:12,318 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 23:43:12,318 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 23:43:12,318 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 23:43:12,319 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2023-12-02 23:43:12,319 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 23:43:12,325 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 23:43:12,325 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984ff5e-943a-4ea2-a66a-095c3d6c0941/bin/ukojak-verify-Qdu7aM0XO9/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984ff5e-943a-4ea2-a66a-095c3d6c0941/bin/ukojak-verify-Qdu7aM0XO9 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 -> 0128e00bf508dfedd424bfda3d692f75ea10f378731858e87047f02277f2ca04 [2023-12-02 23:43:12,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 23:43:12,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 23:43:12,573 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 23:43:12,574 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 23:43:12,575 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 23:43:12,576 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984ff5e-943a-4ea2-a66a-095c3d6c0941/bin/ukojak-verify-Qdu7aM0XO9/../../sv-benchmarks/c/eca-rers2012/Problem01_label57.c [2023-12-02 23:43:15,284 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 23:43:15,523 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 23:43:15,524 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984ff5e-943a-4ea2-a66a-095c3d6c0941/sv-benchmarks/c/eca-rers2012/Problem01_label57.c [2023-12-02 23:43:15,537 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984ff5e-943a-4ea2-a66a-095c3d6c0941/bin/ukojak-verify-Qdu7aM0XO9/data/569dae415/5b09d10800704aa5a3f88b86cbc16a75/FLAGb905bdcbb [2023-12-02 23:43:15,549 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984ff5e-943a-4ea2-a66a-095c3d6c0941/bin/ukojak-verify-Qdu7aM0XO9/data/569dae415/5b09d10800704aa5a3f88b86cbc16a75 [2023-12-02 23:43:15,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 23:43:15,552 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 23:43:15,554 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 23:43:15,554 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 23:43:15,557 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 23:43:15,558 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:43:15" (1/1) ... [2023-12-02 23:43:15,559 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@338011cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:43:15, skipping insertion in model container [2023-12-02 23:43:15,559 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:43:15" (1/1) ... [2023-12-02 23:43:15,614 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 23:43:15,840 WARN L240 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_e984ff5e-943a-4ea2-a66a-095c3d6c0941/sv-benchmarks/c/eca-rers2012/Problem01_label57.c[15253,15266] [2023-12-02 23:43:15,882 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 23:43:15,894 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 23:43:15,967 WARN L240 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_e984ff5e-943a-4ea2-a66a-095c3d6c0941/sv-benchmarks/c/eca-rers2012/Problem01_label57.c[15253,15266] [2023-12-02 23:43:15,989 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 23:43:16,006 INFO L206 MainTranslator]: Completed translation [2023-12-02 23:43:16,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:43:16 WrapperNode [2023-12-02 23:43:16,007 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 23:43:16,008 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 23:43:16,008 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 23:43:16,008 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 23:43:16,016 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:43:16" (1/1) ... [2023-12-02 23:43:16,036 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:43:16" (1/1) ... [2023-12-02 23:43:16,084 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 658 [2023-12-02 23:43:16,085 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 23:43:16,085 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 23:43:16,085 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 23:43:16,086 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 23:43:16,095 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:43:16" (1/1) ... [2023-12-02 23:43:16,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:43:16" (1/1) ... [2023-12-02 23:43:16,100 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:43:16" (1/1) ... [2023-12-02 23:43:16,100 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:43:16" (1/1) ... [2023-12-02 23:43:16,126 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:43:16" (1/1) ... [2023-12-02 23:43:16,155 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:43:16" (1/1) ... [2023-12-02 23:43:16,167 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:43:16" (1/1) ... [2023-12-02 23:43:16,172 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:43:16" (1/1) ... [2023-12-02 23:43:16,179 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 23:43:16,180 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 23:43:16,180 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 23:43:16,180 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 23:43:16,181 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:43:16" (1/1) ... [2023-12-02 23:43:16,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-12-02 23:43:16,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984ff5e-943a-4ea2-a66a-095c3d6c0941/bin/ukojak-verify-Qdu7aM0XO9/z3 [2023-12-02 23:43:16,214 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984ff5e-943a-4ea2-a66a-095c3d6c0941/bin/ukojak-verify-Qdu7aM0XO9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2023-12-02 23:43:16,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984ff5e-943a-4ea2-a66a-095c3d6c0941/bin/ukojak-verify-Qdu7aM0XO9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2023-12-02 23:43:16,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 23:43:16,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 23:43:16,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 23:43:16,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 23:43:16,312 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 23:43:16,313 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 23:43:17,098 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 23:43:17,303 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 23:43:17,303 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-02 23:43:17,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:43:17 BoogieIcfgContainer [2023-12-02 23:43:17,305 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 23:43:17,306 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2023-12-02 23:43:17,306 INFO L270 PluginConnector]: Initializing CodeCheck... [2023-12-02 23:43:17,314 INFO L274 PluginConnector]: CodeCheck initialized [2023-12-02 23:43:17,314 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:43:17" (1/1) ... [2023-12-02 23:43:17,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 23:43:17,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:17,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2023-12-02 23:43:17,367 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2023-12-02 23:43:17,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-02 23:43:17,370 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:17,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:17,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:17,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:43:18,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:18,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 145 states and 237 transitions. [2023-12-02 23:43:18,184 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 237 transitions. [2023-12-02 23:43:18,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-02 23:43:18,188 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:18,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:18,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:18,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 23:43:18,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:18,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 146 states and 238 transitions. [2023-12-02 23:43:18,549 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 238 transitions. [2023-12-02 23:43:18,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-02 23:43:18,552 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:18,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:18,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:18,636 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:43:18,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:18,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 150 states and 244 transitions. [2023-12-02 23:43:18,708 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 244 transitions. [2023-12-02 23:43:18,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-02 23:43:18,711 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:18,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:18,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:18,796 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 23:43:18,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:18,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 151 states and 245 transitions. [2023-12-02 23:43:18,930 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 245 transitions. [2023-12-02 23:43:18,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-02 23:43:18,933 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:18,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:18,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:19,038 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:43:19,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:19,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 159 states and 258 transitions. [2023-12-02 23:43:19,204 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 258 transitions. [2023-12-02 23:43:19,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-02 23:43:19,205 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:19,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:19,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:19,313 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:43:19,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:19,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 160 states and 259 transitions. [2023-12-02 23:43:19,440 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 259 transitions. [2023-12-02 23:43:19,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-02 23:43:19,443 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:19,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:19,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:19,573 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:43:19,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:19,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 168 states and 268 transitions. [2023-12-02 23:43:19,707 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 268 transitions. [2023-12-02 23:43:19,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-02 23:43:19,708 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:19,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:19,921 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:43:20,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:20,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 182 states and 286 transitions. [2023-12-02 23:43:20,190 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 286 transitions. [2023-12-02 23:43:20,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-12-02 23:43:20,191 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:20,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:20,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:20,305 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:43:20,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:20,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 197 states and 306 transitions. [2023-12-02 23:43:20,718 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 306 transitions. [2023-12-02 23:43:20,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-02 23:43:20,719 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:20,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:20,896 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:43:21,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:21,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 212 states and 327 transitions. [2023-12-02 23:43:21,474 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 327 transitions. [2023-12-02 23:43:21,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-02 23:43:21,475 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:21,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:21,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:21,598 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:43:22,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:22,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 230 states and 356 transitions. [2023-12-02 23:43:22,180 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2023-12-02 23:43:22,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-02 23:43:22,181 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:22,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:22,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:22,326 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:43:22,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:22,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 232 states and 359 transitions. [2023-12-02 23:43:22,502 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 359 transitions. [2023-12-02 23:43:22,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-02 23:43:22,503 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:22,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:22,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:22,595 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:43:22,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:22,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 237 states and 365 transitions. [2023-12-02 23:43:22,721 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 365 transitions. [2023-12-02 23:43:22,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-02 23:43:22,722 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:22,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:22,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:22,879 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 23:43:23,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:23,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 238 states and 366 transitions. [2023-12-02 23:43:23,039 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 366 transitions. [2023-12-02 23:43:23,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-02 23:43:23,040 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:23,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:23,147 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:43:23,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:23,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 257 states and 395 transitions. [2023-12-02 23:43:23,928 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 395 transitions. [2023-12-02 23:43:23,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-02 23:43:23,928 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:23,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:23,976 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:43:24,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:24,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 258 states and 396 transitions. [2023-12-02 23:43:24,120 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 396 transitions. [2023-12-02 23:43:24,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-02 23:43:24,121 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:24,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:24,239 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:43:24,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:24,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 273 states and 415 transitions. [2023-12-02 23:43:24,691 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 415 transitions. [2023-12-02 23:43:24,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-02 23:43:24,692 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:24,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:24,771 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 23:43:25,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:25,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 291 states and 435 transitions. [2023-12-02 23:43:25,417 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 435 transitions. [2023-12-02 23:43:25,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-02 23:43:25,418 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:25,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:25,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:25,495 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:43:25,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:25,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 295 states and 439 transitions. [2023-12-02 23:43:25,542 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 439 transitions. [2023-12-02 23:43:25,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-02 23:43:25,543 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:25,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:25,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:25,651 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 23:43:26,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:26,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 299 states and 444 transitions. [2023-12-02 23:43:26,024 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 444 transitions. [2023-12-02 23:43:26,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-02 23:43:26,026 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:26,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:26,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:26,105 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 23:43:26,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:26,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 307 states and 459 transitions. [2023-12-02 23:43:26,531 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 459 transitions. [2023-12-02 23:43:26,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-02 23:43:26,532 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:26,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:26,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:26,576 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 23:43:26,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:26,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 313 states and 467 transitions. [2023-12-02 23:43:26,943 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 467 transitions. [2023-12-02 23:43:26,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-02 23:43:26,944 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:26,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:27,008 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 23:43:27,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:27,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 316 states and 471 transitions. [2023-12-02 23:43:27,196 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 471 transitions. [2023-12-02 23:43:27,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-02 23:43:27,197 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:27,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:27,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:27,252 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:43:27,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:27,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 331 states and 491 transitions. [2023-12-02 23:43:27,615 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 491 transitions. [2023-12-02 23:43:27,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-02 23:43:27,616 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:27,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:27,744 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:43:27,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:27,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 345 states and 508 transitions. [2023-12-02 23:43:27,995 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 508 transitions. [2023-12-02 23:43:27,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-02 23:43:27,996 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:27,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:28,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:28,139 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:43:28,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:28,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 347 states and 510 transitions. [2023-12-02 23:43:28,371 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 510 transitions. [2023-12-02 23:43:28,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-02 23:43:28,372 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:28,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:28,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:28,433 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 23:43:28,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:28,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 353 states and 516 transitions. [2023-12-02 23:43:28,711 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 516 transitions. [2023-12-02 23:43:28,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-02 23:43:28,712 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:28,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:28,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:28,757 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 23:43:28,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:28,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 357 states and 519 transitions. [2023-12-02 23:43:28,795 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 519 transitions. [2023-12-02 23:43:28,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-02 23:43:28,796 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:28,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:28,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:28,879 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:43:28,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:28,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 359 states and 522 transitions. [2023-12-02 23:43:28,923 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 522 transitions. [2023-12-02 23:43:28,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-02 23:43:28,924 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:28,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:29,037 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:43:29,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:29,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 373 states and 540 transitions. [2023-12-02 23:43:29,445 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 540 transitions. [2023-12-02 23:43:29,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-02 23:43:29,446 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:29,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:29,532 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:43:29,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:29,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 377 states and 545 transitions. [2023-12-02 23:43:29,745 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 545 transitions. [2023-12-02 23:43:29,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-02 23:43:29,746 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:29,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:29,845 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 23:43:29,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:29,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 379 states and 548 transitions. [2023-12-02 23:43:29,965 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 548 transitions. [2023-12-02 23:43:29,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-02 23:43:29,966 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:29,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:29,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:30,171 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 35 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:43:30,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:30,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 386 states and 555 transitions. [2023-12-02 23:43:30,469 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 555 transitions. [2023-12-02 23:43:30,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-02 23:43:30,471 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:30,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:30,579 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 23:43:30,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:30,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 395 states and 564 transitions. [2023-12-02 23:43:30,889 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 564 transitions. [2023-12-02 23:43:30,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-02 23:43:30,890 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:30,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:30,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:30,972 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 23:43:31,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:31,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 399 states and 567 transitions. [2023-12-02 23:43:31,209 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 567 transitions. [2023-12-02 23:43:31,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-02 23:43:31,209 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:31,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:31,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:31,306 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 23:43:31,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:31,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 402 states and 569 transitions. [2023-12-02 23:43:31,521 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 569 transitions. [2023-12-02 23:43:31,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-02 23:43:31,522 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:31,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:31,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:31,669 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:43:32,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:32,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 472 states and 647 transitions. [2023-12-02 23:43:32,232 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 647 transitions. [2023-12-02 23:43:32,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-02 23:43:32,233 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:32,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:32,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:32,313 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:43:32,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:32,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 486 states and 664 transitions. [2023-12-02 23:43:32,444 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 664 transitions. [2023-12-02 23:43:32,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-02 23:43:32,446 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:32,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:32,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:32,526 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:43:32,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:32,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 497 states and 678 transitions. [2023-12-02 23:43:32,678 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 678 transitions. [2023-12-02 23:43:32,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-02 23:43:32,679 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:32,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:32,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:32,770 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 42 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:43:32,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:32,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 504 states and 686 transitions. [2023-12-02 23:43:32,836 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 686 transitions. [2023-12-02 23:43:32,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-02 23:43:32,837 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:32,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:32,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:32,902 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 23:43:32,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:32,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 506 states and 688 transitions. [2023-12-02 23:43:32,946 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 688 transitions. [2023-12-02 23:43:32,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-02 23:43:32,947 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:32,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:32,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:33,000 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 23:43:33,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:33,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 513 states and 695 transitions. [2023-12-02 23:43:33,142 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 695 transitions. [2023-12-02 23:43:33,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-02 23:43:33,142 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:33,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:33,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:33,200 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:43:33,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:33,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 551 states and 739 transitions. [2023-12-02 23:43:33,915 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 739 transitions. [2023-12-02 23:43:33,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-02 23:43:33,916 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:33,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:33,969 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:43:34,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:34,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 554 states and 741 transitions. [2023-12-02 23:43:34,175 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 741 transitions. [2023-12-02 23:43:34,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-02 23:43:34,176 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:34,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:34,243 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:43:34,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:34,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 557 states and 743 transitions. [2023-12-02 23:43:34,491 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 743 transitions. [2023-12-02 23:43:34,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-02 23:43:34,492 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:34,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:34,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:34,534 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:43:34,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:34,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 571 states and 758 transitions. [2023-12-02 23:43:34,618 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 758 transitions. [2023-12-02 23:43:34,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-02 23:43:34,618 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:34,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:34,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:34,665 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 23:43:34,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:34,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 580 states and 766 transitions. [2023-12-02 23:43:34,723 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 766 transitions. [2023-12-02 23:43:34,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-02 23:43:34,724 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:34,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:34,806 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:43:34,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:34,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 588 states and 775 transitions. [2023-12-02 23:43:34,978 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 775 transitions. [2023-12-02 23:43:34,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-02 23:43:34,979 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:34,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:34,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:35,046 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-12-02 23:43:35,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:35,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 672 states and 862 transitions. [2023-12-02 23:43:35,742 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 862 transitions. [2023-12-02 23:43:35,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-02 23:43:35,743 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:35,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:35,991 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 49 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:43:36,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:36,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 703 states and 897 transitions. [2023-12-02 23:43:36,569 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 897 transitions. [2023-12-02 23:43:36,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-02 23:43:36,570 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:36,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:36,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:36,645 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 23:43:36,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:36,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 708 states and 901 transitions. [2023-12-02 23:43:36,812 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 901 transitions. [2023-12-02 23:43:36,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-02 23:43:36,813 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:36,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:36,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:36,966 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 66 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-02 23:43:37,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:37,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 711 states and 904 transitions. [2023-12-02 23:43:37,082 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 904 transitions. [2023-12-02 23:43:37,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-02 23:43:37,083 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:37,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:37,131 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-02 23:43:37,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:37,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 725 states and 921 transitions. [2023-12-02 23:43:37,450 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 921 transitions. [2023-12-02 23:43:37,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-12-02 23:43:37,450 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:37,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:37,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:37,518 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:43:37,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:37,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 752 states and 949 transitions. [2023-12-02 23:43:37,669 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 949 transitions. [2023-12-02 23:43:37,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-02 23:43:37,670 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:37,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:37,811 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:43:38,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:38,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 769 states and 967 transitions. [2023-12-02 23:43:38,009 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 967 transitions. [2023-12-02 23:43:38,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-02 23:43:38,010 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:38,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:38,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:38,093 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:43:38,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:38,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 792 states and 991 transitions. [2023-12-02 23:43:38,386 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 991 transitions. [2023-12-02 23:43:38,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-02 23:43:38,387 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:38,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:38,450 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2023-12-02 23:43:38,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:38,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 793 states and 991 transitions. [2023-12-02 23:43:38,502 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 991 transitions. [2023-12-02 23:43:38,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-02 23:43:38,503 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:38,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:38,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:38,928 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:43:41,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:41,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 865 states and 1084 transitions. [2023-12-02 23:43:41,563 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1084 transitions. [2023-12-02 23:43:41,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-02 23:43:41,564 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:41,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:41,739 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:43:42,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:42,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 869 states and 1089 transitions. [2023-12-02 23:43:42,293 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1089 transitions. [2023-12-02 23:43:42,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-02 23:43:42,294 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:42,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:42,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:42,376 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:43:42,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:42,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 896 states and 1120 transitions. [2023-12-02 23:43:42,941 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1120 transitions. [2023-12-02 23:43:42,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-02 23:43:42,943 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:42,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:42,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:43,103 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:43:44,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:44,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 962 states and 1193 transitions. [2023-12-02 23:43:44,412 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1193 transitions. [2023-12-02 23:43:44,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-02 23:43:44,414 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:44,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:44,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:44,468 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-12-02 23:43:44,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:44,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 975 states and 1206 transitions. [2023-12-02 23:43:44,548 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1206 transitions. [2023-12-02 23:43:44,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-02 23:43:44,549 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:44,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:44,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:44,605 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-02 23:43:44,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:44,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 976 states and 1207 transitions. [2023-12-02 23:43:44,637 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1207 transitions. [2023-12-02 23:43:44,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-02 23:43:44,639 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:44,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:44,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:44,696 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-02 23:43:44,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:44,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 989 states and 1221 transitions. [2023-12-02 23:43:44,779 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1221 transitions. [2023-12-02 23:43:44,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-02 23:43:44,781 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:44,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:44,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:45,131 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 82 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:43:47,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:47,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1072 states and 1319 transitions. [2023-12-02 23:43:47,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1319 transitions. [2023-12-02 23:43:47,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-02 23:43:47,592 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:47,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:47,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:47,741 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-02 23:43:48,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:48,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1091 states and 1338 transitions. [2023-12-02 23:43:48,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1338 transitions. [2023-12-02 23:43:48,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-12-02 23:43:48,107 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:48,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:48,251 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-02 23:43:49,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:49,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1126 states and 1383 transitions. [2023-12-02 23:43:49,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1383 transitions. [2023-12-02 23:43:49,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-12-02 23:43:49,599 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:49,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:49,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:49,740 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-02 23:43:50,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:50,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1387 states to 1130 states and 1387 transitions. [2023-12-02 23:43:50,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1387 transitions. [2023-12-02 23:43:50,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-12-02 23:43:50,062 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:50,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:50,204 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-02 23:43:50,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:50,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1135 states and 1392 transitions. [2023-12-02 23:43:50,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1392 transitions. [2023-12-02 23:43:50,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-12-02 23:43:50,550 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:50,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:50,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:50,874 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-02 23:43:51,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:51,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1141 states and 1398 transitions. [2023-12-02 23:43:51,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1398 transitions. [2023-12-02 23:43:51,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-12-02 23:43:51,639 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:51,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:51,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:51,826 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-02 23:43:52,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:52,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1463 states to 1206 states and 1463 transitions. [2023-12-02 23:43:52,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1463 transitions. [2023-12-02 23:43:52,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-02 23:43:52,415 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:52,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:52,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:52,520 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-02 23:43:52,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:52,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1207 states and 1464 transitions. [2023-12-02 23:43:52,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 1464 transitions. [2023-12-02 23:43:52,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-12-02 23:43:52,757 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:52,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:52,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:52,835 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2023-12-02 23:43:53,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:53,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1222 states and 1482 transitions. [2023-12-02 23:43:53,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1482 transitions. [2023-12-02 23:43:53,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-12-02 23:43:53,324 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:53,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:53,399 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2023-12-02 23:43:53,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:53,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 1225 states and 1484 transitions. [2023-12-02 23:43:53,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1484 transitions. [2023-12-02 23:43:53,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-12-02 23:43:53,499 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:53,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:53,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:53,629 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-02 23:43:55,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:55,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1279 states and 1545 transitions. [2023-12-02 23:43:55,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1545 transitions. [2023-12-02 23:43:55,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-12-02 23:43:55,376 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:55,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:55,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:55,463 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-02 23:43:55,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:43:55,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1286 states and 1552 transitions. [2023-12-02 23:43:55,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1552 transitions. [2023-12-02 23:43:55,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-12-02 23:43:55,899 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:43:55,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:43:55,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:43:56,419 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 98 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:44:00,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:00,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1365 states and 1648 transitions. [2023-12-02 23:44:00,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 1648 transitions. [2023-12-02 23:44:00,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-12-02 23:44:00,471 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:00,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:00,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:00,669 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 98 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:44:02,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:02,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1386 states and 1677 transitions. [2023-12-02 23:44:02,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1677 transitions. [2023-12-02 23:44:02,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-12-02 23:44:02,797 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:02,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:02,992 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 98 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:44:03,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:03,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1681 states to 1389 states and 1681 transitions. [2023-12-02 23:44:03,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1681 transitions. [2023-12-02 23:44:03,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-12-02 23:44:03,409 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:03,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:03,511 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-02 23:44:04,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:04,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1414 states and 1707 transitions. [2023-12-02 23:44:04,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 1707 transitions. [2023-12-02 23:44:04,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-12-02 23:44:04,265 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:04,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:04,430 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-02 23:44:04,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:04,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1418 states and 1711 transitions. [2023-12-02 23:44:04,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 1711 transitions. [2023-12-02 23:44:04,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-12-02 23:44:04,852 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:04,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:04,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:05,097 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-12-02 23:44:05,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:05,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1488 states and 1789 transitions. [2023-12-02 23:44:05,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 1789 transitions. [2023-12-02 23:44:05,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-12-02 23:44:05,726 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:05,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:05,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:06,048 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:44:06,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:06,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1493 states and 1801 transitions. [2023-12-02 23:44:06,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 1801 transitions. [2023-12-02 23:44:06,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-12-02 23:44:06,825 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:06,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:06,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:07,055 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:44:07,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:07,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1494 states and 1801 transitions. [2023-12-02 23:44:07,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 1801 transitions. [2023-12-02 23:44:07,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-12-02 23:44:07,494 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:07,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:07,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:07,724 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:44:08,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:08,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1495 states and 1801 transitions. [2023-12-02 23:44:08,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 1801 transitions. [2023-12-02 23:44:08,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2023-12-02 23:44:08,146 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:08,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:08,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:08,623 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:44:09,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:09,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1885 states to 1564 states and 1885 transitions. [2023-12-02 23:44:09,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 1885 transitions. [2023-12-02 23:44:09,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-12-02 23:44:09,805 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:09,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:09,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:09,911 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-02 23:44:09,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:09,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1885 states to 1565 states and 1885 transitions. [2023-12-02 23:44:09,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 1885 transitions. [2023-12-02 23:44:09,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2023-12-02 23:44:09,973 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:09,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:10,649 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 3 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:44:15,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:15,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 1748 states and 2090 transitions. [2023-12-02 23:44:15,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2090 transitions. [2023-12-02 23:44:15,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2023-12-02 23:44:15,407 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:15,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:15,810 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 120 proven. 51 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-02 23:44:16,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:16,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2109 states to 1763 states and 2109 transitions. [2023-12-02 23:44:16,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 2109 transitions. [2023-12-02 23:44:16,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2023-12-02 23:44:16,384 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:16,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:16,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:17,031 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 136 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:44:19,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:19,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 1828 states and 2192 transitions. [2023-12-02 23:44:19,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1828 states and 2192 transitions. [2023-12-02 23:44:19,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2023-12-02 23:44:19,160 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:19,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:19,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:19,520 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 136 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:44:21,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:21,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2213 states to 1839 states and 2213 transitions. [2023-12-02 23:44:21,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 2213 transitions. [2023-12-02 23:44:21,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2023-12-02 23:44:21,179 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:21,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:21,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:21,519 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 136 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:44:21,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:21,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2213 states to 1840 states and 2213 transitions. [2023-12-02 23:44:21,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2213 transitions. [2023-12-02 23:44:21,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2023-12-02 23:44:21,992 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:21,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:22,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:22,411 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 136 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:44:23,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:23,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2221 states to 1846 states and 2221 transitions. [2023-12-02 23:44:23,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1846 states and 2221 transitions. [2023-12-02 23:44:23,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2023-12-02 23:44:23,270 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:23,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:23,614 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 136 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:44:24,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:24,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2227 states to 1849 states and 2227 transitions. [2023-12-02 23:44:24,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 2227 transitions. [2023-12-02 23:44:24,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2023-12-02 23:44:24,085 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:24,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:24,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:24,511 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 136 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:44:25,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:25,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2229 states to 1852 states and 2229 transitions. [2023-12-02 23:44:25,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1852 states and 2229 transitions. [2023-12-02 23:44:25,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2023-12-02 23:44:25,070 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:25,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:25,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:25,495 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 135 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:44:28,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:28,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 1913 states and 2305 transitions. [2023-12-02 23:44:28,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1913 states and 2305 transitions. [2023-12-02 23:44:28,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2023-12-02 23:44:28,501 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:28,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:29,047 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 205 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-02 23:44:31,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:31,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2403 states to 1996 states and 2403 transitions. [2023-12-02 23:44:31,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1996 states and 2403 transitions. [2023-12-02 23:44:31,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2023-12-02 23:44:31,390 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:31,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:31,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:31,655 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 205 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-02 23:44:32,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:32,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2406 states to 2000 states and 2406 transitions. [2023-12-02 23:44:32,232 INFO L276 IsEmpty]: Start isEmpty. Operand 2000 states and 2406 transitions. [2023-12-02 23:44:32,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2023-12-02 23:44:32,234 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:32,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:32,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:32,416 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 136 proven. 65 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-02 23:44:32,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:32,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2020 states and 2426 transitions. [2023-12-02 23:44:32,986 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 2426 transitions. [2023-12-02 23:44:32,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2023-12-02 23:44:32,987 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:32,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:33,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:33,257 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 137 proven. 71 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-02 23:44:33,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:33,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2448 states to 2040 states and 2448 transitions. [2023-12-02 23:44:33,481 INFO L276 IsEmpty]: Start isEmpty. Operand 2040 states and 2448 transitions. [2023-12-02 23:44:33,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2023-12-02 23:44:33,482 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:33,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:33,557 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2023-12-02 23:44:33,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:33,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2456 states to 2045 states and 2456 transitions. [2023-12-02 23:44:33,886 INFO L276 IsEmpty]: Start isEmpty. Operand 2045 states and 2456 transitions. [2023-12-02 23:44:33,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2023-12-02 23:44:33,888 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:33,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:34,227 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-02 23:44:35,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:35,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2479 states to 2065 states and 2479 transitions. [2023-12-02 23:44:35,219 INFO L276 IsEmpty]: Start isEmpty. Operand 2065 states and 2479 transitions. [2023-12-02 23:44:35,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2023-12-02 23:44:35,222 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:35,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:35,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:35,480 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 139 proven. 55 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-02 23:44:38,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:38,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2541 states to 2112 states and 2541 transitions. [2023-12-02 23:44:38,632 INFO L276 IsEmpty]: Start isEmpty. Operand 2112 states and 2541 transitions. [2023-12-02 23:44:38,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2023-12-02 23:44:38,685 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:38,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:38,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:39,108 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 142 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:44:39,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:39,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2125 states and 2553 transitions. [2023-12-02 23:44:39,601 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 2553 transitions. [2023-12-02 23:44:39,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2023-12-02 23:44:39,602 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:39,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:39,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:39,685 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2023-12-02 23:44:40,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:40,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2625 states to 2195 states and 2625 transitions. [2023-12-02 23:44:40,285 INFO L276 IsEmpty]: Start isEmpty. Operand 2195 states and 2625 transitions. [2023-12-02 23:44:40,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2023-12-02 23:44:40,287 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:40,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:40,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:40,542 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 158 proven. 88 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-02 23:44:41,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:41,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2207 states and 2645 transitions. [2023-12-02 23:44:41,263 INFO L276 IsEmpty]: Start isEmpty. Operand 2207 states and 2645 transitions. [2023-12-02 23:44:41,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2023-12-02 23:44:41,264 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:41,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:41,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:41,634 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 175 proven. 42 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2023-12-02 23:44:42,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:42,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2649 states to 2210 states and 2649 transitions. [2023-12-02 23:44:42,211 INFO L276 IsEmpty]: Start isEmpty. Operand 2210 states and 2649 transitions. [2023-12-02 23:44:42,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2023-12-02 23:44:42,212 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:42,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:42,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:42,471 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-12-02 23:44:43,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:43,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2222 states and 2664 transitions. [2023-12-02 23:44:43,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2222 states and 2664 transitions. [2023-12-02 23:44:43,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2023-12-02 23:44:43,241 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:43,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:43,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:43,520 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 152 proven. 83 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-02 23:44:44,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:44,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2690 states to 2237 states and 2690 transitions. [2023-12-02 23:44:44,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2237 states and 2690 transitions. [2023-12-02 23:44:44,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2023-12-02 23:44:44,636 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:44,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:44,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:44,839 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2023-12-02 23:44:46,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:46,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2716 states to 2259 states and 2716 transitions. [2023-12-02 23:44:46,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2259 states and 2716 transitions. [2023-12-02 23:44:46,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2023-12-02 23:44:46,167 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:46,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:46,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:46,519 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 155 proven. 86 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-12-02 23:44:47,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:47,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2760 states to 2296 states and 2760 transitions. [2023-12-02 23:44:47,891 INFO L276 IsEmpty]: Start isEmpty. Operand 2296 states and 2760 transitions. [2023-12-02 23:44:47,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2023-12-02 23:44:47,892 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:47,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:47,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:47,979 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-12-02 23:44:48,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:48,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2780 states to 2315 states and 2780 transitions. [2023-12-02 23:44:48,656 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 2780 transitions. [2023-12-02 23:44:48,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2023-12-02 23:44:48,657 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:48,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:48,923 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 174 proven. 116 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-02 23:44:50,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:50,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2792 states to 2326 states and 2792 transitions. [2023-12-02 23:44:50,075 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 2792 transitions. [2023-12-02 23:44:50,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2023-12-02 23:44:50,077 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:50,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:50,565 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 182 proven. 112 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-02 23:44:52,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:52,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2823 states to 2350 states and 2823 transitions. [2023-12-02 23:44:52,093 INFO L276 IsEmpty]: Start isEmpty. Operand 2350 states and 2823 transitions. [2023-12-02 23:44:52,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2023-12-02 23:44:52,094 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:52,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:52,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:52,539 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 178 proven. 30 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2023-12-02 23:44:53,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:53,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2826 states to 2352 states and 2826 transitions. [2023-12-02 23:44:53,687 INFO L276 IsEmpty]: Start isEmpty. Operand 2352 states and 2826 transitions. [2023-12-02 23:44:53,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2023-12-02 23:44:53,688 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:53,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:53,976 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 159 proven. 93 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-02 23:44:55,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:55,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2867 states to 2387 states and 2867 transitions. [2023-12-02 23:44:55,854 INFO L276 IsEmpty]: Start isEmpty. Operand 2387 states and 2867 transitions. [2023-12-02 23:44:55,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2023-12-02 23:44:55,856 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:55,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:55,931 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-12-02 23:44:56,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:56,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2871 states to 2388 states and 2871 transitions. [2023-12-02 23:44:56,500 INFO L276 IsEmpty]: Start isEmpty. Operand 2388 states and 2871 transitions. [2023-12-02 23:44:56,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2023-12-02 23:44:56,501 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:56,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:56,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:56,575 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-12-02 23:44:57,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:57,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2877 states to 2395 states and 2877 transitions. [2023-12-02 23:44:57,064 INFO L276 IsEmpty]: Start isEmpty. Operand 2395 states and 2877 transitions. [2023-12-02 23:44:57,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2023-12-02 23:44:57,066 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:57,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:57,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:57,228 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2023-12-02 23:44:57,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:57,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2880 states to 2397 states and 2880 transitions. [2023-12-02 23:44:57,704 INFO L276 IsEmpty]: Start isEmpty. Operand 2397 states and 2880 transitions. [2023-12-02 23:44:57,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2023-12-02 23:44:57,705 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:57,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:57,778 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 231 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-12-02 23:44:58,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:44:58,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2881 states to 2398 states and 2881 transitions. [2023-12-02 23:44:58,317 INFO L276 IsEmpty]: Start isEmpty. Operand 2398 states and 2881 transitions. [2023-12-02 23:44:58,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2023-12-02 23:44:58,318 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:44:58,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:44:58,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:44:58,958 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 192 proven. 59 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-12-02 23:45:01,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:45:01,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2429 states and 2922 transitions. [2023-12-02 23:45:01,676 INFO L276 IsEmpty]: Start isEmpty. Operand 2429 states and 2922 transitions. [2023-12-02 23:45:01,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2023-12-02 23:45:01,678 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:45:01,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:45:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:45:02,261 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 200 proven. 63 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2023-12-02 23:45:05,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:45:05,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2954 states to 2452 states and 2954 transitions. [2023-12-02 23:45:05,138 INFO L276 IsEmpty]: Start isEmpty. Operand 2452 states and 2954 transitions. [2023-12-02 23:45:05,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2023-12-02 23:45:05,140 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:45:05,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:45:05,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:45:05,422 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 200 proven. 63 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2023-12-02 23:45:06,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:45:06,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2956 states to 2454 states and 2956 transitions. [2023-12-02 23:45:06,118 INFO L276 IsEmpty]: Start isEmpty. Operand 2454 states and 2956 transitions. [2023-12-02 23:45:06,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2023-12-02 23:45:06,119 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:45:06,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:45:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:45:06,487 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 196 proven. 61 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-12-02 23:45:07,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:45:07,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2958 states to 2456 states and 2958 transitions. [2023-12-02 23:45:07,092 INFO L276 IsEmpty]: Start isEmpty. Operand 2456 states and 2958 transitions. [2023-12-02 23:45:07,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2023-12-02 23:45:07,094 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:45:07,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:45:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:45:07,526 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 198 proven. 61 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-12-02 23:45:09,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:45:09,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2986 states to 2477 states and 2986 transitions. [2023-12-02 23:45:09,704 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 2986 transitions. [2023-12-02 23:45:09,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2023-12-02 23:45:09,705 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:45:09,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:45:09,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:45:10,049 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 198 proven. 61 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-12-02 23:45:10,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:45:10,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2993 states to 2485 states and 2993 transitions. [2023-12-02 23:45:10,762 INFO L276 IsEmpty]: Start isEmpty. Operand 2485 states and 2993 transitions. [2023-12-02 23:45:10,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2023-12-02 23:45:10,764 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:45:10,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:45:10,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:45:11,067 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 169 proven. 103 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-12-02 23:45:13,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:45:13,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3014 states to 2499 states and 3014 transitions. [2023-12-02 23:45:13,021 INFO L276 IsEmpty]: Start isEmpty. Operand 2499 states and 3014 transitions. [2023-12-02 23:45:13,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2023-12-02 23:45:13,023 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:45:13,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:45:13,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:45:13,394 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 169 proven. 103 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-12-02 23:45:13,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:45:13,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3015 states to 2501 states and 3015 transitions. [2023-12-02 23:45:13,937 INFO L276 IsEmpty]: Start isEmpty. Operand 2501 states and 3015 transitions. [2023-12-02 23:45:13,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2023-12-02 23:45:13,939 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:45:13,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:45:13,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:45:14,016 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 266 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-12-02 23:45:15,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:45:15,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3027 states to 2511 states and 3027 transitions. [2023-12-02 23:45:15,734 INFO L276 IsEmpty]: Start isEmpty. Operand 2511 states and 3027 transitions. [2023-12-02 23:45:15,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2023-12-02 23:45:15,735 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:45:15,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:45:15,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:45:16,181 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 171 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-12-02 23:45:18,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:45:18,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3074 states to 2547 states and 3074 transitions. [2023-12-02 23:45:18,665 INFO L276 IsEmpty]: Start isEmpty. Operand 2547 states and 3074 transitions. [2023-12-02 23:45:18,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-02 23:45:18,667 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:45:18,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:45:18,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:45:18,970 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 172 proven. 106 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-12-02 23:45:19,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:45:19,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3091 states to 2563 states and 3091 transitions. [2023-12-02 23:45:19,895 INFO L276 IsEmpty]: Start isEmpty. Operand 2563 states and 3091 transitions. [2023-12-02 23:45:19,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2023-12-02 23:45:19,897 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:45:19,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:45:19,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:45:20,200 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 173 proven. 104 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2023-12-02 23:45:21,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:45:21,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3117 states to 2587 states and 3117 transitions. [2023-12-02 23:45:21,482 INFO L276 IsEmpty]: Start isEmpty. Operand 2587 states and 3117 transitions. [2023-12-02 23:45:21,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2023-12-02 23:45:21,483 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:45:21,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:45:21,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:45:22,422 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 230 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:45:23,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:45:23,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3188 states to 2657 states and 3188 transitions. [2023-12-02 23:45:23,886 INFO L276 IsEmpty]: Start isEmpty. Operand 2657 states and 3188 transitions. [2023-12-02 23:45:23,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2023-12-02 23:45:23,887 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:45:23,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:45:23,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:45:24,220 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-12-02 23:45:26,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:45:26,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3216 states to 2682 states and 3216 transitions. [2023-12-02 23:45:26,476 INFO L276 IsEmpty]: Start isEmpty. Operand 2682 states and 3216 transitions. [2023-12-02 23:45:26,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2023-12-02 23:45:26,477 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:45:26,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:45:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:45:26,758 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 174 proven. 105 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-12-02 23:45:28,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:45:28,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3220 states to 2686 states and 3220 transitions. [2023-12-02 23:45:28,002 INFO L276 IsEmpty]: Start isEmpty. Operand 2686 states and 3220 transitions. [2023-12-02 23:45:28,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2023-12-02 23:45:28,004 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:45:28,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:45:28,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:45:28,642 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:45:30,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:45:30,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3244 states to 2708 states and 3244 transitions. [2023-12-02 23:45:30,651 INFO L276 IsEmpty]: Start isEmpty. Operand 2708 states and 3244 transitions. [2023-12-02 23:45:30,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2023-12-02 23:45:30,654 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:45:30,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:45:30,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:45:31,041 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 175 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 23:45:32,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:45:32,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3293 states to 2757 states and 3293 transitions. [2023-12-02 23:45:32,980 INFO L276 IsEmpty]: Start isEmpty. Operand 2757 states and 3293 transitions. [2023-12-02 23:45:32,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2023-12-02 23:45:32,981 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:45:32,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:45:33,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:45:33,341 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 224 proven. 65 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2023-12-02 23:45:35,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:45:35,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3312 states to 2775 states and 3312 transitions. [2023-12-02 23:45:35,076 INFO L276 IsEmpty]: Start isEmpty. Operand 2775 states and 3312 transitions. [2023-12-02 23:45:35,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2023-12-02 23:45:35,078 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:45:35,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:45:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:45:35,367 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 190 proven. 132 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-12-02 23:45:36,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:45:36,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 2781 states and 3317 transitions. [2023-12-02 23:45:36,065 INFO L276 IsEmpty]: Start isEmpty. Operand 2781 states and 3317 transitions. [2023-12-02 23:45:36,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2023-12-02 23:45:36,066 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:45:36,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:45:36,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:45:36,162 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2023-12-02 23:45:36,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:45:36,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3389 states to 2851 states and 3389 transitions. [2023-12-02 23:45:36,997 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 3389 transitions. [2023-12-02 23:45:36,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2023-12-02 23:45:36,998 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:45:36,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:45:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:45:37,085 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2023-12-02 23:45:39,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:45:39,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3420 states to 2876 states and 3420 transitions. [2023-12-02 23:45:39,240 INFO L276 IsEmpty]: Start isEmpty. Operand 2876 states and 3420 transitions. [2023-12-02 23:45:39,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2023-12-02 23:45:39,241 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:45:39,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:45:39,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:45:39,474 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 288 proven. 59 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2023-12-02 23:45:41,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:45:41,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3431 states to 2884 states and 3431 transitions. [2023-12-02 23:45:41,419 INFO L276 IsEmpty]: Start isEmpty. Operand 2884 states and 3431 transitions. [2023-12-02 23:45:41,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2023-12-02 23:45:41,421 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:45:41,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:45:41,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:45:41,827 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 288 proven. 59 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2023-12-02 23:45:42,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:45:42,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3433 states to 2886 states and 3433 transitions. [2023-12-02 23:45:42,675 INFO L276 IsEmpty]: Start isEmpty. Operand 2886 states and 3433 transitions. [2023-12-02 23:45:42,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2023-12-02 23:45:42,678 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:45:42,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:45:42,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:45:42,771 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 309 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2023-12-02 23:45:43,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:45:43,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3446 states to 2898 states and 3446 transitions. [2023-12-02 23:45:43,584 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 3446 transitions. [2023-12-02 23:45:43,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2023-12-02 23:45:43,585 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:45:43,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:45:43,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:45:43,829 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2023-12-02 23:45:45,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:45:45,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3478 states to 2924 states and 3478 transitions. [2023-12-02 23:45:45,827 INFO L276 IsEmpty]: Start isEmpty. Operand 2924 states and 3478 transitions. [2023-12-02 23:45:45,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2023-12-02 23:45:45,828 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:45:45,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:45:45,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:45:46,163 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2023-12-02 23:45:48,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:45:48,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3497 states to 2940 states and 3497 transitions. [2023-12-02 23:45:48,306 INFO L276 IsEmpty]: Start isEmpty. Operand 2940 states and 3497 transitions. [2023-12-02 23:45:48,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2023-12-02 23:45:48,308 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:45:48,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:45:48,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:45:48,548 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2023-12-02 23:45:49,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:45:49,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3499 states to 2942 states and 3499 transitions. [2023-12-02 23:45:49,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2942 states and 3499 transitions. [2023-12-02 23:45:49,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2023-12-02 23:45:49,026 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:45:49,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:45:49,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:45:49,267 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2023-12-02 23:45:49,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:45:49,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3503 states to 2944 states and 3503 transitions. [2023-12-02 23:45:49,985 INFO L276 IsEmpty]: Start isEmpty. Operand 2944 states and 3503 transitions. [2023-12-02 23:45:49,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2023-12-02 23:45:49,987 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:45:49,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:45:50,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:45:50,398 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 3 proven. 287 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2023-12-02 23:45:51,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:45:51,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3574 states to 3014 states and 3574 transitions. [2023-12-02 23:45:51,834 INFO L276 IsEmpty]: Start isEmpty. Operand 3014 states and 3574 transitions. [2023-12-02 23:45:51,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2023-12-02 23:45:51,836 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:45:51,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:45:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 23:45:52,174 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 3 proven. 287 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2023-12-02 23:45:52,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-02 23:45:52,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3579 states to 3019 states and 3579 transitions. [2023-12-02 23:45:52,952 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 3579 transitions. [2023-12-02 23:45:52,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2023-12-02 23:45:52,954 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-02 23:45:52,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 23:45:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 23:45:52,998 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 23:45:53,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 23:45:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 23:45:53,235 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 23:45:53,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 23:45:53,355 WARN L476 CodeCheckObserver]: This program is UNSAFE, Check terminated with 151 iterations. [2023-12-02 23:45:53,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 02.12 11:45:53 ImpRootNode [2023-12-02 23:45:53,508 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2023-12-02 23:45:53,508 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 23:45:53,508 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 23:45:53,509 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 23:45:53,509 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:43:17" (3/4) ... [2023-12-02 23:45:53,510 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-12-02 23:45:53,883 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984ff5e-943a-4ea2-a66a-095c3d6c0941/bin/ukojak-verify-Qdu7aM0XO9/witness.graphml [2023-12-02 23:45:53,883 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 23:45:53,884 INFO L158 Benchmark]: Toolchain (without parser) took 158330.97ms. Allocated memory was 127.9MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 90.1MB in the beginning and 957.9MB in the end (delta: -867.8MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2023-12-02 23:45:53,884 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 127.9MB. Free memory was 99.4MB in the beginning and 99.2MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 23:45:53,884 INFO L158 Benchmark]: CACSL2BoogieTranslator took 453.51ms. Allocated memory is still 127.9MB. Free memory was 89.8MB in the beginning and 62.0MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-12-02 23:45:53,885 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.93ms. Allocated memory is still 127.9MB. Free memory was 62.0MB in the beginning and 56.2MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-12-02 23:45:53,885 INFO L158 Benchmark]: Boogie Preprocessor took 93.67ms. Allocated memory is still 127.9MB. Free memory was 56.2MB in the beginning and 95.8MB in the end (delta: -39.6MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2023-12-02 23:45:53,885 INFO L158 Benchmark]: RCFGBuilder took 1125.62ms. Allocated memory was 127.9MB in the beginning and 157.3MB in the end (delta: 29.4MB). Free memory was 95.8MB in the beginning and 87.7MB in the end (delta: 8.1MB). Peak memory consumption was 56.2MB. Max. memory is 16.1GB. [2023-12-02 23:45:53,886 INFO L158 Benchmark]: CodeCheck took 156201.71ms. Allocated memory was 157.3MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 87.7MB in the beginning and 986.1MB in the end (delta: -898.3MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2023-12-02 23:45:53,886 INFO L158 Benchmark]: Witness Printer took 374.73ms. Allocated memory is still 2.2GB. Free memory was 986.1MB in the beginning and 957.9MB in the end (delta: 28.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-12-02 23:45:53,888 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: 156.0s, OverallIterations: 151, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 432878 SdHoareTripleChecker+Valid, 967.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 428107 mSDsluCounter, 60587 SdHoareTripleChecker+Invalid, 827.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51403 mSDsCounter, 107697 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 948595 IncrementalHoareTripleChecker+Invalid, 1056292 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 107697 mSolverCounterUnsat, 9184 mSDtfsCounter, 948595 mSolverCounterSat, 6.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 172376 GetRequests, 164534 SyntacticMatches, 6682 SemanticMatches, 1160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921749 ImplicationChecksByTransitivity, 104.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.9s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 27.9s InterpolantComputationTime, 25759 NumberOfCodeBlocks, 25759 NumberOfCodeBlocksAsserted, 151 NumberOfCheckSat, 25346 ConstructedInterpolants, 0 QuantifiedInterpolants, 146344 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 150 InterpolantComputations, 85 PerfectInterpolantSequences, 21188/25733 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 - CounterExampleResult [Line: 420]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int a= 1; [L18] int d= 4; [L19] int e= 5; [L20] int f= 6; [L21] int c= 3; [L22] int b= 2; [L25] int u = 21; [L26] int v = 22; [L27] int w = 23; [L28] int x = 24; [L29] int y = 25; [L30] int z = 26; [L32] int a17 = 1; [L33] int a7 = 0; [L34] int a20 = 1; [L35] int a8 = 15; [L36] int a12 = 8; [L37] int a16 = 5; [L38] int a21 = 1; [L590] int output = -1; VAL [a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L593] COND TRUE 1 [L596] int input; [L597] EXPR input = __VERIFIER_nondet_int() [L598] COND FALSE, EXPR !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [\old(input)=3, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L344] a17 = 0 [L345] a16 = 4 [L346] return 21; VAL [\old(input)=3, \result=21, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] EXPR output = calculate_output(input) [L594-L603] { // read input int input; input = __VERIFIER_nondet_int(); if ((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) return -2; // operate eca engine output = calculate_output(input); } VAL [a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, output=21, u=21, v=22, w=23, x=24, y=25, z=26] [L593] COND TRUE 1 [L596] int input; [L597] EXPR input = __VERIFIER_nondet_int() [L598] COND FALSE, EXPR !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [\old(input)=4, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L279] a20 = 0 [L280] a17 = 1 [L281] a16 = 6 [L282] return 21; VAL [\old(input)=4, \result=21, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] EXPR output = calculate_output(input) [L594-L603] { // read input int input; input = __VERIFIER_nondet_int(); if ((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) return -2; // operate eca engine output = calculate_output(input); } VAL [a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, output=21, u=21, v=22, w=23, x=24, y=25, z=26] [L593] COND TRUE 1 [L596] int input; [L597] EXPR input = __VERIFIER_nondet_int() [L598] COND FALSE, EXPR !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(input)=4, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(input)=4, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(input)=4, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(input)=4, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(input)=4, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L73] a17 = 0 [L74] return 26; VAL [\old(input)=4, \result=26, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] EXPR output = calculate_output(input) [L594-L603] { // read input int input; input = __VERIFIER_nondet_int(); if ((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) return -2; // operate eca engine output = calculate_output(input); } VAL [a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, output=26, u=21, v=22, w=23, x=24, y=25, z=26] [L593] COND TRUE 1 [L596] int input; [L597] EXPR input = __VERIFIER_nondet_int() [L598] COND FALSE, EXPR !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(input)=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(input)=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(input)=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(input)=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(input)=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(input)=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L83] a7 = 1 [L84] a17 = 1 [L85] a21 = 0 [L86] a20 = 1 [L87] a8 = 13 [L88] a16 = 5 [L89] return 26; VAL [\old(input)=1, \result=26, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] EXPR output = calculate_output(input) [L594-L603] { // read input int input; input = __VERIFIER_nondet_int(); if ((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) return -2; // operate eca engine output = calculate_output(input); } VAL [a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, output=26, u=21, v=22, w=23, x=24, y=25, z=26] [L593] COND TRUE 1 [L596] int input; [L597] EXPR input = __VERIFIER_nondet_int() [L598] COND FALSE, EXPR !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [\old(input)=5, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND TRUE ((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5)) [L376] a21 = 1 [L377] a7 = 0 [L378] a17 = 0 [L379] a8 = 14 [L380] a20 = 0 [L381] return -1; VAL [\old(input)=5, \result=-1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] EXPR output = calculate_output(input) [L594-L603] { // read input int input; input = __VERIFIER_nondet_int(); if ((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) return -2; // operate eca engine output = calculate_output(input); } VAL [a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L387] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L392] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L401] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L404] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L407] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L410] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L413] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L416] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L419] COND TRUE ((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1)) VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L420] reach_error() VAL [\old(input)=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 127.9MB. Free memory was 99.4MB in the beginning and 99.2MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 453.51ms. Allocated memory is still 127.9MB. Free memory was 89.8MB in the beginning and 62.0MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.93ms. Allocated memory is still 127.9MB. Free memory was 62.0MB in the beginning and 56.2MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.67ms. Allocated memory is still 127.9MB. Free memory was 56.2MB in the beginning and 95.8MB in the end (delta: -39.6MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. * RCFGBuilder took 1125.62ms. Allocated memory was 127.9MB in the beginning and 157.3MB in the end (delta: 29.4MB). Free memory was 95.8MB in the beginning and 87.7MB in the end (delta: 8.1MB). Peak memory consumption was 56.2MB. Max. memory is 16.1GB. * CodeCheck took 156201.71ms. Allocated memory was 157.3MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 87.7MB in the beginning and 986.1MB in the end (delta: -898.3MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 374.73ms. Allocated memory is still 2.2GB. Free memory was 986.1MB in the beginning and 957.9MB in the end (delta: 28.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2023-12-02 23:45:53,909 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e984ff5e-943a-4ea2-a66a-095c3d6c0941/bin/ukojak-verify-Qdu7aM0XO9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE