./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label44.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f4ded20e-ff25-4981-97d8-648cbe13fc0d/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f4ded20e-ff25-4981-97d8-648cbe13fc0d/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f4ded20e-ff25-4981-97d8-648cbe13fc0d/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f4ded20e-ff25-4981-97d8-648cbe13fc0d/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label44.c -s /tmp/vcloud-vcloud-master/worker/run_dir_f4ded20e-ff25-4981-97d8-648cbe13fc0d/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f4ded20e-ff25-4981-97d8-648cbe13fc0d/bin/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2239efb232e6960cd140d60028ed9446da6b2730 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.1.24-678e011 [2019-11-20 04:11:14,688 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 04:11:14,690 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 04:11:14,704 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 04:11:14,704 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 04:11:14,705 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 04:11:14,707 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 04:11:14,709 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 04:11:14,712 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 04:11:14,713 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 04:11:14,714 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 04:11:14,716 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 04:11:14,716 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 04:11:14,717 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 04:11:14,719 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 04:11:14,720 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 04:11:14,721 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 04:11:14,722 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 04:11:14,724 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 04:11:14,727 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 04:11:14,729 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 04:11:14,731 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 04:11:14,732 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 04:11:14,733 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 04:11:14,736 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 04:11:14,737 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 04:11:14,737 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 04:11:14,738 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 04:11:14,739 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 04:11:14,740 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 04:11:14,740 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 04:11:14,741 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 04:11:14,741 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 04:11:14,742 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 04:11:14,743 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 04:11:14,744 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 04:11:14,744 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 04:11:14,745 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 04:11:14,745 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 04:11:14,746 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 04:11:14,747 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 04:11:14,747 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f4ded20e-ff25-4981-97d8-648cbe13fc0d/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2019-11-20 04:11:14,763 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 04:11:14,764 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 04:11:14,765 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-20 04:11:14,765 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-11-20 04:11:14,766 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 04:11:14,766 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 04:11:14,766 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 04:11:14,766 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 04:11:14,767 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 04:11:14,767 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 04:11:14,767 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 04:11:14,767 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 04:11:14,767 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 04:11:14,768 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 04:11:14,768 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 04:11:14,768 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 04:11:14,768 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 04:11:14,769 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 04:11:14,769 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-11-20 04:11:14,769 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-11-20 04:11:14,769 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 04:11:14,770 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 04:11:14,770 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-11-20 04:11:14,770 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 04:11:14,770 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 04:11:14,771 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 04:11:14,771 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-11-20 04:11:14,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 04:11:14,771 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 04:11:14,771 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-vcloud-master/worker/run_dir_f4ded20e-ff25-4981-97d8-648cbe13fc0d/bin/ukojak 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(__VERIFIER_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 -> 2239efb232e6960cd140d60028ed9446da6b2730 [2019-11-20 04:11:14,946 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 04:11:14,960 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 04:11:14,963 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 04:11:14,965 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 04:11:14,966 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 04:11:14,967 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f4ded20e-ff25-4981-97d8-648cbe13fc0d/bin/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label44.c [2019-11-20 04:11:15,032 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f4ded20e-ff25-4981-97d8-648cbe13fc0d/bin/ukojak/data/7ea260ba8/5cab19fc5c5e4afa89b0f629915c459c/FLAG17d93cede [2019-11-20 04:11:15,599 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 04:11:15,600 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f4ded20e-ff25-4981-97d8-648cbe13fc0d/sv-benchmarks/c/eca-rers2012/Problem01_label44.c [2019-11-20 04:11:15,613 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f4ded20e-ff25-4981-97d8-648cbe13fc0d/bin/ukojak/data/7ea260ba8/5cab19fc5c5e4afa89b0f629915c459c/FLAG17d93cede [2019-11-20 04:11:15,924 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f4ded20e-ff25-4981-97d8-648cbe13fc0d/bin/ukojak/data/7ea260ba8/5cab19fc5c5e4afa89b0f629915c459c [2019-11-20 04:11:15,927 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 04:11:15,929 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 04:11:15,930 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 04:11:15,931 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 04:11:15,935 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 04:11:15,936 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:11:15" (1/1) ... [2019-11-20 04:11:15,940 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6709ef4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:11:15, skipping insertion in model container [2019-11-20 04:11:15,940 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:11:15" (1/1) ... [2019-11-20 04:11:15,949 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 04:11:16,020 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 04:11:16,575 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 04:11:16,590 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 04:11:16,695 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 04:11:16,713 INFO L192 MainTranslator]: Completed translation [2019-11-20 04:11:16,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:11:16 WrapperNode [2019-11-20 04:11:16,714 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 04:11:16,715 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 04:11:16,716 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 04:11:16,716 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 04:11:16,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:11:16" (1/1) ... [2019-11-20 04:11:16,752 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:11:16" (1/1) ... [2019-11-20 04:11:16,824 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 04:11:16,824 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 04:11:16,824 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 04:11:16,825 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 04:11:16,847 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:11:16" (1/1) ... [2019-11-20 04:11:16,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:11:16" (1/1) ... [2019-11-20 04:11:16,852 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:11:16" (1/1) ... [2019-11-20 04:11:16,853 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:11:16" (1/1) ... [2019-11-20 04:11:16,878 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:11:16" (1/1) ... [2019-11-20 04:11:16,906 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:11:16" (1/1) ... [2019-11-20 04:11:16,914 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:11:16" (1/1) ... [2019-11-20 04:11:16,923 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 04:11:16,924 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 04:11:16,924 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 04:11:16,924 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 04:11:16,926 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:11:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4ded20e-ff25-4981-97d8-648cbe13fc0d/bin/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-11-20 04:11:17,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 04:11:17,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 04:11:19,685 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 04:11:19,690 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 04:11:19,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:11:19 BoogieIcfgContainer [2019-11-20 04:11:19,693 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 04:11:19,693 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-11-20 04:11:19,694 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-11-20 04:11:19,706 INFO L275 PluginConnector]: CodeCheck initialized [2019-11-20 04:11:19,707 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:11:19" (1/1) ... [2019-11-20 04:11:19,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:11:19,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:11:19,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2019-11-20 04:11:19,773 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2019-11-20 04:11:19,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-20 04:11:19,781 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:11:19,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:11:20,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:11:21,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:11:21,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 145 states and 237 transitions. [2019-11-20 04:11:21,022 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 237 transitions. [2019-11-20 04:11:21,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-20 04:11:21,027 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:11:21,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:11:21,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 04:11:21,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:11:21,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 146 states and 238 transitions. [2019-11-20 04:11:21,460 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 238 transitions. [2019-11-20 04:11:21,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-20 04:11:21,465 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:11:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:11:21,525 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:11:21,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:11:21,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 150 states and 245 transitions. [2019-11-20 04:11:21,751 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 245 transitions. [2019-11-20 04:11:21,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-20 04:11:21,756 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:11:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:11:21,797 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 04:11:21,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:11:21,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 151 states and 246 transitions. [2019-11-20 04:11:21,964 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 246 transitions. [2019-11-20 04:11:21,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-20 04:11:21,966 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:11:21,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:11:22,071 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:11:22,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:11:22,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 159 states and 261 transitions. [2019-11-20 04:11:22,452 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 261 transitions. [2019-11-20 04:11:22,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-20 04:11:22,454 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:11:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:11:22,558 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 04:11:23,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:11:23,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 170 states and 280 transitions. [2019-11-20 04:11:23,298 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 280 transitions. [2019-11-20 04:11:23,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 04:11:23,309 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:11:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:11:23,388 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:11:23,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:11:23,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 171 states and 281 transitions. [2019-11-20 04:11:23,453 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 281 transitions. [2019-11-20 04:11:23,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 04:11:23,454 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:11:23,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:11:23,534 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:11:23,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:11:23,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 177 states and 288 transitions. [2019-11-20 04:11:23,736 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 288 transitions. [2019-11-20 04:11:23,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 04:11:23,738 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:11:23,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:11:23,874 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:11:24,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:11:24,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 191 states and 307 transitions. [2019-11-20 04:11:24,989 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 307 transitions. [2019-11-20 04:11:24,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 04:11:24,991 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:11:25,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:11:25,127 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:11:25,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:11:25,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 200 states and 325 transitions. [2019-11-20 04:11:25,886 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 325 transitions. [2019-11-20 04:11:25,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 04:11:25,887 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:11:25,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:11:25,915 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:11:26,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:11:26,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 201 states and 327 transitions. [2019-11-20 04:11:26,276 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 327 transitions. [2019-11-20 04:11:26,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 04:11:26,278 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:11:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:11:26,307 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:11:26,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:11:26,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 202 states and 329 transitions. [2019-11-20 04:11:26,335 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 329 transitions. [2019-11-20 04:11:26,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 04:11:26,336 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:11:26,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:11:26,370 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 04:11:26,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:11:26,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 203 states and 330 transitions. [2019-11-20 04:11:26,453 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 330 transitions. [2019-11-20 04:11:26,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-20 04:11:26,456 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:11:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:11:26,601 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:11:27,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:11:27,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 214 states and 347 transitions. [2019-11-20 04:11:27,713 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 347 transitions. [2019-11-20 04:11:27,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-20 04:11:27,715 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:11:27,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:11:27,778 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:11:27,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:11:27,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 217 states and 350 transitions. [2019-11-20 04:11:27,812 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 350 transitions. [2019-11-20 04:11:27,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-20 04:11:27,813 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:11:27,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:11:27,846 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 04:11:28,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:11:28,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 219 states and 351 transitions. [2019-11-20 04:11:28,053 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 351 transitions. [2019-11-20 04:11:28,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-20 04:11:28,056 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:11:28,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:11:28,113 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 04:11:28,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:11:28,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 224 states and 356 transitions. [2019-11-20 04:11:28,549 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 356 transitions. [2019-11-20 04:11:28,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-20 04:11:28,550 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:11:28,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:11:28,665 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:11:29,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:11:29,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 230 states and 366 transitions. [2019-11-20 04:11:29,194 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 366 transitions. [2019-11-20 04:11:29,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-20 04:11:29,196 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:11:29,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:11:29,232 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:11:30,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:11:30,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 241 states and 381 transitions. [2019-11-20 04:11:30,838 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 381 transitions. [2019-11-20 04:11:30,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-20 04:11:30,839 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:11:30,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:11:30,876 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 04:11:31,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:11:31,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 243 states and 382 transitions. [2019-11-20 04:11:31,144 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 382 transitions. [2019-11-20 04:11:31,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-20 04:11:31,146 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:11:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:11:31,198 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 04:11:32,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:11:32,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 254 states and 392 transitions. [2019-11-20 04:11:32,013 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 392 transitions. [2019-11-20 04:11:32,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-20 04:11:32,014 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:11:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:11:32,185 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:11:33,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:11:33,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 278 states and 426 transitions. [2019-11-20 04:11:33,945 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 426 transitions. [2019-11-20 04:11:33,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 04:11:33,946 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:11:33,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:11:33,996 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 04:11:34,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:11:34,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 280 states and 431 transitions. [2019-11-20 04:11:34,314 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 431 transitions. [2019-11-20 04:11:34,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 04:11:34,316 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:11:34,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:11:34,427 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:11:34,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:11:34,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 283 states and 434 transitions. [2019-11-20 04:11:34,473 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 434 transitions. [2019-11-20 04:11:34,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 04:11:34,475 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:11:34,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:11:34,572 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:11:35,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:11:35,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 298 states and 451 transitions. [2019-11-20 04:11:35,425 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 451 transitions. [2019-11-20 04:11:35,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 04:11:35,426 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:11:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:11:35,500 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:11:35,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:11:35,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 301 states and 454 transitions. [2019-11-20 04:11:35,820 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 454 transitions. [2019-11-20 04:11:35,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 04:11:35,822 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:11:35,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:11:35,987 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:11:38,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:11:38,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 326 states and 489 transitions. [2019-11-20 04:11:38,839 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 489 transitions. [2019-11-20 04:11:38,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-20 04:11:38,841 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:11:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:11:39,008 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:11:40,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:11:40,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 337 states and 501 transitions. [2019-11-20 04:11:40,755 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 501 transitions. [2019-11-20 04:11:40,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-20 04:11:40,758 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:11:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:11:41,759 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:11:45,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:11:45,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 362 states and 544 transitions. [2019-11-20 04:11:45,027 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 544 transitions. [2019-11-20 04:11:45,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-20 04:11:45,029 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:11:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:11:45,335 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:11:47,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:11:47,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 378 states and 565 transitions. [2019-11-20 04:11:47,092 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 565 transitions. [2019-11-20 04:11:47,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-20 04:11:47,094 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:11:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:11:47,341 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:11:47,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:11:47,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 379 states and 567 transitions. [2019-11-20 04:11:47,668 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 567 transitions. [2019-11-20 04:11:47,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-20 04:11:47,670 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:11:47,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:11:48,023 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:11:49,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:11:49,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 390 states and 580 transitions. [2019-11-20 04:11:49,210 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 580 transitions. [2019-11-20 04:11:49,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-20 04:11:49,212 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:11:49,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:11:49,539 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:11:49,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:11:49,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 391 states and 580 transitions. [2019-11-20 04:11:49,948 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 580 transitions. [2019-11-20 04:11:49,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-20 04:11:49,950 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:11:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:11:50,007 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:11:50,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:11:50,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 393 states and 583 transitions. [2019-11-20 04:11:50,073 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 583 transitions. [2019-11-20 04:11:50,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-20 04:11:50,080 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:11:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:11:50,628 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:11:52,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:11:52,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 407 states and 605 transitions. [2019-11-20 04:11:52,873 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 605 transitions. [2019-11-20 04:11:52,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-20 04:11:52,876 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:11:52,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:11:52,946 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:11:54,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:11:54,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 418 states and 617 transitions. [2019-11-20 04:11:54,250 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 617 transitions. [2019-11-20 04:11:54,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-20 04:11:54,252 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:11:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:11:54,295 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 04:11:55,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:11:55,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 429 states and 630 transitions. [2019-11-20 04:11:55,787 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 630 transitions. [2019-11-20 04:11:55,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-20 04:11:55,788 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:11:55,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:11:55,827 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 04:11:57,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:11:57,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 438 states and 641 transitions. [2019-11-20 04:11:57,349 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 641 transitions. [2019-11-20 04:11:57,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 04:11:57,350 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:11:57,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:11:57,395 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:12:00,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:12:00,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 466 states and 675 transitions. [2019-11-20 04:12:00,701 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 675 transitions. [2019-11-20 04:12:00,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 04:12:00,702 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:12:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:12:00,770 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:12:02,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:12:02,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 479 states and 699 transitions. [2019-11-20 04:12:02,804 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 699 transitions. [2019-11-20 04:12:02,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 04:12:02,806 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:12:02,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:12:02,867 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:12:03,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:12:03,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 489 states and 710 transitions. [2019-11-20 04:12:03,833 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 710 transitions. [2019-11-20 04:12:03,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 04:12:03,834 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:12:03,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:12:03,891 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:12:04,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:12:04,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 493 states and 714 transitions. [2019-11-20 04:12:04,337 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 714 transitions. [2019-11-20 04:12:04,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 04:12:04,338 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:12:04,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:12:04,406 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:12:04,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:12:04,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 500 states and 721 transitions. [2019-11-20 04:12:04,636 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 721 transitions. [2019-11-20 04:12:04,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 04:12:04,637 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:12:04,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:12:04,693 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:12:04,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:12:04,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 501 states and 721 transitions. [2019-11-20 04:12:04,935 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 721 transitions. [2019-11-20 04:12:04,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-20 04:12:04,936 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:12:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:12:05,250 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:12:05,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:12:05,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 502 states and 722 transitions. [2019-11-20 04:12:05,863 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 722 transitions. [2019-11-20 04:12:05,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-20 04:12:05,864 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:12:05,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:12:05,910 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:12:06,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:12:06,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 509 states and 729 transitions. [2019-11-20 04:12:06,442 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 729 transitions. [2019-11-20 04:12:06,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-20 04:12:06,443 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:12:06,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:12:06,501 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:12:07,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:12:07,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 510 states and 729 transitions. [2019-11-20 04:12:07,088 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 729 transitions. [2019-11-20 04:12:07,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-20 04:12:07,089 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:12:07,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:12:07,245 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:12:08,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:12:08,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 580 states and 807 transitions. [2019-11-20 04:12:08,176 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 807 transitions. [2019-11-20 04:12:08,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-20 04:12:08,177 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:12:08,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:12:08,213 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:12:09,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:12:09,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 589 states and 820 transitions. [2019-11-20 04:12:09,421 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 820 transitions. [2019-11-20 04:12:09,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-20 04:12:09,422 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:12:09,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:12:09,455 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:12:10,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:12:10,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 601 states and 830 transitions. [2019-11-20 04:12:10,379 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 830 transitions. [2019-11-20 04:12:10,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-20 04:12:10,380 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:12:10,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:12:10,416 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:12:10,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:12:10,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 610 states and 842 transitions. [2019-11-20 04:12:10,526 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 842 transitions. [2019-11-20 04:12:10,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-20 04:12:10,528 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:12:10,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:12:10,635 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:12:11,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:12:11,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 623 states and 857 transitions. [2019-11-20 04:12:11,344 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 857 transitions. [2019-11-20 04:12:11,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-20 04:12:11,346 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:12:11,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:12:11,395 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 04:12:11,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:12:11,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 625 states and 858 transitions. [2019-11-20 04:12:11,654 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 858 transitions. [2019-11-20 04:12:11,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-20 04:12:11,656 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:12:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:12:11,804 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:12:12,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:12:12,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 629 states and 861 transitions. [2019-11-20 04:12:12,104 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 861 transitions. [2019-11-20 04:12:12,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-20 04:12:12,108 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:12:12,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:12:12,151 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 04:12:12,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:12:12,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 631 states and 862 transitions. [2019-11-20 04:12:12,417 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 862 transitions. [2019-11-20 04:12:12,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-20 04:12:12,419 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:12:12,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:12:12,635 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:12:13,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:12:13,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 645 states and 878 transitions. [2019-11-20 04:12:13,055 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 878 transitions. [2019-11-20 04:12:13,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-20 04:12:13,056 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:12:13,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:12:13,098 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 04:12:13,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:12:13,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 647 states and 881 transitions. [2019-11-20 04:12:13,133 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 881 transitions. [2019-11-20 04:12:13,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-20 04:12:13,134 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:12:13,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:12:13,749 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:12:17,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:12:17,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 692 states and 930 transitions. [2019-11-20 04:12:17,593 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 930 transitions. [2019-11-20 04:12:17,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-20 04:12:17,594 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:12:17,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:12:18,949 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 44 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:12:23,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:12:23,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 716 states and 963 transitions. [2019-11-20 04:12:23,357 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 963 transitions. [2019-11-20 04:12:23,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-20 04:12:23,358 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:12:23,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:12:23,649 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:12:24,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:12:24,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 729 states and 982 transitions. [2019-11-20 04:12:24,812 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 982 transitions. [2019-11-20 04:12:24,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-20 04:12:24,813 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:12:24,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:12:25,144 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 04:12:26,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:12:26,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 742 states and 1015 transitions. [2019-11-20 04:12:26,871 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1015 transitions. [2019-11-20 04:12:26,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-20 04:12:26,872 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:12:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:12:27,016 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 04:12:27,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:12:27,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 747 states and 1023 transitions. [2019-11-20 04:12:27,801 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1023 transitions. [2019-11-20 04:12:27,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-20 04:12:27,802 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:12:27,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:12:27,938 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 04:12:28,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:12:28,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 752 states and 1033 transitions. [2019-11-20 04:12:28,756 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1033 transitions. [2019-11-20 04:12:28,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-20 04:12:28,759 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:12:28,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:12:28,957 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:12:30,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:12:30,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 760 states and 1043 transitions. [2019-11-20 04:12:30,319 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1043 transitions. [2019-11-20 04:12:30,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-20 04:12:30,321 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:12:30,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:12:30,470 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:12:30,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:12:30,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 765 states and 1047 transitions. [2019-11-20 04:12:30,833 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1047 transitions. [2019-11-20 04:12:30,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-20 04:12:30,836 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:12:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:12:30,896 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 04:12:36,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:12:36,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 805 states and 1098 transitions. [2019-11-20 04:12:36,069 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1098 transitions. [2019-11-20 04:12:36,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-20 04:12:36,070 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:12:36,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:12:36,124 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 04:12:37,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:12:37,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 821 states and 1113 transitions. [2019-11-20 04:12:37,517 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1113 transitions. [2019-11-20 04:12:37,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-20 04:12:37,518 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:12:37,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:12:37,570 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 04:12:38,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:12:38,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 825 states and 1117 transitions. [2019-11-20 04:12:38,265 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1117 transitions. [2019-11-20 04:12:38,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-20 04:12:38,267 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:12:38,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:12:38,304 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 57 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-20 04:12:39,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:12:39,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 846 states and 1144 transitions. [2019-11-20 04:12:39,962 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1144 transitions. [2019-11-20 04:12:39,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-20 04:12:39,963 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:12:39,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:12:40,029 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-11-20 04:12:41,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:12:41,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 926 states and 1230 transitions. [2019-11-20 04:12:41,046 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1230 transitions. [2019-11-20 04:12:41,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-20 04:12:41,047 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:12:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:12:41,445 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 04:12:43,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:12:43,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 935 states and 1252 transitions. [2019-11-20 04:12:43,997 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1252 transitions. [2019-11-20 04:12:43,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-20 04:12:43,999 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:12:44,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:12:44,668 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 65 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 04:12:47,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:12:47,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 962 states and 1286 transitions. [2019-11-20 04:12:47,215 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1286 transitions. [2019-11-20 04:12:47,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-20 04:12:47,216 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:12:47,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:12:47,264 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 75 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-20 04:12:49,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:12:49,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 993 states and 1322 transitions. [2019-11-20 04:12:49,153 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1322 transitions. [2019-11-20 04:12:49,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-20 04:12:49,155 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:12:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:12:50,782 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:12:57,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:12:57,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1060 states and 1394 transitions. [2019-11-20 04:12:57,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1394 transitions. [2019-11-20 04:12:57,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-20 04:12:57,494 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:12:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:12:57,542 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-20 04:12:58,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:12:58,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1069 states and 1405 transitions. [2019-11-20 04:12:58,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1405 transitions. [2019-11-20 04:12:58,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-20 04:12:58,449 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:12:58,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:12:58,529 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-11-20 04:12:58,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:12:58,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1070 states and 1405 transitions. [2019-11-20 04:12:58,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1405 transitions. [2019-11-20 04:12:58,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-20 04:12:58,599 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:12:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:12:58,660 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-11-20 04:13:00,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:13:00,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1091 states and 1436 transitions. [2019-11-20 04:13:00,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1436 transitions. [2019-11-20 04:13:00,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-20 04:13:00,677 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:13:00,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:13:00,737 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-11-20 04:13:01,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:13:01,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1099 states and 1446 transitions. [2019-11-20 04:13:01,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1446 transitions. [2019-11-20 04:13:01,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-20 04:13:01,599 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:13:01,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:13:01,661 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 04:13:04,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:13:04,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1126 states and 1482 transitions. [2019-11-20 04:13:04,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1482 transitions. [2019-11-20 04:13:04,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-20 04:13:04,043 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:13:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:13:04,730 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 04:13:06,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:13:06,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1139 states and 1506 transitions. [2019-11-20 04:13:06,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1506 transitions. [2019-11-20 04:13:06,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-20 04:13:06,545 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:13:06,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:13:06,766 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 04:13:07,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:13:07,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1155 states and 1524 transitions. [2019-11-20 04:13:07,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1524 transitions. [2019-11-20 04:13:07,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-20 04:13:07,976 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:13:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:13:08,257 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 04:13:09,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:13:09,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1534 states to 1166 states and 1534 transitions. [2019-11-20 04:13:09,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1534 transitions. [2019-11-20 04:13:09,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-20 04:13:09,101 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:13:09,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:13:09,210 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 04:13:09,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:13:09,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1167 states and 1535 transitions. [2019-11-20 04:13:09,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1535 transitions. [2019-11-20 04:13:09,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-20 04:13:09,253 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:13:09,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:13:09,359 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:13:09,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:13:09,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1180 states and 1548 transitions. [2019-11-20 04:13:09,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1548 transitions. [2019-11-20 04:13:09,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-20 04:13:09,510 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:13:09,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:13:09,577 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-20 04:13:10,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:13:10,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1192 states and 1562 transitions. [2019-11-20 04:13:10,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1562 transitions. [2019-11-20 04:13:10,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-20 04:13:10,704 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:13:10,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:13:10,757 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-20 04:13:11,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:13:11,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1202 states and 1572 transitions. [2019-11-20 04:13:11,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1572 transitions. [2019-11-20 04:13:11,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-20 04:13:11,388 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:13:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:13:11,578 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 04:13:13,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:13:13,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1211 states and 1590 transitions. [2019-11-20 04:13:13,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1590 transitions. [2019-11-20 04:13:13,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-20 04:13:13,016 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:13:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:13:13,061 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 04:13:13,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:13:13,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1223 states and 1605 transitions. [2019-11-20 04:13:13,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1605 transitions. [2019-11-20 04:13:13,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-20 04:13:13,767 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:13:13,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:13:14,006 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-11-20 04:13:14,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:13:14,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1227 states and 1613 transitions. [2019-11-20 04:13:14,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 1613 transitions. [2019-11-20 04:13:14,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-20 04:13:14,633 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:13:14,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:13:15,960 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 91 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:13:20,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:13:20,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1276 states and 1668 transitions. [2019-11-20 04:13:20,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1668 transitions. [2019-11-20 04:13:20,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-20 04:13:20,864 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:13:20,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:13:20,945 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-20 04:13:23,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:13:23,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1306 states and 1705 transitions. [2019-11-20 04:13:23,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1705 transitions. [2019-11-20 04:13:23,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-20 04:13:23,565 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:13:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:13:23,646 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-20 04:13:24,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:13:24,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1709 states to 1310 states and 1709 transitions. [2019-11-20 04:13:24,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1709 transitions. [2019-11-20 04:13:24,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-20 04:13:24,321 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:13:24,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:13:24,432 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-20 04:13:26,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:13:26,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1740 states to 1330 states and 1740 transitions. [2019-11-20 04:13:26,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1740 transitions. [2019-11-20 04:13:26,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-20 04:13:26,972 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:13:27,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:13:27,203 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-20 04:13:28,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:13:28,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1339 states and 1751 transitions. [2019-11-20 04:13:28,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 1751 transitions. [2019-11-20 04:13:28,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-20 04:13:28,590 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:13:28,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:13:28,703 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-20 04:13:29,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:13:29,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1340 states and 1751 transitions. [2019-11-20 04:13:29,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1751 transitions. [2019-11-20 04:13:29,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-20 04:13:29,386 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:13:29,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:13:30,067 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 04:13:35,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:13:35,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1403 states and 1817 transitions. [2019-11-20 04:13:35,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states and 1817 transitions. [2019-11-20 04:13:35,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-20 04:13:35,243 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:13:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:13:35,392 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 04:13:35,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:13:35,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1820 states to 1408 states and 1820 transitions. [2019-11-20 04:13:35,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 1820 transitions. [2019-11-20 04:13:35,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-20 04:13:35,909 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:13:35,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:13:35,986 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-20 04:13:37,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:13:37,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1440 states and 1853 transitions. [2019-11-20 04:13:37,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 1853 transitions. [2019-11-20 04:13:37,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-20 04:13:37,648 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:13:37,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:13:38,181 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-20 04:13:40,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:13:40,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1864 states to 1444 states and 1864 transitions. [2019-11-20 04:13:40,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1864 transitions. [2019-11-20 04:13:40,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-20 04:13:40,466 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:13:40,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:13:40,530 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-20 04:13:41,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:13:41,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1468 states and 1890 transitions. [2019-11-20 04:13:41,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 1890 transitions. [2019-11-20 04:13:41,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-20 04:13:41,193 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:13:41,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:13:41,311 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-20 04:13:46,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:13:46,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1920 states to 1487 states and 1920 transitions. [2019-11-20 04:13:46,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1487 states and 1920 transitions. [2019-11-20 04:13:46,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-20 04:13:46,158 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:13:46,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:13:46,282 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-20 04:13:47,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:13:47,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1921 states to 1489 states and 1921 transitions. [2019-11-20 04:13:47,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 1921 transitions. [2019-11-20 04:13:47,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-20 04:13:47,773 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:13:47,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:13:47,907 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-20 04:13:48,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:13:48,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1495 states and 1927 transitions. [2019-11-20 04:13:48,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 1927 transitions. [2019-11-20 04:13:48,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-20 04:13:48,940 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:13:48,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:13:49,059 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-20 04:13:51,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:13:51,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1499 states and 1934 transitions. [2019-11-20 04:13:51,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 1934 transitions. [2019-11-20 04:13:51,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-20 04:13:51,043 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:13:51,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:13:51,160 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-20 04:13:54,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:13:54,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1524 states and 1963 transitions. [2019-11-20 04:13:54,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 1963 transitions. [2019-11-20 04:13:54,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-20 04:13:54,131 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:13:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:13:54,197 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-20 04:13:54,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:13:54,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1968 states to 1528 states and 1968 transitions. [2019-11-20 04:13:54,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 1968 transitions. [2019-11-20 04:13:54,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-20 04:13:54,919 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:13:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:13:54,988 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-20 04:13:55,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:13:55,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1968 states to 1529 states and 1968 transitions. [2019-11-20 04:13:55,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 1968 transitions. [2019-11-20 04:13:55,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-20 04:13:55,700 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:13:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:13:57,521 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:14:04,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:14:04,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 1594 states and 2037 transitions. [2019-11-20 04:14:04,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 2037 transitions. [2019-11-20 04:14:04,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-20 04:14:04,713 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:14:04,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:14:04,889 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:14:05,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:14:05,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 1603 states and 2046 transitions. [2019-11-20 04:14:05,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2046 transitions. [2019-11-20 04:14:05,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-20 04:14:05,984 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:14:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:14:06,074 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-20 04:14:07,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:14:07,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2069 states to 1625 states and 2069 transitions. [2019-11-20 04:14:07,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 2069 transitions. [2019-11-20 04:14:07,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-20 04:14:07,658 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:14:07,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:14:07,801 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-20 04:14:09,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:14:09,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 1636 states and 2079 transitions. [2019-11-20 04:14:09,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 2079 transitions. [2019-11-20 04:14:09,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-20 04:14:09,276 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:14:09,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:14:09,329 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-20 04:14:10,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:14:10,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2086 states to 1639 states and 2086 transitions. [2019-11-20 04:14:10,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1639 states and 2086 transitions. [2019-11-20 04:14:10,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-20 04:14:10,045 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:14:10,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:14:10,093 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-20 04:14:11,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:14:11,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 1643 states and 2090 transitions. [2019-11-20 04:14:11,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1643 states and 2090 transitions. [2019-11-20 04:14:11,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-20 04:14:11,934 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:14:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:14:11,985 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-20 04:14:13,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:14:13,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 1647 states and 2094 transitions. [2019-11-20 04:14:13,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2094 transitions. [2019-11-20 04:14:13,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-20 04:14:13,785 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:14:13,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:14:14,218 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 113 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 04:14:16,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:14:16,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2108 states to 1654 states and 2108 transitions. [2019-11-20 04:14:16,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 2108 transitions. [2019-11-20 04:14:16,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-20 04:14:16,787 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:14:16,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:14:17,077 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 113 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 04:14:17,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:14:17,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 1659 states and 2114 transitions. [2019-11-20 04:14:17,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2114 transitions. [2019-11-20 04:14:17,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-20 04:14:17,726 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:14:17,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:14:18,043 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 113 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 04:14:20,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:14:20,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2135 states to 1674 states and 2135 transitions. [2019-11-20 04:14:20,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2135 transitions. [2019-11-20 04:14:20,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-20 04:14:20,887 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:14:20,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:14:21,175 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 113 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 04:14:22,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:14:22,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2138 states to 1678 states and 2138 transitions. [2019-11-20 04:14:22,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 2138 transitions. [2019-11-20 04:14:22,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-20 04:14:22,994 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:14:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:14:23,328 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 113 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 04:14:24,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:14:24,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 1683 states and 2145 transitions. [2019-11-20 04:14:24,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2145 transitions. [2019-11-20 04:14:24,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-20 04:14:24,806 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:14:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:14:25,224 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 183 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-20 04:14:26,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 04:14:26,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 1691 states and 2156 transitions. [2019-11-20 04:14:26,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 2156 transitions. [2019-11-20 04:14:26,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-11-20 04:14:26,396 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 04:14:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 04:14:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 04:14:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 04:14:26,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 04:14:26,803 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 121 iterations. [2019-11-20 04:14:27,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 20.11 04:14:27 ImpRootNode [2019-11-20 04:14:27,165 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2019-11-20 04:14:27,165 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 04:14:27,166 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 04:14:27,166 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 04:14:27,166 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:11:19" (3/4) ... [2019-11-20 04:14:27,169 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 04:14:27,384 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f4ded20e-ff25-4981-97d8-648cbe13fc0d/bin/ukojak/witness.graphml [2019-11-20 04:14:27,384 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 04:14:27,387 INFO L168 Benchmark]: Toolchain (without parser) took 191457.40 ms. Allocated memory was 1.0 GB in the beginning and 3.2 GB in the end (delta: 2.2 GB). Free memory was 944.8 MB in the beginning and 1.4 GB in the end (delta: -425.5 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-11-20 04:14:27,387 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 04:14:27,390 INFO L168 Benchmark]: CACSL2BoogieTranslator took 784.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -166.2 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2019-11-20 04:14:27,391 INFO L168 Benchmark]: Boogie Procedure Inliner took 108.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 04:14:27,391 INFO L168 Benchmark]: Boogie Preprocessor took 99.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 04:14:27,392 INFO L168 Benchmark]: RCFGBuilder took 2768.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 893.4 MB in the end (delta: 206.9 MB). Peak memory consumption was 206.9 MB. Max. memory is 11.5 GB. [2019-11-20 04:14:27,392 INFO L168 Benchmark]: CodeCheck took 187471.69 ms. Allocated memory was 1.2 GB in the beginning and 3.2 GB in the end (delta: 2.0 GB). Free memory was 893.4 MB in the beginning and 1.4 GB in the end (delta: -533.3 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-11-20 04:14:27,393 INFO L168 Benchmark]: Witness Printer took 218.91 ms. Allocated memory is still 3.2 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 56.4 MB). Peak memory consumption was 56.4 MB. Max. memory is 11.5 GB. [2019-11-20 04:14:27,395 INFO L335 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. Result: UNSAFE, OverallTime: 187.0s, OverallIterations: 121, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1648443400 SDtfs, 1107651306 SDslu, 1330612144 SDs, 0 SdLazy, -479393994 SolverSat, 59314256 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 589.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 109520 GetRequests, 106883 SyntacticMatches, 1325 SemanticMatches, 1312 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1210090 ImplicationChecksByTransitivity, 163.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.6s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 19.8s InterpolantComputationTime, 15418 NumberOfCodeBlocks, 15418 NumberOfCodeBlocksAsserted, 121 NumberOfCheckSat, 15123 ConstructedInterpolants, 0 QuantifiedInterpolants, 6445152 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 120 InterpolantComputations, 109 PerfectInterpolantSequences, 8873/9043 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: 428]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int d= 4; [L9] int e= 5; [L10] int f= 6; [L11] int c= 3; [L12] int b= 2; [L15] int u = 21; [L16] int v = 22; [L17] int w = 23; [L18] int x = 24; [L19] int y = 25; [L20] int z = 26; [L22] int a17 = 1; [L23] int a7 = 0; [L24] int a20 = 1; [L25] int a8 = 15; [L26] int a12 = 8; [L27] int a16 = 5; [L28] int a21 = 1; [L580] 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] [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND TRUE (((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8)) [L32] a16 = 5 [L33] a20 = 0 [L34] return 24; VAL [a=1, a12=8, a16=5, 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] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] 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=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] [L35] 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=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] [L43] 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=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] [L49] 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=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] [L54] 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=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] [L62] 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=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] [L65] 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=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 !(((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=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] [L80] 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=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] [L84] 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=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] [L92] 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=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] [L97] 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=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 !((((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=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] [L108] 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=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] [L114] 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=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] [L119] 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=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 !(((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=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 !((((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=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] [L136] 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=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] [L140] 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=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] [L144] 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=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] [L148] 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=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] [L152] 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=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] [L160] 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=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] [L165] 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=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] [L173] 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=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] [L178] 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=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] [L186] 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=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] [L189] 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=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] [L194] 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=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] [L197] 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=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] [L203] 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=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] [L208] 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=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] [L214] 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=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 !((!(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=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] [L223] 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=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] [L231] 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=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] [L238] 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=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] [L245] 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=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] [L250] 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=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] [L256] 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=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] [L261] 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=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] [L265] COND TRUE ((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15))) [L266] a17 = 0 [L267] return 24; VAL [a=1, a12=8, a16=5, 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] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] 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=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] [L35] 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=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] [L43] 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=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] [L49] 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=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] [L54] 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=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] [L62] 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=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] [L65] 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=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 !(((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=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] [L80] 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=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] [L84] 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=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] [L92] 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=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] [L97] 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=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 !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, 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] [L108] 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=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] [L114] 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=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] [L119] 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=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 !(((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=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 !((((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=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] [L136] 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=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] [L140] 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=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] [L144] 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=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] [L148] 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=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] [L152] 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=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] [L160] 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=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] [L165] 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=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] [L173] 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=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] [L178] 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=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] [L186] 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=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] [L189] 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=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] [L194] 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=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] [L197] 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=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] [L203] 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=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] [L208] 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=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] [L214] 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=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 !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, 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] [L223] 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=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] [L231] 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=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] [L238] 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=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] [L245] 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=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] [L250] 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=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] [L256] 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=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] [L261] 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=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] [L265] 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=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] [L268] 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=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] [L273] 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=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 !((((((((!(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=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] [L286] 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=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] [L292] 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=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] [L299] 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=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] [L306] 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=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] [L312] COND TRUE ((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5)) [L313] a8 = 13 [L314] a16 = 4 [L315] return -1; VAL [a=1, a12=8, a16=4, a17=0, a20=0, 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] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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 !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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 !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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 !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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 !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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 !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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 !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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 !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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 !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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] [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=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 !(((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)))))))) [L391] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L394] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L397] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L400] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L403] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L406] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L409] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L412] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L415] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L418] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L421] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L424] 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=0, 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] [L427] 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=0, 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] [L428] __VERIFIER_error() VAL [a=1, a12=8, a16=4, a17=0, a20=0, 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 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 784.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -166.2 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 108.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 99.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2768.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 893.4 MB in the end (delta: 206.9 MB). Peak memory consumption was 206.9 MB. Max. memory is 11.5 GB. * CodeCheck took 187471.69 ms. Allocated memory was 1.2 GB in the beginning and 3.2 GB in the end (delta: 2.0 GB). Free memory was 893.4 MB in the beginning and 1.4 GB in the end (delta: -533.3 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 218.91 ms. Allocated memory is still 3.2 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 56.4 MB). Peak memory consumption was 56.4 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...