./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label56.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad04b20b-d661-47cc-8557-d3f582c16d3f/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad04b20b-d661-47cc-8557-d3f582c16d3f/bin/ukojak-verify-EEHR8qb7sm/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad04b20b-d661-47cc-8557-d3f582c16d3f/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad04b20b-d661-47cc-8557-d3f582c16d3f/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label56.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad04b20b-d661-47cc-8557-d3f582c16d3f/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad04b20b-d661-47cc-8557-d3f582c16d3f/bin/ukojak-verify-EEHR8qb7sm --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 7b93c3f7fecac47558d01f2a0c93696ea48f2ebbd5c30f43df88a8759c531651 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 20:34:01,234 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 20:34:01,330 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad04b20b-d661-47cc-8557-d3f582c16d3f/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 20:34:01,336 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 20:34:01,337 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 20:34:01,370 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 20:34:01,370 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 20:34:01,371 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 20:34:01,371 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 20:34:01,371 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 20:34:01,372 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 20:34:01,372 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 20:34:01,372 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 20:34:01,372 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 20:34:01,372 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 20:34:01,372 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 20:34:01,372 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 20:34:01,373 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 20:34:01,373 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 20:34:01,373 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 20:34:01,373 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 20:34:01,373 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 20:34:01,373 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 20:34:01,374 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 20:34:01,374 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 20:34:01,374 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 20:34:01,374 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 20:34:01,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 20:34:01,374 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 20:34:01,375 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 20:34:01,375 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 20:34:01,375 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 20:34:01,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 20:34:01,375 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad04b20b-d661-47cc-8557-d3f582c16d3f/bin/ukojak-verify-EEHR8qb7sm 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 -> 7b93c3f7fecac47558d01f2a0c93696ea48f2ebbd5c30f43df88a8759c531651 [2024-11-13 20:34:01,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 20:34:01,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 20:34:01,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 20:34:01,716 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 20:34:01,717 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 20:34:01,719 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad04b20b-d661-47cc-8557-d3f582c16d3f/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/eca-rers2012/Problem01_label56.c Unable to find full path for "g++" [2024-11-13 20:34:03,507 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 20:34:03,850 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 20:34:03,851 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad04b20b-d661-47cc-8557-d3f582c16d3f/sv-benchmarks/c/eca-rers2012/Problem01_label56.c [2024-11-13 20:34:03,864 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad04b20b-d661-47cc-8557-d3f582c16d3f/bin/ukojak-verify-EEHR8qb7sm/data/27702783f/6f8650f86baf44bca7334644662887d7/FLAG8cb336c55 [2024-11-13 20:34:04,065 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad04b20b-d661-47cc-8557-d3f582c16d3f/bin/ukojak-verify-EEHR8qb7sm/data/27702783f/6f8650f86baf44bca7334644662887d7 [2024-11-13 20:34:04,068 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 20:34:04,070 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 20:34:04,071 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 20:34:04,071 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 20:34:04,076 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 20:34:04,077 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 08:34:04" (1/1) ... [2024-11-13 20:34:04,078 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fd83fa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:34:04, skipping insertion in model container [2024-11-13 20:34:04,078 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 08:34:04" (1/1) ... [2024-11-13 20:34:04,126 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 20:34:04,426 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad04b20b-d661-47cc-8557-d3f582c16d3f/sv-benchmarks/c/eca-rers2012/Problem01_label56.c[15002,15015] [2024-11-13 20:34:04,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 20:34:04,476 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 20:34:04,571 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad04b20b-d661-47cc-8557-d3f582c16d3f/sv-benchmarks/c/eca-rers2012/Problem01_label56.c[15002,15015] [2024-11-13 20:34:04,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 20:34:04,621 INFO L204 MainTranslator]: Completed translation [2024-11-13 20:34:04,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:34:04 WrapperNode [2024-11-13 20:34:04,622 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 20:34:04,623 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 20:34:04,624 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 20:34:04,624 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 20:34:04,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:34:04" (1/1) ... [2024-11-13 20:34:04,652 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:34:04" (1/1) ... [2024-11-13 20:34:04,727 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-13 20:34:04,730 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 20:34:04,731 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 20:34:04,731 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 20:34:04,731 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 20:34:04,745 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:34:04" (1/1) ... [2024-11-13 20:34:04,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:34:04" (1/1) ... [2024-11-13 20:34:04,754 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:34:04" (1/1) ... [2024-11-13 20:34:04,754 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:34:04" (1/1) ... [2024-11-13 20:34:04,786 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:34:04" (1/1) ... [2024-11-13 20:34:04,801 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:34:04" (1/1) ... [2024-11-13 20:34:04,808 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:34:04" (1/1) ... [2024-11-13 20:34:04,815 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:34:04" (1/1) ... [2024-11-13 20:34:04,827 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 20:34:04,828 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 20:34:04,828 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 20:34:04,828 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 20:34:04,829 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:34:04" (1/1) ... [2024-11-13 20:34:04,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 20:34:04,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad04b20b-d661-47cc-8557-d3f582c16d3f/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 20:34:04,863 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad04b20b-d661-47cc-8557-d3f582c16d3f/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 20:34:04,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad04b20b-d661-47cc-8557-d3f582c16d3f/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 20:34:04,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 20:34:04,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 20:34:04,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 20:34:04,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 20:34:04,989 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 20:34:04,991 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 20:34:06,346 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-13 20:34:06,346 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 20:34:06,675 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 20:34:06,677 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 20:34:06,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:34:06 BoogieIcfgContainer [2024-11-13 20:34:06,678 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 20:34:06,679 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 20:34:06,679 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 20:34:06,689 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 20:34:06,689 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:34:06" (1/1) ... [2024-11-13 20:34:06,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 20:34:06,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:06,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-11-13 20:34:06,762 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-11-13 20:34:06,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-13 20:34:06,766 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:06,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:06,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:07,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:07,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:07,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 145 states and 237 transitions. [2024-11-13 20:34:07,953 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 237 transitions. [2024-11-13 20:34:07,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-13 20:34:07,956 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:07,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:08,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:08,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 20:34:08,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:08,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 146 states and 238 transitions. [2024-11-13 20:34:08,412 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 238 transitions. [2024-11-13 20:34:08,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-13 20:34:08,414 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:08,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:08,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:08,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:08,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:08,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 150 states and 244 transitions. [2024-11-13 20:34:08,683 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 244 transitions. [2024-11-13 20:34:08,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-13 20:34:08,685 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:08,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:08,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:08,841 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 20:34:09,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:09,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 151 states and 245 transitions. [2024-11-13 20:34:09,016 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 245 transitions. [2024-11-13 20:34:09,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-13 20:34:09,017 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:09,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:09,200 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:09,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:09,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 159 states and 258 transitions. [2024-11-13 20:34:09,435 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 258 transitions. [2024-11-13 20:34:09,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-13 20:34:09,440 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:09,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:09,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:09,626 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:09,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:09,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 160 states and 259 transitions. [2024-11-13 20:34:09,788 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 259 transitions. [2024-11-13 20:34:09,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-13 20:34:09,791 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:09,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:09,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:10,007 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:10,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:10,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 168 states and 268 transitions. [2024-11-13 20:34:10,168 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 268 transitions. [2024-11-13 20:34:10,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-13 20:34:10,169 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:10,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:10,397 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:10,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:10,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 182 states and 286 transitions. [2024-11-13 20:34:10,748 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 286 transitions. [2024-11-13 20:34:10,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-13 20:34:10,749 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:10,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:10,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:10,883 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:11,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:11,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 197 states and 306 transitions. [2024-11-13 20:34:11,432 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 306 transitions. [2024-11-13 20:34:11,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-13 20:34:11,433 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:11,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:11,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:11,708 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:12,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:12,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 212 states and 327 transitions. [2024-11-13 20:34:12,422 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 327 transitions. [2024-11-13 20:34:12,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-13 20:34:12,423 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:12,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:12,616 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:13,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:13,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 230 states and 356 transitions. [2024-11-13 20:34:13,424 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2024-11-13 20:34:13,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-13 20:34:13,425 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:13,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:13,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:13,595 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:13,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:13,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 232 states and 359 transitions. [2024-11-13 20:34:13,833 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 359 transitions. [2024-11-13 20:34:13,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-13 20:34:13,834 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:13,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:13,943 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:14,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:14,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 237 states and 365 transitions. [2024-11-13 20:34:14,080 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 365 transitions. [2024-11-13 20:34:14,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-13 20:34:14,085 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:14,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:14,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:14,230 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 20:34:14,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:14,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 238 states and 366 transitions. [2024-11-13 20:34:14,423 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 366 transitions. [2024-11-13 20:34:14,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-13 20:34:14,424 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:14,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:14,529 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:15,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:15,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 257 states and 395 transitions. [2024-11-13 20:34:15,491 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 395 transitions. [2024-11-13 20:34:15,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-13 20:34:15,492 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:15,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:15,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:15,566 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:15,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:15,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 258 states and 396 transitions. [2024-11-13 20:34:15,753 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 396 transitions. [2024-11-13 20:34:15,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-13 20:34:15,754 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:15,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:15,884 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:16,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:16,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 273 states and 415 transitions. [2024-11-13 20:34:16,439 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 415 transitions. [2024-11-13 20:34:16,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-13 20:34:16,440 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:16,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:16,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:16,536 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 20:34:17,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:17,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 291 states and 435 transitions. [2024-11-13 20:34:17,317 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 435 transitions. [2024-11-13 20:34:17,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-13 20:34:17,318 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:17,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:17,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:17,396 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:17,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:17,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 295 states and 439 transitions. [2024-11-13 20:34:17,449 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 439 transitions. [2024-11-13 20:34:17,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-13 20:34:17,450 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:17,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:17,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:17,582 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 20:34:17,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:17,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 299 states and 444 transitions. [2024-11-13 20:34:17,966 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 444 transitions. [2024-11-13 20:34:17,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 20:34:17,968 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:17,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:17,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:18,028 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 20:34:18,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:18,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 307 states and 459 transitions. [2024-11-13 20:34:18,523 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 459 transitions. [2024-11-13 20:34:18,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 20:34:18,526 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:18,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:18,605 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 20:34:19,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:19,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 313 states and 467 transitions. [2024-11-13 20:34:19,071 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 467 transitions. [2024-11-13 20:34:19,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 20:34:19,072 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:19,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:19,136 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 20:34:19,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:19,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 316 states and 471 transitions. [2024-11-13 20:34:19,390 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 471 transitions. [2024-11-13 20:34:19,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 20:34:19,392 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:19,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:19,460 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:19,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:19,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 331 states and 491 transitions. [2024-11-13 20:34:19,999 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 491 transitions. [2024-11-13 20:34:20,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-13 20:34:20,001 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:20,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:20,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:20,161 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:20,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:20,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 345 states and 508 transitions. [2024-11-13 20:34:20,515 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 508 transitions. [2024-11-13 20:34:20,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-13 20:34:20,517 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:20,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:20,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:20,675 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:20,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:20,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 347 states and 510 transitions. [2024-11-13 20:34:20,977 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 510 transitions. [2024-11-13 20:34:20,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 20:34:20,978 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:20,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:21,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:21,068 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 20:34:21,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:21,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 353 states and 516 transitions. [2024-11-13 20:34:21,421 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 516 transitions. [2024-11-13 20:34:21,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 20:34:21,423 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:21,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:21,490 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 20:34:21,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:21,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 357 states and 519 transitions. [2024-11-13 20:34:21,540 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 519 transitions. [2024-11-13 20:34:21,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 20:34:21,541 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:21,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:21,675 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:21,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:21,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 359 states and 522 transitions. [2024-11-13 20:34:21,727 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 522 transitions. [2024-11-13 20:34:21,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 20:34:21,728 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:21,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:21,864 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:22,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:22,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 373 states and 540 transitions. [2024-11-13 20:34:22,429 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 540 transitions. [2024-11-13 20:34:22,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 20:34:22,431 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:22,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:22,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:22,577 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:22,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:22,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 377 states and 545 transitions. [2024-11-13 20:34:22,859 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 545 transitions. [2024-11-13 20:34:22,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 20:34:22,860 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:22,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:22,967 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 20:34:23,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:23,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 379 states and 548 transitions. [2024-11-13 20:34:23,180 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 548 transitions. [2024-11-13 20:34:23,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 20:34:23,182 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:23,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:23,470 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 35 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:23,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:23,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 386 states and 555 transitions. [2024-11-13 20:34:23,905 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 555 transitions. [2024-11-13 20:34:23,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 20:34:23,906 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:23,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:24,052 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 20:34:24,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:24,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 395 states and 564 transitions. [2024-11-13 20:34:24,461 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 564 transitions. [2024-11-13 20:34:24,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 20:34:24,463 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:24,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:24,591 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 20:34:24,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:24,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 399 states and 567 transitions. [2024-11-13 20:34:24,890 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 567 transitions. [2024-11-13 20:34:24,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 20:34:24,891 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:24,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:25,034 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 20:34:25,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:25,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 402 states and 569 transitions. [2024-11-13 20:34:25,278 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 569 transitions. [2024-11-13 20:34:25,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 20:34:25,279 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:25,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:25,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:25,376 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-13 20:34:26,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:26,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 484 states and 656 transitions. [2024-11-13 20:34:26,037 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 656 transitions. [2024-11-13 20:34:26,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-13 20:34:26,038 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:26,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:26,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:26,121 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:26,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:26,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 486 states and 658 transitions. [2024-11-13 20:34:26,175 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 658 transitions. [2024-11-13 20:34:26,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-13 20:34:26,176 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:26,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:26,241 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:26,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:26,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 497 states and 672 transitions. [2024-11-13 20:34:26,425 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 672 transitions. [2024-11-13 20:34:26,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-13 20:34:26,426 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:26,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:26,546 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 42 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:26,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:26,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 504 states and 680 transitions. [2024-11-13 20:34:26,627 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 680 transitions. [2024-11-13 20:34:26,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 20:34:26,629 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:26,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:26,722 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 20:34:26,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:26,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 506 states and 682 transitions. [2024-11-13 20:34:26,768 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 682 transitions. [2024-11-13 20:34:26,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 20:34:26,769 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:26,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:26,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:26,833 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 20:34:26,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:26,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 513 states and 689 transitions. [2024-11-13 20:34:26,996 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 689 transitions. [2024-11-13 20:34:26,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 20:34:26,998 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:26,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:27,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:27,080 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:27,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:27,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 551 states and 733 transitions. [2024-11-13 20:34:27,917 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 733 transitions. [2024-11-13 20:34:27,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 20:34:27,918 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:27,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:28,003 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:28,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:28,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 554 states and 735 transitions. [2024-11-13 20:34:28,335 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 735 transitions. [2024-11-13 20:34:28,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 20:34:28,336 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:28,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:28,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:28,427 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:28,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:28,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 557 states and 737 transitions. [2024-11-13 20:34:28,695 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 737 transitions. [2024-11-13 20:34:28,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-13 20:34:28,697 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:28,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:28,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:28,763 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 20:34:28,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:28,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 566 states and 745 transitions. [2024-11-13 20:34:28,834 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 745 transitions. [2024-11-13 20:34:28,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-13 20:34:28,835 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:28,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:28,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:28,940 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:29,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:29,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 574 states and 753 transitions. [2024-11-13 20:34:29,046 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 753 transitions. [2024-11-13 20:34:29,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-13 20:34:29,047 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:29,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:29,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:29,372 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 49 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:30,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:30,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 605 states and 788 transitions. [2024-11-13 20:34:30,137 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 788 transitions. [2024-11-13 20:34:30,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-13 20:34:30,139 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:30,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:30,213 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 20:34:31,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:31,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 636 states and 825 transitions. [2024-11-13 20:34:31,114 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 825 transitions. [2024-11-13 20:34:31,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-13 20:34:31,116 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:31,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:31,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:31,197 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 20:34:31,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:31,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 645 states and 835 transitions. [2024-11-13 20:34:31,273 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 835 transitions. [2024-11-13 20:34:31,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-13 20:34:31,274 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:31,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:31,558 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 62 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 20:34:32,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:32,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 695 states and 893 transitions. [2024-11-13 20:34:32,945 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 893 transitions. [2024-11-13 20:34:32,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-13 20:34:32,947 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:32,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:33,114 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 66 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-13 20:34:33,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:33,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 698 states and 896 transitions. [2024-11-13 20:34:33,420 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 896 transitions. [2024-11-13 20:34:33,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-13 20:34:33,423 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:33,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:33,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:33,543 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:33,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:33,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 725 states and 926 transitions. [2024-11-13 20:34:33,730 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 926 transitions. [2024-11-13 20:34:33,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 20:34:33,731 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:33,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:33,875 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-13 20:34:34,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:34,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 744 states and 949 transitions. [2024-11-13 20:34:34,931 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 949 transitions. [2024-11-13 20:34:34,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 20:34:34,932 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:34,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:35,076 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 66 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:35,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:35,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 761 states and 966 transitions. [2024-11-13 20:34:35,235 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 966 transitions. [2024-11-13 20:34:35,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-13 20:34:35,237 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:35,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:35,330 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:35,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:35,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 784 states and 990 transitions. [2024-11-13 20:34:35,687 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 990 transitions. [2024-11-13 20:34:35,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-13 20:34:35,688 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:35,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:36,204 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 69 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:39,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:39,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 853 states and 1086 transitions. [2024-11-13 20:34:39,535 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1086 transitions. [2024-11-13 20:34:39,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-13 20:34:39,537 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:39,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:39,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:39,781 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 69 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:41,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:41,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 884 states and 1124 transitions. [2024-11-13 20:34:41,699 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1124 transitions. [2024-11-13 20:34:41,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-13 20:34:41,700 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:41,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:41,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:41,863 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 69 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:42,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:42,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 891 states and 1133 transitions. [2024-11-13 20:34:42,899 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1133 transitions. [2024-11-13 20:34:42,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-13 20:34:42,901 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:42,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:42,994 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-13 20:34:43,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:43,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 892 states and 1133 transitions. [2024-11-13 20:34:43,044 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1133 transitions. [2024-11-13 20:34:43,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-13 20:34:43,045 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:43,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:43,258 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:44,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:44,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 915 states and 1157 transitions. [2024-11-13 20:34:44,128 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1157 transitions. [2024-11-13 20:34:44,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-13 20:34:44,129 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:44,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:44,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:44,220 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:44,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:44,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 942 states and 1188 transitions. [2024-11-13 20:34:44,939 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1188 transitions. [2024-11-13 20:34:44,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-13 20:34:44,940 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:44,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:44,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:45,150 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:47,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:47,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1008 states and 1260 transitions. [2024-11-13 20:34:47,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1260 transitions. [2024-11-13 20:34:47,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-13 20:34:47,308 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:47,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:47,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:47,364 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 20:34:47,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:47,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1019 states and 1271 transitions. [2024-11-13 20:34:47,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1271 transitions. [2024-11-13 20:34:47,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-13 20:34:47,574 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:47,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:47,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:47,675 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 80 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 20:34:48,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:48,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1036 states and 1290 transitions. [2024-11-13 20:34:48,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1290 transitions. [2024-11-13 20:34:48,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-13 20:34:48,667 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:48,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:48,964 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:49,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:49,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1053 states and 1307 transitions. [2024-11-13 20:34:49,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1307 transitions. [2024-11-13 20:34:49,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-13 20:34:49,365 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:49,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:49,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:49,422 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 20:34:49,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:49,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1054 states and 1308 transitions. [2024-11-13 20:34:49,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1308 transitions. [2024-11-13 20:34:49,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-13 20:34:49,639 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:49,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:50,070 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 82 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:53,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:53,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1137 states and 1406 transitions. [2024-11-13 20:34:53,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1406 transitions. [2024-11-13 20:34:53,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-13 20:34:53,398 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:53,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:53,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:53,626 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:34:54,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:54,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1186 states and 1461 transitions. [2024-11-13 20:34:54,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1461 transitions. [2024-11-13 20:34:54,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-13 20:34:54,336 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:54,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:54,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:54,544 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 20:34:56,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:56,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1221 states and 1503 transitions. [2024-11-13 20:34:56,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1503 transitions. [2024-11-13 20:34:56,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-13 20:34:56,543 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:56,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:56,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:56,701 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 20:34:57,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:34:57,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1235 states and 1518 transitions. [2024-11-13 20:34:57,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1518 transitions. [2024-11-13 20:34:57,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-13 20:34:57,582 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:34:57,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:34:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:34:58,104 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 20:35:00,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:00,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1306 states and 1591 transitions. [2024-11-13 20:35:00,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1591 transitions. [2024-11-13 20:35:00,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-13 20:35:00,134 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:00,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:00,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:00,335 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 20:35:01,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:01,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1326 states and 1610 transitions. [2024-11-13 20:35:01,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 1610 transitions. [2024-11-13 20:35:01,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-13 20:35:01,118 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:01,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:01,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:01,170 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-13 20:35:01,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:01,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1331 states and 1616 transitions. [2024-11-13 20:35:01,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1616 transitions. [2024-11-13 20:35:01,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-13 20:35:01,226 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:01,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:01,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:01,290 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 20:35:03,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:03,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1661 states to 1370 states and 1661 transitions. [2024-11-13 20:35:03,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1661 transitions. [2024-11-13 20:35:03,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-13 20:35:03,253 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:03,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:03,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:03,310 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 20:35:04,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:04,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1384 states and 1677 transitions. [2024-11-13 20:35:04,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1677 transitions. [2024-11-13 20:35:04,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-13 20:35:04,050 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:04,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:04,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:04,146 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 20:35:05,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:05,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1709 states to 1417 states and 1709 transitions. [2024-11-13 20:35:05,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 1709 transitions. [2024-11-13 20:35:05,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-13 20:35:05,502 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:05,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:05,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:05,649 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-13 20:35:05,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:05,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1418 states and 1710 transitions. [2024-11-13 20:35:05,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 1710 transitions. [2024-11-13 20:35:05,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-13 20:35:05,958 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:05,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:06,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:06,088 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-13 20:35:07,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:07,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1447 states and 1739 transitions. [2024-11-13 20:35:07,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 1739 transitions. [2024-11-13 20:35:07,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-13 20:35:07,288 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:07,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:07,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:07,399 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-13 20:35:09,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:09,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1774 states to 1479 states and 1774 transitions. [2024-11-13 20:35:09,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 1774 transitions. [2024-11-13 20:35:09,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-13 20:35:09,268 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:09,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:09,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:09,352 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-13 20:35:09,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:09,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1506 states and 1800 transitions. [2024-11-13 20:35:09,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 1800 transitions. [2024-11-13 20:35:09,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-13 20:35:09,975 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:09,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:10,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:10,765 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 101 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:35:14,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:14,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1912 states to 1597 states and 1912 transitions. [2024-11-13 20:35:14,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 1912 transitions. [2024-11-13 20:35:14,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-13 20:35:14,239 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:14,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:14,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:14,476 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 101 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:35:14,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:14,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1913 states to 1599 states and 1913 transitions. [2024-11-13 20:35:14,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 1913 transitions. [2024-11-13 20:35:14,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-13 20:35:14,877 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:14,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:14,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:15,587 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 98 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:35:20,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:20,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1985 states to 1649 states and 1985 transitions. [2024-11-13 20:35:20,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 1985 transitions. [2024-11-13 20:35:20,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-13 20:35:20,206 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:20,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:20,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:20,470 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 98 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:35:21,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:21,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2004 states to 1665 states and 2004 transitions. [2024-11-13 20:35:21,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2004 transitions. [2024-11-13 20:35:21,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-13 20:35:21,796 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:21,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:21,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:22,042 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-13 20:35:22,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:22,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2005 states to 1667 states and 2005 transitions. [2024-11-13 20:35:22,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2005 transitions. [2024-11-13 20:35:22,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-13 20:35:22,506 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:22,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:22,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:22,667 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-13 20:35:22,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:22,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2005 states to 1668 states and 2005 transitions. [2024-11-13 20:35:22,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 2005 transitions. [2024-11-13 20:35:22,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-13 20:35:22,928 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:22,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:22,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:23,040 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-13 20:35:23,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:23,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2077 states to 1738 states and 2077 transitions. [2024-11-13 20:35:23,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2077 transitions. [2024-11-13 20:35:23,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-13 20:35:23,672 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:23,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:23,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:24,034 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:35:25,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:25,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 1743 states and 2089 transitions. [2024-11-13 20:35:25,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 2089 transitions. [2024-11-13 20:35:25,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-13 20:35:25,161 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:25,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:25,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:25,460 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:35:26,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:26,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 1744 states and 2089 transitions. [2024-11-13 20:35:26,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 2089 transitions. [2024-11-13 20:35:26,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-13 20:35:26,006 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:26,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:26,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:26,219 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:35:26,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:26,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 1745 states and 2089 transitions. [2024-11-13 20:35:26,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 2089 transitions. [2024-11-13 20:35:26,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-13 20:35:26,705 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:26,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:26,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:27,438 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:35:29,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:29,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 1814 states and 2174 transitions. [2024-11-13 20:35:29,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1814 states and 2174 transitions. [2024-11-13 20:35:29,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-13 20:35:29,108 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:29,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:29,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:29,813 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:35:31,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:31,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2198 states to 1833 states and 2198 transitions. [2024-11-13 20:35:31,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 2198 transitions. [2024-11-13 20:35:31,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-13 20:35:31,833 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:31,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:31,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:31,984 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-13 20:35:32,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:32,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2200 states to 1836 states and 2200 transitions. [2024-11-13 20:35:32,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1836 states and 2200 transitions. [2024-11-13 20:35:32,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-13 20:35:32,347 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:32,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:32,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:32,444 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-13 20:35:32,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:32,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2201 states to 1838 states and 2201 transitions. [2024-11-13 20:35:32,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2201 transitions. [2024-11-13 20:35:32,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-13 20:35:32,510 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:32,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:32,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:32,640 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 112 proven. 6 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-13 20:35:33,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:33,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2214 states to 1851 states and 2214 transitions. [2024-11-13 20:35:33,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 2214 transitions. [2024-11-13 20:35:33,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-13 20:35:33,867 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:33,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:33,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:33,967 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 112 proven. 6 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-13 20:35:34,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:34,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 1854 states and 2216 transitions. [2024-11-13 20:35:34,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2216 transitions. [2024-11-13 20:35:34,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-13 20:35:34,478 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:34,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:34,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:34,538 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-13 20:35:35,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:35,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2219 states to 1857 states and 2219 transitions. [2024-11-13 20:35:35,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1857 states and 2219 transitions. [2024-11-13 20:35:35,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 20:35:35,366 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:35,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:35,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:36,128 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 160 proven. 38 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-13 20:35:37,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:37,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 1871 states and 2234 transitions. [2024-11-13 20:35:37,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2234 transitions. [2024-11-13 20:35:37,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 20:35:37,167 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:37,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:37,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:37,549 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:35:39,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:39,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 1892 states and 2257 transitions. [2024-11-13 20:35:39,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2257 transitions. [2024-11-13 20:35:39,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-13 20:35:39,532 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:39,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:39,819 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 121 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:35:40,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:40,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2260 states to 1895 states and 2260 transitions. [2024-11-13 20:35:40,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1895 states and 2260 transitions. [2024-11-13 20:35:40,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-13 20:35:40,343 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:40,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:40,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:41,062 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 3 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:35:44,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:44,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 1933 states and 2305 transitions. [2024-11-13 20:35:44,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1933 states and 2305 transitions. [2024-11-13 20:35:44,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-13 20:35:44,717 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:44,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:44,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:44,937 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 120 proven. 51 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-13 20:35:45,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:45,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2324 states to 1948 states and 2324 transitions. [2024-11-13 20:35:45,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1948 states and 2324 transitions. [2024-11-13 20:35:45,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-13 20:35:45,517 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:45,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:45,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:45,576 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-13 20:35:45,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:45,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2331 states to 1953 states and 2331 transitions. [2024-11-13 20:35:45,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1953 states and 2331 transitions. [2024-11-13 20:35:45,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 20:35:45,962 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:45,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:46,521 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:35:48,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:48,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2395 states to 2008 states and 2395 transitions. [2024-11-13 20:35:48,466 INFO L276 IsEmpty]: Start isEmpty. Operand 2008 states and 2395 transitions. [2024-11-13 20:35:48,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 20:35:48,467 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:48,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:48,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:48,536 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-13 20:35:49,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:49,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2078 states and 2467 transitions. [2024-11-13 20:35:49,211 INFO L276 IsEmpty]: Start isEmpty. Operand 2078 states and 2467 transitions. [2024-11-13 20:35:49,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-13 20:35:49,213 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:49,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:49,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:49,424 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:35:50,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:50,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2480 states to 2092 states and 2480 transitions. [2024-11-13 20:35:50,020 INFO L276 IsEmpty]: Start isEmpty. Operand 2092 states and 2480 transitions. [2024-11-13 20:35:50,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-13 20:35:50,021 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:50,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:50,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:50,502 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:35:55,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:55,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2145 states and 2545 transitions. [2024-11-13 20:35:55,523 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 2545 transitions. [2024-11-13 20:35:55,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-13 20:35:55,524 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:55,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:55,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:55,770 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:35:56,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:56,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2560 states to 2161 states and 2560 transitions. [2024-11-13 20:35:56,643 INFO L276 IsEmpty]: Start isEmpty. Operand 2161 states and 2560 transitions. [2024-11-13 20:35:56,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-13 20:35:56,645 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:56,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:56,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:57,077 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-13 20:35:58,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:58,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2620 states to 2208 states and 2620 transitions. [2024-11-13 20:35:58,509 INFO L276 IsEmpty]: Start isEmpty. Operand 2208 states and 2620 transitions. [2024-11-13 20:35:58,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-13 20:35:58,510 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:58,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:58,804 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 65 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-13 20:35:59,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:35:59,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2623 states to 2211 states and 2623 transitions. [2024-11-13 20:35:59,280 INFO L276 IsEmpty]: Start isEmpty. Operand 2211 states and 2623 transitions. [2024-11-13 20:35:59,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-13 20:35:59,282 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:35:59,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:35:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:35:59,914 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-13 20:36:04,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:04,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2252 states and 2670 transitions. [2024-11-13 20:36:04,575 INFO L276 IsEmpty]: Start isEmpty. Operand 2252 states and 2670 transitions. [2024-11-13 20:36:04,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-13 20:36:04,577 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:04,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:04,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:36:05,174 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 135 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:36:08,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:08,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2287 states and 2710 transitions. [2024-11-13 20:36:08,925 INFO L276 IsEmpty]: Start isEmpty. Operand 2287 states and 2710 transitions. [2024-11-13 20:36:08,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-13 20:36:08,928 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:08,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:36:09,230 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 135 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:36:09,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:09,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2713 states to 2290 states and 2713 transitions. [2024-11-13 20:36:09,958 INFO L276 IsEmpty]: Start isEmpty. Operand 2290 states and 2713 transitions. [2024-11-13 20:36:09,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 20:36:09,959 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:09,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:36:10,625 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 205 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-13 20:36:13,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:13,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2768 states to 2329 states and 2768 transitions. [2024-11-13 20:36:13,531 INFO L276 IsEmpty]: Start isEmpty. Operand 2329 states and 2768 transitions. [2024-11-13 20:36:13,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 20:36:13,532 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:13,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:36:13,770 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 205 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-13 20:36:15,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:15,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2774 states to 2336 states and 2774 transitions. [2024-11-13 20:36:15,247 INFO L276 IsEmpty]: Start isEmpty. Operand 2336 states and 2774 transitions. [2024-11-13 20:36:15,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 20:36:15,248 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:15,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:15,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:36:15,511 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 205 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-13 20:36:16,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:16,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2777 states to 2340 states and 2777 transitions. [2024-11-13 20:36:16,260 INFO L276 IsEmpty]: Start isEmpty. Operand 2340 states and 2777 transitions. [2024-11-13 20:36:16,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 20:36:16,261 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:16,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:36:16,794 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 137 proven. 71 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-13 20:36:16,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:16,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2784 states to 2346 states and 2784 transitions. [2024-11-13 20:36:16,976 INFO L276 IsEmpty]: Start isEmpty. Operand 2346 states and 2784 transitions. [2024-11-13 20:36:16,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 20:36:16,977 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:16,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:36:17,448 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-13 20:36:20,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:20,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2842 states to 2395 states and 2842 transitions. [2024-11-13 20:36:20,596 INFO L276 IsEmpty]: Start isEmpty. Operand 2395 states and 2842 transitions. [2024-11-13 20:36:20,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-13 20:36:20,598 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:20,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:20,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:36:20,851 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 137 proven. 68 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-13 20:36:21,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:21,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2845 states to 2398 states and 2845 transitions. [2024-11-13 20:36:21,445 INFO L276 IsEmpty]: Start isEmpty. Operand 2398 states and 2845 transitions. [2024-11-13 20:36:21,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 20:36:21,447 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:21,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:36:21,836 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 208 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-13 20:36:22,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:22,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2851 states to 2404 states and 2851 transitions. [2024-11-13 20:36:22,612 INFO L276 IsEmpty]: Start isEmpty. Operand 2404 states and 2851 transitions. [2024-11-13 20:36:22,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 20:36:22,614 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:22,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:36:22,884 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 139 proven. 55 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 20:36:24,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:24,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2877 states to 2429 states and 2877 transitions. [2024-11-13 20:36:24,319 INFO L276 IsEmpty]: Start isEmpty. Operand 2429 states and 2877 transitions. [2024-11-13 20:36:24,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-13 20:36:24,320 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:24,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:24,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:36:24,599 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 139 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:36:25,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:25,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2442 states and 2889 transitions. [2024-11-13 20:36:25,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 2889 transitions. [2024-11-13 20:36:25,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-13 20:36:25,249 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:25,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:25,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:36:25,318 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-13 20:36:25,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:25,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2925 states to 2478 states and 2925 transitions. [2024-11-13 20:36:25,534 INFO L276 IsEmpty]: Start isEmpty. Operand 2478 states and 2925 transitions. [2024-11-13 20:36:25,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-13 20:36:25,535 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:25,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:25,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:36:25,881 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 20:36:30,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:30,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2982 states to 2514 states and 2982 transitions. [2024-11-13 20:36:30,110 INFO L276 IsEmpty]: Start isEmpty. Operand 2514 states and 2982 transitions. [2024-11-13 20:36:30,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-13 20:36:30,111 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:30,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:30,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:36:30,206 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 20:36:33,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:33,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3034 states to 2544 states and 3034 transitions. [2024-11-13 20:36:33,370 INFO L276 IsEmpty]: Start isEmpty. Operand 2544 states and 3034 transitions. [2024-11-13 20:36:33,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-13 20:36:33,371 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:33,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:33,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:36:33,628 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 20:36:35,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:35,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 2565 states and 3065 transitions. [2024-11-13 20:36:35,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2565 states and 3065 transitions. [2024-11-13 20:36:35,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-13 20:36:35,783 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:35,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:35,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:36:35,944 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 20:36:37,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:37,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3074 states to 2572 states and 3074 transitions. [2024-11-13 20:36:37,157 INFO L276 IsEmpty]: Start isEmpty. Operand 2572 states and 3074 transitions. [2024-11-13 20:36:37,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-13 20:36:37,158 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:37,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:37,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:36:37,263 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 20:36:38,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:38,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 2578 states and 3081 transitions. [2024-11-13 20:36:38,283 INFO L276 IsEmpty]: Start isEmpty. Operand 2578 states and 3081 transitions. [2024-11-13 20:36:38,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-13 20:36:38,285 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:38,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:36:38,373 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 20:36:39,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:39,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3096 states to 2592 states and 3096 transitions. [2024-11-13 20:36:39,622 INFO L276 IsEmpty]: Start isEmpty. Operand 2592 states and 3096 transitions. [2024-11-13 20:36:39,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-13 20:36:39,624 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:39,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:39,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:36:39,783 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 20:36:40,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:40,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3103 states to 2598 states and 3103 transitions. [2024-11-13 20:36:40,910 INFO L276 IsEmpty]: Start isEmpty. Operand 2598 states and 3103 transitions. [2024-11-13 20:36:40,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-13 20:36:40,911 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:40,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:36:41,001 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 20:36:43,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:43,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 2614 states and 3129 transitions. [2024-11-13 20:36:43,278 INFO L276 IsEmpty]: Start isEmpty. Operand 2614 states and 3129 transitions. [2024-11-13 20:36:43,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-13 20:36:43,280 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:43,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:43,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:36:43,376 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 20:36:45,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:45,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3147 states to 2627 states and 3147 transitions. [2024-11-13 20:36:45,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2627 states and 3147 transitions. [2024-11-13 20:36:45,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-13 20:36:45,187 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:45,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:36:45,283 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 20:36:45,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:45,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3149 states to 2630 states and 3149 transitions. [2024-11-13 20:36:45,901 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 3149 transitions. [2024-11-13 20:36:45,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-13 20:36:45,902 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:45,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:45,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:36:45,998 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 20:36:47,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:47,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3156 states to 2634 states and 3156 transitions. [2024-11-13 20:36:47,169 INFO L276 IsEmpty]: Start isEmpty. Operand 2634 states and 3156 transitions. [2024-11-13 20:36:47,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-13 20:36:47,171 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:47,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:47,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:36:47,269 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 20:36:47,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:47,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3163 states to 2640 states and 3163 transitions. [2024-11-13 20:36:47,948 INFO L276 IsEmpty]: Start isEmpty. Operand 2640 states and 3163 transitions. [2024-11-13 20:36:47,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-13 20:36:47,950 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:47,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:47,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:36:48,052 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 20:36:48,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:48,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3165 states to 2643 states and 3165 transitions. [2024-11-13 20:36:48,721 INFO L276 IsEmpty]: Start isEmpty. Operand 2643 states and 3165 transitions. [2024-11-13 20:36:48,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-13 20:36:48,722 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:48,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:36:48,814 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 20:36:49,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:49,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3165 states to 2644 states and 3165 transitions. [2024-11-13 20:36:49,665 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 3165 transitions. [2024-11-13 20:36:49,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-13 20:36:49,668 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:49,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:36:49,768 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 20:36:50,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:50,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3165 states to 2645 states and 3165 transitions. [2024-11-13 20:36:50,454 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 3165 transitions. [2024-11-13 20:36:50,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-13 20:36:50,455 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:50,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:36:50,551 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 20:36:51,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:51,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3168 states to 2649 states and 3168 transitions. [2024-11-13 20:36:51,207 INFO L276 IsEmpty]: Start isEmpty. Operand 2649 states and 3168 transitions. [2024-11-13 20:36:51,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-13 20:36:51,209 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:51,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:51,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:36:51,304 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-13 20:36:52,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:52,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3173 states to 2652 states and 3173 transitions. [2024-11-13 20:36:52,431 INFO L276 IsEmpty]: Start isEmpty. Operand 2652 states and 3173 transitions. [2024-11-13 20:36:52,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-13 20:36:52,433 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:52,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:52,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:36:52,506 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-13 20:36:53,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:53,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3178 states to 2659 states and 3178 transitions. [2024-11-13 20:36:53,202 INFO L276 IsEmpty]: Start isEmpty. Operand 2659 states and 3178 transitions. [2024-11-13 20:36:53,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-13 20:36:53,204 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:53,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:53,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:36:53,273 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-13 20:36:53,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:53,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3180 states to 2662 states and 3180 transitions. [2024-11-13 20:36:53,630 INFO L276 IsEmpty]: Start isEmpty. Operand 2662 states and 3180 transitions. [2024-11-13 20:36:53,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-13 20:36:53,632 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:53,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:53,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:36:53,702 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-13 20:36:53,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:53,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3188 states to 2671 states and 3188 transitions. [2024-11-13 20:36:53,797 INFO L276 IsEmpty]: Start isEmpty. Operand 2671 states and 3188 transitions. [2024-11-13 20:36:53,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-13 20:36:53,800 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:53,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:53,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:36:53,871 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-13 20:36:54,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:54,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3196 states to 2680 states and 3196 transitions. [2024-11-13 20:36:54,452 INFO L276 IsEmpty]: Start isEmpty. Operand 2680 states and 3196 transitions. [2024-11-13 20:36:54,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-13 20:36:54,453 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:54,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:54,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:36:54,751 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 152 proven. 83 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-13 20:36:55,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:55,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3213 states to 2695 states and 3213 transitions. [2024-11-13 20:36:55,577 INFO L276 IsEmpty]: Start isEmpty. Operand 2695 states and 3213 transitions. [2024-11-13 20:36:55,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-13 20:36:55,578 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:55,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:36:55,837 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 155 proven. 86 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-13 20:36:58,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:36:58,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3257 states to 2732 states and 3257 transitions. [2024-11-13 20:36:58,420 INFO L276 IsEmpty]: Start isEmpty. Operand 2732 states and 3257 transitions. [2024-11-13 20:36:58,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-11-13 20:36:58,422 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:36:58,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:36:58,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 20:36:58,457 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 20:36:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 20:36:58,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 20:36:58,738 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 20:36:58,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 20:36:58,889 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 148 iterations. [2024-11-13 20:36:59,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 08:36:59 ImpRootNode [2024-11-13 20:36:59,080 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 20:36:59,085 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 20:36:59,085 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 20:36:59,085 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 20:36:59,086 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:34:06" (3/4) ... [2024-11-13 20:36:59,087 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 20:36:59,296 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad04b20b-d661-47cc-8557-d3f582c16d3f/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 20:36:59,296 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 20:36:59,297 INFO L158 Benchmark]: Toolchain (without parser) took 175227.60ms. Allocated memory was 117.4MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 93.0MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-11-13 20:36:59,297 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 142.6MB. Free memory is still 79.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 20:36:59,298 INFO L158 Benchmark]: CACSL2BoogieTranslator took 551.47ms. Allocated memory is still 117.4MB. Free memory was 93.0MB in the beginning and 66.2MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 20:36:59,298 INFO L158 Benchmark]: Boogie Procedure Inliner took 106.83ms. Allocated memory is still 117.4MB. Free memory was 66.2MB in the beginning and 60.9MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 20:36:59,299 INFO L158 Benchmark]: Boogie Preprocessor took 96.42ms. Allocated memory is still 117.4MB. Free memory was 60.9MB in the beginning and 56.6MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 20:36:59,299 INFO L158 Benchmark]: RCFGBuilder took 1850.34ms. Allocated memory is still 117.4MB. Free memory was 56.6MB in the beginning and 72.1MB in the end (delta: -15.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-13 20:36:59,301 INFO L158 Benchmark]: CodeCheck took 172401.71ms. Allocated memory was 117.4MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 72.1MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-11-13 20:36:59,302 INFO L158 Benchmark]: Witness Printer took 211.50ms. Allocated memory is still 2.6GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 20:36:59,303 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: 172.2s, OverallIterations: 148, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 415978 SdHoareTripleChecker+Valid, 1081.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 411303 mSDsluCounter, 52201 SdHoareTripleChecker+Invalid, 925.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44176 mSDsCounter, 98513 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 902872 IncrementalHoareTripleChecker+Invalid, 1001385 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 98513 mSolverCounterUnsat, 8025 mSDtfsCounter, 902872 mSolverCounterSat, 8.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 156794 GetRequests, 150101 SyntacticMatches, 5505 SemanticMatches, 1188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 995777 ImplicationChecksByTransitivity, 123.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.9s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 26.1s InterpolantComputationTime, 23275 NumberOfCodeBlocks, 23275 NumberOfCodeBlocksAsserted, 148 NumberOfCheckSat, 22892 ConstructedInterpolants, 0 QuantifiedInterpolants, 109655 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 147 InterpolantComputations, 95 PerfectInterpolantSequences, 16739/19143 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: 414]: 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, 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, 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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [\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, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [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, 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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [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 [\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, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [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, 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 [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 [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 [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 [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 [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 [\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, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [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, 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 [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 [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 [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 [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 [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 [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 [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 [\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, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [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, 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 [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=2, 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 [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=2, 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 [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=2, 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 [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=2, 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 [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=2, 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 [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=2, 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 [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=2, 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 [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=2, 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 [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=2, 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 [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=2, 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 [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=2, 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 [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=2, 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 [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=2, 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 [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=2, 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 [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=2, 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 [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=2, 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 [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=2, 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 [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=2, 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 [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=2, 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 [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=2, 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 [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=2, 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 [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=2, 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 [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=2, 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 [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=2, 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 [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=2, 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 [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=2, 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 [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=2, 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 [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=2, 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 [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=2, 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 [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=2, 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 [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=2, 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 [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=2, 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 [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=2, 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 [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=2, 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 [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=2, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND TRUE ((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1))) [L234] a21 = 1 [L235] a8 = 14 [L236] a16 = 4 [L237] a20 = 0 [L238] a7 = 0 [L239] a17 = 0 [L240] return -1; VAL [\result=-1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] output = calculate_output(input) [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 [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L387] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L392] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L401] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L404] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L407] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L410] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L413] COND TRUE ((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L414] reach_error() VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=14, a=1, b=2, c=3, d=4, e=5, f=6, 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.43ms. Allocated memory is still 142.6MB. Free memory is still 79.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 551.47ms. Allocated memory is still 117.4MB. Free memory was 93.0MB in the beginning and 66.2MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 106.83ms. Allocated memory is still 117.4MB. Free memory was 66.2MB in the beginning and 60.9MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 96.42ms. Allocated memory is still 117.4MB. Free memory was 60.9MB in the beginning and 56.6MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1850.34ms. Allocated memory is still 117.4MB. Free memory was 56.6MB in the beginning and 72.1MB in the end (delta: -15.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * CodeCheck took 172401.71ms. Allocated memory was 117.4MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 72.1MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 211.50ms. Allocated memory is still 2.6GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-13 20:36:59,352 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad04b20b-d661-47cc-8557-d3f582c16d3f/bin/ukojak-verify-EEHR8qb7sm/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