./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc1e789-60ca-45ae-a2ee-0665175b043e/bin/ukojak-rkRKPMF4O4/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc1e789-60ca-45ae-a2ee-0665175b043e/bin/ukojak-rkRKPMF4O4/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc1e789-60ca-45ae-a2ee-0665175b043e/bin/ukojak-rkRKPMF4O4/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc1e789-60ca-45ae-a2ee-0665175b043e/bin/ukojak-rkRKPMF4O4/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label20.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc1e789-60ca-45ae-a2ee-0665175b043e/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc1e789-60ca-45ae-a2ee-0665175b043e/bin/ukojak-rkRKPMF4O4 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6d0713a1238e02d0284b255e77b84c086e26fd99d5533d6977fb0509f2ece092 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 20:29:46,972 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 20:29:46,974 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 20:29:47,012 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 20:29:47,012 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 20:29:47,013 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 20:29:47,014 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 20:29:47,015 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 20:29:47,016 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 20:29:47,016 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 20:29:47,017 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 20:29:47,028 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 20:29:47,028 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 20:29:47,030 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 20:29:47,032 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 20:29:47,033 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 20:29:47,035 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 20:29:47,036 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 20:29:47,039 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 20:29:47,042 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 20:29:47,044 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 20:29:47,045 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 20:29:47,046 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 20:29:47,046 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 20:29:47,052 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 20:29:47,053 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 20:29:47,053 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 20:29:47,054 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 20:29:47,055 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 20:29:47,056 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 20:29:47,057 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 20:29:47,058 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 20:29:47,059 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 20:29:47,060 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 20:29:47,061 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 20:29:47,061 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 20:29:47,062 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 20:29:47,062 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 20:29:47,062 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 20:29:47,063 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 20:29:47,064 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 20:29:47,064 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc1e789-60ca-45ae-a2ee-0665175b043e/bin/ukojak-rkRKPMF4O4/config/svcomp-Reach-32bit-Kojak_Default.epf [2022-12-14 20:29:47,078 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 20:29:47,078 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 20:29:47,078 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 20:29:47,079 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2022-12-14 20:29:47,079 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 20:29:47,079 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 20:29:47,079 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 20:29:47,079 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 20:29:47,079 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 20:29:47,079 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 20:29:47,080 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 20:29:47,080 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 20:29:47,080 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 20:29:47,080 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 20:29:47,080 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 20:29:47,080 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 20:29:47,080 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 20:29:47,080 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 20:29:47,080 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2022-12-14 20:29:47,080 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2022-12-14 20:29:47,080 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 20:29:47,081 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 20:29:47,081 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 20:29:47,081 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 20:29:47,081 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 20:29:47,081 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2022-12-14 20:29:47,081 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 20:29:47,081 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 20:29:47,081 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_3fc1e789-60ca-45ae-a2ee-0665175b043e/bin/ukojak-rkRKPMF4O4/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc1e789-60ca-45ae-a2ee-0665175b043e/bin/ukojak-rkRKPMF4O4 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6d0713a1238e02d0284b255e77b84c086e26fd99d5533d6977fb0509f2ece092 [2022-12-14 20:29:47,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 20:29:47,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 20:29:47,282 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 20:29:47,283 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 20:29:47,283 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 20:29:47,284 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc1e789-60ca-45ae-a2ee-0665175b043e/bin/ukojak-rkRKPMF4O4/../../sv-benchmarks/c/eca-rers2012/Problem01_label20.c [2022-12-14 20:29:49,824 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 20:29:50,035 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 20:29:50,036 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc1e789-60ca-45ae-a2ee-0665175b043e/sv-benchmarks/c/eca-rers2012/Problem01_label20.c [2022-12-14 20:29:50,046 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc1e789-60ca-45ae-a2ee-0665175b043e/bin/ukojak-rkRKPMF4O4/data/c36e4eff7/a35ef385950b40fb83ac2cbd8a96af78/FLAG0c87e39a6 [2022-12-14 20:29:50,407 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc1e789-60ca-45ae-a2ee-0665175b043e/bin/ukojak-rkRKPMF4O4/data/c36e4eff7/a35ef385950b40fb83ac2cbd8a96af78 [2022-12-14 20:29:50,413 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 20:29:50,415 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 20:29:50,417 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 20:29:50,418 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 20:29:50,422 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 20:29:50,423 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 08:29:50" (1/1) ... [2022-12-14 20:29:50,424 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fa5caeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:29:50, skipping insertion in model container [2022-12-14 20:29:50,424 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 08:29:50" (1/1) ... [2022-12-14 20:29:50,432 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 20:29:50,473 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 20:29:50,708 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc1e789-60ca-45ae-a2ee-0665175b043e/sv-benchmarks/c/eca-rers2012/Problem01_label20.c[14503,14516] [2022-12-14 20:29:50,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 20:29:50,751 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 20:29:50,825 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc1e789-60ca-45ae-a2ee-0665175b043e/sv-benchmarks/c/eca-rers2012/Problem01_label20.c[14503,14516] [2022-12-14 20:29:50,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 20:29:50,852 INFO L208 MainTranslator]: Completed translation [2022-12-14 20:29:50,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:29:50 WrapperNode [2022-12-14 20:29:50,852 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 20:29:50,853 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 20:29:50,853 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 20:29:50,854 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 20:29:50,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:29:50" (1/1) ... [2022-12-14 20:29:50,875 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:29:50" (1/1) ... [2022-12-14 20:29:50,913 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2022-12-14 20:29:50,913 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 20:29:50,914 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 20:29:50,914 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 20:29:50,914 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 20:29:50,921 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:29:50" (1/1) ... [2022-12-14 20:29:50,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:29:50" (1/1) ... [2022-12-14 20:29:50,924 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:29:50" (1/1) ... [2022-12-14 20:29:50,924 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:29:50" (1/1) ... [2022-12-14 20:29:50,936 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:29:50" (1/1) ... [2022-12-14 20:29:50,940 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:29:50" (1/1) ... [2022-12-14 20:29:50,944 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:29:50" (1/1) ... [2022-12-14 20:29:50,947 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:29:50" (1/1) ... [2022-12-14 20:29:50,951 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 20:29:50,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 20:29:50,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 20:29:50,952 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 20:29:50,952 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 08:29:50" (1/1) ... [2022-12-14 20:29:50,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2022-12-14 20:29:50,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc1e789-60ca-45ae-a2ee-0665175b043e/bin/ukojak-rkRKPMF4O4/z3 [2022-12-14 20:29:50,977 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc1e789-60ca-45ae-a2ee-0665175b043e/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2022-12-14 20:29:50,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc1e789-60ca-45ae-a2ee-0665175b043e/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2022-12-14 20:29:51,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 20:29:51,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 20:29:51,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 20:29:51,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 20:29:51,074 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 20:29:51,076 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 20:29:51,816 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 20:29:51,973 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 20:29:51,973 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 20:29:51,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 08:29:51 BoogieIcfgContainer [2022-12-14 20:29:51,975 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 20:29:51,976 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2022-12-14 20:29:51,976 INFO L271 PluginConnector]: Initializing CodeCheck... [2022-12-14 20:29:52,002 INFO L275 PluginConnector]: CodeCheck initialized [2022-12-14 20:29:52,003 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 08:29:51" (1/1) ... [2022-12-14 20:29:52,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 20:29:52,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:29:52,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2022-12-14 20:29:52,059 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2022-12-14 20:29:52,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-12-14 20:29:52,061 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:29:52,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:29:52,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:29:52,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:29:52,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:29:52,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 145 states and 261 transitions. [2022-12-14 20:29:52,654 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 261 transitions. [2022-12-14 20:29:52,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-14 20:29:52,655 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:29:52,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:29:52,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:29:52,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:29:53,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:29:53,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 215 states and 339 transitions. [2022-12-14 20:29:53,247 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 339 transitions. [2022-12-14 20:29:53,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-12-14 20:29:53,250 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:29:53,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:29:53,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:29:53,325 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:29:53,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:29:53,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 220 states and 346 transitions. [2022-12-14 20:29:53,377 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 346 transitions. [2022-12-14 20:29:53,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-12-14 20:29:53,379 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:29:53,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:29:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:29:53,469 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 20:29:53,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:29:53,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 291 states and 425 transitions. [2022-12-14 20:29:53,825 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 425 transitions. [2022-12-14 20:29:53,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-12-14 20:29:53,828 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:29:53,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:29:53,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:29:53,944 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:29:54,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:29:54,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 307 states and 444 transitions. [2022-12-14 20:29:54,148 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 444 transitions. [2022-12-14 20:29:54,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-12-14 20:29:54,150 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:29:54,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:29:54,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:29:54,259 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 20:29:54,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:29:54,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 317 states and 457 transitions. [2022-12-14 20:29:54,422 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 457 transitions. [2022-12-14 20:29:54,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-12-14 20:29:54,424 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:29:54,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:29:54,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:29:54,525 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 20:29:54,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:29:54,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 338 states and 481 transitions. [2022-12-14 20:29:54,801 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 481 transitions. [2022-12-14 20:29:54,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-12-14 20:29:54,801 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:29:54,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:29:54,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:29:54,912 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 20:29:55,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:29:55,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 349 states and 496 transitions. [2022-12-14 20:29:55,181 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 496 transitions. [2022-12-14 20:29:55,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-12-14 20:29:55,183 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:29:55,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:29:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:29:55,301 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 20:29:55,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:29:55,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 359 states and 508 transitions. [2022-12-14 20:29:55,478 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 508 transitions. [2022-12-14 20:29:55,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-12-14 20:29:55,478 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:29:55,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:29:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:29:55,546 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 20:29:55,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:29:55,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 365 states and 514 transitions. [2022-12-14 20:29:55,660 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 514 transitions. [2022-12-14 20:29:55,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-12-14 20:29:55,661 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:29:55,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:29:55,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:29:55,712 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 20:29:55,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:29:55,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 371 states and 520 transitions. [2022-12-14 20:29:55,758 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 520 transitions. [2022-12-14 20:29:55,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-12-14 20:29:55,759 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:29:55,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:29:55,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:29:55,844 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-12-14 20:29:56,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:29:56,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 379 states and 533 transitions. [2022-12-14 20:29:56,058 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 533 transitions. [2022-12-14 20:29:56,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-12-14 20:29:56,059 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:29:56,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:29:56,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:29:56,126 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-12-14 20:29:56,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:29:56,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 386 states and 544 transitions. [2022-12-14 20:29:56,357 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 544 transitions. [2022-12-14 20:29:56,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-12-14 20:29:56,358 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:29:56,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:29:56,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:29:56,437 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-12-14 20:29:56,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:29:56,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 394 states and 555 transitions. [2022-12-14 20:29:56,547 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 555 transitions. [2022-12-14 20:29:56,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-12-14 20:29:56,547 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:29:56,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:29:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:29:56,611 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-12-14 20:29:56,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:29:56,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 396 states and 557 transitions. [2022-12-14 20:29:56,639 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 557 transitions. [2022-12-14 20:29:56,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-12-14 20:29:56,640 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:29:56,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:29:56,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:29:56,737 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-12-14 20:29:56,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:29:56,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 404 states and 567 transitions. [2022-12-14 20:29:56,972 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 567 transitions. [2022-12-14 20:29:56,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-12-14 20:29:56,974 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:29:56,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:29:56,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:29:57,052 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-12-14 20:29:57,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:29:57,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 406 states and 569 transitions. [2022-12-14 20:29:57,085 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 569 transitions. [2022-12-14 20:29:57,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-12-14 20:29:57,086 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:29:57,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:29:57,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:29:57,187 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-12-14 20:29:57,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:29:57,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 408 states and 571 transitions. [2022-12-14 20:29:57,226 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 571 transitions. [2022-12-14 20:29:57,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-12-14 20:29:57,227 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:29:57,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:29:57,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:29:57,314 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 20:29:57,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:29:57,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 413 states and 577 transitions. [2022-12-14 20:29:57,564 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 577 transitions. [2022-12-14 20:29:57,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-12-14 20:29:57,565 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:29:57,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:29:57,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:29:57,647 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 20:29:57,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:29:57,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 423 states and 588 transitions. [2022-12-14 20:29:57,774 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 588 transitions. [2022-12-14 20:29:57,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-12-14 20:29:57,775 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:29:57,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:29:57,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:29:57,860 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 20:29:58,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:29:58,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 440 states and 607 transitions. [2022-12-14 20:29:58,043 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 607 transitions. [2022-12-14 20:29:58,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-12-14 20:29:58,044 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:29:58,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:29:58,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:29:58,106 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 20:29:58,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:29:58,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 454 states and 621 transitions. [2022-12-14 20:29:58,189 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 621 transitions. [2022-12-14 20:29:58,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-12-14 20:29:58,190 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:29:58,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:29:58,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:29:58,256 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-14 20:29:58,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:29:58,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 472 states and 642 transitions. [2022-12-14 20:29:58,685 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 642 transitions. [2022-12-14 20:29:58,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-12-14 20:29:58,686 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:29:58,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:29:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:29:58,764 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-14 20:29:58,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:29:58,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 478 states and 648 transitions. [2022-12-14 20:29:58,850 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 648 transitions. [2022-12-14 20:29:58,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-12-14 20:29:58,851 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:29:58,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:29:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:29:58,912 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-14 20:29:59,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:29:59,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 507 states and 681 transitions. [2022-12-14 20:29:59,277 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 681 transitions. [2022-12-14 20:29:59,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-12-14 20:29:59,278 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:29:59,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:29:59,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:29:59,344 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:29:59,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:29:59,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 536 states and 711 transitions. [2022-12-14 20:29:59,492 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 711 transitions. [2022-12-14 20:29:59,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-12-14 20:29:59,493 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:29:59,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:29:59,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:29:59,557 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 20:30:00,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:00,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 584 states and 763 transitions. [2022-12-14 20:30:00,055 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 763 transitions. [2022-12-14 20:30:00,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-12-14 20:30:00,056 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:00,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:30:00,134 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-12-14 20:30:00,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:00,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 598 states and 777 transitions. [2022-12-14 20:30:00,244 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 777 transitions. [2022-12-14 20:30:00,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-12-14 20:30:00,245 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:00,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:30:00,410 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-12-14 20:30:00,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:00,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 627 states and 810 transitions. [2022-12-14 20:30:00,968 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 810 transitions. [2022-12-14 20:30:00,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-12-14 20:30:00,969 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:00,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:00,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:30:01,105 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-12-14 20:30:01,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:01,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 655 states and 839 transitions. [2022-12-14 20:30:01,512 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 839 transitions. [2022-12-14 20:30:01,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-12-14 20:30:01,512 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:01,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:30:01,582 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:30:01,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:01,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 694 states and 882 transitions. [2022-12-14 20:30:01,768 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 882 transitions. [2022-12-14 20:30:01,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-12-14 20:30:01,768 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:01,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:01,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:30:01,928 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:30:02,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:02,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 764 states and 960 transitions. [2022-12-14 20:30:02,536 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 960 transitions. [2022-12-14 20:30:02,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-12-14 20:30:02,537 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:02,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:30:02,610 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 20:30:02,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:02,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 803 states and 1003 transitions. [2022-12-14 20:30:02,821 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1003 transitions. [2022-12-14 20:30:02,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-12-14 20:30:02,822 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:02,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:02,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:30:02,897 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 20:30:03,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:03,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 842 states and 1042 transitions. [2022-12-14 20:30:03,387 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1042 transitions. [2022-12-14 20:30:03,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-12-14 20:30:03,387 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:03,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:03,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:30:03,446 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-12-14 20:30:03,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:03,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 843 states and 1042 transitions. [2022-12-14 20:30:03,623 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1042 transitions. [2022-12-14 20:30:03,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-12-14 20:30:03,624 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:03,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:30:03,719 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:30:04,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:04,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 871 states and 1072 transitions. [2022-12-14 20:30:04,138 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1072 transitions. [2022-12-14 20:30:04,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-12-14 20:30:04,139 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:04,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:04,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:30:04,315 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 96 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 20:30:05,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:05,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 928 states and 1154 transitions. [2022-12-14 20:30:05,174 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1154 transitions. [2022-12-14 20:30:05,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-12-14 20:30:05,175 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:05,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:05,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:30:05,289 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 96 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 20:30:05,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:05,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 983 states and 1216 transitions. [2022-12-14 20:30:05,909 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1216 transitions. [2022-12-14 20:30:05,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-12-14 20:30:05,910 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:05,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:30:06,131 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:30:06,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:06,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1054 states and 1287 transitions. [2022-12-14 20:30:06,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1287 transitions. [2022-12-14 20:30:06,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-12-14 20:30:06,874 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:06,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:06,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:30:06,963 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-12-14 20:30:07,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:07,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1057 states and 1290 transitions. [2022-12-14 20:30:07,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1290 transitions. [2022-12-14 20:30:07,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-12-14 20:30:07,049 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:07,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:07,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:30:07,143 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-12-14 20:30:07,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:07,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1060 states and 1293 transitions. [2022-12-14 20:30:07,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1293 transitions. [2022-12-14 20:30:07,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-12-14 20:30:07,255 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:07,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:07,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:30:07,340 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-14 20:30:07,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:07,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1075 states and 1310 transitions. [2022-12-14 20:30:07,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1310 transitions. [2022-12-14 20:30:07,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-12-14 20:30:07,717 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:07,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:07,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:30:07,791 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-14 20:30:08,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:08,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1104 states and 1340 transitions. [2022-12-14 20:30:08,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1340 transitions. [2022-12-14 20:30:08,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-12-14 20:30:08,358 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:08,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:08,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:30:08,485 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 117 proven. 46 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 20:30:08,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:08,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1120 states and 1360 transitions. [2022-12-14 20:30:08,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1360 transitions. [2022-12-14 20:30:08,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-12-14 20:30:08,697 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:08,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:08,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:30:08,808 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 20:30:09,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:09,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1141 states and 1386 transitions. [2022-12-14 20:30:09,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1386 transitions. [2022-12-14 20:30:09,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-12-14 20:30:09,149 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:09,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:09,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:30:09,250 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 20:30:09,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:09,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1143 states and 1390 transitions. [2022-12-14 20:30:09,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1390 transitions. [2022-12-14 20:30:09,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-12-14 20:30:09,496 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:09,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:09,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:30:09,594 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 20:30:09,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:09,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1144 states and 1391 transitions. [2022-12-14 20:30:09,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1391 transitions. [2022-12-14 20:30:09,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-12-14 20:30:09,645 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:09,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:09,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:30:09,732 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 20:30:10,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:10,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1183 states and 1430 transitions. [2022-12-14 20:30:10,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1430 transitions. [2022-12-14 20:30:10,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-12-14 20:30:10,441 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:10,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:10,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:30:10,494 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 20:30:10,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:10,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1199 states and 1447 transitions. [2022-12-14 20:30:10,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1447 transitions. [2022-12-14 20:30:10,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-12-14 20:30:10,706 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:10,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:10,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:30:10,775 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-12-14 20:30:11,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:11,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1224 states and 1475 transitions. [2022-12-14 20:30:11,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1475 transitions. [2022-12-14 20:30:11,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-12-14 20:30:11,002 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:11,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:11,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:30:11,079 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-12-14 20:30:11,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:11,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1248 states and 1501 transitions. [2022-12-14 20:30:11,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1501 transitions. [2022-12-14 20:30:11,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-12-14 20:30:11,351 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:11,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:11,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:30:11,749 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 124 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:30:14,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:14,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1632 states to 1363 states and 1632 transitions. [2022-12-14 20:30:14,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1632 transitions. [2022-12-14 20:30:14,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-12-14 20:30:14,234 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:14,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:30:14,431 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 124 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 20:30:16,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:16,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1476 states and 1754 transitions. [2022-12-14 20:30:16,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1476 states and 1754 transitions. [2022-12-14 20:30:16,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-12-14 20:30:16,186 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:16,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:16,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:30:16,326 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-12-14 20:30:16,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:16,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1523 states and 1809 transitions. [2022-12-14 20:30:16,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 1809 transitions. [2022-12-14 20:30:16,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-12-14 20:30:16,992 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:16,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:17,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:30:17,132 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-12-14 20:30:17,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:17,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1860 states to 1569 states and 1860 transitions. [2022-12-14 20:30:17,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 1860 transitions. [2022-12-14 20:30:17,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-12-14 20:30:17,434 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:17,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:17,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:30:17,505 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 20:30:17,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:17,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1598 states and 1893 transitions. [2022-12-14 20:30:17,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 1893 transitions. [2022-12-14 20:30:17,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-12-14 20:30:17,852 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:17,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:30:17,997 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 164 proven. 30 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-12-14 20:30:18,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:18,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1913 states to 1617 states and 1913 transitions. [2022-12-14 20:30:18,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 1913 transitions. [2022-12-14 20:30:18,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-12-14 20:30:18,856 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:18,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:30:18,999 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 164 proven. 30 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-12-14 20:30:19,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:19,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1933 states to 1636 states and 1933 transitions. [2022-12-14 20:30:19,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 1933 transitions. [2022-12-14 20:30:19,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-12-14 20:30:19,743 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:19,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:19,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:30:20,131 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-12-14 20:30:20,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:20,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2005 states to 1706 states and 2005 transitions. [2022-12-14 20:30:20,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2005 transitions. [2022-12-14 20:30:20,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-12-14 20:30:20,636 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:20,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:20,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:30:20,778 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 215 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-12-14 20:30:20,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:20,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2009 states to 1708 states and 2009 transitions. [2022-12-14 20:30:20,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 2009 transitions. [2022-12-14 20:30:20,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-12-14 20:30:20,877 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:20,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:20,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:30:20,995 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 215 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-12-14 20:30:21,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:21,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2011 states to 1709 states and 2011 transitions. [2022-12-14 20:30:21,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1709 states and 2011 transitions. [2022-12-14 20:30:21,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2022-12-14 20:30:21,085 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:21,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:21,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:30:21,188 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-12-14 20:30:21,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:21,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 1727 states and 2029 transitions. [2022-12-14 20:30:21,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1727 states and 2029 transitions. [2022-12-14 20:30:21,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2022-12-14 20:30:21,682 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:21,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:21,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:30:21,879 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-12-14 20:30:22,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:22,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 1797 states and 2101 transitions. [2022-12-14 20:30:22,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2101 transitions. [2022-12-14 20:30:22,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-12-14 20:30:22,435 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:22,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:30:22,551 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-12-14 20:30:22,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:22,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2103 states to 1799 states and 2103 transitions. [2022-12-14 20:30:22,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2103 transitions. [2022-12-14 20:30:22,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-12-14 20:30:22,786 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:22,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:22,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:30:22,901 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-12-14 20:30:23,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:23,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2103 states to 1800 states and 2103 transitions. [2022-12-14 20:30:23,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2103 transitions. [2022-12-14 20:30:23,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-12-14 20:30:23,186 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:23,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:23,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:30:23,710 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 198 proven. 111 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 20:30:25,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:25,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 1858 states and 2169 transitions. [2022-12-14 20:30:25,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2169 transitions. [2022-12-14 20:30:25,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-12-14 20:30:25,305 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:25,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:30:25,619 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 198 proven. 111 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 20:30:26,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:26,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2222 states to 1909 states and 2222 transitions. [2022-12-14 20:30:26,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1909 states and 2222 transitions. [2022-12-14 20:30:26,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2022-12-14 20:30:26,535 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:26,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:30:26,655 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-12-14 20:30:26,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:26,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2239 states to 1923 states and 2239 transitions. [2022-12-14 20:30:26,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1923 states and 2239 transitions. [2022-12-14 20:30:26,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2022-12-14 20:30:26,851 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:26,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:30:26,931 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2022-12-14 20:30:27,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:27,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2315 states to 1997 states and 2315 transitions. [2022-12-14 20:30:27,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 2315 transitions. [2022-12-14 20:30:27,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-12-14 20:30:27,490 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:27,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:27,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:30:28,224 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 342 proven. 110 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 20:30:31,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:31,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2469 states to 2120 states and 2469 transitions. [2022-12-14 20:30:31,486 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 2469 transitions. [2022-12-14 20:30:31,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-12-14 20:30:31,488 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:31,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:30:31,799 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 342 proven. 110 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 20:30:33,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:33,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2547 states to 2186 states and 2547 transitions. [2022-12-14 20:30:33,175 INFO L276 IsEmpty]: Start isEmpty. Operand 2186 states and 2547 transitions. [2022-12-14 20:30:33,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-12-14 20:30:33,177 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:33,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:33,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:30:33,268 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2022-12-14 20:30:33,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:33,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2547 states to 2187 states and 2547 transitions. [2022-12-14 20:30:33,495 INFO L276 IsEmpty]: Start isEmpty. Operand 2187 states and 2547 transitions. [2022-12-14 20:30:33,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2022-12-14 20:30:33,497 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:33,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:33,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:30:34,120 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 333 proven. 27 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-12-14 20:30:37,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:37,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2622 states to 2256 states and 2622 transitions. [2022-12-14 20:30:37,375 INFO L276 IsEmpty]: Start isEmpty. Operand 2256 states and 2622 transitions. [2022-12-14 20:30:37,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2022-12-14 20:30:37,378 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:37,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 20:30:37,733 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 333 proven. 27 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-12-14 20:30:40,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2022-12-14 20:30:40,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2694 states to 2324 states and 2694 transitions. [2022-12-14 20:30:40,088 INFO L276 IsEmpty]: Start isEmpty. Operand 2324 states and 2694 transitions. [2022-12-14 20:30:40,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2022-12-14 20:30:40,090 INFO L422 CodeCheckObserver]: Error Path is FOUND. [2022-12-14 20:30:40,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 20:30:40,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 20:30:40,121 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 20:30:40,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 20:30:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 20:30:40,279 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 20:30:40,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 20:30:40,390 WARN L475 CodeCheckObserver]: This program is UNSAFE, Check terminated with 75 iterations. [2022-12-14 20:30:40,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 14.12 08:30:40 ImpRootNode [2022-12-14 20:30:40,558 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2022-12-14 20:30:40,559 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 20:30:40,559 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 20:30:40,559 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 20:30:40,559 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 08:29:51" (3/4) ... [2022-12-14 20:30:40,561 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 20:30:40,701 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc1e789-60ca-45ae-a2ee-0665175b043e/bin/ukojak-rkRKPMF4O4/witness.graphml [2022-12-14 20:30:40,701 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 20:30:40,702 INFO L158 Benchmark]: Toolchain (without parser) took 50286.51ms. Allocated memory was 205.5MB in the beginning and 931.1MB in the end (delta: 725.6MB). Free memory was 139.4MB in the beginning and 494.5MB in the end (delta: -355.1MB). Peak memory consumption was 372.2MB. Max. memory is 16.1GB. [2022-12-14 20:30:40,702 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 205.5MB. Free memory is still 182.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 20:30:40,702 INFO L158 Benchmark]: CACSL2BoogieTranslator took 435.28ms. Allocated memory is still 205.5MB. Free memory was 139.2MB in the beginning and 170.8MB in the end (delta: -31.6MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2022-12-14 20:30:40,702 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.89ms. Allocated memory is still 205.5MB. Free memory was 170.8MB in the beginning and 165.3MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 20:30:40,703 INFO L158 Benchmark]: Boogie Preprocessor took 37.65ms. Allocated memory is still 205.5MB. Free memory was 165.3MB in the beginning and 161.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 20:30:40,703 INFO L158 Benchmark]: RCFGBuilder took 1023.55ms. Allocated memory is still 205.5MB. Free memory was 161.1MB in the beginning and 65.0MB in the end (delta: 96.1MB). Peak memory consumption was 96.5MB. Max. memory is 16.1GB. [2022-12-14 20:30:40,703 INFO L158 Benchmark]: CodeCheck took 48582.41ms. Allocated memory was 205.5MB in the beginning and 931.1MB in the end (delta: 725.6MB). Free memory was 65.0MB in the beginning and 519.7MB in the end (delta: -454.7MB). Peak memory consumption was 273.0MB. Max. memory is 16.1GB. [2022-12-14 20:30:40,704 INFO L158 Benchmark]: Witness Printer took 142.37ms. Allocated memory is still 931.1MB. Free memory was 519.7MB in the beginning and 494.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-12-14 20:30:40,705 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: 48.4s, OverallIterations: 75, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 147490 SdHoareTripleChecker+Valid, 290.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 146399 mSDsluCounter, 25165 SdHoareTripleChecker+Invalid, 249.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21245 mSDsCounter, 53980 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 338526 IncrementalHoareTripleChecker+Invalid, 392506 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53980 mSolverCounterUnsat, 3920 mSDtfsCounter, 338526 mSolverCounterSat, 2.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 82237 GetRequests, 79932 SyntacticMatches, 1721 SemanticMatches, 584 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259421 ImplicationChecksByTransitivity, 27.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.4s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 12010 NumberOfCodeBlocks, 12010 NumberOfCodeBlocksAsserted, 75 NumberOfCheckSat, 11653 ConstructedInterpolants, 0 QuantifiedInterpolants, 39308 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 74 InterpolantComputations, 60 PerfectInterpolantSequences, 10730/11515 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: 402]: 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)=6, 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=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=5, a17=1, 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=5, a17=1, 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=5, a17=1, 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=5, a17=1, 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=5, a17=1, 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=5, a17=1, 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=5, a17=1, 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=5, a17=1, 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=5, a17=1, 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=5, a17=1, 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=5, a17=1, 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=5, a17=1, 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=5, a17=1, 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=5, a17=1, 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=5, a17=1, 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=5, a17=1, 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 FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=1, 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] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=1, 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] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=1, 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] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=1, 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] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=1, 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] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=1, 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] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=1, 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] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=1, 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] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=1, 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] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=1, 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] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=1, 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] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=1, 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] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=1, 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] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=1, 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] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=1, 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] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=1, 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] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=1, 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] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=1, 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] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=1, 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] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=1, 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] [L248] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=1, 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] [L255] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=1, 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] [L260] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=1, 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] [L266] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [\old(input)=6, a=1, a12=8, a16=5, a17=1, 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] [L271] COND TRUE ((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5)) [L272] a16 = 4 [L273] a20 = 0 [L274] return 25; VAL [\old(input)=6, \result=25, a=1, a12=8, a16=4, a17=1, a20=0, 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] [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=1, a20=0, 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=1, a20=0, 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=1, a20=0, 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=1, a20=0, 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=1, a20=0, 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=1, a20=0, 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=1, a20=0, 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=1, a20=0, 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=1, a20=0, 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=1, a20=0, 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=1, a20=0, 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=1, a20=0, 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=1, a20=0, 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=1, a20=0, 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=1, a20=0, 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=1, a20=0, 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=1, a20=0, 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 FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, 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] [L146] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, 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] [L150] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, 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] [L154] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, 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] [L158] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, 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] [L162] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, 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] [L170] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, 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] [L175] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, 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] [L183] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, 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] [L188] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, 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] [L196] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, 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] [L199] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, 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] [L204] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, 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] [L207] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, 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] [L213] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, 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] [L218] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, 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] [L224] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, 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] [L228] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, 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] [L233] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, 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] [L241] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [\old(input)=6, a=1, a12=8, a16=4, a17=1, a20=0, 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] [L248] COND TRUE ((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1))))))))) [L249] a20 = 0 [L250] a21 = 1 [L251] a17 = 0 [L252] a8 = 14 [L253] a16 = 4 [L254] return -1; VAL [\old(input)=6, \result=-1, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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)))))))) VAL [\old(input)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L401] COND TRUE ((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [\old(input)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, u=21, v=22, w=23, x=24, y=25, z=26] [L402] reach_error() VAL [\old(input)=5, a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, input=5, 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.15ms. Allocated memory is still 205.5MB. Free memory is still 182.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 435.28ms. Allocated memory is still 205.5MB. Free memory was 139.2MB in the beginning and 170.8MB in the end (delta: -31.6MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.89ms. Allocated memory is still 205.5MB. Free memory was 170.8MB in the beginning and 165.3MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.65ms. Allocated memory is still 205.5MB. Free memory was 165.3MB in the beginning and 161.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1023.55ms. Allocated memory is still 205.5MB. Free memory was 161.1MB in the beginning and 65.0MB in the end (delta: 96.1MB). Peak memory consumption was 96.5MB. Max. memory is 16.1GB. * CodeCheck took 48582.41ms. Allocated memory was 205.5MB in the beginning and 931.1MB in the end (delta: 725.6MB). Free memory was 65.0MB in the beginning and 519.7MB in the end (delta: -454.7MB). Peak memory consumption was 273.0MB. Max. memory is 16.1GB. * Witness Printer took 142.37ms. Allocated memory is still 931.1MB. Free memory was 519.7MB in the beginning and 494.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2022-12-14 20:30:40,723 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fc1e789-60ca-45ae-a2ee-0665175b043e/bin/ukojak-rkRKPMF4O4/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE