./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label44.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_16bb5a08-67ed-49e3-9c76-24ea6d74fe41/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16bb5a08-67ed-49e3-9c76-24ea6d74fe41/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_16bb5a08-67ed-49e3-9c76-24ea6d74fe41/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16bb5a08-67ed-49e3-9c76-24ea6d74fe41/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label44.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16bb5a08-67ed-49e3-9c76-24ea6d74fe41/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_16bb5a08-67ed-49e3-9c76-24ea6d74fe41/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 19f6a4e9c4337065cd35355f350ba61e20d7c158a393782dbdfa17548177e415 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 20:49:52,249 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 20:49:52,342 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16bb5a08-67ed-49e3-9c76-24ea6d74fe41/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 20:49:52,348 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 20:49:52,348 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 20:49:52,380 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 20:49:52,381 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 20:49:52,381 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 20:49:52,381 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 20:49:52,382 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 20:49:52,385 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 20:49:52,386 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 20:49:52,386 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 20:49:52,386 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 20:49:52,386 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 20:49:52,386 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 20:49:52,386 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 20:49:52,386 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 20:49:52,386 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 20:49:52,386 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 20:49:52,386 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 20:49:52,386 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 20:49:52,387 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 20:49:52,387 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 20:49:52,387 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 20:49:52,387 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 20:49:52,387 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 20:49:52,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 20:49:52,387 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 20:49:52,387 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 20:49:52,387 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 20:49:52,387 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 20:49:52,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 20:49:52,387 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_16bb5a08-67ed-49e3-9c76-24ea6d74fe41/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 -> 19f6a4e9c4337065cd35355f350ba61e20d7c158a393782dbdfa17548177e415 [2024-11-13 20:49:52,722 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 20:49:52,732 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 20:49:52,736 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 20:49:52,737 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 20:49:52,738 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 20:49:52,739 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16bb5a08-67ed-49e3-9c76-24ea6d74fe41/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/eca-rers2012/Problem01_label44.c Unable to find full path for "g++" [2024-11-13 20:49:54,744 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 20:49:55,087 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 20:49:55,088 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16bb5a08-67ed-49e3-9c76-24ea6d74fe41/sv-benchmarks/c/eca-rers2012/Problem01_label44.c [2024-11-13 20:49:55,106 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16bb5a08-67ed-49e3-9c76-24ea6d74fe41/bin/ukojak-verify-EEHR8qb7sm/data/aad5b0950/22d24f4c21eb410cb650cbd3ca12aee0/FLAG8e858f490 [2024-11-13 20:49:55,134 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16bb5a08-67ed-49e3-9c76-24ea6d74fe41/bin/ukojak-verify-EEHR8qb7sm/data/aad5b0950/22d24f4c21eb410cb650cbd3ca12aee0 [2024-11-13 20:49:55,136 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 20:49:55,139 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 20:49:55,141 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 20:49:55,141 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 20:49:55,145 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 20:49:55,147 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 08:49:55" (1/1) ... [2024-11-13 20:49:55,148 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f1e85b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:49:55, skipping insertion in model container [2024-11-13 20:49:55,151 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 08:49:55" (1/1) ... [2024-11-13 20:49:55,199 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 20:49:55,565 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_16bb5a08-67ed-49e3-9c76-24ea6d74fe41/sv-benchmarks/c/eca-rers2012/Problem01_label44.c[16002,16015] [2024-11-13 20:49:55,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 20:49:55,621 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 20:49:55,721 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_16bb5a08-67ed-49e3-9c76-24ea6d74fe41/sv-benchmarks/c/eca-rers2012/Problem01_label44.c[16002,16015] [2024-11-13 20:49:55,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 20:49:55,764 INFO L204 MainTranslator]: Completed translation [2024-11-13 20:49:55,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:49:55 WrapperNode [2024-11-13 20:49:55,765 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 20:49:55,766 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 20:49:55,766 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 20:49:55,766 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 20:49:55,773 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:49:55" (1/1) ... [2024-11-13 20:49:55,792 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:49:55" (1/1) ... [2024-11-13 20:49:55,855 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2024-11-13 20:49:55,856 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 20:49:55,857 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 20:49:55,857 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 20:49:55,857 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 20:49:55,865 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:49:55" (1/1) ... [2024-11-13 20:49:55,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:49:55" (1/1) ... [2024-11-13 20:49:55,877 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:49:55" (1/1) ... [2024-11-13 20:49:55,877 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:49:55" (1/1) ... [2024-11-13 20:49:55,912 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:49:55" (1/1) ... [2024-11-13 20:49:55,930 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:49:55" (1/1) ... [2024-11-13 20:49:55,937 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:49:55" (1/1) ... [2024-11-13 20:49:55,944 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:49:55" (1/1) ... [2024-11-13 20:49:55,954 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 20:49:55,956 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 20:49:55,956 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 20:49:55,956 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 20:49:55,957 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 08:49:55" (1/1) ... [2024-11-13 20:49:55,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 20:49:55,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16bb5a08-67ed-49e3-9c76-24ea6d74fe41/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 20:49:55,993 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16bb5a08-67ed-49e3-9c76-24ea6d74fe41/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:49:55,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16bb5a08-67ed-49e3-9c76-24ea6d74fe41/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:49:56,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 20:49:56,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 20:49:56,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 20:49:56,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 20:49:56,126 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 20:49:56,128 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 20:49:57,574 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-13 20:49:57,576 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 20:49:57,865 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 20:49:57,867 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 20:49:57,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:49:57 BoogieIcfgContainer [2024-11-13 20:49:57,868 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 20:49:57,869 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 20:49:57,869 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 20:49:57,879 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 20:49:57,880 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:49:57" (1/1) ... [2024-11-13 20:49:57,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 20:49:57,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:57,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2024-11-13 20:49:57,960 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2024-11-13 20:49:57,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-13 20:49:57,963 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:57,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:58,545 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:49:59,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:59,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 145 states and 237 transitions. [2024-11-13 20:49:59,242 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 237 transitions. [2024-11-13 20:49:59,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-13 20:49:59,244 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:59,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:59,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:49:59,558 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:49:59,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:49:59,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 146 states and 238 transitions. [2024-11-13 20:49:59,859 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 238 transitions. [2024-11-13 20:49:59,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-13 20:49:59,863 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:49:59,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:49:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:00,014 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:50:00,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:00,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 150 states and 244 transitions. [2024-11-13 20:50:00,134 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 244 transitions. [2024-11-13 20:50:00,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-13 20:50:00,138 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:00,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:00,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:00,289 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:50:00,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:00,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 151 states and 245 transitions. [2024-11-13 20:50:00,490 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 245 transitions. [2024-11-13 20:50:00,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-13 20:50:00,492 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:00,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:00,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:00,692 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:50:00,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:00,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 159 states and 258 transitions. [2024-11-13 20:50:00,908 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 258 transitions. [2024-11-13 20:50:00,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-13 20:50:00,914 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:00,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:00,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:01,092 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:50:01,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:01,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 160 states and 259 transitions. [2024-11-13 20:50:01,277 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 259 transitions. [2024-11-13 20:50:01,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-13 20:50:01,280 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:01,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:01,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:01,493 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:50:01,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:01,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 168 states and 268 transitions. [2024-11-13 20:50:01,661 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 268 transitions. [2024-11-13 20:50:01,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-13 20:50:01,662 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:01,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:01,922 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:50:02,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:02,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 182 states and 286 transitions. [2024-11-13 20:50:02,286 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 286 transitions. [2024-11-13 20:50:02,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-13 20:50:02,286 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:02,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:02,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:02,481 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:50:03,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:03,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 197 states and 306 transitions. [2024-11-13 20:50:03,037 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 306 transitions. [2024-11-13 20:50:03,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-13 20:50:03,037 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:03,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:03,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:03,307 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:50:04,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:04,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 212 states and 327 transitions. [2024-11-13 20:50:04,052 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 327 transitions. [2024-11-13 20:50:04,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-13 20:50:04,053 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:04,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:04,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:04,247 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:50:05,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:05,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 230 states and 356 transitions. [2024-11-13 20:50:05,065 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2024-11-13 20:50:05,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-13 20:50:05,066 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:05,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:05,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:05,260 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:50:05,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:05,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 232 states and 359 transitions. [2024-11-13 20:50:05,500 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 359 transitions. [2024-11-13 20:50:05,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-13 20:50:05,505 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:05,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:05,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:05,618 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:50:05,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:05,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 237 states and 365 transitions. [2024-11-13 20:50:05,758 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 365 transitions. [2024-11-13 20:50:05,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-13 20:50:05,760 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:05,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:05,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:05,961 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:50:06,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:06,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 238 states and 366 transitions. [2024-11-13 20:50:06,171 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 366 transitions. [2024-11-13 20:50:06,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-13 20:50:06,172 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:06,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:06,277 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:50:07,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:07,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 257 states and 395 transitions. [2024-11-13 20:50:07,258 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 395 transitions. [2024-11-13 20:50:07,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-13 20:50:07,259 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:07,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:07,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:07,319 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:50:07,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:07,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 258 states and 396 transitions. [2024-11-13 20:50:07,517 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 396 transitions. [2024-11-13 20:50:07,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-13 20:50:07,518 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:07,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:07,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:07,634 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:50:08,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:08,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 273 states and 415 transitions. [2024-11-13 20:50:08,199 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 415 transitions. [2024-11-13 20:50:08,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-13 20:50:08,201 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:08,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:08,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:08,293 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:50:09,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:09,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 291 states and 435 transitions. [2024-11-13 20:50:09,079 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 435 transitions. [2024-11-13 20:50:09,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-13 20:50:09,081 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:09,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:09,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:09,161 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:50:09,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:09,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 295 states and 439 transitions. [2024-11-13 20:50:09,223 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 439 transitions. [2024-11-13 20:50:09,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-13 20:50:09,225 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:09,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:09,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:09,345 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:50:09,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:09,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 299 states and 444 transitions. [2024-11-13 20:50:09,804 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 444 transitions. [2024-11-13 20:50:09,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 20:50:09,805 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:09,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:09,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:09,899 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:50:10,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:10,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 307 states and 459 transitions. [2024-11-13 20:50:10,432 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 459 transitions. [2024-11-13 20:50:10,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 20:50:10,435 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:10,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:10,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:10,506 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:50:10,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:10,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 313 states and 467 transitions. [2024-11-13 20:50:10,999 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 467 transitions. [2024-11-13 20:50:11,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 20:50:11,000 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:11,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:11,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:11,059 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:50:11,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:11,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 316 states and 471 transitions. [2024-11-13 20:50:11,309 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 471 transitions. [2024-11-13 20:50:11,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-13 20:50:11,311 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:11,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:11,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:11,372 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:50:11,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:11,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 331 states and 491 transitions. [2024-11-13 20:50:11,946 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 491 transitions. [2024-11-13 20:50:11,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-13 20:50:11,948 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:11,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:12,091 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:50:12,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:12,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 345 states and 508 transitions. [2024-11-13 20:50:12,420 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 508 transitions. [2024-11-13 20:50:12,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-13 20:50:12,421 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:12,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:12,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:12,579 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:50:12,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:12,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 347 states and 510 transitions. [2024-11-13 20:50:12,897 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 510 transitions. [2024-11-13 20:50:12,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 20:50:12,899 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:12,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:12,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:12,964 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:50:13,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:13,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 353 states and 516 transitions. [2024-11-13 20:50:13,332 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 516 transitions. [2024-11-13 20:50:13,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 20:50:13,334 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:13,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:13,405 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:50:13,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:13,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 357 states and 519 transitions. [2024-11-13 20:50:13,459 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 519 transitions. [2024-11-13 20:50:13,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-13 20:50:13,464 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:13,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:13,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:13,632 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:50:13,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:13,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 359 states and 522 transitions. [2024-11-13 20:50:13,713 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 522 transitions. [2024-11-13 20:50:13,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 20:50:13,715 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:13,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:13,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:13,874 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:50:14,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:14,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 373 states and 540 transitions. [2024-11-13 20:50:14,467 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 540 transitions. [2024-11-13 20:50:14,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 20:50:14,468 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:14,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:14,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:14,626 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:50:14,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:14,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 377 states and 545 transitions. [2024-11-13 20:50:14,911 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 545 transitions. [2024-11-13 20:50:14,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 20:50:14,913 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:14,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:14,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:15,022 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:50:15,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:15,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 379 states and 548 transitions. [2024-11-13 20:50:15,218 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 548 transitions. [2024-11-13 20:50:15,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 20:50:15,219 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:15,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:15,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:15,487 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:50:15,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:15,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 386 states and 555 transitions. [2024-11-13 20:50:15,944 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 555 transitions. [2024-11-13 20:50:15,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 20:50:15,946 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:15,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:15,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:16,088 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:50:16,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:16,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 395 states and 564 transitions. [2024-11-13 20:50:16,520 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 564 transitions. [2024-11-13 20:50:16,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 20:50:16,522 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:16,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:16,652 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:50:16,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:16,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 399 states and 567 transitions. [2024-11-13 20:50:16,951 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 567 transitions. [2024-11-13 20:50:16,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 20:50:16,952 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:16,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:16,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:17,072 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:50:17,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:17,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 402 states and 569 transitions. [2024-11-13 20:50:17,410 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 569 transitions. [2024-11-13 20:50:17,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-13 20:50:17,411 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:17,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:17,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:17,514 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:50:18,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:18,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 477 states and 646 transitions. [2024-11-13 20:50:18,230 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 646 transitions. [2024-11-13 20:50:18,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-13 20:50:18,231 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:18,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:18,310 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:50:18,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:18,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 491 states and 662 transitions. [2024-11-13 20:50:18,421 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 662 transitions. [2024-11-13 20:50:18,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-13 20:50:18,422 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:18,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:18,506 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:50:18,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:18,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 502 states and 675 transitions. [2024-11-13 20:50:18,675 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 675 transitions. [2024-11-13 20:50:18,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 20:50:18,676 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:18,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:18,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:18,739 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 20:50:18,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:18,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 507 states and 682 transitions. [2024-11-13 20:50:18,937 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 682 transitions. [2024-11-13 20:50:18,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-13 20:50:18,938 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:18,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:18,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:19,056 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:50:19,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:19,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 509 states and 685 transitions. [2024-11-13 20:50:19,098 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 685 transitions. [2024-11-13 20:50:19,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 20:50:19,099 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:19,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:19,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:19,166 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:50:19,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:19,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 516 states and 693 transitions. [2024-11-13 20:50:19,412 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 693 transitions. [2024-11-13 20:50:19,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-13 20:50:19,417 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:19,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:19,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:19,533 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:50:19,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:19,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 518 states and 694 transitions. [2024-11-13 20:50:19,696 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 694 transitions. [2024-11-13 20:50:19,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 20:50:19,697 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:19,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:19,789 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:50:20,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:20,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 556 states and 738 transitions. [2024-11-13 20:50:20,712 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 738 transitions. [2024-11-13 20:50:20,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 20:50:20,714 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:20,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:20,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:20,829 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:50:21,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:21,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 559 states and 740 transitions. [2024-11-13 20:50:21,131 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 740 transitions. [2024-11-13 20:50:21,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 20:50:21,133 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:21,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:21,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:21,220 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:50:21,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:21,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 562 states and 742 transitions. [2024-11-13 20:50:21,506 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 742 transitions. [2024-11-13 20:50:21,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 20:50:21,507 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:21,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:21,572 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 20:50:21,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:21,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 571 states and 752 transitions. [2024-11-13 20:50:21,662 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 752 transitions. [2024-11-13 20:50:21,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-13 20:50:21,663 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:21,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:21,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:21,776 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:50:21,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:21,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 580 states and 760 transitions. [2024-11-13 20:50:21,862 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 760 transitions. [2024-11-13 20:50:21,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-13 20:50:21,863 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:21,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:21,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:22,019 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-13 20:50:22,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:22,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 669 states and 852 transitions. [2024-11-13 20:50:22,949 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 852 transitions. [2024-11-13 20:50:22,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-13 20:50:22,950 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:22,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:22,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:23,049 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:50:23,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:23,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 696 states and 880 transitions. [2024-11-13 20:50:23,293 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 880 transitions. [2024-11-13 20:50:23,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-13 20:50:23,294 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:23,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:23,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:23,428 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:50:23,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:23,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 724 states and 909 transitions. [2024-11-13 20:50:23,887 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 909 transitions. [2024-11-13 20:50:23,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-13 20:50:23,888 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:23,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:24,001 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:50:24,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:24,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 725 states and 909 transitions. [2024-11-13 20:50:24,058 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 909 transitions. [2024-11-13 20:50:24,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-13 20:50:24,059 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:24,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:24,649 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:50:27,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:27,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 797 states and 1003 transitions. [2024-11-13 20:50:27,709 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1003 transitions. [2024-11-13 20:50:27,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-13 20:50:27,710 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:27,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:27,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:27,989 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:50:28,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:28,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 801 states and 1008 transitions. [2024-11-13 20:50:28,609 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1008 transitions. [2024-11-13 20:50:28,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-13 20:50:28,610 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:28,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:28,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:28,689 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:50:29,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:29,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 828 states and 1039 transitions. [2024-11-13 20:50:29,111 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1039 transitions. [2024-11-13 20:50:29,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-13 20:50:29,112 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:29,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:29,354 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:50:31,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:31,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 893 states and 1111 transitions. [2024-11-13 20:50:31,393 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1111 transitions. [2024-11-13 20:50:31,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-13 20:50:31,394 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:31,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:31,484 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:50:31,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:31,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 908 states and 1126 transitions. [2024-11-13 20:50:31,640 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1126 transitions. [2024-11-13 20:50:31,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-13 20:50:31,641 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:31,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:31,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:31,837 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 76 proven. 3 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-13 20:50:32,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:32,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 911 states and 1129 transitions. [2024-11-13 20:50:32,030 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1129 transitions. [2024-11-13 20:50:32,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-13 20:50:32,031 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:32,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:32,085 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-13 20:50:32,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:32,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 947 states and 1165 transitions. [2024-11-13 20:50:32,275 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1165 transitions. [2024-11-13 20:50:32,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-13 20:50:32,276 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:32,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:32,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 20:50:32,588 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 124 proven. 6 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-13 20:50:34,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 20:50:34,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 987 states and 1211 transitions. [2024-11-13 20:50:34,030 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1211 transitions. [2024-11-13 20:50:34,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-13 20:50:34,032 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 20:50:34,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 20:50:34,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 20:50:34,071 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 20:50:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 20:50:34,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 20:50:34,309 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 20:50:34,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 20:50:34,432 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 61 iterations. [2024-11-13 20:50:34,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 13.11 08:50:34 ImpRootNode [2024-11-13 20:50:34,638 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-11-13 20:50:34,639 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 20:50:34,639 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 20:50:34,639 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 20:50:34,640 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 08:49:57" (3/4) ... [2024-11-13 20:50:34,640 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-13 20:50:34,805 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16bb5a08-67ed-49e3-9c76-24ea6d74fe41/bin/ukojak-verify-EEHR8qb7sm/witness.graphml [2024-11-13 20:50:34,805 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 20:50:34,806 INFO L158 Benchmark]: Toolchain (without parser) took 39668.59ms. Allocated memory was 117.4MB in the beginning and 587.2MB in the end (delta: 469.8MB). Free memory was 89.8MB in the beginning and 501.0MB in the end (delta: -411.2MB). Peak memory consumption was 60.1MB. Max. memory is 16.1GB. [2024-11-13 20:50:34,808 INFO L158 Benchmark]: CDTParser took 1.65ms. Allocated memory is still 83.9MB. Free memory is still 40.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 20:50:34,808 INFO L158 Benchmark]: CACSL2BoogieTranslator took 624.45ms. Allocated memory is still 117.4MB. Free memory was 89.8MB in the beginning and 62.9MB in the end (delta: 26.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 20:50:34,808 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.29ms. Allocated memory is still 117.4MB. Free memory was 62.9MB in the beginning and 57.2MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 20:50:34,809 INFO L158 Benchmark]: Boogie Preprocessor took 97.99ms. Allocated memory is still 117.4MB. Free memory was 57.2MB in the beginning and 53.6MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 20:50:34,809 INFO L158 Benchmark]: RCFGBuilder took 1912.11ms. Allocated memory is still 117.4MB. Free memory was 53.6MB in the beginning and 71.7MB in the end (delta: -18.1MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. [2024-11-13 20:50:34,809 INFO L158 Benchmark]: CodeCheck took 36769.35ms. Allocated memory was 117.4MB in the beginning and 587.2MB in the end (delta: 469.8MB). Free memory was 71.7MB in the beginning and 517.8MB in the end (delta: -446.1MB). Peak memory consumption was 351.6MB. Max. memory is 16.1GB. [2024-11-13 20:50:34,809 INFO L158 Benchmark]: Witness Printer took 166.84ms. Allocated memory is still 587.2MB. Free memory was 517.8MB in the beginning and 501.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 20:50:34,812 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: 36.5s, OverallIterations: 61, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48342 SdHoareTripleChecker+Valid, 177.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46451 mSDsluCounter, 8904 SdHoareTripleChecker+Invalid, 149.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7378 mSDsCounter, 23330 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 115377 IncrementalHoareTripleChecker+Invalid, 138707 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23330 mSolverCounterUnsat, 1526 mSDtfsCounter, 115377 mSolverCounterSat, 2.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48501 GetRequests, 47412 SyntacticMatches, 707 SemanticMatches, 382 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83763 ImplicationChecksByTransitivity, 19.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.4s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 6683 NumberOfCodeBlocks, 6683 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 6448 ConstructedInterpolants, 0 QuantifiedInterpolants, 14943 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 60 InterpolantComputations, 53 PerfectInterpolantSequences, 2471/2495 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: 438]: 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 TRUE (((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8)) [L42] a16 = 5 [L43] a20 = 0 [L44] return 24; VAL [\result=24, a12=8, a16=5, 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=5, a17=1, a20=0, a21=1, a7=0, a8=15, 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=0, a21=1, a7=0, a8=15, 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=0, a21=1, a7=0, a8=15, 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=0, a21=1, a7=0, a8=15, 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=0, a21=1, a7=0, a8=15, 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=0, a21=1, a7=0, a8=15, 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=0, a21=1, a7=0, a8=15, 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=0, a21=1, a7=0, a8=15, 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=0, a21=1, a7=0, a8=15, 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=0, a21=1, a7=0, a8=15, 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=0, a21=1, a7=0, a8=15, 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=0, a21=1, a7=0, a8=15, 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=0, a21=1, a7=0, a8=15, 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=0, a21=1, a7=0, a8=15, 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=0, a21=1, a7=0, a8=15, 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=0, a21=1, a7=0, a8=15, 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=0, a21=1, a7=0, a8=15, 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=0, a21=1, a7=0, a8=15, 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=0, a21=1, a7=0, a8=15, 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=0, a21=1, a7=0, a8=15, 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=0, a21=1, a7=0, a8=15, 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=0, a21=1, a7=0, a8=15, 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=0, a21=1, a7=0, a8=15, 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=0, a21=1, a7=0, a8=15, 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=0, a21=1, a7=0, a8=15, 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=0, a21=1, a7=0, a8=15, 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=0, a21=1, a7=0, a8=15, 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=0, a21=1, a7=0, a8=15, 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=0, a21=1, a7=0, a8=15, 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=0, a21=1, a7=0, a8=15, 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=0, a21=1, a7=0, a8=15, 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=0, a21=1, a7=0, a8=15, 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=0, a21=1, a7=0, a8=15, 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=0, a21=1, a7=0, a8=15, 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=0, a21=1, a7=0, a8=15, 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 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=0, a21=1, a7=0, a8=15, 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] [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=0, a21=1, a7=0, a8=15, 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] [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=0, a21=1, a7=0, a8=15, 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] [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=0, a21=1, a7=0, a8=15, 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] [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=0, a21=1, a7=0, a8=15, 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] [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=0, a21=1, a7=0, a8=15, 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] [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=0, a21=1, a7=0, a8=15, 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] [L275] COND TRUE ((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15))) [L276] a17 = 0 [L277] return 24; VAL [\result=24, a12=8, a16=5, 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=5, a17=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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=0, a20=0, 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 TRUE ((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5)) [L323] a8 = 13 [L324] a16 = 4 [L325] return -1; VAL [\result=-1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, 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 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=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L387] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, a=1, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L392] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L401] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L404] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L407] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L410] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L413] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L416] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L419] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L422] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L425] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L428] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L431] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L434] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, 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] [L437] COND TRUE ((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, 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] [L438] reach_error() VAL [a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, 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] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.65ms. Allocated memory is still 83.9MB. Free memory is still 40.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 624.45ms. Allocated memory is still 117.4MB. Free memory was 89.8MB in the beginning and 62.9MB in the end (delta: 26.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.29ms. Allocated memory is still 117.4MB. Free memory was 62.9MB in the beginning and 57.2MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 97.99ms. Allocated memory is still 117.4MB. Free memory was 57.2MB in the beginning and 53.6MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1912.11ms. Allocated memory is still 117.4MB. Free memory was 53.6MB in the beginning and 71.7MB in the end (delta: -18.1MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. * CodeCheck took 36769.35ms. Allocated memory was 117.4MB in the beginning and 587.2MB in the end (delta: 469.8MB). Free memory was 71.7MB in the beginning and 517.8MB in the end (delta: -446.1MB). Peak memory consumption was 351.6MB. Max. memory is 16.1GB. * Witness Printer took 166.84ms. Allocated memory is still 587.2MB. Free memory was 517.8MB in the beginning and 501.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-11-13 20:50:34,854 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16bb5a08-67ed-49e3-9c76-24ea6d74fe41/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE