./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label32.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb4c656-f17e-4948-8bfc-8793fe1048e1/bin/ukojak-Rh5K9KB4LI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb4c656-f17e-4948-8bfc-8793fe1048e1/bin/ukojak-Rh5K9KB4LI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb4c656-f17e-4948-8bfc-8793fe1048e1/bin/ukojak-Rh5K9KB4LI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb4c656-f17e-4948-8bfc-8793fe1048e1/bin/ukojak-Rh5K9KB4LI/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label32.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb4c656-f17e-4948-8bfc-8793fe1048e1/bin/ukojak-Rh5K9KB4LI/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb4c656-f17e-4948-8bfc-8793fe1048e1/bin/ukojak-Rh5K9KB4LI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2b0b2a9797b90f95684a46496de9717e82eef5c31235380fd2859f2748d0f286 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-29 03:54:17,825 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-29 03:54:17,828 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-29 03:54:17,864 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-29 03:54:17,864 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-29 03:54:17,865 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-29 03:54:17,873 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-29 03:54:17,882 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-29 03:54:17,885 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-29 03:54:17,890 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-29 03:54:17,891 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-29 03:54:17,892 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-29 03:54:17,893 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-29 03:54:17,895 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-29 03:54:17,898 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-29 03:54:17,901 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-29 03:54:17,902 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-29 03:54:17,903 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-29 03:54:17,906 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-29 03:54:17,913 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-29 03:54:17,915 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-29 03:54:17,917 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-29 03:54:17,920 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-29 03:54:17,921 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-29 03:54:17,929 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-29 03:54:17,930 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-29 03:54:17,930 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-29 03:54:17,932 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-29 03:54:17,932 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-29 03:54:17,934 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-29 03:54:17,934 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-29 03:54:17,935 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-29 03:54:17,937 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-29 03:54:17,938 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-29 03:54:17,939 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-29 03:54:17,939 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-29 03:54:17,940 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-29 03:54:17,940 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-29 03:54:17,940 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-29 03:54:17,941 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-29 03:54:17,942 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-29 03:54:17,942 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb4c656-f17e-4948-8bfc-8793fe1048e1/bin/ukojak-Rh5K9KB4LI/config/svcomp-Reach-32bit-Kojak_Default.epf [2021-10-29 03:54:17,985 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-29 03:54:17,985 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-29 03:54:17,986 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-29 03:54:17,987 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2021-10-29 03:54:17,987 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-29 03:54:17,987 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-29 03:54:17,988 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-29 03:54:17,988 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-29 03:54:17,994 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-29 03:54:17,994 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-29 03:54:17,995 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-29 03:54:17,996 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-29 03:54:17,996 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-29 03:54:17,996 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-29 03:54:17,996 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-29 03:54:17,996 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-29 03:54:17,996 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-29 03:54:17,997 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-29 03:54:17,997 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2021-10-29 03:54:17,997 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2021-10-29 03:54:17,997 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-29 03:54:17,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-10-29 03:54:17,998 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-29 03:54:17,998 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-29 03:54:17,998 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-29 03:54:17,998 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2021-10-29 03:54:17,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-29 03:54:17,999 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-29 03:54:17,999 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_3cb4c656-f17e-4948-8bfc-8793fe1048e1/bin/ukojak-Rh5K9KB4LI/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_3cb4c656-f17e-4948-8bfc-8793fe1048e1/bin/ukojak-Rh5K9KB4LI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2b0b2a9797b90f95684a46496de9717e82eef5c31235380fd2859f2748d0f286 [2021-10-29 03:54:18,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-29 03:54:18,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-29 03:54:18,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-29 03:54:18,351 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-29 03:54:18,352 INFO L275 PluginConnector]: CDTParser initialized [2021-10-29 03:54:18,353 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb4c656-f17e-4948-8bfc-8793fe1048e1/bin/ukojak-Rh5K9KB4LI/../../sv-benchmarks/c/eca-rers2012/Problem01_label32.c [2021-10-29 03:54:18,422 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb4c656-f17e-4948-8bfc-8793fe1048e1/bin/ukojak-Rh5K9KB4LI/data/47bb60530/f11465b2067048d8ac024c401c0db10d/FLAG20b40f305 [2021-10-29 03:54:19,041 INFO L306 CDTParser]: Found 1 translation units. [2021-10-29 03:54:19,055 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb4c656-f17e-4948-8bfc-8793fe1048e1/sv-benchmarks/c/eca-rers2012/Problem01_label32.c [2021-10-29 03:54:19,066 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb4c656-f17e-4948-8bfc-8793fe1048e1/bin/ukojak-Rh5K9KB4LI/data/47bb60530/f11465b2067048d8ac024c401c0db10d/FLAG20b40f305 [2021-10-29 03:54:19,278 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb4c656-f17e-4948-8bfc-8793fe1048e1/bin/ukojak-Rh5K9KB4LI/data/47bb60530/f11465b2067048d8ac024c401c0db10d [2021-10-29 03:54:19,281 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-29 03:54:19,282 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-29 03:54:19,283 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-29 03:54:19,284 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-29 03:54:19,287 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-29 03:54:19,288 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 03:54:19" (1/1) ... [2021-10-29 03:54:19,289 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@260987a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:54:19, skipping insertion in model container [2021-10-29 03:54:19,289 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 03:54:19" (1/1) ... [2021-10-29 03:54:19,295 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-29 03:54:19,353 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-29 03:54:19,681 WARN L228 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_3cb4c656-f17e-4948-8bfc-8793fe1048e1/sv-benchmarks/c/eca-rers2012/Problem01_label32.c[14752,14765] [2021-10-29 03:54:19,756 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 03:54:19,765 INFO L203 MainTranslator]: Completed pre-run [2021-10-29 03:54:19,855 WARN L228 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_3cb4c656-f17e-4948-8bfc-8793fe1048e1/sv-benchmarks/c/eca-rers2012/Problem01_label32.c[14752,14765] [2021-10-29 03:54:19,877 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 03:54:19,891 INFO L208 MainTranslator]: Completed translation [2021-10-29 03:54:19,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:54:19 WrapperNode [2021-10-29 03:54:19,892 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-29 03:54:19,893 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-29 03:54:19,893 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-29 03:54:19,894 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-29 03:54:19,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:54:19" (1/1) ... [2021-10-29 03:54:19,931 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:54:19" (1/1) ... [2021-10-29 03:54:20,008 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-29 03:54:20,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-29 03:54:20,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-29 03:54:20,010 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-29 03:54:20,018 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:54:19" (1/1) ... [2021-10-29 03:54:20,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:54:19" (1/1) ... [2021-10-29 03:54:20,028 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:54:19" (1/1) ... [2021-10-29 03:54:20,029 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:54:19" (1/1) ... [2021-10-29 03:54:20,050 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:54:19" (1/1) ... [2021-10-29 03:54:20,059 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:54:19" (1/1) ... [2021-10-29 03:54:20,066 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:54:19" (1/1) ... [2021-10-29 03:54:20,075 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-29 03:54:20,076 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-29 03:54:20,076 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-29 03:54:20,076 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-29 03:54:20,080 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:54:19" (1/1) ... [2021-10-29 03:54:20,089 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-10-29 03:54:20,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb4c656-f17e-4948-8bfc-8793fe1048e1/bin/ukojak-Rh5K9KB4LI/z3 [2021-10-29 03:54:20,117 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb4c656-f17e-4948-8bfc-8793fe1048e1/bin/ukojak-Rh5K9KB4LI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2021-10-29 03:54:20,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb4c656-f17e-4948-8bfc-8793fe1048e1/bin/ukojak-Rh5K9KB4LI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2021-10-29 03:54:20,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-29 03:54:20,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-29 03:54:20,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-29 03:54:20,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-29 03:54:21,958 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-29 03:54:21,959 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-10-29 03:54:21,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 03:54:21 BoogieIcfgContainer [2021-10-29 03:54:21,961 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-29 03:54:21,963 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2021-10-29 03:54:21,963 INFO L271 PluginConnector]: Initializing CodeCheck... [2021-10-29 03:54:21,974 INFO L275 PluginConnector]: CodeCheck initialized [2021-10-29 03:54:21,974 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 03:54:21" (1/1) ... [2021-10-29 03:54:21,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 03:54:22,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:22,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2021-10-29 03:54:22,062 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2021-10-29 03:54:22,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-10-29 03:54:22,069 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:22,070 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:22,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:22,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:54:22,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:22,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 145 states and 231 transitions. [2021-10-29 03:54:22,927 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 231 transitions. [2021-10-29 03:54:22,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-10-29 03:54:22,934 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:22,934 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:22,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:23,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:54:23,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:23,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 215 states and 304 transitions. [2021-10-29 03:54:23,717 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 304 transitions. [2021-10-29 03:54:23,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-10-29 03:54:23,720 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:23,721 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:23,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:23,802 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-29 03:54:23,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:23,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 216 states and 305 transitions. [2021-10-29 03:54:23,916 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 305 transitions. [2021-10-29 03:54:23,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-10-29 03:54:23,919 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:23,919 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:23,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:23,978 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:54:24,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:24,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 236 states and 328 transitions. [2021-10-29 03:54:24,150 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 328 transitions. [2021-10-29 03:54:24,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-10-29 03:54:24,152 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:24,153 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:24,200 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-29 03:54:24,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:24,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 237 states and 330 transitions. [2021-10-29 03:54:24,360 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 330 transitions. [2021-10-29 03:54:24,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-10-29 03:54:24,367 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:24,367 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:24,476 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-29 03:54:24,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:24,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 262 states and 361 transitions. [2021-10-29 03:54:24,845 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 361 transitions. [2021-10-29 03:54:24,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-10-29 03:54:24,846 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:24,846 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:24,904 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:54:25,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:25,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 288 states and 392 transitions. [2021-10-29 03:54:25,290 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 392 transitions. [2021-10-29 03:54:25,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-10-29 03:54:25,292 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:25,292 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:25,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:25,356 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-29 03:54:25,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:25,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 309 states and 416 transitions. [2021-10-29 03:54:25,701 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 416 transitions. [2021-10-29 03:54:25,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-10-29 03:54:25,705 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:25,705 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:25,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:25,802 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:54:26,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:26,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 334 states and 443 transitions. [2021-10-29 03:54:26,163 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 443 transitions. [2021-10-29 03:54:26,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-10-29 03:54:26,165 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:26,165 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:26,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:26,211 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-29 03:54:26,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:26,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 335 states and 445 transitions. [2021-10-29 03:54:26,338 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 445 transitions. [2021-10-29 03:54:26,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-10-29 03:54:26,340 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:26,340 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:26,403 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-29 03:54:26,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:26,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 338 states and 449 transitions. [2021-10-29 03:54:26,469 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 449 transitions. [2021-10-29 03:54:26,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-10-29 03:54:26,471 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:26,472 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:26,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:26,563 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-10-29 03:54:26,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:26,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 347 states and 463 transitions. [2021-10-29 03:54:26,856 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 463 transitions. [2021-10-29 03:54:26,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-10-29 03:54:26,858 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:26,858 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:26,906 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:54:26,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:26,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 353 states and 469 transitions. [2021-10-29 03:54:26,959 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 469 transitions. [2021-10-29 03:54:26,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-10-29 03:54:26,962 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:26,962 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:26,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:27,024 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-29 03:54:27,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:27,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 374 states and 492 transitions. [2021-10-29 03:54:27,390 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 492 transitions. [2021-10-29 03:54:27,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-10-29 03:54:27,392 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:27,393 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:27,464 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:54:27,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:27,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 392 states and 512 transitions. [2021-10-29 03:54:27,655 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 512 transitions. [2021-10-29 03:54:27,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-10-29 03:54:27,657 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:27,657 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:27,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:27,704 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:54:27,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:27,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 406 states and 528 transitions. [2021-10-29 03:54:27,788 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 528 transitions. [2021-10-29 03:54:27,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-10-29 03:54:27,790 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:27,790 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:27,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:27,834 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:54:27,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:27,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 412 states and 535 transitions. [2021-10-29 03:54:27,896 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 535 transitions. [2021-10-29 03:54:27,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-10-29 03:54:27,898 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:27,898 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:27,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:27,955 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:54:28,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:28,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 450 states and 577 transitions. [2021-10-29 03:54:28,456 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 577 transitions. [2021-10-29 03:54:28,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-10-29 03:54:28,458 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:28,459 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:28,530 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-29 03:54:28,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:28,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 462 states and 589 transitions. [2021-10-29 03:54:28,769 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 589 transitions. [2021-10-29 03:54:28,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-10-29 03:54:28,770 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:28,771 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:28,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:28,833 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:54:28,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:28,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 475 states and 604 transitions. [2021-10-29 03:54:28,959 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 604 transitions. [2021-10-29 03:54:28,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-10-29 03:54:28,961 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:28,961 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:28,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:29,030 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:54:29,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:29,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 481 states and 612 transitions. [2021-10-29 03:54:29,154 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 612 transitions. [2021-10-29 03:54:29,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-10-29 03:54:29,157 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:29,158 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:29,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:29,243 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-10-29 03:54:29,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:29,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 510 states and 644 transitions. [2021-10-29 03:54:29,729 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 644 transitions. [2021-10-29 03:54:29,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-10-29 03:54:29,731 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:29,731 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:29,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:29,775 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-29 03:54:29,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:29,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 520 states and 654 transitions. [2021-10-29 03:54:29,996 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 654 transitions. [2021-10-29 03:54:29,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-10-29 03:54:29,997 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:29,998 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:30,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:30,038 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-29 03:54:30,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:30,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 544 states and 679 transitions. [2021-10-29 03:54:30,164 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 679 transitions. [2021-10-29 03:54:30,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-10-29 03:54:30,166 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:30,166 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:30,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:30,232 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:54:30,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:30,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 566 states and 706 transitions. [2021-10-29 03:54:30,607 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 706 transitions. [2021-10-29 03:54:30,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-10-29 03:54:30,609 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:30,609 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:30,681 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-10-29 03:54:30,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:30,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 567 states and 708 transitions. [2021-10-29 03:54:30,840 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 708 transitions. [2021-10-29 03:54:30,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-10-29 03:54:30,841 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:30,842 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:30,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:30,965 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-10-29 03:54:32,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:32,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 666 states and 816 transitions. [2021-10-29 03:54:32,202 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 816 transitions. [2021-10-29 03:54:32,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-10-29 03:54:32,204 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:32,204 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:32,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:32,311 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-10-29 03:54:32,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:32,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 667 states and 817 transitions. [2021-10-29 03:54:32,587 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 817 transitions. [2021-10-29 03:54:32,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-10-29 03:54:32,588 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:32,589 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:32,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:32,658 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-10-29 03:54:32,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:32,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 668 states and 824 transitions. [2021-10-29 03:54:32,703 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 824 transitions. [2021-10-29 03:54:32,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-10-29 03:54:32,705 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:32,705 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:32,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:32,780 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-10-29 03:54:32,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:32,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 669 states and 824 transitions. [2021-10-29 03:54:32,883 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 824 transitions. [2021-10-29 03:54:32,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-10-29 03:54:32,893 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:32,894 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:32,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:32,972 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-10-29 03:54:33,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:33,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 686 states and 843 transitions. [2021-10-29 03:54:33,228 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 843 transitions. [2021-10-29 03:54:33,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-10-29 03:54:33,232 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:33,232 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:33,301 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-10-29 03:54:33,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:33,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 698 states and 856 transitions. [2021-10-29 03:54:33,619 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 856 transitions. [2021-10-29 03:54:33,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-10-29 03:54:33,621 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:33,621 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:33,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:33,681 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-10-29 03:54:33,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:33,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 712 states and 870 transitions. [2021-10-29 03:54:33,874 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 870 transitions. [2021-10-29 03:54:33,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-10-29 03:54:33,876 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:33,876 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:33,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:33,933 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-10-29 03:54:34,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:34,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 719 states and 879 transitions. [2021-10-29 03:54:34,006 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 879 transitions. [2021-10-29 03:54:34,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-10-29 03:54:34,008 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:34,008 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:34,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:34,058 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-10-29 03:54:34,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:34,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 740 states and 902 transitions. [2021-10-29 03:54:34,186 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 902 transitions. [2021-10-29 03:54:34,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-10-29 03:54:34,188 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:34,188 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:34,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:34,296 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-10-29 03:54:35,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:35,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 807 states and 987 transitions. [2021-10-29 03:54:35,316 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 987 transitions. [2021-10-29 03:54:35,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-10-29 03:54:35,319 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:35,319 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:35,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:35,403 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-10-29 03:54:36,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:36,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 835 states and 1017 transitions. [2021-10-29 03:54:36,010 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1017 transitions. [2021-10-29 03:54:36,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-10-29 03:54:36,012 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:36,012 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:36,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:36,067 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-10-29 03:54:36,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:36,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 837 states and 1018 transitions. [2021-10-29 03:54:36,175 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1018 transitions. [2021-10-29 03:54:36,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-10-29 03:54:36,178 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:36,178 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:36,510 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 90 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:54:37,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:37,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 921 states and 1112 transitions. [2021-10-29 03:54:37,933 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1112 transitions. [2021-10-29 03:54:37,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-10-29 03:54:37,936 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:37,936 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:37,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:37,988 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-10-29 03:54:39,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:39,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 989 states and 1192 transitions. [2021-10-29 03:54:39,111 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1192 transitions. [2021-10-29 03:54:39,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-10-29 03:54:39,114 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:39,115 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:39,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:39,171 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-10-29 03:54:39,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:39,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1016 states and 1220 transitions. [2021-10-29 03:54:39,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1220 transitions. [2021-10-29 03:54:39,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-10-29 03:54:39,721 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:39,721 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:39,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:39,776 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-10-29 03:54:39,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:39,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1039 states and 1243 transitions. [2021-10-29 03:54:39,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1243 transitions. [2021-10-29 03:54:39,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-10-29 03:54:39,952 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:39,952 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:39,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:40,006 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-10-29 03:54:40,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:40,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1060 states and 1272 transitions. [2021-10-29 03:54:40,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1272 transitions. [2021-10-29 03:54:40,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-10-29 03:54:40,135 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:40,135 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:40,190 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2021-10-29 03:54:40,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:40,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1113 states and 1326 transitions. [2021-10-29 03:54:40,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1326 transitions. [2021-10-29 03:54:40,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-10-29 03:54:40,873 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:40,873 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:40,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:40,932 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-10-29 03:54:41,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:41,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1119 states and 1337 transitions. [2021-10-29 03:54:41,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1337 transitions. [2021-10-29 03:54:41,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-10-29 03:54:41,477 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:41,477 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:41,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:41,537 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-10-29 03:54:41,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:41,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1121 states and 1338 transitions. [2021-10-29 03:54:41,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1338 transitions. [2021-10-29 03:54:41,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-10-29 03:54:41,712 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:41,712 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:41,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:41,783 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-10-29 03:54:42,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:42,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1146 states and 1363 transitions. [2021-10-29 03:54:42,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1363 transitions. [2021-10-29 03:54:42,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-10-29 03:54:42,132 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:42,132 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:42,195 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-10-29 03:54:43,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:43,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1213 states and 1436 transitions. [2021-10-29 03:54:43,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1436 transitions. [2021-10-29 03:54:43,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2021-10-29 03:54:43,213 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:43,213 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:43,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:43,344 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-10-29 03:54:44,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:44,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1241 states and 1466 transitions. [2021-10-29 03:54:44,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1466 transitions. [2021-10-29 03:54:44,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2021-10-29 03:54:44,187 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:44,187 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:44,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:44,243 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-10-29 03:54:44,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:44,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1306 states and 1532 transitions. [2021-10-29 03:54:44,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1532 transitions. [2021-10-29 03:54:44,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2021-10-29 03:54:44,982 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:44,982 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:45,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:45,234 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-10-29 03:54:46,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:46,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1312 states and 1538 transitions. [2021-10-29 03:54:46,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1538 transitions. [2021-10-29 03:54:46,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2021-10-29 03:54:46,091 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:46,091 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:46,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:46,185 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-10-29 03:54:46,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:46,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1377 states and 1603 transitions. [2021-10-29 03:54:46,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1603 transitions. [2021-10-29 03:54:46,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-10-29 03:54:46,744 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:46,744 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:46,877 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-10-29 03:54:47,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:47,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1398 states and 1636 transitions. [2021-10-29 03:54:47,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 1636 transitions. [2021-10-29 03:54:47,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-10-29 03:54:47,613 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:47,613 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:47,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:47,670 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-10-29 03:54:47,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:47,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1637 states to 1400 states and 1637 transitions. [2021-10-29 03:54:47,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 1637 transitions. [2021-10-29 03:54:47,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-10-29 03:54:47,792 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:47,793 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:47,847 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-10-29 03:54:48,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:48,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1402 states and 1639 transitions. [2021-10-29 03:54:48,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 1639 transitions. [2021-10-29 03:54:48,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-10-29 03:54:48,106 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:48,106 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:48,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:48,156 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-10-29 03:54:48,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:48,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1403 states and 1639 transitions. [2021-10-29 03:54:48,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states and 1639 transitions. [2021-10-29 03:54:48,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-10-29 03:54:48,369 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:48,369 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:48,421 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-10-29 03:54:48,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:48,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1644 states to 1404 states and 1644 transitions. [2021-10-29 03:54:48,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 1644 transitions. [2021-10-29 03:54:48,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-10-29 03:54:48,682 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:48,682 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:48,821 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-10-29 03:54:49,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:49,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1427 states and 1667 transitions. [2021-10-29 03:54:49,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1667 transitions. [2021-10-29 03:54:49,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-10-29 03:54:49,816 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:49,816 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:49,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:49,884 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-10-29 03:54:50,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:50,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1497 states and 1739 transitions. [2021-10-29 03:54:50,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 1739 transitions. [2021-10-29 03:54:50,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-10-29 03:54:50,648 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:50,648 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:50,875 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 163 proven. 41 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-10-29 03:54:52,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:52,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1554 states and 1812 transitions. [2021-10-29 03:54:52,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 1812 transitions. [2021-10-29 03:54:52,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-10-29 03:54:52,365 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:52,365 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:52,422 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-10-29 03:54:52,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:52,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1616 states and 1874 transitions. [2021-10-29 03:54:52,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 1874 transitions. [2021-10-29 03:54:52,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2021-10-29 03:54:52,967 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:52,967 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:52,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:53,023 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-10-29 03:54:54,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:54,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1660 states and 1927 transitions. [2021-10-29 03:54:54,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 1927 transitions. [2021-10-29 03:54:54,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2021-10-29 03:54:54,218 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:54,219 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:54,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:54,276 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-10-29 03:54:54,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:54,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1668 states and 1934 transitions. [2021-10-29 03:54:54,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 1934 transitions. [2021-10-29 03:54:54,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2021-10-29 03:54:54,595 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:54,595 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:54,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:54,674 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-10-29 03:54:55,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:55,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1988 states to 1714 states and 1988 transitions. [2021-10-29 03:54:55,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 1988 transitions. [2021-10-29 03:54:55,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2021-10-29 03:54:55,397 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:55,397 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:55,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:55,452 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-10-29 03:54:56,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:56,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 1751 states and 2029 transitions. [2021-10-29 03:54:56,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2029 transitions. [2021-10-29 03:54:56,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2021-10-29 03:54:56,234 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:56,235 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:56,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:56,483 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 164 proven. 30 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-10-29 03:54:56,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:56,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 1759 states and 2037 transitions. [2021-10-29 03:54:56,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 2037 transitions. [2021-10-29 03:54:56,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2021-10-29 03:54:56,911 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:56,911 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:56,976 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-10-29 03:54:57,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:57,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2045 states to 1765 states and 2045 transitions. [2021-10-29 03:54:57,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 2045 transitions. [2021-10-29 03:54:57,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2021-10-29 03:54:57,314 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:57,315 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:57,383 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-10-29 03:54:57,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:57,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 1767 states and 2046 transitions. [2021-10-29 03:54:57,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 2046 transitions. [2021-10-29 03:54:57,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2021-10-29 03:54:57,743 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:57,744 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:57,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:57,824 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2021-10-29 03:54:58,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:58,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2065 states to 1787 states and 2065 transitions. [2021-10-29 03:54:58,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1787 states and 2065 transitions. [2021-10-29 03:54:58,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2021-10-29 03:54:58,208 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:58,209 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:58,300 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2021-10-29 03:54:58,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:54:58,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2065 states to 1788 states and 2065 transitions. [2021-10-29 03:54:58,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1788 states and 2065 transitions. [2021-10-29 03:54:58,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2021-10-29 03:54:58,341 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:54:58,341 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:54:58,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:54:58,758 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 204 proven. 35 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-10-29 03:55:00,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:00,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2151 states to 1866 states and 2151 transitions. [2021-10-29 03:55:00,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 2151 transitions. [2021-10-29 03:55:00,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2021-10-29 03:55:00,408 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:00,408 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:00,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:00,496 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 204 proven. 35 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-10-29 03:55:00,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:00,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 1894 states and 2180 transitions. [2021-10-29 03:55:00,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 2180 transitions. [2021-10-29 03:55:00,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2021-10-29 03:55:00,901 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:00,901 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:00,961 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2021-10-29 03:55:01,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:01,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2183 states to 1895 states and 2183 transitions. [2021-10-29 03:55:01,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1895 states and 2183 transitions. [2021-10-29 03:55:01,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2021-10-29 03:55:01,311 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:01,311 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:01,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:01,367 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2021-10-29 03:55:01,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:01,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2203 states to 1913 states and 2203 transitions. [2021-10-29 03:55:01,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1913 states and 2203 transitions. [2021-10-29 03:55:01,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2021-10-29 03:55:01,888 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:01,888 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:01,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:02,026 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 215 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-10-29 03:55:03,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:03,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 1938 states and 2231 transitions. [2021-10-29 03:55:03,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1938 states and 2231 transitions. [2021-10-29 03:55:03,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2021-10-29 03:55:03,153 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:03,153 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:03,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:03,674 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 146 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:55:06,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:06,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 2044 states and 2364 transitions. [2021-10-29 03:55:06,860 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 2364 transitions. [2021-10-29 03:55:06,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2021-10-29 03:55:06,862 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:06,862 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:06,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:07,061 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2021-10-29 03:55:08,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:08,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2391 states to 2065 states and 2391 transitions. [2021-10-29 03:55:08,208 INFO L276 IsEmpty]: Start isEmpty. Operand 2065 states and 2391 transitions. [2021-10-29 03:55:08,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2021-10-29 03:55:08,210 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:08,210 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:08,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:08,285 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-10-29 03:55:08,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:08,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2396 states to 2066 states and 2396 transitions. [2021-10-29 03:55:08,650 INFO L276 IsEmpty]: Start isEmpty. Operand 2066 states and 2396 transitions. [2021-10-29 03:55:08,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2021-10-29 03:55:08,652 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:08,652 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:08,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:08,707 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-10-29 03:55:08,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:08,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2397 states to 2067 states and 2397 transitions. [2021-10-29 03:55:08,981 INFO L276 IsEmpty]: Start isEmpty. Operand 2067 states and 2397 transitions. [2021-10-29 03:55:08,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2021-10-29 03:55:08,982 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:08,983 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:09,038 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-10-29 03:55:09,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:09,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2415 states to 2085 states and 2415 transitions. [2021-10-29 03:55:09,465 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 2415 transitions. [2021-10-29 03:55:09,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2021-10-29 03:55:09,466 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:09,467 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:09,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:09,521 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2021-10-29 03:55:09,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:09,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2416 states to 2087 states and 2416 transitions. [2021-10-29 03:55:09,763 INFO L276 IsEmpty]: Start isEmpty. Operand 2087 states and 2416 transitions. [2021-10-29 03:55:09,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2021-10-29 03:55:09,764 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:09,765 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:09,825 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2021-10-29 03:55:10,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:10,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2417 states to 2089 states and 2417 transitions. [2021-10-29 03:55:10,112 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 2417 transitions. [2021-10-29 03:55:10,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2021-10-29 03:55:10,115 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:10,115 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:10,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:10,174 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2021-10-29 03:55:10,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:10,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2096 states and 2428 transitions. [2021-10-29 03:55:10,731 INFO L276 IsEmpty]: Start isEmpty. Operand 2096 states and 2428 transitions. [2021-10-29 03:55:10,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2021-10-29 03:55:10,733 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:10,733 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:10,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:10,789 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2021-10-29 03:55:11,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:11,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2444 states to 2110 states and 2444 transitions. [2021-10-29 03:55:11,212 INFO L276 IsEmpty]: Start isEmpty. Operand 2110 states and 2444 transitions. [2021-10-29 03:55:11,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2021-10-29 03:55:11,213 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:11,214 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:11,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:11,756 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 226 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:55:12,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:12,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2485 states to 2143 states and 2485 transitions. [2021-10-29 03:55:12,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2143 states and 2485 transitions. [2021-10-29 03:55:13,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2021-10-29 03:55:13,001 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:13,001 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:13,060 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2021-10-29 03:55:13,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:13,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2492 states to 2151 states and 2492 transitions. [2021-10-29 03:55:13,269 INFO L276 IsEmpty]: Start isEmpty. Operand 2151 states and 2492 transitions. [2021-10-29 03:55:13,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2021-10-29 03:55:13,271 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:13,271 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:13,372 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 170 proven. 139 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:55:15,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:15,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2195 states and 2548 transitions. [2021-10-29 03:55:15,013 INFO L276 IsEmpty]: Start isEmpty. Operand 2195 states and 2548 transitions. [2021-10-29 03:55:15,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2021-10-29 03:55:15,015 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:15,015 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:15,111 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 170 proven. 139 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:55:15,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:15,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2203 states and 2555 transitions. [2021-10-29 03:55:15,622 INFO L276 IsEmpty]: Start isEmpty. Operand 2203 states and 2555 transitions. [2021-10-29 03:55:15,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2021-10-29 03:55:15,624 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:15,624 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:15,724 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 170 proven. 139 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 03:55:16,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:16,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2589 states to 2237 states and 2589 transitions. [2021-10-29 03:55:16,195 INFO L276 IsEmpty]: Start isEmpty. Operand 2237 states and 2589 transitions. [2021-10-29 03:55:16,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2021-10-29 03:55:16,198 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:16,199 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:16,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:16,269 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2021-10-29 03:55:16,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:16,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2600 states to 2243 states and 2600 transitions. [2021-10-29 03:55:16,397 INFO L276 IsEmpty]: Start isEmpty. Operand 2243 states and 2600 transitions. [2021-10-29 03:55:16,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2021-10-29 03:55:16,399 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:16,399 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:16,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:16,458 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2021-10-29 03:55:16,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:16,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2603 states to 2247 states and 2603 transitions. [2021-10-29 03:55:16,651 INFO L276 IsEmpty]: Start isEmpty. Operand 2247 states and 2603 transitions. [2021-10-29 03:55:16,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2021-10-29 03:55:16,654 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:16,654 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:16,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:16,725 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2021-10-29 03:55:16,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:16,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2606 states to 2251 states and 2606 transitions. [2021-10-29 03:55:16,932 INFO L276 IsEmpty]: Start isEmpty. Operand 2251 states and 2606 transitions. [2021-10-29 03:55:16,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2021-10-29 03:55:16,934 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:16,934 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:16,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:17,631 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 176 proven. 118 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-10-29 03:55:20,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:20,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2737 states to 2360 states and 2737 transitions. [2021-10-29 03:55:20,687 INFO L276 IsEmpty]: Start isEmpty. Operand 2360 states and 2737 transitions. [2021-10-29 03:55:20,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2021-10-29 03:55:20,690 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:20,690 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:20,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 03:55:20,925 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 188 proven. 112 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-10-29 03:55:22,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 03:55:22,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2868 states to 2482 states and 2868 transitions. [2021-10-29 03:55:22,902 INFO L276 IsEmpty]: Start isEmpty. Operand 2482 states and 2868 transitions. [2021-10-29 03:55:22,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2021-10-29 03:55:22,904 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 03:55:22,904 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 03:55:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 03:55:22,945 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-29 03:55:22,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 03:55:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 03:55:23,198 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-29 03:55:23,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 03:55:23,324 WARN L480 CodeCheckObserver]: This program is UNSAFE, Check terminated with 95 iterations. [2021-10-29 03:55:23,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 29.10 03:55:23 ImpRootNode [2021-10-29 03:55:23,731 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2021-10-29 03:55:23,731 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-29 03:55:23,731 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-29 03:55:23,732 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-29 03:55:23,732 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 03:54:21" (3/4) ... [2021-10-29 03:55:23,734 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-29 03:55:23,967 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb4c656-f17e-4948-8bfc-8793fe1048e1/bin/ukojak-Rh5K9KB4LI/witness.graphml [2021-10-29 03:55:23,967 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-29 03:55:23,968 INFO L168 Benchmark]: Toolchain (without parser) took 64685.75 ms. Allocated memory was 96.5 MB in the beginning and 784.3 MB in the end (delta: 687.9 MB). Free memory was 54.8 MB in the beginning and 412.8 MB in the end (delta: -358.0 MB). Peak memory consumption was 328.3 MB. Max. memory is 16.1 GB. [2021-10-29 03:55:23,969 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 96.5 MB. Free memory is still 72.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 03:55:23,969 INFO L168 Benchmark]: CACSL2BoogieTranslator took 608.94 ms. Allocated memory is still 96.5 MB. Free memory was 54.6 MB in the beginning and 54.1 MB in the end (delta: 507.3 kB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-29 03:55:23,970 INFO L168 Benchmark]: Boogie Procedure Inliner took 114.97 ms. Allocated memory is still 96.5 MB. Free memory was 54.1 MB in the beginning and 48.3 MB in the end (delta: 5.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-29 03:55:23,970 INFO L168 Benchmark]: Boogie Preprocessor took 66.29 ms. Allocated memory is still 96.5 MB. Free memory was 48.3 MB in the beginning and 44.2 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-29 03:55:23,970 INFO L168 Benchmark]: RCFGBuilder took 1885.68 ms. Allocated memory was 96.5 MB in the beginning and 121.6 MB in the end (delta: 25.2 MB). Free memory was 43.9 MB in the beginning and 41.6 MB in the end (delta: 2.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 16.1 GB. [2021-10-29 03:55:23,971 INFO L168 Benchmark]: CodeCheck took 61768.10 ms. Allocated memory was 121.6 MB in the beginning and 784.3 MB in the end (delta: 662.7 MB). Free memory was 41.6 MB in the beginning and 451.6 MB in the end (delta: -410.0 MB). Peak memory consumption was 254.6 MB. Max. memory is 16.1 GB. [2021-10-29 03:55:23,971 INFO L168 Benchmark]: Witness Printer took 235.84 ms. Allocated memory is still 784.3 MB. Free memory was 451.6 MB in the beginning and 412.8 MB in the end (delta: 38.8 MB). Peak memory consumption was 37.7 MB. Max. memory is 16.1 GB. [2021-10-29 03:55:23,973 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: 61.2s, OverallIterations: 95, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 86510224 SDtfs, -2037895702 SDslu, -1599566988 SDs, 0 SdLazy, -2125075752 SolverSat, -1672921730 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 416.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 106485 GetRequests, 103096 SyntacticMatches, 2703 SemanticMatches, 686 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279546 ImplicationChecksByTransitivity, 40.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.7s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 15977 NumberOfCodeBlocks, 15977 NumberOfCodeBlocksAsserted, 95 NumberOfCheckSat, 15640 ConstructedInterpolants, 0 QuantifiedInterpolants, 54006 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 94 InterpolantComputations, 82 PerfectInterpolantSequences, 13728/14721 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 408]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int a= 1; [L18] int d= 4; [L19] int e= 5; [L20] int f= 6; [L21] int c= 3; [L22] int b= 2; [L25] int u = 21; [L26] int v = 22; [L27] int w = 23; [L28] int x = 24; [L29] int y = 25; [L30] int z = 26; [L32] int a17 = 1; [L33] int a7 = 0; [L34] int a20 = 1; [L35] int a8 = 15; [L36] int a12 = 8; [L37] int a16 = 5; [L38] int a21 = 1; [L590] int output = -1; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, 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)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) 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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, u=21, v=22, w=23, x=24, y=25, z=26] [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)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, u=21, v=22, w=23, x=24, y=25, z=26] [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)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, u=21, v=22, w=23, x=24, y=25, z=26] [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)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, u=21, v=22, w=23, x=24, y=25, z=26] [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)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, 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 [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, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND TRUE ((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1))) [L159] a16 = 4 [L160] a17 = 0 [L161] return 25; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND TRUE (((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1)) [L140] a8 = 15 [L141] a17 = 0 [L142] a21 = 1 [L143] a20 = 0 [L144] a16 = 4 [L145] return -1; VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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)) [L41] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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 [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L392] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L401] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L404] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L407] COND TRUE ((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L408] reach_error() VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, 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.23 ms. Allocated memory is still 96.5 MB. Free memory is still 72.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 608.94 ms. Allocated memory is still 96.5 MB. Free memory was 54.6 MB in the beginning and 54.1 MB in the end (delta: 507.3 kB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 114.97 ms. Allocated memory is still 96.5 MB. Free memory was 54.1 MB in the beginning and 48.3 MB in the end (delta: 5.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 66.29 ms. Allocated memory is still 96.5 MB. Free memory was 48.3 MB in the beginning and 44.2 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1885.68 ms. Allocated memory was 96.5 MB in the beginning and 121.6 MB in the end (delta: 25.2 MB). Free memory was 43.9 MB in the beginning and 41.6 MB in the end (delta: 2.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 16.1 GB. * CodeCheck took 61768.10 ms. Allocated memory was 121.6 MB in the beginning and 784.3 MB in the end (delta: 662.7 MB). Free memory was 41.6 MB in the beginning and 451.6 MB in the end (delta: -410.0 MB). Peak memory consumption was 254.6 MB. Max. memory is 16.1 GB. * Witness Printer took 235.84 ms. Allocated memory is still 784.3 MB. Free memory was 451.6 MB in the beginning and 412.8 MB in the end (delta: 38.8 MB). Peak memory consumption was 37.7 MB. Max. memory is 16.1 GB. RESULT: Ultimate proved your program to be incorrect! [2021-10-29 03:55:24,031 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cb4c656-f17e-4948-8bfc-8793fe1048e1/bin/ukojak-Rh5K9KB4LI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...