./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label43_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_77411974-99fe-4e3e-840e-7d3ca35e96e5/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_77411974-99fe-4e3e-840e-7d3ca35e96e5/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_77411974-99fe-4e3e-840e-7d3ca35e96e5/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_77411974-99fe-4e3e-840e-7d3ca35e96e5/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label43_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_77411974-99fe-4e3e-840e-7d3ca35e96e5/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_77411974-99fe-4e3e-840e-7d3ca35e96e5/bin-2019/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 3aae675ead2f575cce05887b769a7a66f133447b ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.23-635dfa2 [2018-12-02 18:45:35,573 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 18:45:35,574 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 18:45:35,580 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 18:45:35,580 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 18:45:35,581 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 18:45:35,581 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 18:45:35,582 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 18:45:35,583 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 18:45:35,583 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 18:45:35,584 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 18:45:35,584 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 18:45:35,584 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 18:45:35,585 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 18:45:35,585 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 18:45:35,586 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 18:45:35,586 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 18:45:35,587 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 18:45:35,588 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 18:45:35,588 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 18:45:35,589 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 18:45:35,590 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 18:45:35,591 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 18:45:35,591 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 18:45:35,591 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 18:45:35,591 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 18:45:35,592 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 18:45:35,592 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 18:45:35,593 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 18:45:35,593 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 18:45:35,593 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 18:45:35,593 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 18:45:35,594 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 18:45:35,594 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 18:45:35,594 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 18:45:35,594 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 18:45:35,595 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_77411974-99fe-4e3e-840e-7d3ca35e96e5/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-02 18:45:35,601 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 18:45:35,602 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 18:45:35,602 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 18:45:35,602 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-02 18:45:35,602 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 18:45:35,603 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 18:45:35,603 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 18:45:35,603 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 18:45:35,603 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 18:45:35,603 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 18:45:35,603 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 18:45:35,603 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 18:45:35,603 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 18:45:35,603 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 18:45:35,603 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 18:45:35,603 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 18:45:35,603 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 18:45:35,604 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 18:45:35,604 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-02 18:45:35,604 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-02 18:45:35,604 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 18:45:35,604 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 18:45:35,604 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-02 18:45:35,604 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 18:45:35,604 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 18:45:35,604 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 18:45:35,604 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-02 18:45:35,604 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 18:45:35,605 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 18:45:35,605 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_77411974-99fe-4e3e-840e-7d3ca35e96e5/bin-2019/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 -> 3aae675ead2f575cce05887b769a7a66f133447b [2018-12-02 18:45:35,622 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 18:45:35,631 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 18:45:35,634 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 18:45:35,635 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 18:45:35,635 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 18:45:35,636 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_77411974-99fe-4e3e-840e-7d3ca35e96e5/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem02_label43_false-unreach-call_false-termination.c [2018-12-02 18:45:35,681 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_77411974-99fe-4e3e-840e-7d3ca35e96e5/bin-2019/ukojak/data/ceda754cc/89fcc5697e8e4304ae5fb9fd77bc68a1/FLAG11b2d6442 [2018-12-02 18:45:36,102 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 18:45:36,103 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_77411974-99fe-4e3e-840e-7d3ca35e96e5/sv-benchmarks/c/eca-rers2012/Problem02_label43_false-unreach-call_false-termination.c [2018-12-02 18:45:36,109 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_77411974-99fe-4e3e-840e-7d3ca35e96e5/bin-2019/ukojak/data/ceda754cc/89fcc5697e8e4304ae5fb9fd77bc68a1/FLAG11b2d6442 [2018-12-02 18:45:36,117 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_77411974-99fe-4e3e-840e-7d3ca35e96e5/bin-2019/ukojak/data/ceda754cc/89fcc5697e8e4304ae5fb9fd77bc68a1 [2018-12-02 18:45:36,119 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 18:45:36,120 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 18:45:36,120 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 18:45:36,121 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 18:45:36,123 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 18:45:36,123 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:45:36" (1/1) ... [2018-12-02 18:45:36,124 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ba821c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:45:36, skipping insertion in model container [2018-12-02 18:45:36,125 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:45:36" (1/1) ... [2018-12-02 18:45:36,129 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 18:45:36,151 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 18:45:36,323 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 18:45:36,326 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 18:45:36,417 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 18:45:36,427 INFO L195 MainTranslator]: Completed translation [2018-12-02 18:45:36,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:45:36 WrapperNode [2018-12-02 18:45:36,427 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 18:45:36,428 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 18:45:36,428 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 18:45:36,428 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 18:45:36,433 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:45:36" (1/1) ... [2018-12-02 18:45:36,441 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:45:36" (1/1) ... [2018-12-02 18:45:36,466 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 18:45:36,466 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 18:45:36,466 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 18:45:36,467 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 18:45:36,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:45:36" (1/1) ... [2018-12-02 18:45:36,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:45:36" (1/1) ... [2018-12-02 18:45:36,475 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:45:36" (1/1) ... [2018-12-02 18:45:36,475 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:45:36" (1/1) ... [2018-12-02 18:45:36,483 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:45:36" (1/1) ... [2018-12-02 18:45:36,489 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:45:36" (1/1) ... [2018-12-02 18:45:36,492 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:45:36" (1/1) ... [2018-12-02 18:45:36,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 18:45:36,495 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 18:45:36,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 18:45:36,495 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 18:45:36,496 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:45:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_77411974-99fe-4e3e-840e-7d3ca35e96e5/bin-2019/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 [2018-12-02 18:45:36,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 18:45:36,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 18:45:37,543 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 18:45:37,543 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-02 18:45:37,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:45:37 BoogieIcfgContainer [2018-12-02 18:45:37,544 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 18:45:37,544 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-02 18:45:37,544 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-02 18:45:37,552 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-02 18:45:37,552 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:45:37" (1/1) ... [2018-12-02 18:45:37,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:45:37,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 18:45:37,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 85 states and 162 transitions. [2018-12-02 18:45:37,585 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 162 transitions. [2018-12-02 18:45:37,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-02 18:45:37,589 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 18:45:37,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:45:37,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 18:45:38,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 18:45:38,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 163 states and 276 transitions. [2018-12-02 18:45:38,069 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 276 transitions. [2018-12-02 18:45:38,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-02 18:45:38,071 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 18:45:38,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:45:38,129 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 18:45:38,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 18:45:38,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 166 states and 281 transitions. [2018-12-02 18:45:38,181 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 281 transitions. [2018-12-02 18:45:38,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-02 18:45:38,182 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 18:45:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:45:38,227 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 18:45:38,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 18:45:38,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 170 states and 287 transitions. [2018-12-02 18:45:38,367 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 287 transitions. [2018-12-02 18:45:38,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-02 18:45:38,368 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 18:45:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:45:38,415 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 18:45:38,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 18:45:38,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 175 states and 296 transitions. [2018-12-02 18:45:38,521 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 296 transitions. [2018-12-02 18:45:38,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-02 18:45:38,524 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 18:45:38,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:45:38,551 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 18:45:38,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 18:45:38,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 181 states and 308 transitions. [2018-12-02 18:45:38,700 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 308 transitions. [2018-12-02 18:45:38,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-02 18:45:38,701 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 18:45:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:45:38,731 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 18:45:38,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 18:45:38,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 185 states and 316 transitions. [2018-12-02 18:45:38,892 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 316 transitions. [2018-12-02 18:45:38,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-02 18:45:38,893 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 18:45:38,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:45:38,907 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 18:45:38,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 18:45:38,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 188 states and 321 transitions. [2018-12-02 18:45:38,977 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 321 transitions. [2018-12-02 18:45:38,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-02 18:45:38,978 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 18:45:38,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:45:39,048 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 18:45:39,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 18:45:39,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 267 states and 403 transitions. [2018-12-02 18:45:39,479 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 403 transitions. [2018-12-02 18:45:39,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 18:45:39,480 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 18:45:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:45:39,502 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 18:45:39,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 18:45:39,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 271 states and 409 transitions. [2018-12-02 18:45:39,661 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 409 transitions. [2018-12-02 18:45:39,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-02 18:45:39,663 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 18:45:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:45:39,680 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 18:45:39,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 18:45:39,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 274 states and 412 transitions. [2018-12-02 18:45:39,755 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 412 transitions. [2018-12-02 18:45:39,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 18:45:39,756 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 18:45:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:45:39,772 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 18:45:39,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 18:45:39,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 277 states and 415 transitions. [2018-12-02 18:45:39,800 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 415 transitions. [2018-12-02 18:45:39,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-02 18:45:39,801 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 18:45:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:45:39,817 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 18:45:39,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 18:45:39,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 280 states and 418 transitions. [2018-12-02 18:45:39,838 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 418 transitions. [2018-12-02 18:45:39,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 18:45:39,838 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 18:45:39,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:45:39,852 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 18:45:39,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 18:45:39,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 282 states and 420 transitions. [2018-12-02 18:45:39,877 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 420 transitions. [2018-12-02 18:45:39,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-02 18:45:39,878 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 18:45:39,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:45:39,897 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 18:45:39,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 18:45:39,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 287 states and 425 transitions. [2018-12-02 18:45:39,931 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 425 transitions. [2018-12-02 18:45:39,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 18:45:39,932 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 18:45:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:45:39,950 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 18:45:39,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 18:45:39,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 289 states and 427 transitions. [2018-12-02 18:45:39,966 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 427 transitions. [2018-12-02 18:45:39,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 18:45:39,967 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 18:45:39,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:45:39,985 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 18:45:40,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 18:45:40,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 299 states and 440 transitions. [2018-12-02 18:45:40,161 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 440 transitions. [2018-12-02 18:45:40,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 18:45:40,161 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 18:45:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:45:40,213 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 18:45:40,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 18:45:40,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 309 states and 453 transitions. [2018-12-02 18:45:40,466 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 453 transitions. [2018-12-02 18:45:40,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-02 18:45:40,466 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 18:45:40,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:45:40,529 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-02 18:45:40,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 18:45:40,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 327 states and 480 transitions. [2018-12-02 18:45:40,890 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 480 transitions. [2018-12-02 18:45:40,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-02 18:45:40,891 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 18:45:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:45:40,902 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 18:45:40,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 18:45:40,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 331 states and 484 transitions. [2018-12-02 18:45:40,923 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 484 transitions. [2018-12-02 18:45:40,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-02 18:45:40,923 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 18:45:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:45:40,935 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 18:45:40,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 18:45:40,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 332 states and 485 transitions. [2018-12-02 18:45:40,945 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 485 transitions. [2018-12-02 18:45:40,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-02 18:45:40,945 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 18:45:40,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:45:40,958 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 18:45:41,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 18:45:41,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 337 states and 491 transitions. [2018-12-02 18:45:41,021 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 491 transitions. [2018-12-02 18:45:41,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-02 18:45:41,022 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 18:45:41,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:45:41,064 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 18:45:41,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 18:45:41,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 357 states and 514 transitions. [2018-12-02 18:45:41,371 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 514 transitions. [2018-12-02 18:45:41,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-02 18:45:41,372 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 18:45:41,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:45:41,386 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 18:45:41,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 18:45:41,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 358 states and 515 transitions. [2018-12-02 18:45:41,406 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 515 transitions. [2018-12-02 18:45:41,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-02 18:45:41,406 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 18:45:41,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:45:41,429 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 18:45:41,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 18:45:41,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 364 states and 522 transitions. [2018-12-02 18:45:41,515 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 522 transitions. [2018-12-02 18:45:41,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-02 18:45:41,515 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 18:45:41,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:45:41,591 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 18:45:41,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 18:45:41,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 377 states and 538 transitions. [2018-12-02 18:45:41,970 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 538 transitions. [2018-12-02 18:45:41,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-02 18:45:41,970 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 18:45:41,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:45:42,007 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 18:45:42,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 18:45:42,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 456 states and 622 transitions. [2018-12-02 18:45:42,413 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 622 transitions. [2018-12-02 18:45:42,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-02 18:45:42,414 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 18:45:42,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:45:42,431 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-02 18:45:42,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 18:45:42,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 460 states and 628 transitions. [2018-12-02 18:45:42,627 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 628 transitions. [2018-12-02 18:45:42,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-02 18:45:42,628 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 18:45:42,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:45:42,646 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-02 18:45:42,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 18:45:42,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 463 states and 631 transitions. [2018-12-02 18:45:42,747 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 631 transitions. [2018-12-02 18:45:42,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-02 18:45:42,748 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 18:45:42,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:45:42,769 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 18:45:42,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 18:45:42,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 470 states and 638 transitions. [2018-12-02 18:45:42,804 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 638 transitions. [2018-12-02 18:45:42,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-02 18:45:42,805 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 18:45:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:45:42,862 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 18:45:43,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 18:45:43,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 477 states and 647 transitions. [2018-12-02 18:45:43,181 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 647 transitions. [2018-12-02 18:45:43,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-02 18:45:43,182 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 18:45:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:45:43,229 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 18:45:43,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 18:45:43,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 493 states and 667 transitions. [2018-12-02 18:45:43,745 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 667 transitions. [2018-12-02 18:45:43,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-02 18:45:43,746 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 18:45:43,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:45:43,787 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 18:45:43,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 18:45:43,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 496 states and 670 transitions. [2018-12-02 18:45:43,891 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 670 transitions. [2018-12-02 18:45:43,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-02 18:45:43,892 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 18:45:43,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:45:43,986 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 18:45:44,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 18:45:44,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 503 states and 687 transitions. [2018-12-02 18:45:44,514 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 687 transitions. [2018-12-02 18:45:44,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-02 18:45:44,515 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 18:45:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:45:44,538 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 18:45:44,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 18:45:44,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 506 states and 691 transitions. [2018-12-02 18:45:44,661 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 691 transitions. [2018-12-02 18:45:44,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-02 18:45:44,662 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 18:45:44,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 18:45:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 18:45:44,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 18:45:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 18:45:44,771 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 35 iterations. [2018-12-02 18:45:44,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 02.12 06:45:44 ImpRootNode [2018-12-02 18:45:44,827 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-02 18:45:44,827 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 18:45:44,827 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 18:45:44,827 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 18:45:44,828 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:45:37" (3/4) ... [2018-12-02 18:45:44,829 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 18:45:44,921 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_77411974-99fe-4e3e-840e-7d3ca35e96e5/bin-2019/ukojak/witness.graphml [2018-12-02 18:45:44,921 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 18:45:44,922 INFO L168 Benchmark]: Toolchain (without parser) took 8802.16 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 361.8 MB). Free memory was 950.6 MB in the beginning and 882.3 MB in the end (delta: 68.4 MB). Peak memory consumption was 430.1 MB. Max. memory is 11.5 GB. [2018-12-02 18:45:44,923 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 18:45:44,923 INFO L168 Benchmark]: CACSL2BoogieTranslator took 306.92 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -150.9 MB). Peak memory consumption was 44.1 MB. Max. memory is 11.5 GB. [2018-12-02 18:45:44,923 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.62 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2018-12-02 18:45:44,924 INFO L168 Benchmark]: Boogie Preprocessor took 28.62 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 18:45:44,924 INFO L168 Benchmark]: RCFGBuilder took 1048.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 869.6 MB in the end (delta: 224.7 MB). Peak memory consumption was 224.7 MB. Max. memory is 11.5 GB. [2018-12-02 18:45:44,924 INFO L168 Benchmark]: CodeCheck took 7282.89 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 242.2 MB). Free memory was 869.6 MB in the beginning and 893.9 MB in the end (delta: -24.3 MB). Peak memory consumption was 217.9 MB. Max. memory is 11.5 GB. [2018-12-02 18:45:44,924 INFO L168 Benchmark]: Witness Printer took 93.79 ms. Allocated memory is still 1.4 GB. Free memory was 893.9 MB in the beginning and 882.3 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 11.5 GB. [2018-12-02 18:45:44,926 INFO L336 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, 227 locations, 1 error locations. UNSAFE Result, 7.2s OverallTime, 35 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: -65796292 SDtfs, 1286419482 SDslu, -327930756 SDs, 0 SdLazy, 184390170 SolverSat, -1650435664 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 26.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 26248 GetRequests, 25982 SyntacticMatches, 52 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25276 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 3554 NumberOfCodeBlocks, 3554 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 3406 ConstructedInterpolants, 0 QuantifiedInterpolants, 555161 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 862/862 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 427]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND TRUE (((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1)) [L166] a25 = 1 [L167] a28 = 9 [L168] return 26; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND TRUE (((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8)) [L31] a28 = 9 [L32] a11 = 1 [L33] a25 = 1 [L34] return -1; VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, 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)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, 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)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L394] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L398] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L402] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L407] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L409] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) [L414] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) [L417] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) [L420] COND FALSE !(((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8))) [L423] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L426] COND TRUE ((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8)) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L427] __VERIFIER_error() VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 306.92 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -150.9 MB). Peak memory consumption was 44.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.62 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.62 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1048.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 869.6 MB in the end (delta: 224.7 MB). Peak memory consumption was 224.7 MB. Max. memory is 11.5 GB. * CodeCheck took 7282.89 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 242.2 MB). Free memory was 869.6 MB in the beginning and 893.9 MB in the end (delta: -24.3 MB). Peak memory consumption was 217.9 MB. Max. memory is 11.5 GB. * Witness Printer took 93.79 ms. Allocated memory is still 1.4 GB. Free memory was 893.9 MB in the beginning and 882.3 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...