./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label38.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f526e5-8e2e-4d3b-a6d5-469ceea5cb0d/bin/ukojak-Rh5K9KB4LI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f526e5-8e2e-4d3b-a6d5-469ceea5cb0d/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_37f526e5-8e2e-4d3b-a6d5-469ceea5cb0d/bin/ukojak-Rh5K9KB4LI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f526e5-8e2e-4d3b-a6d5-469ceea5cb0d/bin/ukojak-Rh5K9KB4LI/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label38.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f526e5-8e2e-4d3b-a6d5-469ceea5cb0d/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_37f526e5-8e2e-4d3b-a6d5-469ceea5cb0d/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 af706eff0638e64b28329aeb8e4500504f7e95c7ca075a2e2f010d6212db9f23 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 04:19:14,182 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-29 04:19:14,184 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-29 04:19:14,216 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-29 04:19:14,221 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-29 04:19:14,223 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-29 04:19:14,226 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-29 04:19:14,231 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-29 04:19:14,236 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-29 04:19:14,238 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-29 04:19:14,239 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-29 04:19:14,243 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-29 04:19:14,243 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-29 04:19:14,251 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-29 04:19:14,254 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-29 04:19:14,256 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-29 04:19:14,258 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-29 04:19:14,261 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-29 04:19:14,263 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-29 04:19:14,270 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-29 04:19:14,276 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-29 04:19:14,278 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-29 04:19:14,281 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-29 04:19:14,282 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-29 04:19:14,289 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-29 04:19:14,289 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-29 04:19:14,290 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-29 04:19:14,292 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-29 04:19:14,292 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-29 04:19:14,294 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-29 04:19:14,295 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-29 04:19:14,296 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-29 04:19:14,299 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-29 04:19:14,300 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-29 04:19:14,302 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-29 04:19:14,302 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-29 04:19:14,303 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-29 04:19:14,303 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-29 04:19:14,304 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-29 04:19:14,305 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-29 04:19:14,306 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-29 04:19:14,307 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f526e5-8e2e-4d3b-a6d5-469ceea5cb0d/bin/ukojak-Rh5K9KB4LI/config/svcomp-Reach-32bit-Kojak_Default.epf [2021-10-29 04:19:14,350 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-29 04:19:14,350 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-29 04:19:14,351 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-29 04:19:14,352 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2021-10-29 04:19:14,353 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-29 04:19:14,353 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-29 04:19:14,353 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-29 04:19:14,353 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-29 04:19:14,354 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-29 04:19:14,354 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-29 04:19:14,354 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-29 04:19:14,354 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-29 04:19:14,354 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-29 04:19:14,355 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-29 04:19:14,355 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-29 04:19:14,355 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-29 04:19:14,355 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-29 04:19:14,356 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-29 04:19:14,356 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2021-10-29 04:19:14,356 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2021-10-29 04:19:14,356 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-29 04:19:14,356 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-10-29 04:19:14,357 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-29 04:19:14,357 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-29 04:19:14,357 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-29 04:19:14,357 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2021-10-29 04:19:14,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-29 04:19:14,358 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-29 04:19:14,358 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_37f526e5-8e2e-4d3b-a6d5-469ceea5cb0d/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_37f526e5-8e2e-4d3b-a6d5-469ceea5cb0d/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 -> af706eff0638e64b28329aeb8e4500504f7e95c7ca075a2e2f010d6212db9f23 [2021-10-29 04:19:14,658 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-29 04:19:14,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-29 04:19:14,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-29 04:19:14,694 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-29 04:19:14,696 INFO L275 PluginConnector]: CDTParser initialized [2021-10-29 04:19:14,697 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f526e5-8e2e-4d3b-a6d5-469ceea5cb0d/bin/ukojak-Rh5K9KB4LI/../../sv-benchmarks/c/eca-rers2012/Problem01_label38.c [2021-10-29 04:19:14,791 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f526e5-8e2e-4d3b-a6d5-469ceea5cb0d/bin/ukojak-Rh5K9KB4LI/data/f985e1fa9/be534c2d86404549b2d88251b474225a/FLAG58a2404a6 [2021-10-29 04:19:15,413 INFO L306 CDTParser]: Found 1 translation units. [2021-10-29 04:19:15,414 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f526e5-8e2e-4d3b-a6d5-469ceea5cb0d/sv-benchmarks/c/eca-rers2012/Problem01_label38.c [2021-10-29 04:19:15,427 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f526e5-8e2e-4d3b-a6d5-469ceea5cb0d/bin/ukojak-Rh5K9KB4LI/data/f985e1fa9/be534c2d86404549b2d88251b474225a/FLAG58a2404a6 [2021-10-29 04:19:15,632 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f526e5-8e2e-4d3b-a6d5-469ceea5cb0d/bin/ukojak-Rh5K9KB4LI/data/f985e1fa9/be534c2d86404549b2d88251b474225a [2021-10-29 04:19:15,635 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-29 04:19:15,638 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-29 04:19:15,641 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-29 04:19:15,642 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-29 04:19:15,645 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-29 04:19:15,646 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 04:19:15" (1/1) ... [2021-10-29 04:19:15,649 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f61fc00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:19:15, skipping insertion in model container [2021-10-29 04:19:15,649 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 04:19:15" (1/1) ... [2021-10-29 04:19:15,657 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-29 04:19:15,722 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-29 04:19:16,232 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_37f526e5-8e2e-4d3b-a6d5-469ceea5cb0d/sv-benchmarks/c/eca-rers2012/Problem01_label38.c[15751,15764] [2021-10-29 04:19:16,288 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 04:19:16,302 INFO L203 MainTranslator]: Completed pre-run [2021-10-29 04:19:16,433 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_37f526e5-8e2e-4d3b-a6d5-469ceea5cb0d/sv-benchmarks/c/eca-rers2012/Problem01_label38.c[15751,15764] [2021-10-29 04:19:16,469 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 04:19:16,485 INFO L208 MainTranslator]: Completed translation [2021-10-29 04:19:16,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:19:16 WrapperNode [2021-10-29 04:19:16,486 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-29 04:19:16,488 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-29 04:19:16,488 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-29 04:19:16,488 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-29 04:19:16,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:19:16" (1/1) ... [2021-10-29 04:19:16,516 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:19:16" (1/1) ... [2021-10-29 04:19:16,578 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-29 04:19:16,579 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-29 04:19:16,580 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-29 04:19:16,580 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-29 04:19:16,589 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:19:16" (1/1) ... [2021-10-29 04:19:16,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:19:16" (1/1) ... [2021-10-29 04:19:16,602 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:19:16" (1/1) ... [2021-10-29 04:19:16,607 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:19:16" (1/1) ... [2021-10-29 04:19:16,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:19:16" (1/1) ... [2021-10-29 04:19:16,656 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:19:16" (1/1) ... [2021-10-29 04:19:16,672 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:19:16" (1/1) ... [2021-10-29 04:19:16,679 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-29 04:19:16,680 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-29 04:19:16,680 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-29 04:19:16,680 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-29 04:19:16,681 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:19:16" (1/1) ... [2021-10-29 04:19:16,688 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2021-10-29 04:19:16,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f526e5-8e2e-4d3b-a6d5-469ceea5cb0d/bin/ukojak-Rh5K9KB4LI/z3 [2021-10-29 04:19:16,727 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f526e5-8e2e-4d3b-a6d5-469ceea5cb0d/bin/ukojak-Rh5K9KB4LI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2021-10-29 04:19:16,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f526e5-8e2e-4d3b-a6d5-469ceea5cb0d/bin/ukojak-Rh5K9KB4LI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2021-10-29 04:19:16,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-29 04:19:16,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-29 04:19:16,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-29 04:19:16,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-29 04:19:18,641 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-29 04:19:18,645 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-10-29 04:19:18,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 04:19:18 BoogieIcfgContainer [2021-10-29 04:19:18,649 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-29 04:19:18,649 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2021-10-29 04:19:18,650 INFO L271 PluginConnector]: Initializing CodeCheck... [2021-10-29 04:19:18,661 INFO L275 PluginConnector]: CodeCheck initialized [2021-10-29 04:19:18,662 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 04:19:18" (1/1) ... [2021-10-29 04:19:18,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:19:18,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:18,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2021-10-29 04:19:18,725 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2021-10-29 04:19:18,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-10-29 04:19:18,731 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:18,732 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:19,152 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 04:19:19,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:19,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 145 states and 219 transitions. [2021-10-29 04:19:19,708 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 219 transitions. [2021-10-29 04:19:19,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-10-29 04:19:19,711 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:19,712 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:19,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-29 04:19:20,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:20,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 146 states and 220 transitions. [2021-10-29 04:19:20,112 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2021-10-29 04:19:20,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-10-29 04:19:20,119 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:20,120 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:20,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:20,214 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:19:20,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:20,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 151 states and 227 transitions. [2021-10-29 04:19:20,292 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 227 transitions. [2021-10-29 04:19:20,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-10-29 04:19:20,300 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:20,300 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:20,447 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:19:21,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:21,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 221 states and 299 transitions. [2021-10-29 04:19:21,033 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 299 transitions. [2021-10-29 04:19:21,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-10-29 04:19:21,034 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:21,035 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:21,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:21,095 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:19:21,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:21,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 228 states and 308 transitions. [2021-10-29 04:19:21,247 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 308 transitions. [2021-10-29 04:19:21,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-10-29 04:19:21,249 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:21,249 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:21,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:21,304 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-29 04:19:21,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:21,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 239 states and 323 transitions. [2021-10-29 04:19:21,700 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 323 transitions. [2021-10-29 04:19:21,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-10-29 04:19:21,707 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:21,708 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:21,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:21,782 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:19:21,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:21,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 248 states and 332 transitions. [2021-10-29 04:19:21,855 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 332 transitions. [2021-10-29 04:19:21,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-10-29 04:19:21,857 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:21,857 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:21,922 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-29 04:19:22,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:22,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 256 states and 342 transitions. [2021-10-29 04:19:22,107 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 342 transitions. [2021-10-29 04:19:22,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-10-29 04:19:22,109 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:22,110 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:22,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:22,172 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-29 04:19:22,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:22,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 264 states and 355 transitions. [2021-10-29 04:19:22,422 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 355 transitions. [2021-10-29 04:19:22,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-10-29 04:19:22,423 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:22,424 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:22,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:22,481 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-29 04:19:22,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:22,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 277 states and 371 transitions. [2021-10-29 04:19:22,793 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 371 transitions. [2021-10-29 04:19:22,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-10-29 04:19:22,794 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:22,795 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:22,845 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-29 04:19:23,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:23,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 285 states and 380 transitions. [2021-10-29 04:19:23,010 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 380 transitions. [2021-10-29 04:19:23,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-10-29 04:19:23,012 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:23,013 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:23,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:23,107 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-29 04:19:23,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:23,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 292 states and 389 transitions. [2021-10-29 04:19:23,308 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 389 transitions. [2021-10-29 04:19:23,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-10-29 04:19:23,310 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:23,310 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:23,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:23,378 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-29 04:19:23,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:23,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 295 states and 395 transitions. [2021-10-29 04:19:23,721 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 395 transitions. [2021-10-29 04:19:23,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-10-29 04:19:23,723 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:23,723 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:23,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:23,773 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-29 04:19:23,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:23,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 300 states and 400 transitions. [2021-10-29 04:19:23,855 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 400 transitions. [2021-10-29 04:19:23,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-10-29 04:19:23,857 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:23,857 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:23,930 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-10-29 04:19:24,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:24,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 301 states and 402 transitions. [2021-10-29 04:19:24,071 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 402 transitions. [2021-10-29 04:19:24,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-10-29 04:19:24,072 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:24,074 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:24,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:24,144 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-29 04:19:24,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:24,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 317 states and 423 transitions. [2021-10-29 04:19:24,726 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 423 transitions. [2021-10-29 04:19:24,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-10-29 04:19:24,727 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:24,727 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:24,837 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-10-29 04:19:25,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:25,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 332 states and 442 transitions. [2021-10-29 04:19:25,486 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 442 transitions. [2021-10-29 04:19:25,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-10-29 04:19:25,488 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:25,489 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:25,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:25,525 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-10-29 04:19:25,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:25,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 343 states and 455 transitions. [2021-10-29 04:19:25,976 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 455 transitions. [2021-10-29 04:19:25,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-10-29 04:19:25,978 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:25,978 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:25,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:26,013 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-10-29 04:19:26,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:26,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 350 states and 464 transitions. [2021-10-29 04:19:26,191 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 464 transitions. [2021-10-29 04:19:26,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-10-29 04:19:26,193 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:26,193 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:26,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:26,228 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-10-29 04:19:26,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:26,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 359 states and 474 transitions. [2021-10-29 04:19:26,292 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 474 transitions. [2021-10-29 04:19:26,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-10-29 04:19:26,294 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:26,295 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:26,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:26,335 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-29 04:19:26,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:26,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 373 states and 488 transitions. [2021-10-29 04:19:26,479 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 488 transitions. [2021-10-29 04:19:26,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-10-29 04:19:26,482 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:26,482 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:26,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:26,519 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-10-29 04:19:26,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:26,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 377 states and 492 transitions. [2021-10-29 04:19:26,549 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 492 transitions. [2021-10-29 04:19:26,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-10-29 04:19:26,550 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:26,551 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:26,600 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-29 04:19:26,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:26,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 380 states and 495 transitions. [2021-10-29 04:19:26,672 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 495 transitions. [2021-10-29 04:19:26,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-10-29 04:19:26,676 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:26,676 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:26,746 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-10-29 04:19:26,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:26,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 389 states and 505 transitions. [2021-10-29 04:19:26,943 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 505 transitions. [2021-10-29 04:19:26,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-10-29 04:19:26,945 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:26,946 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:26,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:27,036 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-29 04:19:28,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:28,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 413 states and 535 transitions. [2021-10-29 04:19:28,004 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 535 transitions. [2021-10-29 04:19:28,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-10-29 04:19:28,006 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:28,007 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:28,050 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-10-29 04:19:28,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:28,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 415 states and 537 transitions. [2021-10-29 04:19:28,081 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 537 transitions. [2021-10-29 04:19:28,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-10-29 04:19:28,083 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:28,083 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:28,127 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-10-29 04:19:28,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:28,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 416 states and 538 transitions. [2021-10-29 04:19:28,150 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 538 transitions. [2021-10-29 04:19:28,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-10-29 04:19:28,152 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:28,152 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:28,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:28,241 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-29 04:19:28,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:28,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 419 states and 543 transitions. [2021-10-29 04:19:28,674 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 543 transitions. [2021-10-29 04:19:28,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-10-29 04:19:28,675 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:28,676 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:28,715 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-29 04:19:28,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:28,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 424 states and 548 transitions. [2021-10-29 04:19:28,816 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 548 transitions. [2021-10-29 04:19:28,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-10-29 04:19:28,819 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:28,823 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:28,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:28,928 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:19:30,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:30,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 466 states and 603 transitions. [2021-10-29 04:19:30,335 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 603 transitions. [2021-10-29 04:19:30,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-10-29 04:19:30,337 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:30,337 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:30,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:30,383 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:19:30,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:30,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 473 states and 610 transitions. [2021-10-29 04:19:30,616 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 610 transitions. [2021-10-29 04:19:30,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-10-29 04:19:30,618 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:30,618 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:30,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:30,662 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 04:19:30,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:30,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 496 states and 635 transitions. [2021-10-29 04:19:30,777 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 635 transitions. [2021-10-29 04:19:30,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-10-29 04:19:30,779 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:30,779 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:30,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:30,820 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-10-29 04:19:31,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:31,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 511 states and 653 transitions. [2021-10-29 04:19:31,368 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 653 transitions. [2021-10-29 04:19:31,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-10-29 04:19:31,370 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:31,370 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:31,415 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-29 04:19:31,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:31,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 523 states and 666 transitions. [2021-10-29 04:19:31,585 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 666 transitions. [2021-10-29 04:19:31,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-10-29 04:19:31,588 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:31,588 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:31,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:31,690 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:19:32,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:32,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 539 states and 689 transitions. [2021-10-29 04:19:32,621 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 689 transitions. [2021-10-29 04:19:32,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-10-29 04:19:32,624 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:32,625 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:32,672 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:19:32,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:32,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 546 states and 697 transitions. [2021-10-29 04:19:32,869 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 697 transitions. [2021-10-29 04:19:32,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-10-29 04:19:32,898 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:32,899 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:32,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:32,941 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:19:33,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:33,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 582 states and 736 transitions. [2021-10-29 04:19:33,184 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 736 transitions. [2021-10-29 04:19:33,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-10-29 04:19:33,185 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:33,186 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:33,229 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:19:33,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:33,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 595 states and 750 transitions. [2021-10-29 04:19:33,589 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 750 transitions. [2021-10-29 04:19:33,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-10-29 04:19:33,591 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:33,591 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:33,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:33,635 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-29 04:19:33,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:33,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 597 states and 752 transitions. [2021-10-29 04:19:33,798 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 752 transitions. [2021-10-29 04:19:33,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-10-29 04:19:33,800 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:33,801 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:33,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:33,847 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-29 04:19:33,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:33,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 606 states and 761 transitions. [2021-10-29 04:19:33,903 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 761 transitions. [2021-10-29 04:19:33,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-10-29 04:19:33,906 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:33,906 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:33,970 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:19:34,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:34,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 614 states and 772 transitions. [2021-10-29 04:19:34,027 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 772 transitions. [2021-10-29 04:19:34,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-10-29 04:19:34,028 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:34,029 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:34,073 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-10-29 04:19:34,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:34,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 615 states and 773 transitions. [2021-10-29 04:19:34,098 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 773 transitions. [2021-10-29 04:19:34,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-10-29 04:19:34,100 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:34,100 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:34,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:34,148 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-29 04:19:34,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:34,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 645 states and 805 transitions. [2021-10-29 04:19:34,464 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 805 transitions. [2021-10-29 04:19:34,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-10-29 04:19:34,466 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:34,466 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:34,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:34,582 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-29 04:19:35,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:35,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 685 states and 848 transitions. [2021-10-29 04:19:35,476 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 848 transitions. [2021-10-29 04:19:35,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-10-29 04:19:35,478 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:35,479 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:35,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:35,524 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-29 04:19:35,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:35,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 690 states and 853 transitions. [2021-10-29 04:19:35,803 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 853 transitions. [2021-10-29 04:19:35,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-10-29 04:19:35,805 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:35,805 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:35,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:35,846 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 04:19:36,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:36,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 695 states and 859 transitions. [2021-10-29 04:19:36,063 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 859 transitions. [2021-10-29 04:19:36,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-10-29 04:19:36,066 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:36,067 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:36,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:36,184 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:19:36,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:36,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 700 states and 866 transitions. [2021-10-29 04:19:36,614 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 866 transitions. [2021-10-29 04:19:36,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2021-10-29 04:19:36,616 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:36,617 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:36,844 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:19:37,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:37,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 840 states and 1015 transitions. [2021-10-29 04:19:37,995 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1015 transitions. [2021-10-29 04:19:37,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-10-29 04:19:37,997 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:37,998 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:38,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:38,083 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2021-10-29 04:19:38,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:38,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 841 states and 1015 transitions. [2021-10-29 04:19:38,184 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1015 transitions. [2021-10-29 04:19:38,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-10-29 04:19:38,186 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:38,187 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:38,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:38,234 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:19:38,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:38,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 870 states and 1047 transitions. [2021-10-29 04:19:38,392 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1047 transitions. [2021-10-29 04:19:38,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-10-29 04:19:38,394 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:38,394 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:38,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:38,442 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-10-29 04:19:38,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:38,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 882 states and 1060 transitions. [2021-10-29 04:19:38,514 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1060 transitions. [2021-10-29 04:19:38,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-10-29 04:19:38,515 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:38,516 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:38,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:38,736 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:19:39,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:39,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 953 states and 1131 transitions. [2021-10-29 04:19:39,791 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1131 transitions. [2021-10-29 04:19:39,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-10-29 04:19:39,793 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:39,793 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:39,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:39,843 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-29 04:19:40,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:40,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 973 states and 1152 transitions. [2021-10-29 04:19:40,370 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1152 transitions. [2021-10-29 04:19:40,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-10-29 04:19:40,372 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:40,372 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:40,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:40,423 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-29 04:19:40,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:40,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 978 states and 1156 transitions. [2021-10-29 04:19:40,610 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1156 transitions. [2021-10-29 04:19:40,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-10-29 04:19:40,615 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:40,616 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:40,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:40,664 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-10-29 04:19:41,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:41,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 986 states and 1171 transitions. [2021-10-29 04:19:41,243 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1171 transitions. [2021-10-29 04:19:41,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-10-29 04:19:41,246 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:41,246 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:41,286 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-10-29 04:19:41,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:41,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 991 states and 1176 transitions. [2021-10-29 04:19:41,418 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1176 transitions. [2021-10-29 04:19:41,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-10-29 04:19:41,420 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:41,421 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:41,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:41,476 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-10-29 04:19:41,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:41,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 993 states and 1177 transitions. [2021-10-29 04:19:41,574 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1177 transitions. [2021-10-29 04:19:41,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-10-29 04:19:41,576 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:41,577 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:41,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:41,633 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-10-29 04:19:41,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:41,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 996 states and 1180 transitions. [2021-10-29 04:19:41,719 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1180 transitions. [2021-10-29 04:19:41,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-10-29 04:19:41,721 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:41,721 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:41,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:41,787 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:19:42,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:42,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1034 states and 1229 transitions. [2021-10-29 04:19:42,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1229 transitions. [2021-10-29 04:19:42,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-10-29 04:19:42,909 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:42,909 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:42,964 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:19:43,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:43,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1053 states and 1248 transitions. [2021-10-29 04:19:43,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1248 transitions. [2021-10-29 04:19:43,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-10-29 04:19:43,247 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:43,247 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:43,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:43,300 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-10-29 04:19:43,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:43,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1063 states and 1261 transitions. [2021-10-29 04:19:43,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1261 transitions. [2021-10-29 04:19:43,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-10-29 04:19:43,710 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:43,710 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:43,765 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:19:44,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:44,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1070 states and 1266 transitions. [2021-10-29 04:19:44,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1266 transitions. [2021-10-29 04:19:44,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-10-29 04:19:44,302 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:44,303 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:44,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:44,354 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-10-29 04:19:44,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:44,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1075 states and 1270 transitions. [2021-10-29 04:19:44,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1270 transitions. [2021-10-29 04:19:44,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-10-29 04:19:44,675 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:44,675 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:44,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:44,735 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2021-10-29 04:19:44,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:44,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1078 states and 1274 transitions. [2021-10-29 04:19:44,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1274 transitions. [2021-10-29 04:19:44,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-10-29 04:19:44,792 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:44,792 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:44,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:44,847 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-10-29 04:19:45,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:45,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1140 states and 1336 transitions. [2021-10-29 04:19:45,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1336 transitions. [2021-10-29 04:19:45,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-10-29 04:19:45,833 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:45,833 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:45,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:45,886 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-10-29 04:19:45,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:45,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1148 states and 1343 transitions. [2021-10-29 04:19:45,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1343 transitions. [2021-10-29 04:19:45,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2021-10-29 04:19:45,982 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:45,983 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:46,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:46,190 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 134 proven. 41 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-29 04:19:47,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:47,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1197 states and 1406 transitions. [2021-10-29 04:19:47,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1406 transitions. [2021-10-29 04:19:47,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2021-10-29 04:19:47,753 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:47,753 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:47,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:48,150 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 104 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:19:50,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:50,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1291 states and 1515 transitions. [2021-10-29 04:19:50,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1515 transitions. [2021-10-29 04:19:50,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2021-10-29 04:19:50,985 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:50,986 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:51,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:51,105 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 104 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:19:51,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:51,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1292 states and 1515 transitions. [2021-10-29 04:19:51,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1515 transitions. [2021-10-29 04:19:51,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-10-29 04:19:51,417 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:51,418 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:51,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:51,501 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-10-29 04:19:52,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:52,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1378 states and 1603 transitions. [2021-10-29 04:19:52,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 1603 transitions. [2021-10-29 04:19:52,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-10-29 04:19:52,202 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:52,202 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:52,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:52,265 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-10-29 04:19:53,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:53,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1419 states and 1648 transitions. [2021-10-29 04:19:53,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 1648 transitions. [2021-10-29 04:19:53,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-10-29 04:19:53,926 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:53,926 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:53,976 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-10-29 04:19:54,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:54,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1427 states and 1657 transitions. [2021-10-29 04:19:54,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1657 transitions. [2021-10-29 04:19:54,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-10-29 04:19:54,653 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:54,653 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:54,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:54,713 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-10-29 04:19:55,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:55,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1428 states and 1657 transitions. [2021-10-29 04:19:55,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1657 transitions. [2021-10-29 04:19:55,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-10-29 04:19:55,141 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:55,141 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:55,203 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-10-29 04:19:55,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:55,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1471 states and 1703 transitions. [2021-10-29 04:19:55,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 1703 transitions. [2021-10-29 04:19:55,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-10-29 04:19:55,778 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:55,779 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:55,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:55,838 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-10-29 04:19:56,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:56,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1485 states and 1717 transitions. [2021-10-29 04:19:56,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 1717 transitions. [2021-10-29 04:19:56,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-10-29 04:19:56,252 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:56,252 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:56,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:56,313 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-10-29 04:19:56,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:56,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1487 states and 1718 transitions. [2021-10-29 04:19:56,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1487 states and 1718 transitions. [2021-10-29 04:19:56,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2021-10-29 04:19:56,518 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:56,518 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:56,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:56,580 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-10-29 04:19:58,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:58,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1521 states and 1753 transitions. [2021-10-29 04:19:58,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 1753 transitions. [2021-10-29 04:19:58,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2021-10-29 04:19:58,124 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:58,125 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:58,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:58,193 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-10-29 04:19:58,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:58,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1523 states and 1754 transitions. [2021-10-29 04:19:58,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 1754 transitions. [2021-10-29 04:19:58,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2021-10-29 04:19:58,605 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:58,605 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:58,671 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-10-29 04:19:58,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:58,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1758 states to 1528 states and 1758 transitions. [2021-10-29 04:19:58,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 1758 transitions. [2021-10-29 04:19:58,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-10-29 04:19:58,969 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:58,970 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:59,023 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-29 04:19:59,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:19:59,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1782 states to 1550 states and 1782 transitions. [2021-10-29 04:19:59,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 1782 transitions. [2021-10-29 04:19:59,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2021-10-29 04:19:59,608 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:19:59,608 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:19:59,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:19:59,662 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-10-29 04:20:00,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:20:00,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1586 states and 1822 transitions. [2021-10-29 04:20:00,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 1822 transitions. [2021-10-29 04:20:00,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2021-10-29 04:20:00,561 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:20:00,561 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:20:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:20:00,622 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-10-29 04:20:02,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:20:02,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1596 states and 1834 transitions. [2021-10-29 04:20:02,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 1834 transitions. [2021-10-29 04:20:02,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2021-10-29 04:20:02,058 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:20:02,058 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:20:02,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:20:02,115 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-10-29 04:20:02,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:20:02,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1843 states to 1607 states and 1843 transitions. [2021-10-29 04:20:02,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 1843 transitions. [2021-10-29 04:20:02,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2021-10-29 04:20:02,663 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:20:02,663 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:20:02,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:20:03,077 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 121 proven. 64 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-10-29 04:20:06,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:20:06,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 1740 states and 2007 transitions. [2021-10-29 04:20:06,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1740 states and 2007 transitions. [2021-10-29 04:20:06,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2021-10-29 04:20:06,483 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:20:06,483 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:20:06,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:20:06,551 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-10-29 04:20:07,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:20:07,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2021 states to 1756 states and 2021 transitions. [2021-10-29 04:20:07,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 2021 transitions. [2021-10-29 04:20:07,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2021-10-29 04:20:07,398 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:20:07,398 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:20:07,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:20:07,556 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 162 proven. 95 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-10-29 04:20:08,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:20:08,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2030 states to 1765 states and 2030 transitions. [2021-10-29 04:20:08,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 2030 transitions. [2021-10-29 04:20:08,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2021-10-29 04:20:08,384 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:20:08,384 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:20:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:20:08,472 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-10-29 04:20:09,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:20:09,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 1777 states and 2042 transitions. [2021-10-29 04:20:09,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 2042 transitions. [2021-10-29 04:20:09,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2021-10-29 04:20:09,004 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:20:09,004 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:20:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:20:09,135 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 169 proven. 95 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-10-29 04:20:09,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:20:09,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2049 states to 1784 states and 2049 transitions. [2021-10-29 04:20:09,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2049 transitions. [2021-10-29 04:20:09,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2021-10-29 04:20:09,493 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:20:09,493 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:20:09,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:20:09,708 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-10-29 04:20:10,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:20:10,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 1815 states and 2090 transitions. [2021-10-29 04:20:10,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 2090 transitions. [2021-10-29 04:20:10,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2021-10-29 04:20:10,707 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:20:10,707 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:20:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:20:10,760 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-10-29 04:20:10,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:20:10,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2096 states to 1821 states and 2096 transitions. [2021-10-29 04:20:10,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2096 transitions. [2021-10-29 04:20:10,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2021-10-29 04:20:10,961 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:20:10,961 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:20:10,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:20:11,086 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 171 proven. 108 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-10-29 04:20:11,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:20:11,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2123 states to 1847 states and 2123 transitions. [2021-10-29 04:20:11,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 2123 transitions. [2021-10-29 04:20:11,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2021-10-29 04:20:11,807 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:20:11,807 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:20:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:20:11,928 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 171 proven. 108 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-10-29 04:20:12,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:20:12,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2129 states to 1852 states and 2129 transitions. [2021-10-29 04:20:12,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1852 states and 2129 transitions. [2021-10-29 04:20:12,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2021-10-29 04:20:12,401 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:20:12,402 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:20:12,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:20:12,541 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 172 proven. 95 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-10-29 04:20:12,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2021-10-29 04:20:12,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 1855 states and 2133 transitions. [2021-10-29 04:20:12,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1855 states and 2133 transitions. [2021-10-29 04:20:12,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2021-10-29 04:20:12,742 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2021-10-29 04:20:12,742 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:20:12,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 04:20:12,779 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-29 04:20:12,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 04:20:13,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 04:20:13,001 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-29 04:20:13,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 04:20:13,135 WARN L480 CodeCheckObserver]: This program is UNSAFE, Check terminated with 94 iterations. [2021-10-29 04:20:13,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 29.10 04:20:13 ImpRootNode [2021-10-29 04:20:13,563 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2021-10-29 04:20:13,564 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-29 04:20:13,564 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-29 04:20:13,564 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-29 04:20:13,564 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 04:19:18" (3/4) ... [2021-10-29 04:20:13,569 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-29 04:20:13,801 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f526e5-8e2e-4d3b-a6d5-469ceea5cb0d/bin/ukojak-Rh5K9KB4LI/witness.graphml [2021-10-29 04:20:13,801 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-29 04:20:13,802 INFO L168 Benchmark]: Toolchain (without parser) took 58163.39 ms. Allocated memory was 81.8 MB in the beginning and 639.6 MB in the end (delta: 557.8 MB). Free memory was 45.5 MB in the beginning and 317.2 MB in the end (delta: -271.7 MB). Peak memory consumption was 284.7 MB. Max. memory is 16.1 GB. [2021-10-29 04:20:13,803 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 81.8 MB. Free memory was 52.1 MB in the beginning and 52.1 MB in the end (delta: 30.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 04:20:13,803 INFO L168 Benchmark]: CACSL2BoogieTranslator took 845.60 ms. Allocated memory was 81.8 MB in the beginning and 102.8 MB in the end (delta: 21.0 MB). Free memory was 45.3 MB in the beginning and 60.8 MB in the end (delta: -15.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-29 04:20:13,804 INFO L168 Benchmark]: Boogie Procedure Inliner took 90.77 ms. Allocated memory is still 102.8 MB. Free memory was 60.8 MB in the beginning and 55.1 MB in the end (delta: 5.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-29 04:20:13,804 INFO L168 Benchmark]: Boogie Preprocessor took 99.54 ms. Allocated memory is still 102.8 MB. Free memory was 55.1 MB in the beginning and 50.8 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-29 04:20:13,804 INFO L168 Benchmark]: RCFGBuilder took 1969.13 ms. Allocated memory was 102.8 MB in the beginning and 144.7 MB in the end (delta: 41.9 MB). Free memory was 50.3 MB in the beginning and 104.7 MB in the end (delta: -54.3 MB). Peak memory consumption was 28.9 MB. Max. memory is 16.1 GB. [2021-10-29 04:20:13,805 INFO L168 Benchmark]: CodeCheck took 54913.63 ms. Allocated memory was 144.7 MB in the beginning and 639.6 MB in the end (delta: 494.9 MB). Free memory was 104.7 MB in the beginning and 356.0 MB in the end (delta: -251.4 MB). Peak memory consumption was 243.6 MB. Max. memory is 16.1 GB. [2021-10-29 04:20:13,805 INFO L168 Benchmark]: Witness Printer took 237.47 ms. Allocated memory is still 639.6 MB. Free memory was 356.0 MB in the beginning and 317.2 MB in the end (delta: 38.8 MB). Peak memory consumption was 37.7 MB. Max. memory is 16.1 GB. [2021-10-29 04:20:13,807 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: 54.4s, OverallIterations: 94, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 570433856 SDtfs, 630914148 SDslu, -585050368 SDs, 0 SdLazy, -2064591288 SolverSat, -1113637964 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 306.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 87293 GetRequests, 83770 SyntacticMatches, 2921 SemanticMatches, 602 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269601 ImplicationChecksByTransitivity, 36.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.6s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 13532 NumberOfCodeBlocks, 13532 NumberOfCodeBlocksAsserted, 94 NumberOfCheckSat, 13204 ConstructedInterpolants, 0 QuantifiedInterpolants, 55678 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 93 InterpolantComputations, 83 PerfectInterpolantSequences, 9583/10350 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 432]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int a= 1; [L18] int d= 4; [L19] int e= 5; [L20] int f= 6; [L21] int c= 3; [L22] int b= 2; [L25] int u = 21; [L26] int v = 22; [L27] int w = 23; [L28] int x = 24; [L29] int y = 25; [L30] int z = 26; [L32] int a17 = 1; [L33] int a7 = 0; [L34] int a20 = 1; [L35] int a8 = 15; [L36] int a12 = 8; [L37] int a16 = 5; [L38] int a21 = 1; [L590] int output = -1; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, 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 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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [L288] COND TRUE (((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8)) [L289] a20 = 1 [L290] a8 = 13 [L291] a16 = 4 [L292] a7 = 0 [L293] a21 = 1 [L294] a17 = 0 [L295] return -1; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, 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=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=1, a7=0, 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=1, a7=0, 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=1, a7=0, 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=1, a7=0, 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=1, a7=0, 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=1, a7=0, 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=1, a7=0, 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=1, a7=0, 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=1, a7=0, 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=1, a7=0, 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=1, a7=0, 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=1, a7=0, 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=1, a7=0, 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=1, a7=0, 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=1, a7=0, 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=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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 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=13, 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=13, 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=13, 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=13, 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=13, 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=13, 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=13, 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=13, 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=13, 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=13, 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=13, 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=13, 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=13, 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=13, 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=13, 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=13, 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=13, 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=13, 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=13, 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=13, 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=13, 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=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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=1, a21=1, a7=0, a8=13, 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))) [L407] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L410] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L413] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L416] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L419] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L422] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L425] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L428] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L431] COND TRUE ((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L432] reach_error() VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, 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.30 ms. Allocated memory is still 81.8 MB. Free memory was 52.1 MB in the beginning and 52.1 MB in the end (delta: 30.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 845.60 ms. Allocated memory was 81.8 MB in the beginning and 102.8 MB in the end (delta: 21.0 MB). Free memory was 45.3 MB in the beginning and 60.8 MB in the end (delta: -15.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 90.77 ms. Allocated memory is still 102.8 MB. Free memory was 60.8 MB in the beginning and 55.1 MB in the end (delta: 5.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 99.54 ms. Allocated memory is still 102.8 MB. Free memory was 55.1 MB in the beginning and 50.8 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1969.13 ms. Allocated memory was 102.8 MB in the beginning and 144.7 MB in the end (delta: 41.9 MB). Free memory was 50.3 MB in the beginning and 104.7 MB in the end (delta: -54.3 MB). Peak memory consumption was 28.9 MB. Max. memory is 16.1 GB. * CodeCheck took 54913.63 ms. Allocated memory was 144.7 MB in the beginning and 639.6 MB in the end (delta: 494.9 MB). Free memory was 104.7 MB in the beginning and 356.0 MB in the end (delta: -251.4 MB). Peak memory consumption was 243.6 MB. Max. memory is 16.1 GB. * Witness Printer took 237.47 ms. Allocated memory is still 639.6 MB. Free memory was 356.0 MB in the beginning and 317.2 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 04:20:13,864 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_37f526e5-8e2e-4d3b-a6d5-469ceea5cb0d/bin/ukojak-Rh5K9KB4LI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...