./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label38.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_630ee861-b48b-4286-a744-e703a2b6c675/bin/ukojak-rkRKPMF4O4/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_630ee861-b48b-4286-a744-e703a2b6c675/bin/ukojak-rkRKPMF4O4/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_630ee861-b48b-4286-a744-e703a2b6c675/bin/ukojak-rkRKPMF4O4/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_630ee861-b48b-4286-a744-e703a2b6c675/bin/ukojak-rkRKPMF4O4/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label38.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_630ee861-b48b-4286-a744-e703a2b6c675/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_630ee861-b48b-4286-a744-e703a2b6c675/bin/ukojak-rkRKPMF4O4 --witnessprinter.witness.filename witness.graphml --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 af706eff0638e64b28329aeb8e4500504f7e95c7ca075a2e2f010d6212db9f23 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 21:08:16,024 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 21:08:16,025 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 21:08:16,042 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 21:08:16,042 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 21:08:16,043 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 21:08:16,043 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 21:08:16,044 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 21:08:16,046 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 21:08:16,046 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 21:08:16,047 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 21:08:16,048 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 21:08:16,048 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 21:08:16,049 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 21:08:16,049 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 21:08:16,050 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 21:08:16,050 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 21:08:16,051 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 21:08:16,052 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 21:08:16,053 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 21:08:16,054 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 21:08:16,055 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 21:08:16,056 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 21:08:16,056 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 21:08:16,059 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 21:08:16,059 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 21:08:16,059 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 21:08:16,060 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 21:08:16,060 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 21:08:16,061 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 21:08:16,061 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 21:08:16,061 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 21:08:16,062 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 21:08:16,062 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 21:08:16,063 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 21:08:16,063 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 21:08:16,064 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 21:08:16,064 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 21:08:16,064 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 21:08:16,064 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 21:08:16,065 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 21:08:16,066 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_630ee861-b48b-4286-a744-e703a2b6c675/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf [2022-12-14 21:08:16,080 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 21:08:16,080 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 21:08:16,080 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 21:08:16,081 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2022-12-14 21:08:16,081 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 21:08:16,081 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 21:08:16,081 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 21:08:16,081 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 21:08:16,082 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 21:08:16,082 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 21:08:16,082 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 21:08:16,082 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 21:08:16,082 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 21:08:16,082 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 21:08:16,082 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 21:08:16,082 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 21:08:16,083 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 21:08:16,083 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 21:08:16,083 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2022-12-14 21:08:16,083 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2022-12-14 21:08:16,083 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 21:08:16,083 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 21:08:16,083 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 21:08:16,083 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 21:08:16,084 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 21:08:16,084 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2022-12-14 21:08:16,084 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 21:08:16,084 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 21:08:16,084 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_630ee861-b48b-4286-a744-e703a2b6c675/bin/ukojak-rkRKPMF4O4/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_630ee861-b48b-4286-a744-e703a2b6c675/bin/ukojak-rkRKPMF4O4 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> af706eff0638e64b28329aeb8e4500504f7e95c7ca075a2e2f010d6212db9f23 [2022-12-14 21:08:16,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 21:08:16,296 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 21:08:16,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 21:08:16,299 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 21:08:16,299 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 21:08:16,301 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_630ee861-b48b-4286-a744-e703a2b6c675/bin/ukojak-rkRKPMF4O4/../../sv-benchmarks/c/eca-rers2012/Problem01_label38.c [2022-12-14 21:08:18,976 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 21:08:19,186 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 21:08:19,186 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_630ee861-b48b-4286-a744-e703a2b6c675/sv-benchmarks/c/eca-rers2012/Problem01_label38.c [2022-12-14 21:08:19,195 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_630ee861-b48b-4286-a744-e703a2b6c675/bin/ukojak-rkRKPMF4O4/data/880cc27c2/c630d2ad84ae4794950366ece25890a9/FLAG0228c479b [2022-12-14 21:08:19,205 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_630ee861-b48b-4286-a744-e703a2b6c675/bin/ukojak-rkRKPMF4O4/data/880cc27c2/c630d2ad84ae4794950366ece25890a9 [2022-12-14 21:08:19,207 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 21:08:19,208 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 21:08:19,209 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 21:08:19,209 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 21:08:19,212 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 21:08:19,212 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 09:08:19" (1/1) ... [2022-12-14 21:08:19,213 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5900f1a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:08:19, skipping insertion in model container [2022-12-14 21:08:19,213 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 09:08:19" (1/1) ... [2022-12-14 21:08:19,219 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 21:08:19,247 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 21:08:19,443 WARN L237 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_630ee861-b48b-4286-a744-e703a2b6c675/sv-benchmarks/c/eca-rers2012/Problem01_label38.c[15751,15764] [2022-12-14 21:08:19,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 21:08:19,495 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 21:08:19,578 WARN L237 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_630ee861-b48b-4286-a744-e703a2b6c675/sv-benchmarks/c/eca-rers2012/Problem01_label38.c[15751,15764] [2022-12-14 21:08:19,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 21:08:19,609 INFO L208 MainTranslator]: Completed translation [2022-12-14 21:08:19,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:08:19 WrapperNode [2022-12-14 21:08:19,610 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 21:08:19,611 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 21:08:19,611 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 21:08:19,611 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 21:08:19,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:08:19" (1/1) ... [2022-12-14 21:08:19,632 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:08:19" (1/1) ... [2022-12-14 21:08:19,671 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2022-12-14 21:08:19,671 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 21:08:19,672 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 21:08:19,672 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 21:08:19,672 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 21:08:19,679 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:08:19" (1/1) ... [2022-12-14 21:08:19,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:08:19" (1/1) ... [2022-12-14 21:08:19,682 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:08:19" (1/1) ... [2022-12-14 21:08:19,682 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:08:19" (1/1) ... [2022-12-14 21:08:19,695 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:08:19" (1/1) ... [2022-12-14 21:08:19,700 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:08:19" (1/1) ... [2022-12-14 21:08:19,704 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:08:19" (1/1) ... [2022-12-14 21:08:19,706 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:08:19" (1/1) ... [2022-12-14 21:08:19,711 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 21:08:19,711 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 21:08:19,711 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 21:08:19,712 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 21:08:19,712 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:08:19" (1/1) ... [2022-12-14 21:08:19,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 21:08:19,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_630ee861-b48b-4286-a744-e703a2b6c675/bin/ukojak-rkRKPMF4O4/z3 [2022-12-14 21:08:19,736 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_630ee861-b48b-4286-a744-e703a2b6c675/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2022-12-14 21:08:19,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_630ee861-b48b-4286-a744-e703a2b6c675/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2022-12-14 21:08:19,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 21:08:19,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 21:08:19,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 21:08:19,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 21:08:19,839 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 21:08:19,841 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 21:08:20,583 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 21:08:20,718 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 21:08:20,718 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 21:08:20,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:08:20 BoogieIcfgContainer [2022-12-14 21:08:20,721 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 21:08:20,721 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2022-12-14 21:08:20,721 INFO L271 PluginConnector]: Initializing CodeCheck... [2022-12-14 21:08:20,728 INFO L275 PluginConnector]: CodeCheck initialized [2022-12-14 21:08:20,728 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:08:20" (1/1) ... [2022-12-14 21:08:20,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 21:08:20,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:20,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2022-12-14 21:08:20,773 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2022-12-14 21:08:20,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-12-14 21:08:20,776 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:20,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:21,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:08:21,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:21,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 145 states and 219 transitions. [2022-12-14 21:08:21,428 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 219 transitions. [2022-12-14 21:08:21,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-14 21:08:21,430 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:21,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:21,581 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 21:08:21,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:21,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 146 states and 220 transitions. [2022-12-14 21:08:21,714 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2022-12-14 21:08:21,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-12-14 21:08:21,716 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:21,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:21,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:21,764 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:08:21,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:21,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 151 states and 227 transitions. [2022-12-14 21:08:21,815 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 227 transitions. [2022-12-14 21:08:21,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-12-14 21:08:21,817 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:21,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:21,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:21,907 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:08:22,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:22,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 221 states and 299 transitions. [2022-12-14 21:08:22,285 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 299 transitions. [2022-12-14 21:08:22,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-12-14 21:08:22,286 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:22,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:22,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:22,390 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:08:22,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:22,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 228 states and 308 transitions. [2022-12-14 21:08:22,496 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 308 transitions. [2022-12-14 21:08:22,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-12-14 21:08:22,497 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:22,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:22,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:22,586 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 21:08:22,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:22,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 239 states and 323 transitions. [2022-12-14 21:08:22,891 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 323 transitions. [2022-12-14 21:08:22,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-12-14 21:08:22,893 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:22,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:22,954 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:08:23,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:23,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 248 states and 332 transitions. [2022-12-14 21:08:23,014 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 332 transitions. [2022-12-14 21:08:23,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-12-14 21:08:23,014 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:23,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:23,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:23,106 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 21:08:23,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:23,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 256 states and 342 transitions. [2022-12-14 21:08:23,269 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 342 transitions. [2022-12-14 21:08:23,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-12-14 21:08:23,270 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:23,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:23,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:23,328 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 21:08:23,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:23,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 264 states and 355 transitions. [2022-12-14 21:08:23,515 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 355 transitions. [2022-12-14 21:08:23,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-12-14 21:08:23,516 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:23,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:23,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:23,628 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 21:08:23,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:23,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 277 states and 371 transitions. [2022-12-14 21:08:23,865 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 371 transitions. [2022-12-14 21:08:23,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-12-14 21:08:23,866 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:23,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:23,930 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 21:08:24,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:24,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 285 states and 380 transitions. [2022-12-14 21:08:24,056 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 380 transitions. [2022-12-14 21:08:24,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-12-14 21:08:24,057 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:24,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:24,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:24,192 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 21:08:24,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:24,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 292 states and 389 transitions. [2022-12-14 21:08:24,355 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 389 transitions. [2022-12-14 21:08:24,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-12-14 21:08:24,356 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:24,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:24,477 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 21:08:24,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:24,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 295 states and 393 transitions. [2022-12-14 21:08:24,633 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 393 transitions. [2022-12-14 21:08:24,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-12-14 21:08:24,634 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:24,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:24,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:24,675 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 21:08:24,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:24,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 296 states and 395 transitions. [2022-12-14 21:08:24,763 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 395 transitions. [2022-12-14 21:08:24,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-12-14 21:08:24,764 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:24,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:24,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:24,854 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 21:08:25,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:25,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 312 states and 416 transitions. [2022-12-14 21:08:25,281 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 416 transitions. [2022-12-14 21:08:25,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-12-14 21:08:25,282 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:25,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:25,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:25,408 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 21:08:25,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:25,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 327 states and 434 transitions. [2022-12-14 21:08:25,814 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 434 transitions. [2022-12-14 21:08:25,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-12-14 21:08:25,815 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:25,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:25,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:25,877 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 21:08:26,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:26,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 338 states and 447 transitions. [2022-12-14 21:08:26,195 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 447 transitions. [2022-12-14 21:08:26,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-12-14 21:08:26,195 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:26,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:26,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:26,229 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 21:08:26,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:26,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 345 states and 456 transitions. [2022-12-14 21:08:26,376 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 456 transitions. [2022-12-14 21:08:26,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-12-14 21:08:26,377 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:26,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:26,428 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 21:08:26,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:26,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 354 states and 467 transitions. [2022-12-14 21:08:26,492 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 467 transitions. [2022-12-14 21:08:26,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-12-14 21:08:26,493 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:26,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:26,566 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 21:08:26,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:26,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 368 states and 481 transitions. [2022-12-14 21:08:26,672 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 481 transitions. [2022-12-14 21:08:26,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-12-14 21:08:26,673 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:26,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:26,740 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 21:08:26,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:26,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 372 states and 485 transitions. [2022-12-14 21:08:26,790 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 485 transitions. [2022-12-14 21:08:26,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-12-14 21:08:26,791 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:26,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:26,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:26,885 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 21:08:27,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:27,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 381 states and 496 transitions. [2022-12-14 21:08:27,010 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 496 transitions. [2022-12-14 21:08:27,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-12-14 21:08:27,011 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:27,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:27,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:27,109 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 21:08:27,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:27,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 395 states and 511 transitions. [2022-12-14 21:08:27,394 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 511 transitions. [2022-12-14 21:08:27,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-12-14 21:08:27,395 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:27,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:27,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:27,430 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 21:08:27,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:27,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 397 states and 513 transitions. [2022-12-14 21:08:27,459 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 513 transitions. [2022-12-14 21:08:27,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-12-14 21:08:27,460 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:27,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:27,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:27,503 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 21:08:27,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:27,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 398 states and 514 transitions. [2022-12-14 21:08:27,527 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 514 transitions. [2022-12-14 21:08:27,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-12-14 21:08:27,527 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:27,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:27,586 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 21:08:27,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:27,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 415 states and 532 transitions. [2022-12-14 21:08:27,710 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 532 transitions. [2022-12-14 21:08:27,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-12-14 21:08:27,711 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:27,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:27,789 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 21:08:27,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:27,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 418 states and 536 transitions. [2022-12-14 21:08:27,838 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 536 transitions. [2022-12-14 21:08:27,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-12-14 21:08:27,839 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:27,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:27,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:27,898 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:08:27,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:27,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 441 states and 561 transitions. [2022-12-14 21:08:27,998 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 561 transitions. [2022-12-14 21:08:27,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-12-14 21:08:27,999 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:28,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:28,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:28,112 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 21:08:28,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:28,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 456 states and 577 transitions. [2022-12-14 21:08:28,255 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 577 transitions. [2022-12-14 21:08:28,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-12-14 21:08:28,256 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:28,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:28,319 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 21:08:28,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:28,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 468 states and 590 transitions. [2022-12-14 21:08:28,432 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 590 transitions. [2022-12-14 21:08:28,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-12-14 21:08:28,433 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:28,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:28,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:28,549 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:08:29,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:29,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 513 states and 647 transitions. [2022-12-14 21:08:29,292 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 647 transitions. [2022-12-14 21:08:29,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-12-14 21:08:29,293 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:29,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:29,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:29,359 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:08:29,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:29,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 532 states and 669 transitions. [2022-12-14 21:08:29,484 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 669 transitions. [2022-12-14 21:08:29,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-12-14 21:08:29,485 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:29,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:29,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:29,550 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 21:08:29,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:29,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 534 states and 671 transitions. [2022-12-14 21:08:29,663 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 671 transitions. [2022-12-14 21:08:29,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-12-14 21:08:29,663 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:29,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:29,710 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 21:08:29,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:29,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 548 states and 685 transitions. [2022-12-14 21:08:29,784 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 685 transitions. [2022-12-14 21:08:29,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-12-14 21:08:29,785 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:29,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:29,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:29,822 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:08:29,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:29,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 556 states and 696 transitions. [2022-12-14 21:08:29,879 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 696 transitions. [2022-12-14 21:08:29,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-12-14 21:08:29,880 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:29,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:29,918 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 21:08:29,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:29,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 557 states and 697 transitions. [2022-12-14 21:08:29,942 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 697 transitions. [2022-12-14 21:08:29,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-12-14 21:08:29,943 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:29,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:29,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:30,013 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 21:08:30,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:30,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 587 states and 729 transitions. [2022-12-14 21:08:30,277 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 729 transitions. [2022-12-14 21:08:30,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-12-14 21:08:30,278 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:30,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:30,393 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 21:08:31,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:31,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 627 states and 772 transitions. [2022-12-14 21:08:31,056 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 772 transitions. [2022-12-14 21:08:31,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-12-14 21:08:31,057 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:31,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:31,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:31,131 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 21:08:31,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:31,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 632 states and 777 transitions. [2022-12-14 21:08:31,324 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 777 transitions. [2022-12-14 21:08:31,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-12-14 21:08:31,325 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:31,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:31,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:31,362 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 21:08:31,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:31,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 637 states and 783 transitions. [2022-12-14 21:08:31,522 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 783 transitions. [2022-12-14 21:08:31,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-12-14 21:08:31,523 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:31,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:31,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:31,644 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:08:31,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:31,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 642 states and 790 transitions. [2022-12-14 21:08:31,839 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 790 transitions. [2022-12-14 21:08:31,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-12-14 21:08:31,839 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:31,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:31,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:32,022 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:08:32,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:32,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 782 states and 939 transitions. [2022-12-14 21:08:32,912 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 939 transitions. [2022-12-14 21:08:32,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-12-14 21:08:32,913 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:32,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:32,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:32,983 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-12-14 21:08:33,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:33,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 783 states and 939 transitions. [2022-12-14 21:08:33,050 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 939 transitions. [2022-12-14 21:08:33,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-12-14 21:08:33,051 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:33,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:33,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:33,106 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:08:33,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:33,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 812 states and 971 transitions. [2022-12-14 21:08:33,220 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 971 transitions. [2022-12-14 21:08:33,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-12-14 21:08:33,221 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:33,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:33,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:33,271 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 21:08:33,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:33,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 824 states and 984 transitions. [2022-12-14 21:08:33,328 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 984 transitions. [2022-12-14 21:08:33,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-12-14 21:08:33,329 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:33,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:33,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:33,546 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:08:34,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:34,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 895 states and 1055 transitions. [2022-12-14 21:08:34,392 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1055 transitions. [2022-12-14 21:08:34,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-12-14 21:08:34,394 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:34,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:34,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:34,489 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 21:08:34,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:34,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 915 states and 1076 transitions. [2022-12-14 21:08:34,907 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1076 transitions. [2022-12-14 21:08:34,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-12-14 21:08:34,908 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:34,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:34,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:34,985 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 21:08:35,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:35,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 920 states and 1080 transitions. [2022-12-14 21:08:35,111 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1080 transitions. [2022-12-14 21:08:35,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-12-14 21:08:35,112 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:35,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:35,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:35,210 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 21:08:35,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:35,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 922 states and 1081 transitions. [2022-12-14 21:08:35,307 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1081 transitions. [2022-12-14 21:08:35,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-12-14 21:08:35,308 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:35,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:35,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:35,402 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-12-14 21:08:35,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:35,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 925 states and 1084 transitions. [2022-12-14 21:08:35,509 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1084 transitions. [2022-12-14 21:08:35,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-12-14 21:08:35,510 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:35,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:35,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:35,591 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 21:08:36,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:36,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 956 states and 1117 transitions. [2022-12-14 21:08:36,092 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1117 transitions. [2022-12-14 21:08:36,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-12-14 21:08:36,094 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:36,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:36,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:36,196 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 21:08:36,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:36,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 967 states and 1126 transitions. [2022-12-14 21:08:36,450 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1126 transitions. [2022-12-14 21:08:36,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-12-14 21:08:36,450 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:36,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:36,546 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-12-14 21:08:36,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:36,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 970 states and 1130 transitions. [2022-12-14 21:08:36,600 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1130 transitions. [2022-12-14 21:08:36,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-12-14 21:08:36,601 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:36,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:36,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:36,670 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-14 21:08:37,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:37,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1032 states and 1192 transitions. [2022-12-14 21:08:37,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1192 transitions. [2022-12-14 21:08:37,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-12-14 21:08:37,433 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:37,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:37,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:37,529 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-14 21:08:37,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:37,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1040 states and 1199 transitions. [2022-12-14 21:08:37,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1199 transitions. [2022-12-14 21:08:37,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-12-14 21:08:37,592 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:37,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:37,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:37,799 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 134 proven. 41 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 21:08:38,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:38,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1089 states and 1262 transitions. [2022-12-14 21:08:38,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1262 transitions. [2022-12-14 21:08:38,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-12-14 21:08:38,876 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:38,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:38,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:39,281 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 104 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:08:41,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:41,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1172 states and 1358 transitions. [2022-12-14 21:08:41,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1358 transitions. [2022-12-14 21:08:41,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-12-14 21:08:41,028 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:41,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:41,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:41,231 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 104 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 21:08:41,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:41,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1184 states and 1371 transitions. [2022-12-14 21:08:41,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1371 transitions. [2022-12-14 21:08:41,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-12-14 21:08:41,610 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:41,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:41,754 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-12-14 21:08:42,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:42,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1231 states and 1427 transitions. [2022-12-14 21:08:42,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1427 transitions. [2022-12-14 21:08:42,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-12-14 21:08:42,315 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:42,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:42,388 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-12-14 21:08:42,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:42,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1233 states and 1428 transitions. [2022-12-14 21:08:42,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1428 transitions. [2022-12-14 21:08:42,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-12-14 21:08:42,581 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:42,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:42,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:42,640 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-12-14 21:08:43,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:43,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1319 states and 1516 transitions. [2022-12-14 21:08:43,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1516 transitions. [2022-12-14 21:08:43,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-12-14 21:08:43,175 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:43,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:43,284 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-12-14 21:08:43,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:43,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1339 states and 1536 transitions. [2022-12-14 21:08:43,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 1536 transitions. [2022-12-14 21:08:43,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-12-14 21:08:43,468 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:43,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:44,206 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 117 proven. 89 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 21:08:46,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:46,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1382 states and 1596 transitions. [2022-12-14 21:08:46,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 1596 transitions. [2022-12-14 21:08:46,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-12-14 21:08:46,992 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:46,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:47,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:47,298 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 117 proven. 89 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 21:08:48,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:48,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1395 states and 1608 transitions. [2022-12-14 21:08:48,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 1608 transitions. [2022-12-14 21:08:48,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-12-14 21:08:48,289 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:48,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:48,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:48,603 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 117 proven. 89 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 21:08:49,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:49,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1411 states and 1622 transitions. [2022-12-14 21:08:49,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1622 transitions. [2022-12-14 21:08:49,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-12-14 21:08:49,136 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:49,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:49,416 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 117 proven. 89 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 21:08:49,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:49,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1420 states and 1630 transitions. [2022-12-14 21:08:49,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 1630 transitions. [2022-12-14 21:08:49,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-12-14 21:08:49,795 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:49,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:49,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:50,132 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 117 proven. 89 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 21:08:50,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:50,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1421 states and 1631 transitions. [2022-12-14 21:08:50,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 1631 transitions. [2022-12-14 21:08:50,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-12-14 21:08:50,417 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:50,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:50,548 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-12-14 21:08:50,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:50,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1632 states to 1423 states and 1632 transitions. [2022-12-14 21:08:50,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 1632 transitions. [2022-12-14 21:08:50,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-12-14 21:08:50,668 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:50,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:50,764 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-12-14 21:08:50,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:50,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1637 states to 1428 states and 1637 transitions. [2022-12-14 21:08:50,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1637 transitions. [2022-12-14 21:08:50,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-12-14 21:08:50,945 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:50,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:51,044 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-12-14 21:08:51,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:51,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1642 states to 1433 states and 1642 transitions. [2022-12-14 21:08:51,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 1642 transitions. [2022-12-14 21:08:51,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-12-14 21:08:51,411 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:51,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:51,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:51,470 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-12-14 21:08:51,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:51,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1643 states to 1435 states and 1643 transitions. [2022-12-14 21:08:51,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 1643 transitions. [2022-12-14 21:08:51,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-12-14 21:08:51,606 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:51,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:51,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:52,028 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 121 proven. 64 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-12-14 21:08:54,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:54,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1568 states and 1803 transitions. [2022-12-14 21:08:54,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 1803 transitions. [2022-12-14 21:08:54,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-12-14 21:08:54,178 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:54,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:54,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:54,285 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-14 21:08:54,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:54,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1570 states and 1804 transitions. [2022-12-14 21:08:54,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 1804 transitions. [2022-12-14 21:08:54,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-12-14 21:08:54,550 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:54,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:54,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:54,942 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 248 proven. 27 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-12-14 21:08:56,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:56,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1825 states to 1590 states and 1825 transitions. [2022-12-14 21:08:56,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 1825 transitions. [2022-12-14 21:08:56,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-12-14 21:08:56,469 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:56,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:56,702 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 248 proven. 27 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-12-14 21:08:57,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:57,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1836 states to 1601 states and 1836 transitions. [2022-12-14 21:08:57,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 1836 transitions. [2022-12-14 21:08:57,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2022-12-14 21:08:57,406 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:57,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:57,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 21:08:57,532 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-12-14 21:08:57,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 21:08:57,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1606 states and 1840 transitions. [2022-12-14 21:08:57,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1840 transitions. [2022-12-14 21:08:57,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2022-12-14 21:08:57,885 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 21:08:57,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 21:08:57,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 21:08:57,933 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 21:08:57,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 21:08:58,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 21:08:58,097 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 21:08:58,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 21:08:58,208 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 77 iterations. [2022-12-14 21:08:58,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 14.12 09:08:58 ImpRootNode [2022-12-14 21:08:58,391 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2022-12-14 21:08:58,392 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 21:08:58,392 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 21:08:58,392 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 21:08:58,392 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:08:20" (3/4) ... [2022-12-14 21:08:58,394 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 21:08:58,494 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_630ee861-b48b-4286-a744-e703a2b6c675/bin/ukojak-rkRKPMF4O4/witness.graphml [2022-12-14 21:08:58,494 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 21:08:58,495 INFO L158 Benchmark]: Toolchain (without parser) took 39286.42ms. Allocated memory was 159.4MB in the beginning and 704.6MB in the end (delta: 545.3MB). Free memory was 127.0MB in the beginning and 514.8MB in the end (delta: -387.8MB). Peak memory consumption was 160.4MB. Max. memory is 16.1GB. [2022-12-14 21:08:58,495 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 107.0MB. Free memory is still 62.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 21:08:58,495 INFO L158 Benchmark]: CACSL2BoogieTranslator took 400.84ms. Allocated memory is still 159.4MB. Free memory was 127.0MB in the beginning and 99.7MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-14 21:08:58,495 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.27ms. Allocated memory is still 159.4MB. Free memory was 99.7MB in the beginning and 94.1MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-12-14 21:08:58,496 INFO L158 Benchmark]: Boogie Preprocessor took 39.24ms. Allocated memory is still 159.4MB. Free memory was 94.1MB in the beginning and 89.3MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 21:08:58,496 INFO L158 Benchmark]: RCFGBuilder took 1009.26ms. Allocated memory is still 159.4MB. Free memory was 89.3MB in the beginning and 104.3MB in the end (delta: -15.0MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. [2022-12-14 21:08:58,496 INFO L158 Benchmark]: CodeCheck took 37670.30ms. Allocated memory was 159.4MB in the beginning and 704.6MB in the end (delta: 545.3MB). Free memory was 104.3MB in the beginning and 537.0MB in the end (delta: -432.7MB). Peak memory consumption was 112.5MB. Max. memory is 16.1GB. [2022-12-14 21:08:58,496 INFO L158 Benchmark]: Witness Printer took 102.47ms. Allocated memory is still 704.6MB. Free memory was 537.0MB in the beginning and 514.8MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-12-14 21:08:58,497 INFO L339 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: 37.5s, OverallIterations: 77, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 110740 SdHoareTripleChecker+Valid, 216.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 109687 mSDsluCounter, 16941 SdHoareTripleChecker+Invalid, 186.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14209 mSDsCounter, 33422 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 242718 IncrementalHoareTripleChecker+Invalid, 276140 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33422 mSolverCounterUnsat, 2732 mSDtfsCounter, 242718 mSolverCounterSat, 1.9s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 69041 GetRequests, 66752 SyntacticMatches, 1813 SemanticMatches, 476 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156136 ImplicationChecksByTransitivity, 20.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.4s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 10698 NumberOfCodeBlocks, 10698 NumberOfCodeBlocksAsserted, 77 NumberOfCheckSat, 10387 ConstructedInterpolants, 0 QuantifiedInterpolants, 36574 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 76 InterpolantComputations, 64 PerfectInterpolantSequences, 7080/7845 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: 432]: 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 [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, output=-1, u=21, v=22, w=23, x=24, y=25, z=26] [L593] COND TRUE 1 [L596] int input; [L597] input = __VERIFIER_nondet_int() [L598] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L601] CALL, EXPR calculate_output(input) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [\old(input)=3, a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L344] a17 = 0 [L345] a16 = 4 [L346] return 21; VAL [\old(input)=3, \result=21, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] 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 [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [\old(input)=4, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L279] a20 = 0 [L280] a17 = 1 [L281] a16 = 6 [L282] return 21; VAL [\old(input)=4, \result=21, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] 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 [\old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(input)=4, a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L73] a17 = 0 [L74] return 26; VAL [\old(input)=4, \result=26, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L601] RET, EXPR calculate_output(input) [L601] 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 [\old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [\old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [\old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [\old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [\old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [\old(input)=6, a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND TRUE (((((((!(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)) [L289] a20 = 1 [L290] a8 = 13 [L291] a16 = 4 [L292] a7 = 0 [L293] a21 = 1 [L294] a17 = 0 [L295] return -1; VAL [\old(input)=6, \result=-1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=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 [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L53] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L90] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L94] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L107] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L112] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L118] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L275] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L288] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L302] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L322] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L326] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L334] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L339] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L343] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L387] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, 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))) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L431] COND TRUE ((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L432] reach_error() VAL [\old(input)=1, a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 107.0MB. Free memory is still 62.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 400.84ms. Allocated memory is still 159.4MB. Free memory was 127.0MB in the beginning and 99.7MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.27ms. Allocated memory is still 159.4MB. Free memory was 99.7MB in the beginning and 94.1MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.24ms. Allocated memory is still 159.4MB. Free memory was 94.1MB in the beginning and 89.3MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1009.26ms. Allocated memory is still 159.4MB. Free memory was 89.3MB in the beginning and 104.3MB in the end (delta: -15.0MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. * CodeCheck took 37670.30ms. Allocated memory was 159.4MB in the beginning and 704.6MB in the end (delta: 545.3MB). Free memory was 104.3MB in the beginning and 537.0MB in the end (delta: -432.7MB). Peak memory consumption was 112.5MB. Max. memory is 16.1GB. * Witness Printer took 102.47ms. Allocated memory is still 704.6MB. Free memory was 537.0MB in the beginning and 514.8MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2022-12-14 21:08:58,515 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_630ee861-b48b-4286-a744-e703a2b6c675/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE