./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label32.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aef121e0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bf851d0-92f3-44fb-9726-a9e7697242e0/bin/ukojak-LBtLqBUTdQ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bf851d0-92f3-44fb-9726-a9e7697242e0/bin/ukojak-LBtLqBUTdQ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bf851d0-92f3-44fb-9726-a9e7697242e0/bin/ukojak-LBtLqBUTdQ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bf851d0-92f3-44fb-9726-a9e7697242e0/bin/ukojak-LBtLqBUTdQ/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label32.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bf851d0-92f3-44fb-9726-a9e7697242e0/bin/ukojak-LBtLqBUTdQ/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bf851d0-92f3-44fb-9726-a9e7697242e0/bin/ukojak-LBtLqBUTdQ --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 2b0b2a9797b90f95684a46496de9717e82eef5c31235380fd2859f2748d0f286 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-22 23:15:47,883 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 23:15:47,887 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 23:15:47,949 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 23:15:47,950 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 23:15:47,954 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 23:15:47,956 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 23:15:47,960 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 23:15:47,963 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 23:15:47,972 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 23:15:47,973 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 23:15:47,975 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 23:15:47,975 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 23:15:47,978 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 23:15:47,981 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 23:15:47,988 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 23:15:47,991 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 23:15:47,993 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 23:15:47,995 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 23:15:48,002 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 23:15:48,005 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 23:15:48,006 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 23:15:48,010 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 23:15:48,011 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 23:15:48,017 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 23:15:48,017 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 23:15:48,018 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 23:15:48,020 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 23:15:48,021 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 23:15:48,022 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 23:15:48,023 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 23:15:48,024 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 23:15:48,025 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 23:15:48,026 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 23:15:48,028 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 23:15:48,028 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 23:15:48,029 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 23:15:48,029 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 23:15:48,029 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 23:15:48,030 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 23:15:48,031 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 23:15:48,032 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bf851d0-92f3-44fb-9726-a9e7697242e0/bin/ukojak-LBtLqBUTdQ/config/svcomp-Reach-32bit-Kojak_Default.epf [2021-11-22 23:15:48,071 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 23:15:48,071 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 23:15:48,072 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-22 23:15:48,073 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2021-11-22 23:15:48,073 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 23:15:48,074 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 23:15:48,074 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 23:15:48,074 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-22 23:15:48,080 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-22 23:15:48,081 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-22 23:15:48,082 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 23:15:48,082 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-22 23:15:48,082 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-22 23:15:48,082 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-22 23:15:48,083 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-22 23:15:48,083 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-22 23:15:48,083 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 23:15:48,083 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-22 23:15:48,083 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2021-11-22 23:15:48,083 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2021-11-22 23:15:48,084 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 23:15:48,084 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-11-22 23:15:48,084 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 23:15:48,084 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-22 23:15:48,085 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-22 23:15:48,085 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2021-11-22 23:15:48,085 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-22 23:15:48,085 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-22 23:15:48,085 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_1bf851d0-92f3-44fb-9726-a9e7697242e0/bin/ukojak-LBtLqBUTdQ/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_1bf851d0-92f3-44fb-9726-a9e7697242e0/bin/ukojak-LBtLqBUTdQ 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 -> 2b0b2a9797b90f95684a46496de9717e82eef5c31235380fd2859f2748d0f286 [2021-11-22 23:15:48,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 23:15:48,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 23:15:48,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 23:15:48,413 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 23:15:48,414 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 23:15:48,416 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bf851d0-92f3-44fb-9726-a9e7697242e0/bin/ukojak-LBtLqBUTdQ/../../sv-benchmarks/c/eca-rers2012/Problem01_label32.c [2021-11-22 23:15:48,503 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bf851d0-92f3-44fb-9726-a9e7697242e0/bin/ukojak-LBtLqBUTdQ/data/e739af1ce/4b559d1a7626402f945165a8579d26ec/FLAGa4425f2f1 [2021-11-22 23:15:49,068 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 23:15:49,069 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bf851d0-92f3-44fb-9726-a9e7697242e0/sv-benchmarks/c/eca-rers2012/Problem01_label32.c [2021-11-22 23:15:49,083 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bf851d0-92f3-44fb-9726-a9e7697242e0/bin/ukojak-LBtLqBUTdQ/data/e739af1ce/4b559d1a7626402f945165a8579d26ec/FLAGa4425f2f1 [2021-11-22 23:15:49,324 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bf851d0-92f3-44fb-9726-a9e7697242e0/bin/ukojak-LBtLqBUTdQ/data/e739af1ce/4b559d1a7626402f945165a8579d26ec [2021-11-22 23:15:49,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 23:15:49,327 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 23:15:49,329 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 23:15:49,329 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 23:15:49,332 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 23:15:49,333 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:15:49" (1/1) ... [2021-11-22 23:15:49,334 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4918e463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:15:49, skipping insertion in model container [2021-11-22 23:15:49,334 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:15:49" (1/1) ... [2021-11-22 23:15:49,341 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 23:15:49,390 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 23:15:49,762 WARN L230 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_1bf851d0-92f3-44fb-9726-a9e7697242e0/sv-benchmarks/c/eca-rers2012/Problem01_label32.c[14752,14765] [2021-11-22 23:15:49,816 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 23:15:49,825 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 23:15:49,909 WARN L230 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_1bf851d0-92f3-44fb-9726-a9e7697242e0/sv-benchmarks/c/eca-rers2012/Problem01_label32.c[14752,14765] [2021-11-22 23:15:49,936 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 23:15:49,957 INFO L208 MainTranslator]: Completed translation [2021-11-22 23:15:49,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:15:49 WrapperNode [2021-11-22 23:15:49,958 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 23:15:49,959 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 23:15:49,959 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 23:15:49,961 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 23:15:49,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:15:49" (1/1) ... [2021-11-22 23:15:50,004 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:15:49" (1/1) ... [2021-11-22 23:15:50,069 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2021-11-22 23:15:50,070 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 23:15:50,071 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 23:15:50,071 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 23:15:50,071 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 23:15:50,080 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:15:49" (1/1) ... [2021-11-22 23:15:50,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:15:49" (1/1) ... [2021-11-22 23:15:50,085 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:15:49" (1/1) ... [2021-11-22 23:15:50,085 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:15:49" (1/1) ... [2021-11-22 23:15:50,117 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:15:49" (1/1) ... [2021-11-22 23:15:50,126 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:15:49" (1/1) ... [2021-11-22 23:15:50,140 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:15:49" (1/1) ... [2021-11-22 23:15:50,146 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 23:15:50,147 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 23:15:50,148 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 23:15:50,148 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 23:15:50,157 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:15:49" (1/1) ... [2021-11-22 23:15:50,165 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-11-22 23:15:50,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bf851d0-92f3-44fb-9726-a9e7697242e0/bin/ukojak-LBtLqBUTdQ/z3 [2021-11-22 23:15:50,199 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bf851d0-92f3-44fb-9726-a9e7697242e0/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2021-11-22 23:15:50,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bf851d0-92f3-44fb-9726-a9e7697242e0/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2021-11-22 23:15:50,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 23:15:50,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-22 23:15:50,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 23:15:50,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 23:15:50,360 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 23:15:50,362 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 23:15:51,421 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 23:15:51,666 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 23:15:51,666 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-22 23:15:51,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:15:51 BoogieIcfgContainer [2021-11-22 23:15:51,669 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 23:15:51,670 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2021-11-22 23:15:51,671 INFO L271 PluginConnector]: Initializing CodeCheck... [2021-11-22 23:15:51,682 INFO L275 PluginConnector]: CodeCheck initialized [2021-11-22 23:15:51,683 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:15:51" (1/1) ... [2021-11-22 23:15:51,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 23:15:51,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:15:51,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2021-11-22 23:15:51,795 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2021-11-22 23:15:51,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-22 23:15:51,802 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:15:51,803 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:15:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:15:52,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:15:52,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:15:52,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 145 states and 231 transitions. [2021-11-22 23:15:52,695 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 231 transitions. [2021-11-22 23:15:52,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-22 23:15:52,699 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:15:52,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:15:52,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:15:52,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:15:53,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:15:53,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 215 states and 304 transitions. [2021-11-22 23:15:53,467 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 304 transitions. [2021-11-22 23:15:53,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-22 23:15:53,470 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:15:53,470 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:15:53,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:15:53,546 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-22 23:15:53,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:15:53,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 216 states and 305 transitions. [2021-11-22 23:15:53,667 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 305 transitions. [2021-11-22 23:15:53,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-22 23:15:53,676 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:15:53,677 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:15:53,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:15:53,780 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:15:53,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:15:53,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 236 states and 328 transitions. [2021-11-22 23:15:53,951 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 328 transitions. [2021-11-22 23:15:53,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-11-22 23:15:53,955 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:15:53,956 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:15:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:15:54,044 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-22 23:15:54,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:15:54,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 237 states and 330 transitions. [2021-11-22 23:15:54,213 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 330 transitions. [2021-11-22 23:15:54,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-11-22 23:15:54,217 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:15:54,217 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:15:54,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:15:54,286 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-22 23:15:54,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:15:54,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 262 states and 361 transitions. [2021-11-22 23:15:54,651 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 361 transitions. [2021-11-22 23:15:54,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-11-22 23:15:54,652 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:15:54,653 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:15:54,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:15:54,744 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:15:55,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:15:55,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 288 states and 392 transitions. [2021-11-22 23:15:55,169 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 392 transitions. [2021-11-22 23:15:55,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-22 23:15:55,170 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:15:55,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:15:55,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:15:55,213 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-22 23:15:55,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:15:55,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 309 states and 416 transitions. [2021-11-22 23:15:55,630 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 416 transitions. [2021-11-22 23:15:55,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-22 23:15:55,631 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:15:55,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:15:55,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:15:55,754 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:15:56,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:15:56,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 334 states and 443 transitions. [2021-11-22 23:15:56,127 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 443 transitions. [2021-11-22 23:15:56,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-22 23:15:56,129 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:15:56,129 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:15:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:15:56,176 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-22 23:15:56,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:15:56,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 335 states and 445 transitions. [2021-11-22 23:15:56,304 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 445 transitions. [2021-11-22 23:15:56,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-11-22 23:15:56,307 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:15:56,307 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:15:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:15:56,371 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-22 23:15:56,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:15:56,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 338 states and 449 transitions. [2021-11-22 23:15:56,438 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 449 transitions. [2021-11-22 23:15:56,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-11-22 23:15:56,439 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:15:56,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:15:56,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:15:56,494 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-11-22 23:15:56,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:15:56,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 347 states and 463 transitions. [2021-11-22 23:15:56,808 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 463 transitions. [2021-11-22 23:15:56,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-11-22 23:15:56,809 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:15:56,810 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:15:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:15:56,858 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:15:56,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:15:56,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 353 states and 469 transitions. [2021-11-22 23:15:56,924 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 469 transitions. [2021-11-22 23:15:56,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-22 23:15:56,939 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:15:56,939 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:15:56,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:15:56,991 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-22 23:15:57,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:15:57,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 374 states and 492 transitions. [2021-11-22 23:15:57,376 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 492 transitions. [2021-11-22 23:15:57,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-11-22 23:15:57,385 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:15:57,385 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:15:57,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:15:57,427 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:15:57,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:15:57,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 392 states and 512 transitions. [2021-11-22 23:15:57,577 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 512 transitions. [2021-11-22 23:15:57,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-11-22 23:15:57,579 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:15:57,579 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:15:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:15:57,618 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:15:57,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:15:57,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 406 states and 528 transitions. [2021-11-22 23:15:57,697 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 528 transitions. [2021-11-22 23:15:57,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-11-22 23:15:57,699 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:15:57,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:15:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:15:57,767 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:15:57,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:15:57,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 412 states and 535 transitions. [2021-11-22 23:15:57,828 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 535 transitions. [2021-11-22 23:15:57,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-11-22 23:15:57,830 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:15:57,830 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:15:57,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:15:57,886 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:15:58,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:15:58,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 450 states and 577 transitions. [2021-11-22 23:15:58,419 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 577 transitions. [2021-11-22 23:15:58,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-11-22 23:15:58,424 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:15:58,425 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:15:58,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:15:58,476 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-22 23:15:58,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:15:58,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 462 states and 589 transitions. [2021-11-22 23:15:58,726 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 589 transitions. [2021-11-22 23:15:58,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-11-22 23:15:58,728 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:15:58,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:15:58,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:15:58,818 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:15:58,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:15:58,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 475 states and 604 transitions. [2021-11-22 23:15:58,947 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 604 transitions. [2021-11-22 23:15:58,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-11-22 23:15:58,950 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:15:58,950 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:15:58,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:15:59,006 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:15:59,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:15:59,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 481 states and 612 transitions. [2021-11-22 23:15:59,134 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 612 transitions. [2021-11-22 23:15:59,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-11-22 23:15:59,137 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:15:59,137 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:15:59,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:15:59,242 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-22 23:15:59,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:15:59,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 510 states and 644 transitions. [2021-11-22 23:15:59,732 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 644 transitions. [2021-11-22 23:15:59,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-11-22 23:15:59,734 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:15:59,735 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:15:59,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:15:59,806 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-22 23:16:00,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:00,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 520 states and 654 transitions. [2021-11-22 23:16:00,049 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 654 transitions. [2021-11-22 23:16:00,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-11-22 23:16:00,051 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:00,052 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:00,095 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-22 23:16:00,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:00,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 544 states and 679 transitions. [2021-11-22 23:16:00,230 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 679 transitions. [2021-11-22 23:16:00,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-11-22 23:16:00,233 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:00,233 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:00,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:00,316 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:16:00,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:00,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 566 states and 706 transitions. [2021-11-22 23:16:00,729 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 706 transitions. [2021-11-22 23:16:00,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-11-22 23:16:00,731 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:00,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:00,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:00,815 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-22 23:16:00,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:00,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 567 states and 708 transitions. [2021-11-22 23:16:00,973 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 708 transitions. [2021-11-22 23:16:00,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-11-22 23:16:00,975 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:00,975 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:01,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:01,096 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-22 23:16:02,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:02,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 666 states and 816 transitions. [2021-11-22 23:16:02,344 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 816 transitions. [2021-11-22 23:16:02,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-11-22 23:16:02,346 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:02,346 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:02,441 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-22 23:16:02,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:02,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 667 states and 817 transitions. [2021-11-22 23:16:02,702 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 817 transitions. [2021-11-22 23:16:02,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-11-22 23:16:02,705 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:02,705 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:02,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:02,778 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-11-22 23:16:02,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:02,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 668 states and 824 transitions. [2021-11-22 23:16:02,831 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 824 transitions. [2021-11-22 23:16:02,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-11-22 23:16:02,833 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:02,833 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:02,909 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-11-22 23:16:03,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:03,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 669 states and 824 transitions. [2021-11-22 23:16:03,040 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 824 transitions. [2021-11-22 23:16:03,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-11-22 23:16:03,042 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:03,042 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:03,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:03,111 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-22 23:16:03,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:03,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 686 states and 843 transitions. [2021-11-22 23:16:03,365 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 843 transitions. [2021-11-22 23:16:03,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-11-22 23:16:03,369 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:03,370 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:03,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:03,439 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-11-22 23:16:03,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:03,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 698 states and 856 transitions. [2021-11-22 23:16:03,692 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 856 transitions. [2021-11-22 23:16:03,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-11-22 23:16:03,694 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:03,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:03,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:03,750 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-11-22 23:16:03,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:03,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 712 states and 870 transitions. [2021-11-22 23:16:03,983 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 870 transitions. [2021-11-22 23:16:03,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-11-22 23:16:03,986 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:03,986 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:04,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:04,050 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-11-22 23:16:04,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:04,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 719 states and 879 transitions. [2021-11-22 23:16:04,109 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 879 transitions. [2021-11-22 23:16:04,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-11-22 23:16:04,112 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:04,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:04,163 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-22 23:16:04,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:04,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 740 states and 902 transitions. [2021-11-22 23:16:04,300 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 902 transitions. [2021-11-22 23:16:04,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-11-22 23:16:04,302 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:04,303 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:04,415 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-22 23:16:05,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:05,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 807 states and 987 transitions. [2021-11-22 23:16:05,287 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 987 transitions. [2021-11-22 23:16:05,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-11-22 23:16:05,290 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:05,290 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:05,352 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-22 23:16:06,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:06,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 835 states and 1017 transitions. [2021-11-22 23:16:06,027 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1017 transitions. [2021-11-22 23:16:06,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-11-22 23:16:06,029 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:06,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:06,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:06,088 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-11-22 23:16:06,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:06,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 837 states and 1018 transitions. [2021-11-22 23:16:06,218 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1018 transitions. [2021-11-22 23:16:06,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-11-22 23:16:06,221 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:06,221 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:06,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:06,603 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 90 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:16:07,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:07,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 921 states and 1112 transitions. [2021-11-22 23:16:07,995 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1112 transitions. [2021-11-22 23:16:07,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-11-22 23:16:07,997 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:07,999 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:08,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:08,048 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-22 23:16:09,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:09,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 989 states and 1192 transitions. [2021-11-22 23:16:09,151 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1192 transitions. [2021-11-22 23:16:09,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-11-22 23:16:09,154 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:09,154 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:09,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:09,235 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-22 23:16:09,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:09,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1012 states and 1215 transitions. [2021-11-22 23:16:09,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1215 transitions. [2021-11-22 23:16:09,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-11-22 23:16:09,406 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:09,407 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:09,485 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-22 23:16:10,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:10,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1039 states and 1243 transitions. [2021-11-22 23:16:10,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1243 transitions. [2021-11-22 23:16:10,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-11-22 23:16:10,054 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:10,055 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:10,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:10,110 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-22 23:16:10,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:10,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1060 states and 1272 transitions. [2021-11-22 23:16:10,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1272 transitions. [2021-11-22 23:16:10,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-11-22 23:16:10,262 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:10,263 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:10,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:10,321 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2021-11-22 23:16:11,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:11,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1113 states and 1326 transitions. [2021-11-22 23:16:11,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1326 transitions. [2021-11-22 23:16:11,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-11-22 23:16:11,006 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:11,006 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:11,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:11,063 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-22 23:16:11,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:11,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1119 states and 1337 transitions. [2021-11-22 23:16:11,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1337 transitions. [2021-11-22 23:16:11,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-11-22 23:16:11,571 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:11,571 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:11,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:11,631 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-22 23:16:11,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:11,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1121 states and 1338 transitions. [2021-11-22 23:16:11,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1338 transitions. [2021-11-22 23:16:11,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-11-22 23:16:11,856 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:11,856 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:11,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:11,918 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-22 23:16:12,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:12,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1146 states and 1363 transitions. [2021-11-22 23:16:12,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1363 transitions. [2021-11-22 23:16:12,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-11-22 23:16:12,224 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:12,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:12,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:12,276 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-22 23:16:12,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:12,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1148 states and 1368 transitions. [2021-11-22 23:16:12,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1368 transitions. [2021-11-22 23:16:12,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-11-22 23:16:12,537 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:12,538 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:12,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:12,590 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-22 23:16:13,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:13,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1213 states and 1436 transitions. [2021-11-22 23:16:13,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1436 transitions. [2021-11-22 23:16:13,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2021-11-22 23:16:13,347 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:13,347 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:13,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:13,475 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-22 23:16:14,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:14,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1241 states and 1466 transitions. [2021-11-22 23:16:14,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1466 transitions. [2021-11-22 23:16:14,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2021-11-22 23:16:14,355 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:14,355 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:14,406 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-22 23:16:15,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:15,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1306 states and 1532 transitions. [2021-11-22 23:16:15,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1532 transitions. [2021-11-22 23:16:15,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2021-11-22 23:16:15,209 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:15,209 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:15,523 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-22 23:16:16,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:16,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1312 states and 1538 transitions. [2021-11-22 23:16:16,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1538 transitions. [2021-11-22 23:16:16,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2021-11-22 23:16:16,350 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:16,350 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:16,482 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-22 23:16:16,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:16,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1377 states and 1603 transitions. [2021-11-22 23:16:16,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1603 transitions. [2021-11-22 23:16:16,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-11-22 23:16:16,973 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:16,973 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:16,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:17,109 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-11-22 23:16:17,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:17,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1398 states and 1636 transitions. [2021-11-22 23:16:17,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 1636 transitions. [2021-11-22 23:16:17,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-11-22 23:16:17,908 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:17,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:17,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:17,966 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-22 23:16:18,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:18,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1637 states to 1400 states and 1637 transitions. [2021-11-22 23:16:18,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 1637 transitions. [2021-11-22 23:16:18,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-11-22 23:16:18,105 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:18,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:18,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:18,226 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-22 23:16:18,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:18,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1402 states and 1639 transitions. [2021-11-22 23:16:18,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 1639 transitions. [2021-11-22 23:16:18,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-11-22 23:16:18,426 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:18,426 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:18,475 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-11-22 23:16:18,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:18,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1403 states and 1639 transitions. [2021-11-22 23:16:18,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states and 1639 transitions. [2021-11-22 23:16:18,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-11-22 23:16:18,699 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:18,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:18,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:18,857 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-11-22 23:16:19,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:19,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1643 states to 1406 states and 1643 transitions. [2021-11-22 23:16:19,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 1643 transitions. [2021-11-22 23:16:19,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-11-22 23:16:19,291 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:19,291 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:19,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:19,359 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-11-22 23:16:20,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:20,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1426 states and 1662 transitions. [2021-11-22 23:16:20,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 1662 transitions. [2021-11-22 23:16:20,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-11-22 23:16:20,174 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:20,174 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:20,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:20,226 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-11-22 23:16:20,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:20,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1427 states and 1667 transitions. [2021-11-22 23:16:20,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1667 transitions. [2021-11-22 23:16:20,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-11-22 23:16:20,463 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:20,463 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:20,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:20,528 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-11-22 23:16:21,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:21,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1497 states and 1739 transitions. [2021-11-22 23:16:21,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 1739 transitions. [2021-11-22 23:16:21,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-11-22 23:16:21,473 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:21,473 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:21,739 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 163 proven. 41 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-22 23:16:23,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:23,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1554 states and 1812 transitions. [2021-11-22 23:16:23,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 1812 transitions. [2021-11-22 23:16:23,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-11-22 23:16:23,162 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:23,163 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:23,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:23,221 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-11-22 23:16:23,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:23,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1616 states and 1874 transitions. [2021-11-22 23:16:23,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 1874 transitions. [2021-11-22 23:16:23,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2021-11-22 23:16:23,754 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:23,754 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:23,814 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-11-22 23:16:24,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:24,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1660 states and 1927 transitions. [2021-11-22 23:16:24,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 1927 transitions. [2021-11-22 23:16:24,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2021-11-22 23:16:24,985 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:24,986 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:25,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:25,044 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-11-22 23:16:25,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:25,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1668 states and 1934 transitions. [2021-11-22 23:16:25,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 1934 transitions. [2021-11-22 23:16:25,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2021-11-22 23:16:25,385 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:25,385 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:25,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:25,437 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-11-22 23:16:26,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:26,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1988 states to 1714 states and 1988 transitions. [2021-11-22 23:16:26,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 1988 transitions. [2021-11-22 23:16:26,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2021-11-22 23:16:26,282 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:26,282 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:26,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:26,340 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-22 23:16:27,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:27,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 1751 states and 2029 transitions. [2021-11-22 23:16:27,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2029 transitions. [2021-11-22 23:16:27,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2021-11-22 23:16:27,069 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:27,069 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:27,296 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 164 proven. 30 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-11-22 23:16:28,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:28,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2068 states to 1781 states and 2068 transitions. [2021-11-22 23:16:28,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 2068 transitions. [2021-11-22 23:16:28,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2021-11-22 23:16:28,394 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:28,394 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:28,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:28,452 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-11-22 23:16:28,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:28,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 1784 states and 2071 transitions. [2021-11-22 23:16:28,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2071 transitions. [2021-11-22 23:16:28,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2021-11-22 23:16:28,679 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:28,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:28,743 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-11-22 23:16:28,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:28,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2076 states to 1787 states and 2076 transitions. [2021-11-22 23:16:28,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1787 states and 2076 transitions. [2021-11-22 23:16:28,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2021-11-22 23:16:28,995 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:28,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:29,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:29,054 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2021-11-22 23:16:29,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:29,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2095 states to 1807 states and 2095 transitions. [2021-11-22 23:16:29,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1807 states and 2095 transitions. [2021-11-22 23:16:29,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2021-11-22 23:16:29,499 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:29,499 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:29,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:29,591 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2021-11-22 23:16:29,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:29,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2095 states to 1808 states and 2095 transitions. [2021-11-22 23:16:29,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2095 transitions. [2021-11-22 23:16:29,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2021-11-22 23:16:29,655 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:29,656 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:29,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:30,096 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 204 proven. 35 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-11-22 23:16:31,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:31,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2181 states to 1886 states and 2181 transitions. [2021-11-22 23:16:31,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 2181 transitions. [2021-11-22 23:16:31,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2021-11-22 23:16:31,766 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:31,766 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:31,872 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 204 proven. 35 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-11-22 23:16:32,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:32,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2210 states to 1914 states and 2210 transitions. [2021-11-22 23:16:32,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2210 transitions. [2021-11-22 23:16:32,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2021-11-22 23:16:32,392 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:32,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:33,004 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 168 proven. 46 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-22 23:16:34,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:34,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2237 states to 1933 states and 2237 transitions. [2021-11-22 23:16:34,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1933 states and 2237 transitions. [2021-11-22 23:16:34,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2021-11-22 23:16:34,735 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:34,735 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:34,801 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 215 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-11-22 23:16:35,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:35,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 1936 states and 2242 transitions. [2021-11-22 23:16:35,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 2242 transitions. [2021-11-22 23:16:35,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2021-11-22 23:16:35,095 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:35,095 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:35,742 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 146 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:16:38,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:38,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 2027 states and 2359 transitions. [2021-11-22 23:16:38,298 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 2359 transitions. [2021-11-22 23:16:38,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2021-11-22 23:16:38,301 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:38,301 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:38,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:38,787 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2021-11-22 23:16:40,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:40,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2388 states to 2048 states and 2388 transitions. [2021-11-22 23:16:40,927 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 2388 transitions. [2021-11-22 23:16:40,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2021-11-22 23:16:40,931 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:40,931 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:40,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:41,025 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-11-22 23:16:41,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:41,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2394 states to 2049 states and 2394 transitions. [2021-11-22 23:16:41,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2049 states and 2394 transitions. [2021-11-22 23:16:41,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2021-11-22 23:16:41,439 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:41,439 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:41,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:41,494 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-22 23:16:42,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:42,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2414 states to 2068 states and 2414 transitions. [2021-11-22 23:16:42,292 INFO L276 IsEmpty]: Start isEmpty. Operand 2068 states and 2414 transitions. [2021-11-22 23:16:42,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2021-11-22 23:16:42,294 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:42,294 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:42,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:42,336 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-22 23:16:42,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:42,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2432 states to 2086 states and 2432 transitions. [2021-11-22 23:16:42,721 INFO L276 IsEmpty]: Start isEmpty. Operand 2086 states and 2432 transitions. [2021-11-22 23:16:42,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2021-11-22 23:16:42,723 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:42,724 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:42,881 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2021-11-22 23:16:43,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:43,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2433 states to 2088 states and 2433 transitions. [2021-11-22 23:16:43,154 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 2433 transitions. [2021-11-22 23:16:43,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2021-11-22 23:16:43,157 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:43,157 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:43,240 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2021-11-22 23:16:43,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:43,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2090 states and 2434 transitions. [2021-11-22 23:16:43,526 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 2434 transitions. [2021-11-22 23:16:43,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2021-11-22 23:16:43,529 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:43,529 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:43,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:44,163 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 198 proven. 111 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-22 23:16:47,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:47,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2519 states to 2162 states and 2519 transitions. [2021-11-22 23:16:47,424 INFO L276 IsEmpty]: Start isEmpty. Operand 2162 states and 2519 transitions. [2021-11-22 23:16:47,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2021-11-22 23:16:47,425 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:47,426 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:47,537 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 198 proven. 111 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-22 23:16:48,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:48,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2176 states and 2534 transitions. [2021-11-22 23:16:48,125 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 2534 transitions. [2021-11-22 23:16:48,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2021-11-22 23:16:48,128 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:48,128 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:48,198 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2021-11-22 23:16:48,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:48,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2177 states and 2536 transitions. [2021-11-22 23:16:48,645 INFO L276 IsEmpty]: Start isEmpty. Operand 2177 states and 2536 transitions. [2021-11-22 23:16:48,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2021-11-22 23:16:48,646 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:48,646 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:48,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:48,718 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2021-11-22 23:16:50,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:50,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2606 states to 2245 states and 2606 transitions. [2021-11-22 23:16:50,065 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 2606 transitions. [2021-11-22 23:16:50,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2021-11-22 23:16:50,068 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:50,068 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:50,146 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2021-11-22 23:16:50,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:50,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2613 states to 2253 states and 2613 transitions. [2021-11-22 23:16:50,449 INFO L276 IsEmpty]: Start isEmpty. Operand 2253 states and 2613 transitions. [2021-11-22 23:16:50,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2021-11-22 23:16:50,452 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:50,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:50,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:50,521 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2021-11-22 23:16:50,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:51,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2613 states to 2254 states and 2613 transitions. [2021-11-22 23:16:51,001 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 2613 transitions. [2021-11-22 23:16:51,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2021-11-22 23:16:51,003 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:51,003 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:51,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:51,133 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 170 proven. 139 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:16:52,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:52,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2669 states to 2298 states and 2669 transitions. [2021-11-22 23:16:52,728 INFO L276 IsEmpty]: Start isEmpty. Operand 2298 states and 2669 transitions. [2021-11-22 23:16:52,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2021-11-22 23:16:52,731 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:52,731 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:52,861 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 170 proven. 139 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:16:53,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:53,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2703 states to 2332 states and 2703 transitions. [2021-11-22 23:16:53,458 INFO L276 IsEmpty]: Start isEmpty. Operand 2332 states and 2703 transitions. [2021-11-22 23:16:53,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2021-11-22 23:16:53,461 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:53,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:53,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:53,595 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 170 proven. 139 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 23:16:54,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:54,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2340 states and 2710 transitions. [2021-11-22 23:16:54,158 INFO L276 IsEmpty]: Start isEmpty. Operand 2340 states and 2710 transitions. [2021-11-22 23:16:54,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2021-11-22 23:16:54,160 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:54,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:54,221 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2021-11-22 23:16:54,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:54,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2721 states to 2347 states and 2721 transitions. [2021-11-22 23:16:54,842 INFO L276 IsEmpty]: Start isEmpty. Operand 2347 states and 2721 transitions. [2021-11-22 23:16:54,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2021-11-22 23:16:54,846 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:54,846 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:54,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:54,925 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2021-11-22 23:16:55,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:55,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2724 states to 2351 states and 2724 transitions. [2021-11-22 23:16:55,141 INFO L276 IsEmpty]: Start isEmpty. Operand 2351 states and 2724 transitions. [2021-11-22 23:16:55,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2021-11-22 23:16:55,143 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:55,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:55,197 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2021-11-22 23:16:55,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:55,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2727 states to 2355 states and 2727 transitions. [2021-11-22 23:16:55,418 INFO L276 IsEmpty]: Start isEmpty. Operand 2355 states and 2727 transitions. [2021-11-22 23:16:55,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2021-11-22 23:16:55,420 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:55,421 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:55,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:55,621 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 176 proven. 92 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-11-22 23:16:56,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:56,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2731 states to 2356 states and 2731 transitions. [2021-11-22 23:16:56,179 INFO L276 IsEmpty]: Start isEmpty. Operand 2356 states and 2731 transitions. [2021-11-22 23:16:56,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2021-11-22 23:16:56,182 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:56,182 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 23:16:56,531 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 188 proven. 112 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-11-22 23:16:58,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-11-22 23:16:58,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2862 states to 2478 states and 2862 transitions. [2021-11-22 23:16:58,400 INFO L276 IsEmpty]: Start isEmpty. Operand 2478 states and 2862 transitions. [2021-11-22 23:16:58,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2021-11-22 23:16:58,404 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2021-11-22 23:16:58,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 23:16:58,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 23:16:58,451 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-22 23:16:58,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 23:16:58,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 23:16:58,726 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-22 23:16:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 23:16:58,954 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 98 iterations. [2021-11-22 23:16:59,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 22.11 11:16:59 ImpRootNode [2021-11-22 23:16:59,308 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2021-11-22 23:16:59,309 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-22 23:16:59,309 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-22 23:16:59,309 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-22 23:16:59,310 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:15:51" (3/4) ... [2021-11-22 23:16:59,312 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-22 23:16:59,576 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bf851d0-92f3-44fb-9726-a9e7697242e0/bin/ukojak-LBtLqBUTdQ/witness.graphml [2021-11-22 23:16:59,576 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-22 23:16:59,577 INFO L158 Benchmark]: Toolchain (without parser) took 70249.63ms. Allocated memory was 81.8MB in the beginning and 736.1MB in the end (delta: 654.3MB). Free memory was 46.0MB in the beginning and 310.4MB in the end (delta: -264.3MB). Peak memory consumption was 389.4MB. Max. memory is 16.1GB. [2021-11-22 23:16:59,577 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 81.8MB. Free memory was 54.4MB in the beginning and 54.3MB in the end (delta: 30.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-22 23:16:59,578 INFO L158 Benchmark]: CACSL2BoogieTranslator took 629.49ms. Allocated memory was 81.8MB in the beginning and 100.7MB in the end (delta: 18.9MB). Free memory was 45.9MB in the beginning and 60.2MB in the end (delta: -14.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-22 23:16:59,578 INFO L158 Benchmark]: Boogie Procedure Inliner took 110.83ms. Allocated memory is still 100.7MB. Free memory was 60.2MB in the beginning and 54.4MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-22 23:16:59,579 INFO L158 Benchmark]: Boogie Preprocessor took 76.08ms. Allocated memory is still 100.7MB. Free memory was 54.4MB in the beginning and 50.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-22 23:16:59,579 INFO L158 Benchmark]: RCFGBuilder took 1521.85ms. Allocated memory is still 100.7MB. Free memory was 50.2MB in the beginning and 50.7MB in the end (delta: -460.6kB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. [2021-11-22 23:16:59,579 INFO L158 Benchmark]: CodeCheck took 67637.97ms. Allocated memory was 100.7MB in the beginning and 736.1MB in the end (delta: 635.4MB). Free memory was 50.7MB in the beginning and 342.9MB in the end (delta: -292.2MB). Peak memory consumption was 342.9MB. Max. memory is 16.1GB. [2021-11-22 23:16:59,580 INFO L158 Benchmark]: Witness Printer took 267.60ms. Allocated memory is still 736.1MB. Free memory was 342.9MB in the beginning and 310.4MB in the end (delta: 32.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2021-11-22 23:16:59,582 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: 67.2s, OverallIterations: 98, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 239018 SdHoareTripleChecker+Valid, 545.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 238249 mSDsluCounter, 37332 SdHoareTripleChecker+Invalid, 450.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32725 mSDsCounter, 59826 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 517084 IncrementalHoareTripleChecker+Invalid, 576910 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59826 mSolverCounterUnsat, 4607 mSDtfsCounter, 517084 mSolverCounterSat, 4.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 110597 GetRequests, 106723 SyntacticMatches, 3156 SemanticMatches, 718 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313186 ImplicationChecksByTransitivity, 44.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.8s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 16575 NumberOfCodeBlocks, 16575 NumberOfCodeBlocksAsserted, 98 NumberOfCheckSat, 16235 ConstructedInterpolants, 0 QuantifiedInterpolants, 56201 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 97 InterpolantComputations, 83 PerfectInterpolantSequences, 14322/15463 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: 408]: 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)=1, 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=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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, 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=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, input=1, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L83] a7 = 1 [L84] a17 = 1 [L85] a21 = 0 [L86] a20 = 1 [L87] a8 = 13 [L88] a16 = 5 [L89] return 26; VAL [\old(input)=1, \result=26, a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, 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] [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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, 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 TRUE ((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1))) [L159] a16 = 4 [L160] a17 = 0 [L161] return 25; VAL [\old(input)=4, \result=25, a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, 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=4, a17=0, a20=1, a21=0, a7=1, 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] [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=4, a17=0, a20=1, a21=0, a7=1, 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] [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=4, a17=0, a20=1, a21=0, a7=1, 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] [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=4, a17=0, a20=1, a21=0, a7=1, 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] [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=4, a17=0, a20=1, a21=0, a7=1, 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] [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=4, a17=0, a20=1, a21=0, a7=1, 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] [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=4, a17=0, a20=1, a21=0, a7=1, 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] [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=4, a17=0, a20=1, a21=0, a7=1, 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] [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=4, a17=0, a20=1, a21=0, a7=1, 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] [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=4, a17=0, a20=1, a21=0, a7=1, 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] [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=4, a17=0, a20=1, a21=0, a7=1, 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] [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=4, a17=0, a20=1, a21=0, a7=1, 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] [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=4, a17=0, a20=1, a21=0, a7=1, 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] [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=4, a17=0, a20=1, a21=0, a7=1, 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] [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=4, a17=0, a20=1, a21=0, a7=1, 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] [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=4, a17=0, a20=1, a21=0, a7=1, 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] [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=4, a17=0, a20=1, a21=0, a7=1, 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] [L139] COND TRUE (((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1)) [L140] a8 = 15 [L141] a17 = 0 [L142] a21 = 1 [L143] a20 = 0 [L144] a16 = 4 [L145] return -1; VAL [\old(input)=6, \result=-1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, 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] [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)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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=4, a17=0, a20=0, a21=1, a7=1, 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 FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [\old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, 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] [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)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, 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] [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)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, 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] [L363] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [\old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, 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] [L365] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [\old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, 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] [L371] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [\old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, 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] [L373] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [\old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, 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] [L375] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [\old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, 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] [L382] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [\old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, 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] [L387] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [\old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, 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] [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))) VAL [\old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, 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] [L407] COND TRUE ((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [\old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, 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] [L408] reach_error() VAL [\old(input)=3, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, 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] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 81.8MB. Free memory was 54.4MB in the beginning and 54.3MB in the end (delta: 30.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 629.49ms. Allocated memory was 81.8MB in the beginning and 100.7MB in the end (delta: 18.9MB). Free memory was 45.9MB in the beginning and 60.2MB in the end (delta: -14.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 110.83ms. Allocated memory is still 100.7MB. Free memory was 60.2MB in the beginning and 54.4MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.08ms. Allocated memory is still 100.7MB. Free memory was 54.4MB in the beginning and 50.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1521.85ms. Allocated memory is still 100.7MB. Free memory was 50.2MB in the beginning and 50.7MB in the end (delta: -460.6kB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. * CodeCheck took 67637.97ms. Allocated memory was 100.7MB in the beginning and 736.1MB in the end (delta: 635.4MB). Free memory was 50.7MB in the beginning and 342.9MB in the end (delta: -292.2MB). Peak memory consumption was 342.9MB. Max. memory is 16.1GB. * Witness Printer took 267.60ms. Allocated memory is still 736.1MB. Free memory was 342.9MB in the beginning and 310.4MB in the end (delta: 32.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2021-11-22 23:16:59,642 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bf851d0-92f3-44fb-9726-a9e7697242e0/bin/ukojak-LBtLqBUTdQ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE