./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label37.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_6de36314-43aa-4186-a099-2174e601d9c9/bin/ukojak-verify-Qdu7aM0XO9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6de36314-43aa-4186-a099-2174e601d9c9/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_6de36314-43aa-4186-a099-2174e601d9c9/bin/ukojak-verify-Qdu7aM0XO9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6de36314-43aa-4186-a099-2174e601d9c9/bin/ukojak-verify-Qdu7aM0XO9/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label37.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6de36314-43aa-4186-a099-2174e601d9c9/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_6de36314-43aa-4186-a099-2174e601d9c9/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 889703d30f71ddcf9dd164cd63c57e33725418944081edb29f7e0df12e48cb88 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-03 02:39:29,643 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-03 02:39:29,733 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6de36314-43aa-4186-a099-2174e601d9c9/bin/ukojak-verify-Qdu7aM0XO9/config/svcomp-Reach-32bit-Kojak_Default.epf [2023-12-03 02:39:29,738 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-03 02:39:29,739 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2023-12-03 02:39:29,761 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-03 02:39:29,762 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-03 02:39:29,762 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2023-12-03 02:39:29,763 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-03 02:39:29,763 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-03 02:39:29,764 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-03 02:39:29,765 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-03 02:39:29,765 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-03 02:39:29,766 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-03 02:39:29,766 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-03 02:39:29,766 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-03 02:39:29,767 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-03 02:39:29,768 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-03 02:39:29,768 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-03 02:39:29,768 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-03 02:39:29,769 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-03 02:39:29,769 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-03 02:39:29,770 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2023-12-03 02:39:29,770 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2023-12-03 02:39:29,771 INFO L153 SettingsManager]: * Theory for external solver=ALL [2023-12-03 02:39:29,771 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-03 02:39:29,771 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-12-03 02:39:29,772 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-03 02:39:29,772 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-03 02:39:29,773 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-03 02:39:29,773 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2023-12-03 02:39:29,773 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-03 02:39:29,773 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-03 02:39:29,774 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_6de36314-43aa-4186-a099-2174e601d9c9/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_6de36314-43aa-4186-a099-2174e601d9c9/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 -> 889703d30f71ddcf9dd164cd63c57e33725418944081edb29f7e0df12e48cb88 [2023-12-03 02:39:30,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-03 02:39:30,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-03 02:39:30,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-03 02:39:30,050 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-03 02:39:30,050 INFO L274 PluginConnector]: CDTParser initialized [2023-12-03 02:39:30,051 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6de36314-43aa-4186-a099-2174e601d9c9/bin/ukojak-verify-Qdu7aM0XO9/../../sv-benchmarks/c/eca-rers2012/Problem01_label37.c [2023-12-03 02:39:32,748 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-03 02:39:33,022 INFO L384 CDTParser]: Found 1 translation units. [2023-12-03 02:39:33,023 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6de36314-43aa-4186-a099-2174e601d9c9/sv-benchmarks/c/eca-rers2012/Problem01_label37.c [2023-12-03 02:39:33,036 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6de36314-43aa-4186-a099-2174e601d9c9/bin/ukojak-verify-Qdu7aM0XO9/data/54aa4a884/0d493e4cc6ec489aaf90dfab03efe431/FLAGcb8dd72e1 [2023-12-03 02:39:33,049 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6de36314-43aa-4186-a099-2174e601d9c9/bin/ukojak-verify-Qdu7aM0XO9/data/54aa4a884/0d493e4cc6ec489aaf90dfab03efe431 [2023-12-03 02:39:33,051 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-03 02:39:33,052 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-03 02:39:33,054 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-03 02:39:33,054 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-03 02:39:33,058 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-03 02:39:33,058 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 02:39:33" (1/1) ... [2023-12-03 02:39:33,059 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@334bf637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:39:33, skipping insertion in model container [2023-12-03 02:39:33,060 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 02:39:33" (1/1) ... [2023-12-03 02:39:33,109 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-03 02:39:33,353 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_6de36314-43aa-4186-a099-2174e601d9c9/sv-benchmarks/c/eca-rers2012/Problem01_label37.c[14876,14889] [2023-12-03 02:39:33,399 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-03 02:39:33,411 INFO L202 MainTranslator]: Completed pre-run [2023-12-03 02:39:33,497 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_6de36314-43aa-4186-a099-2174e601d9c9/sv-benchmarks/c/eca-rers2012/Problem01_label37.c[14876,14889] [2023-12-03 02:39:33,517 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-03 02:39:33,532 INFO L206 MainTranslator]: Completed translation [2023-12-03 02:39:33,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:39:33 WrapperNode [2023-12-03 02:39:33,532 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-03 02:39:33,533 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-03 02:39:33,533 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-03 02:39:33,533 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-03 02:39:33,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:39:33" (1/1) ... [2023-12-03 02:39:33,561 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:39:33" (1/1) ... [2023-12-03 02:39:33,611 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 658 [2023-12-03 02:39:33,611 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-03 02:39:33,612 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-03 02:39:33,612 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-03 02:39:33,612 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-03 02:39:33,622 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:39:33" (1/1) ... [2023-12-03 02:39:33,623 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:39:33" (1/1) ... [2023-12-03 02:39:33,627 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:39:33" (1/1) ... [2023-12-03 02:39:33,628 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:39:33" (1/1) ... [2023-12-03 02:39:33,654 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:39:33" (1/1) ... [2023-12-03 02:39:33,664 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:39:33" (1/1) ... [2023-12-03 02:39:33,672 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:39:33" (1/1) ... [2023-12-03 02:39:33,676 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:39:33" (1/1) ... [2023-12-03 02:39:33,684 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-03 02:39:33,685 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-03 02:39:33,685 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-03 02:39:33,685 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-03 02:39:33,686 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:39:33" (1/1) ... [2023-12-03 02:39:33,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-12-03 02:39:33,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6de36314-43aa-4186-a099-2174e601d9c9/bin/ukojak-verify-Qdu7aM0XO9/z3 [2023-12-03 02:39:33,713 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6de36314-43aa-4186-a099-2174e601d9c9/bin/ukojak-verify-Qdu7aM0XO9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2023-12-03 02:39:33,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6de36314-43aa-4186-a099-2174e601d9c9/bin/ukojak-verify-Qdu7aM0XO9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2023-12-03 02:39:33,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-03 02:39:33,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-03 02:39:33,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-03 02:39:33,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-03 02:39:33,859 INFO L241 CfgBuilder]: Building ICFG [2023-12-03 02:39:33,862 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-03 02:39:34,712 INFO L282 CfgBuilder]: Performing block encoding [2023-12-03 02:39:34,885 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-03 02:39:34,886 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-03 02:39:34,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:39:34 BoogieIcfgContainer [2023-12-03 02:39:34,888 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-03 02:39:34,889 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2023-12-03 02:39:34,889 INFO L270 PluginConnector]: Initializing CodeCheck... [2023-12-03 02:39:34,896 INFO L274 PluginConnector]: CodeCheck initialized [2023-12-03 02:39:34,896 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:39:34" (1/1) ... [2023-12-03 02:39:34,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-03 02:39:34,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:34,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2023-12-03 02:39:34,951 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2023-12-03 02:39:34,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-03 02:39:34,955 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:34,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:35,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:35,363 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-03 02:39:35,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:35,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 145 states and 243 transitions. [2023-12-03 02:39:35,865 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 243 transitions. [2023-12-03 02:39:35,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-03 02:39:35,869 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:35,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:35,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:36,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:39:36,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:36,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 218 states and 323 transitions. [2023-12-03 02:39:36,790 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 323 transitions. [2023-12-03 02:39:36,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-03 02:39:36,793 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:36,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:36,925 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:39:37,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:37,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 219 states and 326 transitions. [2023-12-03 02:39:37,172 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 326 transitions. [2023-12-03 02:39:37,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-12-03 02:39:37,175 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:37,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:37,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:37,342 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:39:37,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:37,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 229 states and 341 transitions. [2023-12-03 02:39:37,582 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 341 transitions. [2023-12-03 02:39:37,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-03 02:39:37,586 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:37,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:37,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:37,820 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:39:38,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:38,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 240 states and 357 transitions. [2023-12-03 02:39:38,259 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 357 transitions. [2023-12-03 02:39:38,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-03 02:39:38,261 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:38,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:38,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:38,383 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:39:38,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:38,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 243 states and 361 transitions. [2023-12-03 02:39:38,528 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 361 transitions. [2023-12-03 02:39:38,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-03 02:39:38,529 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:38,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:38,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:38,715 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:39:38,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:38,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 253 states and 372 transitions. [2023-12-03 02:39:38,859 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 372 transitions. [2023-12-03 02:39:38,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-03 02:39:38,860 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:38,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:38,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:39,001 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-03 02:39:39,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:39,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 267 states and 388 transitions. [2023-12-03 02:39:39,429 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 388 transitions. [2023-12-03 02:39:39,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-03 02:39:39,431 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:39,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:39,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:39,505 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-03 02:39:39,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:39,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 268 states and 390 transitions. [2023-12-03 02:39:39,712 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 390 transitions. [2023-12-03 02:39:39,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-03 02:39:39,713 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:39,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:39,796 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-03 02:39:39,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:39,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 271 states and 394 transitions. [2023-12-03 02:39:39,962 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 394 transitions. [2023-12-03 02:39:39,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-03 02:39:39,963 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:39,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:39,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:40,151 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-03 02:39:40,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:40,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 286 states and 416 transitions. [2023-12-03 02:39:40,808 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 416 transitions. [2023-12-03 02:39:40,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-03 02:39:40,810 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:40,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:40,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:40,927 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-03 02:39:41,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:41,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 293 states and 423 transitions. [2023-12-03 02:39:41,092 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 423 transitions. [2023-12-03 02:39:41,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-03 02:39:41,093 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:41,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:41,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:41,257 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-03 02:39:41,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:41,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 296 states and 426 transitions. [2023-12-03 02:39:41,437 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 426 transitions. [2023-12-03 02:39:41,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-03 02:39:41,438 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:41,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:41,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:41,595 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-03 02:39:41,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:41,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 299 states and 429 transitions. [2023-12-03 02:39:41,760 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 429 transitions. [2023-12-03 02:39:41,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-03 02:39:41,761 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:41,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:41,847 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-03 02:39:42,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:42,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 314 states and 450 transitions. [2023-12-03 02:39:42,078 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 450 transitions. [2023-12-03 02:39:42,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-03 02:39:42,080 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:42,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:42,189 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-03 02:39:42,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:42,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 330 states and 472 transitions. [2023-12-03 02:39:42,934 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 472 transitions. [2023-12-03 02:39:42,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-03 02:39:42,935 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:42,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:42,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:42,994 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-03 02:39:43,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:43,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 337 states and 479 transitions. [2023-12-03 02:39:43,206 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 479 transitions. [2023-12-03 02:39:43,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-03 02:39:43,207 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:43,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:43,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:43,278 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-03 02:39:43,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:43,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 340 states and 482 transitions. [2023-12-03 02:39:43,435 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 482 transitions. [2023-12-03 02:39:43,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-03 02:39:43,436 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:43,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:43,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:43,510 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-03 02:39:43,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:43,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 341 states and 483 transitions. [2023-12-03 02:39:43,647 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 483 transitions. [2023-12-03 02:39:43,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-03 02:39:43,648 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:43,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:43,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:43,705 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:39:44,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:44,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 350 states and 495 transitions. [2023-12-03 02:39:44,018 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 495 transitions. [2023-12-03 02:39:44,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-03 02:39:44,019 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:44,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:44,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:44,153 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-03 02:39:44,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:44,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 354 states and 499 transitions. [2023-12-03 02:39:44,353 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 499 transitions. [2023-12-03 02:39:44,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-03 02:39:44,354 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:44,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:44,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:44,442 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:39:44,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:44,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 363 states and 513 transitions. [2023-12-03 02:39:44,819 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 513 transitions. [2023-12-03 02:39:44,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-03 02:39:44,820 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:44,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:44,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:44,898 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:39:45,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:45,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 367 states and 517 transitions. [2023-12-03 02:39:45,156 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 517 transitions. [2023-12-03 02:39:45,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-03 02:39:45,158 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:45,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:45,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:45,334 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-03 02:39:45,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:45,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 386 states and 542 transitions. [2023-12-03 02:39:45,926 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 542 transitions. [2023-12-03 02:39:45,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-03 02:39:45,927 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:45,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:46,026 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-03 02:39:46,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:46,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 388 states and 544 transitions. [2023-12-03 02:39:46,180 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 544 transitions. [2023-12-03 02:39:46,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-03 02:39:46,181 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:46,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:46,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:46,241 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-03 02:39:46,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:46,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 392 states and 548 transitions. [2023-12-03 02:39:46,410 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 548 transitions. [2023-12-03 02:39:46,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-03 02:39:46,410 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:46,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:46,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:46,489 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-03 02:39:46,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:46,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 409 states and 568 transitions. [2023-12-03 02:39:46,756 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 568 transitions. [2023-12-03 02:39:46,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-03 02:39:46,756 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:46,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:46,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:46,831 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-03 02:39:47,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:47,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 432 states and 597 transitions. [2023-12-03 02:39:47,627 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 597 transitions. [2023-12-03 02:39:47,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-03 02:39:47,628 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:47,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:47,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:47,735 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-03 02:39:47,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:47,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 436 states and 600 transitions. [2023-12-03 02:39:47,923 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 600 transitions. [2023-12-03 02:39:47,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-03 02:39:47,924 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:47,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:47,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:47,992 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-03 02:39:48,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:48,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 451 states and 617 transitions. [2023-12-03 02:39:48,511 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 617 transitions. [2023-12-03 02:39:48,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-03 02:39:48,512 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:48,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:48,708 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-03 02:39:49,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:49,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 463 states and 629 transitions. [2023-12-03 02:39:49,229 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 629 transitions. [2023-12-03 02:39:49,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-03 02:39:49,230 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:49,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:49,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:49,339 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-03 02:39:49,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:49,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 469 states and 636 transitions. [2023-12-03 02:39:49,663 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 636 transitions. [2023-12-03 02:39:49,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-03 02:39:49,663 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:49,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:49,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:49,761 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-03 02:39:50,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:50,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 473 states and 640 transitions. [2023-12-03 02:39:50,126 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 640 transitions. [2023-12-03 02:39:50,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-03 02:39:50,128 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:50,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:50,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:50,241 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:39:50,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:50,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 561 states and 740 transitions. [2023-12-03 02:39:50,827 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 740 transitions. [2023-12-03 02:39:50,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-03 02:39:50,828 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:50,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:50,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:50,945 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-03 02:39:51,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:51,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 565 states and 743 transitions. [2023-12-03 02:39:51,149 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 743 transitions. [2023-12-03 02:39:51,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-03 02:39:51,150 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:51,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:51,365 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 47 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:39:51,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:51,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 580 states and 763 transitions. [2023-12-03 02:39:51,984 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 763 transitions. [2023-12-03 02:39:51,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-03 02:39:51,985 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:51,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:52,087 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 47 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:39:52,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:52,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 583 states and 767 transitions. [2023-12-03 02:39:52,373 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 767 transitions. [2023-12-03 02:39:52,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-03 02:39:52,373 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:52,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:52,492 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-03 02:39:53,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:53,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 621 states and 812 transitions. [2023-12-03 02:39:53,296 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 812 transitions. [2023-12-03 02:39:53,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-03 02:39:53,297 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:53,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:53,394 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-03 02:39:54,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:54,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 632 states and 827 transitions. [2023-12-03 02:39:54,099 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 827 transitions. [2023-12-03 02:39:54,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-03 02:39:54,100 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:54,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:54,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:54,159 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-03 02:39:54,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:54,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 637 states and 838 transitions. [2023-12-03 02:39:54,525 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 838 transitions. [2023-12-03 02:39:54,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-03 02:39:54,526 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:54,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:54,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:54,571 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-03 02:39:54,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:54,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 640 states and 842 transitions. [2023-12-03 02:39:54,780 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 842 transitions. [2023-12-03 02:39:54,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-03 02:39:54,781 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:54,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:54,872 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 56 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-03 02:39:55,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:55,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 647 states and 854 transitions. [2023-12-03 02:39:55,297 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 854 transitions. [2023-12-03 02:39:55,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-03 02:39:55,298 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:55,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:55,348 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-03 02:39:55,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:55,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 654 states and 864 transitions. [2023-12-03 02:39:55,732 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 864 transitions. [2023-12-03 02:39:55,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-03 02:39:55,733 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:55,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:55,785 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-03 02:39:56,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:56,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 661 states and 871 transitions. [2023-12-03 02:39:56,198 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 871 transitions. [2023-12-03 02:39:56,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-03 02:39:56,198 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:56,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:56,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:56,263 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-03 02:39:56,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:56,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 684 states and 900 transitions. [2023-12-03 02:39:56,902 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 900 transitions. [2023-12-03 02:39:56,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-03 02:39:56,903 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:56,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:56,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:56,963 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-03 02:39:57,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:57,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 720 states and 938 transitions. [2023-12-03 02:39:57,631 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 938 transitions. [2023-12-03 02:39:57,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-03 02:39:57,632 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:57,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:57,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:57,698 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-03 02:39:58,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:58,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 729 states and 948 transitions. [2023-12-03 02:39:58,098 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 948 transitions. [2023-12-03 02:39:58,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-03 02:39:58,099 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:58,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:58,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:58,150 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-03 02:39:58,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:58,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 736 states and 956 transitions. [2023-12-03 02:39:58,385 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 956 transitions. [2023-12-03 02:39:58,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-03 02:39:58,386 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:58,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:58,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:58,433 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-03 02:39:58,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:58,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 745 states and 965 transitions. [2023-12-03 02:39:58,944 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 965 transitions. [2023-12-03 02:39:58,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-03 02:39:58,945 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:58,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:58,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:59,040 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-03 02:39:59,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:39:59,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 762 states and 987 transitions. [2023-12-03 02:39:59,612 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 987 transitions. [2023-12-03 02:39:59,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-03 02:39:59,613 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:39:59,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:39:59,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:39:59,827 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 71 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:40:00,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:00,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 763 states and 988 transitions. [2023-12-03 02:40:00,098 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 988 transitions. [2023-12-03 02:40:00,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-03 02:40:00,099 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:00,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:00,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:00,234 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 71 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:40:00,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:00,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 773 states and 999 transitions. [2023-12-03 02:40:00,887 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 999 transitions. [2023-12-03 02:40:00,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-03 02:40:00,889 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:00,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:01,028 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 71 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:40:01,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:01,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 776 states and 1002 transitions. [2023-12-03 02:40:01,267 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1002 transitions. [2023-12-03 02:40:01,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-03 02:40:01,269 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:01,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:01,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:01,316 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-03 02:40:01,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:01,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 789 states and 1016 transitions. [2023-12-03 02:40:01,567 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1016 transitions. [2023-12-03 02:40:01,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-03 02:40:01,568 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:01,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:01,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:01,632 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-03 02:40:01,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:01,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 798 states and 1026 transitions. [2023-12-03 02:40:01,936 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1026 transitions. [2023-12-03 02:40:01,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-03 02:40:01,937 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:01,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:01,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:02,029 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-03 02:40:02,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:02,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 814 states and 1046 transitions. [2023-12-03 02:40:02,880 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1046 transitions. [2023-12-03 02:40:02,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-03 02:40:02,881 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:02,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:02,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:02,988 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-03 02:40:03,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:03,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 821 states and 1053 transitions. [2023-12-03 02:40:03,378 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1053 transitions. [2023-12-03 02:40:03,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-03 02:40:03,379 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:03,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:03,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:03,427 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-12-03 02:40:03,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:03,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 825 states and 1058 transitions. [2023-12-03 02:40:03,671 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1058 transitions. [2023-12-03 02:40:03,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-03 02:40:03,672 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:03,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:03,754 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-03 02:40:04,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:04,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 832 states and 1065 transitions. [2023-12-03 02:40:04,182 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1065 transitions. [2023-12-03 02:40:04,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-03 02:40:04,183 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:04,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:04,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:04,265 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-03 02:40:04,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:04,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 837 states and 1069 transitions. [2023-12-03 02:40:04,439 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1069 transitions. [2023-12-03 02:40:04,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-12-03 02:40:04,440 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:04,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:04,515 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:40:04,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:04,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 868 states and 1118 transitions. [2023-12-03 02:40:04,916 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1118 transitions. [2023-12-03 02:40:04,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-03 02:40:04,917 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:04,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:04,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:05,082 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 69 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:40:05,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:05,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 882 states and 1135 transitions. [2023-12-03 02:40:05,611 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1135 transitions. [2023-12-03 02:40:05,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-03 02:40:05,612 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:05,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:05,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:05,688 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-03 02:40:05,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:05,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 884 states and 1139 transitions. [2023-12-03 02:40:05,891 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1139 transitions. [2023-12-03 02:40:05,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-03 02:40:05,892 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:05,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:05,947 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:40:06,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:06,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 928 states and 1187 transitions. [2023-12-03 02:40:06,757 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1187 transitions. [2023-12-03 02:40:06,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-03 02:40:06,758 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:06,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:06,812 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:40:07,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:07,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 935 states and 1194 transitions. [2023-12-03 02:40:07,245 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1194 transitions. [2023-12-03 02:40:07,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-03 02:40:07,246 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:07,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:07,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:07,316 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:40:07,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:07,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 964 states and 1229 transitions. [2023-12-03 02:40:07,944 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1229 transitions. [2023-12-03 02:40:07,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-03 02:40:07,945 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:07,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:07,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:08,012 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:40:08,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:08,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 966 states and 1230 transitions. [2023-12-03 02:40:08,379 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1230 transitions. [2023-12-03 02:40:08,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-12-03 02:40:08,380 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:08,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:08,449 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:40:11,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:11,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1006 states and 1289 transitions. [2023-12-03 02:40:11,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1289 transitions. [2023-12-03 02:40:11,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-12-03 02:40:11,344 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:11,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:11,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:11,407 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:40:12,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:12,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1024 states and 1314 transitions. [2023-12-03 02:40:12,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1314 transitions. [2023-12-03 02:40:12,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-12-03 02:40:12,725 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:12,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:12,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:12,825 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:40:13,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:13,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1035 states and 1326 transitions. [2023-12-03 02:40:13,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1326 transitions. [2023-12-03 02:40:13,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-12-03 02:40:13,870 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:13,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:13,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:13,955 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:40:14,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:14,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1037 states and 1327 transitions. [2023-12-03 02:40:14,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1327 transitions. [2023-12-03 02:40:14,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-12-03 02:40:14,279 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:14,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:14,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:14,343 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:40:14,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:14,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1046 states and 1338 transitions. [2023-12-03 02:40:14,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1338 transitions. [2023-12-03 02:40:14,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-12-03 02:40:14,762 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:14,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:14,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:14,854 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:40:15,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:15,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1051 states and 1343 transitions. [2023-12-03 02:40:15,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1343 transitions. [2023-12-03 02:40:15,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-12-03 02:40:15,177 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:15,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:15,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:15,245 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:40:15,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:15,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1060 states and 1351 transitions. [2023-12-03 02:40:15,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1351 transitions. [2023-12-03 02:40:15,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-12-03 02:40:15,867 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:15,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:15,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:15,966 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:40:16,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:16,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1069 states and 1361 transitions. [2023-12-03 02:40:16,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1361 transitions. [2023-12-03 02:40:16,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-12-03 02:40:16,664 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:16,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:16,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:16,755 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:40:17,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:17,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1074 states and 1365 transitions. [2023-12-03 02:40:17,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1365 transitions. [2023-12-03 02:40:17,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-12-03 02:40:17,069 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:17,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:17,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:17,133 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:40:17,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:17,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1079 states and 1370 transitions. [2023-12-03 02:40:17,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1370 transitions. [2023-12-03 02:40:17,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-12-03 02:40:17,449 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:17,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:17,512 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:40:18,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:18,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1089 states and 1380 transitions. [2023-12-03 02:40:18,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1380 transitions. [2023-12-03 02:40:18,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-12-03 02:40:18,057 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:18,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:18,121 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:40:18,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:18,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1091 states and 1382 transitions. [2023-12-03 02:40:18,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1382 transitions. [2023-12-03 02:40:18,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-12-03 02:40:18,484 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:18,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:18,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:18,548 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:40:18,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:18,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1096 states and 1386 transitions. [2023-12-03 02:40:18,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1386 transitions. [2023-12-03 02:40:18,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-12-03 02:40:18,752 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:18,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:18,815 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:40:19,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:19,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1387 states to 1098 states and 1387 transitions. [2023-12-03 02:40:19,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1387 transitions. [2023-12-03 02:40:19,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2023-12-03 02:40:19,115 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:19,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:19,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:19,301 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 76 proven. 3 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-03 02:40:19,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:19,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1101 states and 1390 transitions. [2023-12-03 02:40:19,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1390 transitions. [2023-12-03 02:40:19,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2023-12-03 02:40:19,454 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:19,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:19,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:19,686 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 76 proven. 3 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-03 02:40:19,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:19,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1104 states and 1393 transitions. [2023-12-03 02:40:19,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1393 transitions. [2023-12-03 02:40:19,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-12-03 02:40:19,896 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:19,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:19,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:20,020 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-03 02:40:20,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:20,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1105 states and 1394 transitions. [2023-12-03 02:40:20,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1394 transitions. [2023-12-03 02:40:20,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2023-12-03 02:40:20,225 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:20,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:20,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:20,296 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-12-03 02:40:21,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:21,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1119 states and 1411 transitions. [2023-12-03 02:40:21,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1411 transitions. [2023-12-03 02:40:21,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2023-12-03 02:40:21,240 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:21,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:21,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:21,304 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-03 02:40:21,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:21,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1137 states and 1431 transitions. [2023-12-03 02:40:21,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1431 transitions. [2023-12-03 02:40:21,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2023-12-03 02:40:21,814 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:21,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:21,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:21,997 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-03 02:40:22,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:22,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1138 states and 1433 transitions. [2023-12-03 02:40:22,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1433 transitions. [2023-12-03 02:40:22,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2023-12-03 02:40:22,458 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:22,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:22,530 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:40:23,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:23,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1149 states and 1446 transitions. [2023-12-03 02:40:23,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1446 transitions. [2023-12-03 02:40:23,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2023-12-03 02:40:23,439 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:23,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:23,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:23,549 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2023-12-03 02:40:23,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:23,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1162 states and 1460 transitions. [2023-12-03 02:40:23,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1460 transitions. [2023-12-03 02:40:23,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2023-12-03 02:40:23,769 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:23,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:23,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:23,843 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-12-03 02:40:23,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:23,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1163 states and 1461 transitions. [2023-12-03 02:40:23,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1461 transitions. [2023-12-03 02:40:23,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2023-12-03 02:40:23,889 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:23,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:24,018 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-03 02:40:24,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:24,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1183 states and 1485 transitions. [2023-12-03 02:40:24,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1485 transitions. [2023-12-03 02:40:24,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2023-12-03 02:40:24,312 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:24,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:24,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:24,385 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2023-12-03 02:40:24,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:24,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1194 states and 1497 transitions. [2023-12-03 02:40:24,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1497 transitions. [2023-12-03 02:40:24,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2023-12-03 02:40:24,751 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:24,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:24,873 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2023-12-03 02:40:24,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:24,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1195 states and 1498 transitions. [2023-12-03 02:40:24,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1498 transitions. [2023-12-03 02:40:24,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2023-12-03 02:40:24,915 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:24,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:24,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:25,218 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 137 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:40:27,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:27,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1265 states and 1572 transitions. [2023-12-03 02:40:27,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1572 transitions. [2023-12-03 02:40:27,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2023-12-03 02:40:27,013 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:27,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:27,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:27,309 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 137 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:40:27,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:27,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1280 states and 1590 transitions. [2023-12-03 02:40:27,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1590 transitions. [2023-12-03 02:40:27,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2023-12-03 02:40:27,854 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:27,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:28,056 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 137 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:40:28,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:28,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1291 states and 1600 transitions. [2023-12-03 02:40:28,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1600 transitions. [2023-12-03 02:40:28,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2023-12-03 02:40:28,354 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:28,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:28,552 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 137 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:40:29,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:29,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1302 states and 1611 transitions. [2023-12-03 02:40:29,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1611 transitions. [2023-12-03 02:40:29,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2023-12-03 02:40:29,036 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:29,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:29,244 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 137 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-03 02:40:29,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:29,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1305 states and 1615 transitions. [2023-12-03 02:40:29,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1615 transitions. [2023-12-03 02:40:29,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2023-12-03 02:40:29,401 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:29,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:29,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:29,483 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2023-12-03 02:40:29,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:29,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 1316 states and 1627 transitions. [2023-12-03 02:40:29,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1627 transitions. [2023-12-03 02:40:29,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2023-12-03 02:40:29,672 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:29,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:29,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:30,265 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 143 proven. 3 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-03 02:40:34,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:34,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1727 states to 1385 states and 1727 transitions. [2023-12-03 02:40:34,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 1727 transitions. [2023-12-03 02:40:34,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2023-12-03 02:40:34,308 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:34,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:34,589 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 143 proven. 3 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-03 02:40:36,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:36,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1768 states to 1421 states and 1768 transitions. [2023-12-03 02:40:36,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 1768 transitions. [2023-12-03 02:40:36,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2023-12-03 02:40:36,492 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:36,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:36,595 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-03 02:40:37,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:37,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1424 states and 1776 transitions. [2023-12-03 02:40:37,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 1776 transitions. [2023-12-03 02:40:37,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2023-12-03 02:40:37,567 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:37,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:37,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:37,717 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-03 02:40:38,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:38,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1787 states to 1436 states and 1787 transitions. [2023-12-03 02:40:38,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 1787 transitions. [2023-12-03 02:40:38,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2023-12-03 02:40:38,820 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:38,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:38,957 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-03 02:40:39,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:39,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1787 states to 1437 states and 1787 transitions. [2023-12-03 02:40:39,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 1787 transitions. [2023-12-03 02:40:39,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2023-12-03 02:40:39,208 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:39,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:39,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:39,315 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-03 02:40:39,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:39,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1438 states and 1789 transitions. [2023-12-03 02:40:39,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 1789 transitions. [2023-12-03 02:40:39,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2023-12-03 02:40:39,698 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:39,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:39,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:39,978 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-03 02:40:41,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:41,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1456 states and 1810 transitions. [2023-12-03 02:40:41,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 1810 transitions. [2023-12-03 02:40:41,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2023-12-03 02:40:41,630 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:41,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:41,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:41,751 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-03 02:40:43,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:43,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1843 states to 1490 states and 1843 transitions. [2023-12-03 02:40:43,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 1843 transitions. [2023-12-03 02:40:43,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2023-12-03 02:40:43,050 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:43,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:43,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:43,555 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-03 02:40:45,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:45,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1560 states and 1914 transitions. [2023-12-03 02:40:45,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 1914 transitions. [2023-12-03 02:40:45,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2023-12-03 02:40:45,383 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:45,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:45,634 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-03 02:40:46,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:46,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1561 states and 1914 transitions. [2023-12-03 02:40:46,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 1914 transitions. [2023-12-03 02:40:46,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2023-12-03 02:40:46,006 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:46,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:46,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:46,101 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2023-12-03 02:40:46,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:46,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1574 states and 1927 transitions. [2023-12-03 02:40:46,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 1927 transitions. [2023-12-03 02:40:46,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2023-12-03 02:40:46,197 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:46,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:46,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:47,028 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 168 proven. 36 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-03 02:40:48,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:48,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1622 states and 1989 transitions. [2023-12-03 02:40:48,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 1989 transitions. [2023-12-03 02:40:48,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2023-12-03 02:40:48,758 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:48,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:48,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:48,872 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-12-03 02:40:50,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:50,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2016 states to 1644 states and 2016 transitions. [2023-12-03 02:40:50,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 2016 transitions. [2023-12-03 02:40:50,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2023-12-03 02:40:50,548 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:50,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:50,627 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-12-03 02:40:51,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:51,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 1663 states and 2035 transitions. [2023-12-03 02:40:51,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 2035 transitions. [2023-12-03 02:40:51,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2023-12-03 02:40:51,201 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:51,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:52,133 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-03 02:40:59,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:40:59,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2148 states to 1732 states and 2148 transitions. [2023-12-03 02:40:59,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2148 transitions. [2023-12-03 02:40:59,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2023-12-03 02:40:59,043 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:40:59,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:40:59,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:40:59,453 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-03 02:41:04,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:41:04,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2195 states to 1771 states and 2195 transitions. [2023-12-03 02:41:04,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2195 transitions. [2023-12-03 02:41:04,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2023-12-03 02:41:04,474 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:41:04,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:41:04,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:41:04,792 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-03 02:41:06,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:41:06,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2210 states to 1784 states and 2210 transitions. [2023-12-03 02:41:06,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2210 transitions. [2023-12-03 02:41:06,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2023-12-03 02:41:06,117 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:41:06,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:41:06,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:41:06,407 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-03 02:41:06,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:41:06,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2212 states to 1786 states and 2212 transitions. [2023-12-03 02:41:06,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 2212 transitions. [2023-12-03 02:41:06,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2023-12-03 02:41:06,976 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:41:06,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:41:07,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:41:07,326 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-03 02:41:08,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:41:08,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2219 states to 1793 states and 2219 transitions. [2023-12-03 02:41:08,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2219 transitions. [2023-12-03 02:41:08,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2023-12-03 02:41:08,245 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:41:08,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:41:08,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:41:08,536 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-03 02:41:09,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:41:09,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 1797 states and 2223 transitions. [2023-12-03 02:41:09,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2223 transitions. [2023-12-03 02:41:09,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2023-12-03 02:41:09,004 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:41:09,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:41:09,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:41:09,439 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-03 02:41:09,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:41:09,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2227 states to 1802 states and 2227 transitions. [2023-12-03 02:41:09,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 2227 transitions. [2023-12-03 02:41:09,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2023-12-03 02:41:09,962 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:41:09,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:41:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:41:10,317 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-03 02:41:11,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:41:11,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2233 states to 1809 states and 2233 transitions. [2023-12-03 02:41:11,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2233 transitions. [2023-12-03 02:41:11,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2023-12-03 02:41:11,139 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:41:11,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:41:11,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:41:11,458 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-03 02:41:12,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:41:12,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2244 states to 1818 states and 2244 transitions. [2023-12-03 02:41:12,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1818 states and 2244 transitions. [2023-12-03 02:41:12,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2023-12-03 02:41:12,843 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:41:12,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:41:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:41:13,224 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-03 02:41:13,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:41:13,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 1820 states and 2246 transitions. [2023-12-03 02:41:13,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 2246 transitions. [2023-12-03 02:41:13,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2023-12-03 02:41:13,727 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:41:13,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:41:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:41:14,011 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-03 02:41:15,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:41:15,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2256 states to 1829 states and 2256 transitions. [2023-12-03 02:41:15,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2256 transitions. [2023-12-03 02:41:15,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2023-12-03 02:41:15,016 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:41:15,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:41:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:41:15,394 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-03 02:41:15,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:41:15,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 1835 states and 2261 transitions. [2023-12-03 02:41:15,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 2261 transitions. [2023-12-03 02:41:15,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2023-12-03 02:41:15,922 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:41:15,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:41:15,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:41:16,272 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-03 02:41:16,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:41:16,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2265 states to 1840 states and 2265 transitions. [2023-12-03 02:41:16,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2265 transitions. [2023-12-03 02:41:16,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2023-12-03 02:41:16,736 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:41:16,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:41:16,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:41:17,026 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-03 02:41:17,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:41:17,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2269 states to 1845 states and 2269 transitions. [2023-12-03 02:41:17,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2269 transitions. [2023-12-03 02:41:17,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2023-12-03 02:41:17,555 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:41:17,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:41:17,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:41:17,847 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-03 02:41:18,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:41:18,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2273 states to 1850 states and 2273 transitions. [2023-12-03 02:41:18,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 2273 transitions. [2023-12-03 02:41:18,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2023-12-03 02:41:18,308 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:41:18,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:41:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:41:18,705 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-03 02:41:19,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:41:19,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2276 states to 1854 states and 2276 transitions. [2023-12-03 02:41:19,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2276 transitions. [2023-12-03 02:41:19,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2023-12-03 02:41:19,156 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:41:19,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:41:19,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:41:19,468 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-03 02:41:19,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:41:19,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 1858 states and 2279 transitions. [2023-12-03 02:41:19,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2279 transitions. [2023-12-03 02:41:19,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2023-12-03 02:41:19,574 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:41:19,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:41:19,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:41:19,861 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 206 proven. 38 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-03 02:41:20,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:41:20,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 1862 states and 2282 transitions. [2023-12-03 02:41:20,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 2282 transitions. [2023-12-03 02:41:20,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2023-12-03 02:41:20,360 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:41:20,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:41:20,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:41:20,819 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 198 proven. 51 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2023-12-03 02:41:21,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:41:21,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2300 states to 1877 states and 2300 transitions. [2023-12-03 02:41:21,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2300 transitions. [2023-12-03 02:41:21,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2023-12-03 02:41:21,695 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:41:21,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:41:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:41:21,796 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2023-12-03 02:41:22,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:41:22,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 1882 states and 2305 transitions. [2023-12-03 02:41:22,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 2305 transitions. [2023-12-03 02:41:22,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2023-12-03 02:41:22,109 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:41:22,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:41:22,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:41:22,188 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2023-12-03 02:41:22,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:41:22,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2311 states to 1887 states and 2311 transitions. [2023-12-03 02:41:22,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1887 states and 2311 transitions. [2023-12-03 02:41:22,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2023-12-03 02:41:22,520 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:41:22,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:41:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:41:22,621 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-03 02:41:23,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:41:23,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2354 states to 1926 states and 2354 transitions. [2023-12-03 02:41:23,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 2354 transitions. [2023-12-03 02:41:23,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2023-12-03 02:41:23,856 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:41:23,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:41:23,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:41:24,078 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 94 proven. 162 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-03 02:41:24,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:41:24,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2354 states to 1927 states and 2354 transitions. [2023-12-03 02:41:24,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 2354 transitions. [2023-12-03 02:41:24,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2023-12-03 02:41:24,185 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:41:24,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:41:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:41:24,261 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2023-12-03 02:41:24,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:41:24,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2358 states to 1931 states and 2358 transitions. [2023-12-03 02:41:24,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2358 transitions. [2023-12-03 02:41:24,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2023-12-03 02:41:24,365 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:41:24,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:41:24,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:41:24,441 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2023-12-03 02:41:24,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:41:24,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 1935 states and 2362 transitions. [2023-12-03 02:41:24,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2362 transitions. [2023-12-03 02:41:24,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2023-12-03 02:41:24,604 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:41:24,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:41:24,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:41:25,334 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 192 proven. 21 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2023-12-03 02:41:26,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:41:26,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2367 states to 1939 states and 2367 transitions. [2023-12-03 02:41:26,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 2367 transitions. [2023-12-03 02:41:26,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2023-12-03 02:41:26,770 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:41:26,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:41:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:41:27,135 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 192 proven. 21 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2023-12-03 02:41:27,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:41:27,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2369 states to 1942 states and 2369 transitions. [2023-12-03 02:41:27,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 2369 transitions. [2023-12-03 02:41:27,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2023-12-03 02:41:27,789 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:41:27,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:41:27,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:41:28,390 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 232 proven. 68 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2023-12-03 02:41:29,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:41:29,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2394 states to 1960 states and 2394 transitions. [2023-12-03 02:41:29,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 2394 transitions. [2023-12-03 02:41:29,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2023-12-03 02:41:29,040 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:41:29,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:41:29,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:41:29,728 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-03 02:41:42,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:41:42,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2528 states to 2048 states and 2528 transitions. [2023-12-03 02:41:42,367 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 2528 transitions. [2023-12-03 02:41:42,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2023-12-03 02:41:42,368 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:41:42,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:41:42,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:41:42,768 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-03 02:41:46,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:41:46,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2563 states to 2077 states and 2563 transitions. [2023-12-03 02:41:46,212 INFO L276 IsEmpty]: Start isEmpty. Operand 2077 states and 2563 transitions. [2023-12-03 02:41:46,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2023-12-03 02:41:46,214 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:41:46,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:41:46,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:41:46,523 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-03 02:41:48,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:41:48,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2578 states to 2090 states and 2578 transitions. [2023-12-03 02:41:48,852 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 2578 transitions. [2023-12-03 02:41:48,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2023-12-03 02:41:48,853 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:41:48,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:41:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:41:49,269 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-03 02:41:50,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:41:50,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2586 states to 2097 states and 2586 transitions. [2023-12-03 02:41:50,440 INFO L276 IsEmpty]: Start isEmpty. Operand 2097 states and 2586 transitions. [2023-12-03 02:41:50,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2023-12-03 02:41:50,441 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:41:50,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:41:50,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:41:50,752 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-03 02:41:51,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:41:51,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2594 states to 2102 states and 2594 transitions. [2023-12-03 02:41:51,447 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 2594 transitions. [2023-12-03 02:41:51,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2023-12-03 02:41:51,448 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:41:51,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:41:51,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:41:51,778 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-03 02:41:53,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:41:53,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2601 states to 2109 states and 2601 transitions. [2023-12-03 02:41:53,054 INFO L276 IsEmpty]: Start isEmpty. Operand 2109 states and 2601 transitions. [2023-12-03 02:41:53,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2023-12-03 02:41:53,055 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:41:53,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:41:53,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:41:53,464 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-03 02:41:54,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:41:54,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2606 states to 2114 states and 2606 transitions. [2023-12-03 02:41:54,091 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 2606 transitions. [2023-12-03 02:41:54,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2023-12-03 02:41:54,092 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:41:54,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:41:54,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:41:54,405 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-03 02:41:55,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:41:55,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2614 states to 2121 states and 2614 transitions. [2023-12-03 02:41:55,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 2614 transitions. [2023-12-03 02:41:55,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2023-12-03 02:41:55,637 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:41:55,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:41:55,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:41:55,950 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-03 02:41:56,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:41:56,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2617 states to 2124 states and 2617 transitions. [2023-12-03 02:41:56,557 INFO L276 IsEmpty]: Start isEmpty. Operand 2124 states and 2617 transitions. [2023-12-03 02:41:56,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2023-12-03 02:41:56,558 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:41:56,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:41:56,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:41:56,973 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-03 02:41:58,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:41:58,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2628 states to 2133 states and 2628 transitions. [2023-12-03 02:41:58,699 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 2628 transitions. [2023-12-03 02:41:58,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2023-12-03 02:41:58,700 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:41:58,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:41:58,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:41:59,018 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-03 02:42:01,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:42:01,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2646 states to 2149 states and 2646 transitions. [2023-12-03 02:42:01,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2149 states and 2646 transitions. [2023-12-03 02:42:01,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2023-12-03 02:42:01,143 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:42:01,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:42:01,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:42:01,476 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-03 02:42:02,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:42:02,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2656 states to 2158 states and 2656 transitions. [2023-12-03 02:42:02,890 INFO L276 IsEmpty]: Start isEmpty. Operand 2158 states and 2656 transitions. [2023-12-03 02:42:02,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2023-12-03 02:42:02,892 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:42:02,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:42:02,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:42:03,329 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-03 02:42:05,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:42:05,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2171 states and 2673 transitions. [2023-12-03 02:42:05,935 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 2673 transitions. [2023-12-03 02:42:05,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2023-12-03 02:42:05,936 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:42:05,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:42:05,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:42:06,247 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-03 02:42:06,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:42:06,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2685 states to 2182 states and 2685 transitions. [2023-12-03 02:42:06,428 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 2685 transitions. [2023-12-03 02:42:06,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2023-12-03 02:42:06,429 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:42:06,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:42:06,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:42:06,739 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-03 02:42:07,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:42:07,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2686 states to 2184 states and 2686 transitions. [2023-12-03 02:42:07,407 INFO L276 IsEmpty]: Start isEmpty. Operand 2184 states and 2686 transitions. [2023-12-03 02:42:07,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2023-12-03 02:42:07,409 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:42:07,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:42:07,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:42:07,844 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-03 02:42:09,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:42:09,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2693 states to 2191 states and 2693 transitions. [2023-12-03 02:42:09,018 INFO L276 IsEmpty]: Start isEmpty. Operand 2191 states and 2693 transitions. [2023-12-03 02:42:09,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2023-12-03 02:42:09,019 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:42:09,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:42:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:42:09,334 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-03 02:42:10,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:42:10,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2698 states to 2196 states and 2698 transitions. [2023-12-03 02:42:10,005 INFO L276 IsEmpty]: Start isEmpty. Operand 2196 states and 2698 transitions. [2023-12-03 02:42:10,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2023-12-03 02:42:10,006 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:42:10,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:42:10,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:42:10,318 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-03 02:42:11,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:42:11,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2702 states to 2201 states and 2702 transitions. [2023-12-03 02:42:11,024 INFO L276 IsEmpty]: Start isEmpty. Operand 2201 states and 2702 transitions. [2023-12-03 02:42:11,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2023-12-03 02:42:11,026 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:42:11,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:42:11,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:42:11,347 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-03 02:42:12,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:42:12,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2705 states to 2204 states and 2705 transitions. [2023-12-03 02:42:12,043 INFO L276 IsEmpty]: Start isEmpty. Operand 2204 states and 2705 transitions. [2023-12-03 02:42:12,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2023-12-03 02:42:12,044 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:42:12,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:42:12,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:42:12,466 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-03 02:42:13,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:42:13,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2206 states and 2706 transitions. [2023-12-03 02:42:13,126 INFO L276 IsEmpty]: Start isEmpty. Operand 2206 states and 2706 transitions. [2023-12-03 02:42:13,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2023-12-03 02:42:13,128 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:42:13,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:42:13,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:42:13,505 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-03 02:42:14,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:42:14,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2707 states to 2208 states and 2707 transitions. [2023-12-03 02:42:14,190 INFO L276 IsEmpty]: Start isEmpty. Operand 2208 states and 2707 transitions. [2023-12-03 02:42:14,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2023-12-03 02:42:14,191 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:42:14,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:42:14,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:42:14,548 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 238 proven. 49 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-03 02:42:15,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:42:15,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2708 states to 2210 states and 2708 transitions. [2023-12-03 02:42:15,283 INFO L276 IsEmpty]: Start isEmpty. Operand 2210 states and 2708 transitions. [2023-12-03 02:42:15,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2023-12-03 02:42:15,285 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:42:15,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:42:15,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:42:15,509 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 232 proven. 46 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2023-12-03 02:42:15,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:42:15,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2708 states to 2211 states and 2708 transitions. [2023-12-03 02:42:15,849 INFO L276 IsEmpty]: Start isEmpty. Operand 2211 states and 2708 transitions. [2023-12-03 02:42:15,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2023-12-03 02:42:15,850 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:42:15,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:42:15,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:42:15,942 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2023-12-03 02:42:16,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:42:16,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2738 states to 2241 states and 2738 transitions. [2023-12-03 02:42:16,377 INFO L276 IsEmpty]: Start isEmpty. Operand 2241 states and 2738 transitions. [2023-12-03 02:42:16,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2023-12-03 02:42:16,378 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:42:16,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:42:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:42:16,826 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 242 proven. 62 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2023-12-03 02:42:18,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:42:18,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2744 states to 2243 states and 2744 transitions. [2023-12-03 02:42:18,294 INFO L276 IsEmpty]: Start isEmpty. Operand 2243 states and 2744 transitions. [2023-12-03 02:42:18,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2023-12-03 02:42:18,295 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:42:18,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:42:18,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:42:18,612 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 242 proven. 62 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2023-12-03 02:42:20,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:42:20,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2762 states to 2256 states and 2762 transitions. [2023-12-03 02:42:20,331 INFO L276 IsEmpty]: Start isEmpty. Operand 2256 states and 2762 transitions. [2023-12-03 02:42:20,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2023-12-03 02:42:20,332 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:42:20,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:42:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:42:20,656 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 242 proven. 62 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2023-12-03 02:42:21,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:42:21,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2260 states and 2766 transitions. [2023-12-03 02:42:21,793 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 2766 transitions. [2023-12-03 02:42:21,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2023-12-03 02:42:21,794 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:42:21,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:42:21,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-03 02:42:22,227 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 240 proven. 8 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2023-12-03 02:42:24,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-12-03 02:42:24,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2793 states to 2285 states and 2793 transitions. [2023-12-03 02:42:24,825 INFO L276 IsEmpty]: Start isEmpty. Operand 2285 states and 2793 transitions. [2023-12-03 02:42:24,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2023-12-03 02:42:24,826 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-12-03 02:42:24,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-03 02:42:24,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-03 02:42:24,867 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-03 02:42:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-03 02:42:25,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-03 02:42:25,110 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-03 02:42:25,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-03 02:42:25,276 WARN L476 CodeCheckObserver]: This program is UNSAFE, Check terminated with 170 iterations. [2023-12-03 02:42:25,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 03.12 02:42:25 ImpRootNode [2023-12-03 02:42:25,403 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2023-12-03 02:42:25,404 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-03 02:42:25,404 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-03 02:42:25,404 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-03 02:42:25,404 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:39:34" (3/4) ... [2023-12-03 02:42:25,405 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-12-03 02:42:25,698 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6de36314-43aa-4186-a099-2174e601d9c9/bin/ukojak-verify-Qdu7aM0XO9/witness.graphml [2023-12-03 02:42:25,698 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-03 02:42:25,698 INFO L158 Benchmark]: Toolchain (without parser) took 172646.02ms. Allocated memory was 167.8MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 138.0MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 865.0MB. Max. memory is 16.1GB. [2023-12-03 02:42:25,699 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 111.1MB. Free memory is still 84.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-03 02:42:25,699 INFO L158 Benchmark]: CACSL2BoogieTranslator took 478.84ms. Allocated memory is still 167.8MB. Free memory was 138.0MB in the beginning and 110.0MB in the end (delta: 28.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-12-03 02:42:25,699 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.42ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 103.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-12-03 02:42:25,699 INFO L158 Benchmark]: Boogie Preprocessor took 71.77ms. Allocated memory is still 167.8MB. Free memory was 103.7MB in the beginning and 99.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-12-03 02:42:25,700 INFO L158 Benchmark]: RCFGBuilder took 1203.29ms. Allocated memory is still 167.8MB. Free memory was 99.5MB in the beginning and 70.1MB in the end (delta: 29.4MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2023-12-03 02:42:25,700 INFO L158 Benchmark]: CodeCheck took 170514.53ms. Allocated memory was 167.8MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 69.0MB in the beginning and 1.8GB in the end (delta: -1.8GB). Peak memory consumption was 770.6MB. Max. memory is 16.1GB. [2023-12-03 02:42:25,700 INFO L158 Benchmark]: Witness Printer took 294.20ms. Allocated memory is still 2.7GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 28.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-12-03 02:42:25,702 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: 170.4s, OverallIterations: 170, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 436144 SdHoareTripleChecker+Valid, 960.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 434470 mSDsluCounter, 80150 SdHoareTripleChecker+Invalid, 825.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 69273 mSDsCounter, 117706 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 941995 IncrementalHoareTripleChecker+Invalid, 1059701 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 117706 mSolverCounterUnsat, 10877 mSDtfsCounter, 941995 mSolverCounterSat, 7.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 206193 GetRequests, 199923 SyntacticMatches, 4944 SemanticMatches, 1326 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1136254 ImplicationChecksByTransitivity, 117.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 1.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 29.4s InterpolantComputationTime, 30955 NumberOfCodeBlocks, 30955 NumberOfCodeBlocksAsserted, 170 NumberOfCheckSat, 30521 ConstructedInterpolants, 0 QuantifiedInterpolants, 120835 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 169 InterpolantComputations, 95 PerfectInterpolantSequences, 28396/31278 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: 411]: 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)=1, 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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [L387] COND TRUE ((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5)) [L388] a21 = 1 [L389] a16 = 6 [L390] a7 = 0 [L391] return -1; VAL [\old(input)=1, \result=-1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, 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=6, a17=1, a20=1, a21=1, a7=0, a8=13, 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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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=6, a17=1, a20=1, a21=1, a7=0, 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] [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))) VAL [\old(input)=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, 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] [L410] COND TRUE (((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1)) VAL [\old(input)=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, 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] [L411] reach_error() VAL [\old(input)=1, a12=8, a16=6, a17=1, a20=1, a21=1, a7=0, 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] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 111.1MB. Free memory is still 84.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 478.84ms. Allocated memory is still 167.8MB. Free memory was 138.0MB in the beginning and 110.0MB in the end (delta: 28.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.42ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 103.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.77ms. Allocated memory is still 167.8MB. Free memory was 103.7MB in the beginning and 99.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1203.29ms. Allocated memory is still 167.8MB. Free memory was 99.5MB in the beginning and 70.1MB in the end (delta: 29.4MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * CodeCheck took 170514.53ms. Allocated memory was 167.8MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 69.0MB in the beginning and 1.8GB in the end (delta: -1.8GB). Peak memory consumption was 770.6MB. Max. memory is 16.1GB. * Witness Printer took 294.20ms. Allocated memory is still 2.7GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 28.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2023-12-03 02:42:25,723 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6de36314-43aa-4186-a099-2174e601d9c9/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