./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.3.ufo.UNBOUNDED.pals.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_45a48bb0-b27f-475f-a333-cdd6ba4d1a7a/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_45a48bb0-b27f-475f-a333-cdd6ba4d1a7a/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_45a48bb0-b27f-475f-a333-cdd6ba4d1a7a/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_45a48bb0-b27f-475f-a333-cdd6ba4d1a7a/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.3.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/working_dir_45a48bb0-b27f-475f-a333-cdd6ba4d1a7a/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_45a48bb0-b27f-475f-a333-cdd6ba4d1a7a/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 fca7014573b2ba8b0b911628482f19638a6ab990 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-09 15:31:00,142 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 15:31:00,143 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 15:31:00,149 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 15:31:00,150 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 15:31:00,150 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 15:31:00,151 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 15:31:00,151 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 15:31:00,152 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 15:31:00,152 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 15:31:00,153 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 15:31:00,153 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 15:31:00,153 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 15:31:00,154 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 15:31:00,154 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 15:31:00,155 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 15:31:00,155 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 15:31:00,156 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 15:31:00,157 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 15:31:00,157 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 15:31:00,158 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 15:31:00,158 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 15:31:00,159 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 15:31:00,160 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 15:31:00,160 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 15:31:00,160 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 15:31:00,161 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 15:31:00,161 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 15:31:00,161 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 15:31:00,162 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 15:31:00,162 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 15:31:00,162 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 15:31:00,162 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 15:31:00,162 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 15:31:00,163 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 15:31:00,163 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 15:31:00,163 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_45a48bb0-b27f-475f-a333-cdd6ba4d1a7a/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-09 15:31:00,170 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 15:31:00,170 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 15:31:00,171 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 15:31:00,171 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-09 15:31:00,171 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 15:31:00,172 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 15:31:00,172 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 15:31:00,172 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 15:31:00,172 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 15:31:00,172 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 15:31:00,172 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 15:31:00,172 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 15:31:00,172 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 15:31:00,173 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 15:31:00,173 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 15:31:00,173 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 15:31:00,173 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 15:31:00,173 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 15:31:00,173 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-09 15:31:00,174 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-09 15:31:00,174 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 15:31:00,174 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 15:31:00,174 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-09 15:31:00,174 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 15:31:00,174 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 15:31:00,174 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 15:31:00,175 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-09 15:31:00,175 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 15:31:00,175 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 15:31:00,175 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_45a48bb0-b27f-475f-a333-cdd6ba4d1a7a/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 -> fca7014573b2ba8b0b911628482f19638a6ab990 [2018-12-09 15:31:00,198 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 15:31:00,207 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 15:31:00,209 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 15:31:00,211 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 15:31:00,211 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 15:31:00,211 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_45a48bb0-b27f-475f-a333-cdd6ba4d1a7a/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.3.ufo.UNBOUNDED.pals.c [2018-12-09 15:31:00,250 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_45a48bb0-b27f-475f-a333-cdd6ba4d1a7a/bin-2019/ukojak/data/4772c4c16/f6d6ccf4445a436abc0ea310a22ad1ae/FLAG82fd214d5 [2018-12-09 15:31:00,686 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 15:31:00,687 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_45a48bb0-b27f-475f-a333-cdd6ba4d1a7a/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.3.ufo.UNBOUNDED.pals.c [2018-12-09 15:31:00,692 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_45a48bb0-b27f-475f-a333-cdd6ba4d1a7a/bin-2019/ukojak/data/4772c4c16/f6d6ccf4445a436abc0ea310a22ad1ae/FLAG82fd214d5 [2018-12-09 15:31:00,700 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_45a48bb0-b27f-475f-a333-cdd6ba4d1a7a/bin-2019/ukojak/data/4772c4c16/f6d6ccf4445a436abc0ea310a22ad1ae [2018-12-09 15:31:00,702 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 15:31:00,703 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 15:31:00,703 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 15:31:00,703 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 15:31:00,705 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 15:31:00,706 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:31:00" (1/1) ... [2018-12-09 15:31:00,707 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@354f5439 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:31:00, skipping insertion in model container [2018-12-09 15:31:00,707 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:31:00" (1/1) ... [2018-12-09 15:31:00,711 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 15:31:00,730 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 15:31:00,852 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 15:31:00,857 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 15:31:00,928 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 15:31:00,940 INFO L195 MainTranslator]: Completed translation [2018-12-09 15:31:00,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:31:00 WrapperNode [2018-12-09 15:31:00,941 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 15:31:00,941 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 15:31:00,941 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 15:31:00,941 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 15:31:00,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:31:00" (1/1) ... [2018-12-09 15:31:00,952 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:31:00" (1/1) ... [2018-12-09 15:31:00,969 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 15:31:00,969 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 15:31:00,969 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 15:31:00,969 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 15:31:00,975 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:31:00" (1/1) ... [2018-12-09 15:31:00,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:31:00" (1/1) ... [2018-12-09 15:31:00,976 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:31:00" (1/1) ... [2018-12-09 15:31:00,976 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:31:00" (1/1) ... [2018-12-09 15:31:00,980 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:31:00" (1/1) ... [2018-12-09 15:31:00,985 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:31:00" (1/1) ... [2018-12-09 15:31:00,987 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:31:00" (1/1) ... [2018-12-09 15:31:00,989 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 15:31:00,989 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 15:31:00,989 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 15:31:00,989 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 15:31:00,989 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:31:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_45a48bb0-b27f-475f-a333-cdd6ba4d1a7a/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-09 15:31:01,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 15:31:01,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 15:31:02,473 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 15:31:02,474 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-12-09 15:31:02,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:31:02 BoogieIcfgContainer [2018-12-09 15:31:02,474 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 15:31:02,474 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-09 15:31:02,474 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-09 15:31:02,482 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-09 15:31:02,483 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:31:02" (1/1) ... [2018-12-09 15:31:02,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:31:02,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:31:02,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 18 states and 29 transitions. [2018-12-09 15:31:02,512 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 29 transitions. [2018-12-09 15:31:02,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-09 15:31:02,513 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:31:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:31:02,791 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-09 15:31:02,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:31:02,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 19 states and 31 transitions. [2018-12-09 15:31:02,860 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 31 transitions. [2018-12-09 15:31:02,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-09 15:31:02,860 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:31:02,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:31:02,962 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-09 15:31:03,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:31:03,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 22 states and 37 transitions. [2018-12-09 15:31:03,138 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 37 transitions. [2018-12-09 15:31:03,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-09 15:31:03,140 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:31:03,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:31:03,262 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-09 15:31:03,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:31:03,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 26 states and 45 transitions. [2018-12-09 15:31:03,505 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 45 transitions. [2018-12-09 15:31:03,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 15:31:03,506 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:31:03,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:31:03,590 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-09 15:31:03,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:31:03,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 31 states and 55 transitions. [2018-12-09 15:31:03,979 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 55 transitions. [2018-12-09 15:31:03,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 15:31:03,980 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:31:04,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:31:04,087 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-09 15:31:04,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:31:04,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 38 states and 67 transitions. [2018-12-09 15:31:04,649 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 67 transitions. [2018-12-09 15:31:04,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-09 15:31:04,650 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:31:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:31:04,791 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-09 15:31:06,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:31:06,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 44 states and 78 transitions. [2018-12-09 15:31:06,041 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 78 transitions. [2018-12-09 15:31:06,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-09 15:31:06,042 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:31:06,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:31:06,107 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-09 15:31:06,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:31:06,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 45 states and 78 transitions. [2018-12-09 15:31:06,242 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 78 transitions. [2018-12-09 15:31:06,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 15:31:06,243 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:31:06,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:31:06,272 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-09 15:31:06,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:31:06,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 46 states and 79 transitions. [2018-12-09 15:31:06,282 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 79 transitions. [2018-12-09 15:31:06,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 15:31:06,282 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:31:06,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:31:06,428 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-09 15:31:08,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:31:08,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 56 states and 95 transitions. [2018-12-09 15:31:08,375 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 95 transitions. [2018-12-09 15:31:08,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 15:31:08,375 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:31:08,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:31:08,514 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-09 15:31:08,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:31:08,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 59 states and 107 transitions. [2018-12-09 15:31:08,689 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 107 transitions. [2018-12-09 15:31:08,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 15:31:08,689 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:31:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:31:09,235 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:12,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:31:12,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 74 states and 137 transitions. [2018-12-09 15:31:12,156 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 137 transitions. [2018-12-09 15:31:12,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 15:31:12,157 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:31:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:31:12,458 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:15,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:31:15,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 86 states and 157 transitions. [2018-12-09 15:31:15,645 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 157 transitions. [2018-12-09 15:31:15,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 15:31:15,646 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:31:15,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:31:15,811 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:16,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:31:16,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 87 states and 158 transitions. [2018-12-09 15:31:16,001 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 158 transitions. [2018-12-09 15:31:16,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 15:31:16,001 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:31:16,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:31:16,452 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:22,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:31:22,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 101 states and 184 transitions. [2018-12-09 15:31:22,282 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 184 transitions. [2018-12-09 15:31:22,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 15:31:22,283 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:31:22,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:31:22,367 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:22,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:31:22,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 103 states and 189 transitions. [2018-12-09 15:31:22,869 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 189 transitions. [2018-12-09 15:31:22,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 15:31:22,870 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:31:22,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:31:23,267 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:27,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:31:27,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 109 states and 204 transitions. [2018-12-09 15:31:27,763 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 204 transitions. [2018-12-09 15:31:27,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 15:31:27,764 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:31:27,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:31:27,875 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:28,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:31:28,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 111 states and 209 transitions. [2018-12-09 15:31:28,624 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 209 transitions. [2018-12-09 15:31:28,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 15:31:28,625 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:31:28,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:31:29,686 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:30,848 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2018-12-09 15:31:34,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:31:34,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 118 states and 225 transitions. [2018-12-09 15:31:34,621 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 225 transitions. [2018-12-09 15:31:34,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 15:31:34,622 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:31:34,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:31:34,732 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:36,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:31:36,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 122 states and 234 transitions. [2018-12-09 15:31:36,208 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 234 transitions. [2018-12-09 15:31:36,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 15:31:36,208 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:31:36,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:31:36,331 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:37,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:31:37,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 124 states and 239 transitions. [2018-12-09 15:31:37,076 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 239 transitions. [2018-12-09 15:31:37,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 15:31:37,076 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:31:37,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:31:37,592 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:42,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:31:42,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 139 states and 267 transitions. [2018-12-09 15:31:42,143 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 267 transitions. [2018-12-09 15:31:42,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 15:31:42,143 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:31:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:31:42,313 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:43,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:31:43,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 144 states and 274 transitions. [2018-12-09 15:31:43,335 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 274 transitions. [2018-12-09 15:31:43,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 15:31:43,335 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:31:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:31:43,503 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:44,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:31:44,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 146 states and 277 transitions. [2018-12-09 15:31:44,451 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 277 transitions. [2018-12-09 15:31:44,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 15:31:44,451 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:31:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:31:45,080 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:48,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:31:48,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 150 states and 292 transitions. [2018-12-09 15:31:48,942 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 292 transitions. [2018-12-09 15:31:48,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 15:31:48,942 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:31:49,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:31:49,146 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:50,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:31:50,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 155 states and 302 transitions. [2018-12-09 15:31:50,600 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 302 transitions. [2018-12-09 15:31:50,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 15:31:50,601 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:31:50,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:31:50,768 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:31:52,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:31:52,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 159 states and 310 transitions. [2018-12-09 15:31:52,206 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 310 transitions. [2018-12-09 15:31:52,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 15:31:52,206 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:31:52,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:31:53,262 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:32:01,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:32:01,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 171 states and 341 transitions. [2018-12-09 15:32:01,747 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 341 transitions. [2018-12-09 15:32:01,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 15:32:01,747 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:32:01,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:32:01,852 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:32:03,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:32:03,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 176 states and 348 transitions. [2018-12-09 15:32:03,550 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 348 transitions. [2018-12-09 15:32:03,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 15:32:03,551 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:32:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:32:03,653 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:32:05,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:32:05,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 180 states and 355 transitions. [2018-12-09 15:32:05,107 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 355 transitions. [2018-12-09 15:32:05,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 15:32:05,108 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:32:05,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:32:06,377 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:32:10,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:32:10,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 190 states and 377 transitions. [2018-12-09 15:32:10,991 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 377 transitions. [2018-12-09 15:32:10,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 15:32:10,992 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:32:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:32:11,103 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:32:13,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:32:13,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 192 states and 380 transitions. [2018-12-09 15:32:13,388 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 380 transitions. [2018-12-09 15:32:13,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 15:32:13,389 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:32:13,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:32:13,524 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:32:14,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:32:14,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 192 states and 378 transitions. [2018-12-09 15:32:14,585 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 378 transitions. [2018-12-09 15:32:14,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 15:32:14,586 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:32:14,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:32:15,857 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:32:22,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:32:22,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 204 states and 401 transitions. [2018-12-09 15:32:22,070 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 401 transitions. [2018-12-09 15:32:22,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 15:32:22,071 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:32:22,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:32:22,174 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:32:25,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:32:25,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 208 states and 416 transitions. [2018-12-09 15:32:25,396 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 416 transitions. [2018-12-09 15:32:25,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 15:32:25,396 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:32:25,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:32:25,506 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:32:26,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:32:26,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 201 states and 407 transitions. [2018-12-09 15:32:26,462 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 407 transitions. [2018-12-09 15:32:26,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 15:32:26,463 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:32:26,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:32:29,148 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:32:36,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:32:36,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 209 states and 425 transitions. [2018-12-09 15:32:36,795 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 425 transitions. [2018-12-09 15:32:36,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 15:32:36,796 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:32:36,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:32:36,913 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:32:41,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:32:41,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 207 states and 428 transitions. [2018-12-09 15:32:41,071 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 428 transitions. [2018-12-09 15:32:41,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 15:32:41,072 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:32:41,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:32:41,186 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:32:43,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:32:43,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 210 states and 437 transitions. [2018-12-09 15:32:43,071 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 437 transitions. [2018-12-09 15:32:43,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 15:32:43,072 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:32:43,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:32:43,173 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:32:43,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:32:43,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 211 states and 443 transitions. [2018-12-09 15:32:43,743 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 443 transitions. [2018-12-09 15:32:43,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 15:32:43,744 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:32:43,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:32:44,047 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:32:46,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:32:46,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 214 states and 453 transitions. [2018-12-09 15:32:46,960 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 453 transitions. [2018-12-09 15:32:46,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 15:32:46,960 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:32:47,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:32:47,098 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:32:48,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:32:48,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 218 states and 464 transitions. [2018-12-09 15:32:48,924 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 464 transitions. [2018-12-09 15:32:48,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 15:32:48,924 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:32:49,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:32:49,066 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:32:49,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:32:49,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 219 states and 467 transitions. [2018-12-09 15:32:49,593 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 467 transitions. [2018-12-09 15:32:49,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 15:32:49,593 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:32:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:32:49,731 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:32:50,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:32:50,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 221 states and 473 transitions. [2018-12-09 15:32:50,514 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 473 transitions. [2018-12-09 15:32:50,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 15:32:50,515 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:32:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:32:52,009 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:33:04,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:33:04,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 235 states and 520 transitions. [2018-12-09 15:33:04,875 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 520 transitions. [2018-12-09 15:33:04,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 15:33:04,875 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:33:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:33:04,988 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:33:06,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:33:06,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 236 states and 523 transitions. [2018-12-09 15:33:06,903 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 523 transitions. [2018-12-09 15:33:06,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 15:33:06,903 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:33:06,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:33:07,025 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:33:10,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:33:10,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 238 states and 527 transitions. [2018-12-09 15:33:10,239 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 527 transitions. [2018-12-09 15:33:10,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 15:33:10,240 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:33:10,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:33:10,348 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:33:11,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:33:11,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 240 states and 534 transitions. [2018-12-09 15:33:11,478 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 534 transitions. [2018-12-09 15:33:11,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 15:33:11,479 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:33:11,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:33:11,601 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:33:13,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:33:13,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 242 states and 537 transitions. [2018-12-09 15:33:13,563 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 537 transitions. [2018-12-09 15:33:13,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 15:33:13,563 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:33:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:33:13,691 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:33:14,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:33:14,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 243 states and 540 transitions. [2018-12-09 15:33:14,322 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 540 transitions. [2018-12-09 15:33:14,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 15:33:14,322 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:33:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:33:15,918 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:33:19,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:33:19,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 245 states and 547 transitions. [2018-12-09 15:33:19,685 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 547 transitions. [2018-12-09 15:33:19,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 15:33:19,685 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:33:19,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:33:19,878 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:33:22,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:33:22,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 249 states and 558 transitions. [2018-12-09 15:33:22,740 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 558 transitions. [2018-12-09 15:33:22,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 15:33:22,741 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:33:22,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:33:22,948 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:33:23,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:33:23,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 251 states and 565 transitions. [2018-12-09 15:33:23,831 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 565 transitions. [2018-12-09 15:33:23,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 15:33:23,831 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:33:23,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:33:24,056 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:33:24,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:33:24,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 252 states and 566 transitions. [2018-12-09 15:33:24,814 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 566 transitions. [2018-12-09 15:33:24,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 15:33:24,815 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:33:24,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:33:25,041 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:33:25,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:33:25,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 253 states and 568 transitions. [2018-12-09 15:33:25,513 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 568 transitions. [2018-12-09 15:33:25,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 15:33:25,514 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:33:25,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:33:26,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:33:26,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:33:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:33:26,738 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 55 iterations. [2018-12-09 15:33:26,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 09.12 03:33:26 ImpRootNode [2018-12-09 15:33:26,817 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-09 15:33:26,817 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 15:33:26,817 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 15:33:26,818 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 15:33:26,818 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:31:02" (3/4) ... [2018-12-09 15:33:26,819 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 15:33:26,898 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_45a48bb0-b27f-475f-a333-cdd6ba4d1a7a/bin-2019/ukojak/witness.graphml [2018-12-09 15:33:26,898 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 15:33:26,899 INFO L168 Benchmark]: Toolchain (without parser) took 146196.60 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 311.4 MB). Free memory was 953.3 MB in the beginning and 1.1 GB in the end (delta: -131.5 MB). Peak memory consumption was 179.9 MB. Max. memory is 11.5 GB. [2018-12-09 15:33:26,899 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 15:33:26,899 INFO L168 Benchmark]: CACSL2BoogieTranslator took 237.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -137.7 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. [2018-12-09 15:33:26,899 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.75 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 15:33:26,899 INFO L168 Benchmark]: Boogie Preprocessor took 19.74 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 15:33:26,900 INFO L168 Benchmark]: RCFGBuilder took 1485.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 948.8 MB in the end (delta: 134.2 MB). Peak memory consumption was 261.4 MB. Max. memory is 11.5 GB. [2018-12-09 15:33:26,900 INFO L168 Benchmark]: CodeCheck took 144342.88 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 218.1 MB). Free memory was 948.8 MB in the beginning and 1.1 GB in the end (delta: -155.1 MB). Peak memory consumption was 63.0 MB. Max. memory is 11.5 GB. [2018-12-09 15:33:26,900 INFO L168 Benchmark]: Witness Printer took 80.79 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. [2018-12-09 15:33:26,901 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, 146 locations, 1 error locations. UNSAFE Result, 144.2s OverallTime, 55 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 0 SDtfs, 57941726 SDslu, 0 SDs, 0 SdLazy, 564472120 SolverSat, 527468474 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 109.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16879 GetRequests, 14964 SyntacticMatches, 877 SemanticMatches, 1038 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665715 ImplicationChecksByTransitivity, 132.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 4.0s SatisfiabilityAnalysisTime, 14.7s InterpolantComputationTime, 1540 NumberOfCodeBlocks, 1540 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 1441 ConstructedInterpolants, 0 QuantifiedInterpolants, 538464 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 54 InterpolantComputations, 10 PerfectInterpolantSequences, 187/940 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: 652]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L70] msg_t nomsg = (msg_t )-1; [L71] port_t p12 ; [L72] char p12_old ; [L73] char p12_new ; [L74] _Bool ep12 ; [L75] port_t p13 ; [L76] char p13_old ; [L77] char p13_new ; [L78] _Bool ep13 ; [L79] port_t p21 ; [L80] char p21_old ; [L81] char p21_new ; [L82] _Bool ep21 ; [L83] port_t p23 ; [L84] char p23_old ; [L85] char p23_new ; [L86] _Bool ep23 ; [L87] port_t p31 ; [L88] char p31_old ; [L89] char p31_new ; [L90] _Bool ep31 ; [L91] port_t p32 ; [L92] char p32_old ; [L93] char p32_new ; [L94] _Bool ep32 ; [L95] char id1 ; [L96] unsigned char r1 ; [L97] char st1 ; [L98] char nl1 ; [L99] char m1 ; [L100] char max1 ; [L101] _Bool mode1 ; [L102] _Bool newmax1 ; [L103] char id2 ; [L104] unsigned char r2 ; [L105] char st2 ; [L106] char nl2 ; [L107] char m2 ; [L108] char max2 ; [L109] _Bool mode2 ; [L110] _Bool newmax2 ; [L111] char id3 ; [L112] unsigned char r3 ; [L113] char st3 ; [L114] char nl3 ; [L115] char m3 ; [L116] char max3 ; [L117] _Bool mode3 ; [L118] _Bool newmax3 ; [L281] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L571] int c1 ; [L572] int i2 ; [L575] c1 = 0 [L576] ep12 = __VERIFIER_nondet_bool() [L577] ep13 = __VERIFIER_nondet_bool() [L578] ep21 = __VERIFIER_nondet_bool() [L579] ep23 = __VERIFIER_nondet_bool() [L580] ep31 = __VERIFIER_nondet_bool() [L581] ep32 = __VERIFIER_nondet_bool() [L582] id1 = __VERIFIER_nondet_char() [L583] r1 = __VERIFIER_nondet_uchar() [L584] st1 = __VERIFIER_nondet_char() [L585] nl1 = __VERIFIER_nondet_char() [L586] m1 = __VERIFIER_nondet_char() [L587] max1 = __VERIFIER_nondet_char() [L588] mode1 = __VERIFIER_nondet_bool() [L589] newmax1 = __VERIFIER_nondet_bool() [L590] id2 = __VERIFIER_nondet_char() [L591] r2 = __VERIFIER_nondet_uchar() [L592] st2 = __VERIFIER_nondet_char() [L593] nl2 = __VERIFIER_nondet_char() [L594] m2 = __VERIFIER_nondet_char() [L595] max2 = __VERIFIER_nondet_char() [L596] mode2 = __VERIFIER_nondet_bool() [L597] newmax2 = __VERIFIER_nondet_bool() [L598] id3 = __VERIFIER_nondet_char() [L599] r3 = __VERIFIER_nondet_uchar() [L600] st3 = __VERIFIER_nondet_char() [L601] nl3 = __VERIFIER_nondet_char() [L602] m3 = __VERIFIER_nondet_char() [L603] max3 = __VERIFIER_nondet_char() [L604] mode3 = __VERIFIER_nondet_bool() [L605] newmax3 = __VERIFIER_nondet_bool() [L284] _Bool r121 ; [L285] _Bool r131 ; [L286] _Bool r211 ; [L287] _Bool r231 ; [L288] _Bool r311 ; [L289] _Bool r321 ; [L290] _Bool r122 ; [L291] int tmp ; [L292] _Bool r132 ; [L293] int tmp___0 ; [L294] _Bool r212 ; [L295] int tmp___1 ; [L296] _Bool r232 ; [L297] int tmp___2 ; [L298] _Bool r312 ; [L299] int tmp___3 ; [L300] _Bool r322 ; [L301] int tmp___4 ; [L302] int tmp___5 ; [L305] r121 = ep12 [L306] r131 = ep13 [L307] r211 = ep21 [L308] r231 = ep23 [L309] r311 = ep31 [L310] r321 = ep32 [L311] COND FALSE !(\read(r121)) [L314] COND TRUE \read(r131) [L315] COND TRUE \read(ep32) [L316] tmp = 1 [L323] r122 = (_Bool )tmp [L324] COND TRUE \read(r131) [L325] tmp___0 = 1 [L336] r132 = (_Bool )tmp___0 [L337] COND TRUE \read(r211) [L338] tmp___1 = 1 [L349] r212 = (_Bool )tmp___1 [L350] COND TRUE \read(r231) [L351] tmp___2 = 1 [L362] r232 = (_Bool )tmp___2 [L363] COND TRUE \read(r311) [L364] tmp___3 = 1 [L375] r312 = (_Bool )tmp___3 [L376] COND TRUE \read(r321) [L377] tmp___4 = 1 [L388] r322 = (_Bool )tmp___4 [L389] COND TRUE (int )id1 != (int )id2 [L390] COND TRUE (int )id1 != (int )id3 [L391] COND TRUE (int )id2 != (int )id3 [L392] COND TRUE (int )id1 >= 0 [L393] COND TRUE (int )id2 >= 0 [L394] COND TRUE (int )id3 >= 0 [L395] COND TRUE (int )r1 == 0 [L396] COND TRUE (int )r2 == 0 [L397] COND TRUE (int )r3 == 0 [L398] COND TRUE \read(r122) [L399] COND TRUE \read(r132) [L400] COND TRUE \read(r212) [L401] COND TRUE \read(r232) [L402] COND TRUE \read(r312) [L403] COND TRUE \read(r322) [L404] COND TRUE (int )max1 == (int )id1 [L405] COND TRUE (int )max2 == (int )id2 [L406] COND TRUE (int )max3 == (int )id3 [L407] COND TRUE (int )st1 == 0 [L408] COND TRUE (int )st2 == 0 [L409] COND TRUE (int )st3 == 0 [L410] COND TRUE (int )nl1 == 0 [L411] COND TRUE (int )nl2 == 0 [L412] COND TRUE (int )nl3 == 0 [L413] COND TRUE (int )mode1 == 0 [L414] COND TRUE (int )mode2 == 0 [L415] COND TRUE (int )mode3 == 0 [L416] COND TRUE \read(newmax1) [L417] COND TRUE \read(newmax2) [L418] COND TRUE \read(newmax3) [L419] tmp___5 = 1 [L510] return (tmp___5); [L606] i2 = init() [L608] p12_old = nomsg [L609] p12_new = nomsg [L610] p13_old = nomsg [L611] p13_new = nomsg [L612] p21_old = nomsg [L613] p21_new = nomsg [L614] p23_old = nomsg [L615] p23_new = nomsg [L616] p31_old = nomsg [L617] p31_new = nomsg [L618] p32_old = nomsg [L619] p32_new = nomsg [L620] i2 = 0 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=3, id3=1, m1=-128, m2=0, m3=-2, max1=2, max2=3, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L621] COND TRUE 1 [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND FALSE !(\read(mode1)) [L156] COND TRUE (int )r1 < 2 [L157] COND FALSE !(\read(ep12)) [L162] COND TRUE \read(ep13) [L163] COND TRUE \read(newmax1) [L164] EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L164] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L168] mode1 = (_Bool)1 [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND FALSE !(\read(mode2)) [L210] COND TRUE (int )r2 < 2 [L211] COND TRUE \read(ep21) [L212] COND TRUE \read(newmax2) [L213] EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L213] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L216] COND TRUE \read(ep23) [L217] COND TRUE \read(newmax2) [L218] EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L218] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L222] mode2 = (_Bool)1 [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND FALSE !(\read(mode3)) [L264] COND TRUE (int )r3 < 2 [L265] COND TRUE \read(ep31) [L266] COND TRUE \read(newmax3) [L267] EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L267] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L270] COND TRUE \read(ep32) [L271] COND TRUE \read(newmax3) [L272] EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L272] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L276] mode3 = (_Bool)1 [L626] p12_old = p12_new [L627] p12_new = nomsg [L628] p13_old = p13_new [L629] p13_new = nomsg [L630] p21_old = p21_new [L631] p21_new = nomsg [L632] p23_old = p23_new [L633] p23_new = nomsg [L634] p31_old = p31_new [L635] p31_new = nomsg [L636] p32_old = p32_new [L637] p32_new = nomsg [L515] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=3, id3=1, m1=-128, m2=0, m3=-2, max1=2, max2=3, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=1, p32=0, p32_new=-1, p32_old=1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L518] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=3, id3=1, m1=-128, m2=0, m3=-2, max1=2, max2=3, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=1, p32=0, p32_new=-1, p32_old=1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L519] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=3, id3=1, m1=-128, m2=0, m3=-2, max1=2, max2=3, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=1, p32=0, p32_new=-1, p32_old=1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L520] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=3, id3=1, m1=-128, m2=0, m3=-2, max1=2, max2=3, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=1, p32=0, p32_new=-1, p32_old=1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L521] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=3, id3=1, m1=-128, m2=0, m3=-2, max1=2, max2=3, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=1, p32=0, p32_new=-1, p32_old=1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L522] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=3, id3=1, m1=-128, m2=0, m3=-2, max1=2, max2=3, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=1, p32=0, p32_new=-1, p32_old=1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L525] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=3, id3=1, m1=-128, m2=0, m3=-2, max1=2, max2=3, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=1, p32=0, p32_new=-1, p32_old=1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L527] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=3, id3=1, m1=-128, m2=0, m3=-2, max1=2, max2=3, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=1, p32=0, p32_new=-1, p32_old=1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L532] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=3, id3=1, m1=-128, m2=0, m3=-2, max1=2, max2=3, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=1, p32=0, p32_new=-1, p32_old=1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L535] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=3, id3=1, m1=-128, m2=0, m3=-2, max1=2, max2=3, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=1, p32=0, p32_new=-1, p32_old=1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L537] COND TRUE (int )r1 < 2 [L538] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=3, id3=1, m1=-128, m2=0, m3=-2, max1=2, max2=3, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=1, p32=0, p32_new=-1, p32_old=1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L566] return (tmp); [L638] c1 = check() [L650] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=3, id3=1, m1=-128, m2=0, m3=-2, max1=2, max2=3, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=3, p23=0, p23_new=-1, p23_old=3, p31=0, p31_new=-1, p31_old=1, p32=0, p32_new=-1, p32_old=1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L621] COND TRUE 1 [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND TRUE \read(mode1) [L126] COND FALSE !(r1 == 255) [L129] r1 = r1 + 1 [L130] COND TRUE \read(ep21) [L131] m1 = p21_old [L132] p21_old = nomsg [L133] COND TRUE (int )m1 > (int )max1 [L134] max1 = m1 [L135] newmax = (_Bool)1 [L138] COND TRUE \read(ep31) [L139] m1 = p31_old [L140] p31_old = nomsg [L141] COND FALSE !((int )m1 > (int )max1) [L146] newmax1 = newmax [L147] COND FALSE !((int )r1 == 2) [L154] mode1 = (_Bool)0 [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND TRUE \read(mode2) [L180] COND FALSE !(r2 == 255) [L183] r2 = r2 + 1 [L184] COND FALSE !(\read(ep12)) [L192] COND TRUE \read(ep32) [L193] m2 = p32_old [L194] p32_old = nomsg [L195] COND FALSE !((int )m2 > (int )max2) [L200] newmax2 = newmax [L201] COND FALSE !((int )r2 == 2) [L208] mode2 = (_Bool)0 [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND TRUE \read(mode3) [L234] COND FALSE !(r3 == 255) [L237] r3 = r3 + 1 [L238] COND TRUE \read(ep13) [L239] m3 = p13_old [L240] p13_old = nomsg [L241] COND TRUE (int )m3 > (int )max3 [L242] max3 = m3 [L243] newmax = (_Bool)1 [L246] COND TRUE \read(ep23) [L247] m3 = p23_old [L248] p23_old = nomsg [L249] COND TRUE (int )m3 > (int )max3 [L250] max3 = m3 [L251] newmax = (_Bool)1 [L254] newmax3 = newmax [L255] COND FALSE !((int )r3 == 2) [L262] mode3 = (_Bool)0 [L626] p12_old = p12_new [L627] p12_new = nomsg [L628] p13_old = p13_new [L629] p13_new = nomsg [L630] p21_old = p21_new [L631] p21_new = nomsg [L632] p23_old = p23_new [L633] p23_new = nomsg [L634] p31_old = p31_new [L635] p31_new = nomsg [L636] p32_old = p32_new [L637] p32_new = nomsg [L515] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=3, id3=1, m1=1, m2=1, m3=3, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L518] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=3, id3=1, m1=1, m2=1, m3=3, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L519] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=3, id3=1, m1=1, m2=1, m3=3, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L520] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=3, id3=1, m1=1, m2=1, m3=3, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L521] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=3, id3=1, m1=1, m2=1, m3=3, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L522] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=3, id3=1, m1=1, m2=1, m3=3, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L525] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=3, id3=1, m1=1, m2=1, m3=3, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L527] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=3, id3=1, m1=1, m2=1, m3=3, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L532] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=3, id3=1, m1=1, m2=1, m3=3, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L535] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=3, id3=1, m1=1, m2=1, m3=3, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L537] COND TRUE (int )r1 < 2 [L538] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=3, id3=1, m1=1, m2=1, m3=3, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L566] return (tmp); [L638] c1 = check() [L650] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=3, id3=1, m1=1, m2=1, m3=3, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L621] COND TRUE 1 [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND FALSE !(\read(mode1)) [L156] COND TRUE (int )r1 < 2 [L157] COND FALSE !(\read(ep12)) [L162] COND TRUE \read(ep13) [L163] COND TRUE \read(newmax1) [L164] EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L164] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L168] mode1 = (_Bool)1 [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND FALSE !(\read(mode2)) [L210] COND TRUE (int )r2 < 2 [L211] COND TRUE \read(ep21) [L212] COND FALSE !(\read(newmax2)) [L216] COND TRUE \read(ep23) [L217] COND FALSE !(\read(newmax2)) [L222] mode2 = (_Bool)1 [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND FALSE !(\read(mode3)) [L264] COND TRUE (int )r3 < 2 [L265] COND TRUE \read(ep31) [L266] COND TRUE \read(newmax3) [L267] EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L267] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L270] COND TRUE \read(ep32) [L271] COND TRUE \read(newmax3) [L272] EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L272] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L276] mode3 = (_Bool)1 [L626] p12_old = p12_new [L627] p12_new = nomsg [L628] p13_old = p13_new [L629] p13_new = nomsg [L630] p21_old = p21_new [L631] p21_new = nomsg [L632] p23_old = p23_new [L633] p23_new = nomsg [L634] p31_old = p31_new [L635] p31_new = nomsg [L636] p32_old = p32_new [L637] p32_new = nomsg [L515] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=3, id3=1, m1=1, m2=1, m3=3, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L518] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=3, id3=1, m1=1, m2=1, m3=3, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L519] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=3, id3=1, m1=1, m2=1, m3=3, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L520] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=3, id3=1, m1=1, m2=1, m3=3, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L521] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=3, id3=1, m1=1, m2=1, m3=3, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L522] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=3, id3=1, m1=1, m2=1, m3=3, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L525] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=3, id3=1, m1=1, m2=1, m3=3, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L527] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=3, id3=1, m1=1, m2=1, m3=3, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L532] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=3, id3=1, m1=1, m2=1, m3=3, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L535] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=3, id3=1, m1=1, m2=1, m3=3, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L537] COND TRUE (int )r1 < 2 [L538] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=3, id3=1, m1=1, m2=1, m3=3, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L566] return (tmp); [L638] c1 = check() [L650] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=3, id3=1, m1=1, m2=1, m3=3, max1=3, max2=3, max3=3, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=3, p32=0, p32_new=-1, p32_old=3, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L621] COND TRUE 1 [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND TRUE \read(mode1) [L126] COND FALSE !(r1 == 255) [L129] r1 = r1 + 1 [L130] COND TRUE \read(ep21) [L131] m1 = p21_old [L132] p21_old = nomsg [L133] COND FALSE !((int )m1 > (int )max1) [L138] COND TRUE \read(ep31) [L139] m1 = p31_old [L140] p31_old = nomsg [L141] COND FALSE !((int )m1 > (int )max1) [L146] newmax1 = newmax [L147] COND TRUE (int )r1 == 2 [L148] COND FALSE !((int )max1 == (int )id1) [L151] st1 = (char)1 [L154] mode1 = (_Bool)0 [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND TRUE \read(mode2) [L180] COND FALSE !(r2 == 255) [L183] r2 = r2 + 1 [L184] COND FALSE !(\read(ep12)) [L192] COND TRUE \read(ep32) [L193] m2 = p32_old [L194] p32_old = nomsg [L195] COND FALSE !((int )m2 > (int )max2) [L200] newmax2 = newmax [L201] COND TRUE (int )r2 == 2 [L202] COND TRUE (int )max2 == (int )id2 [L203] st2 = (char)1 [L208] mode2 = (_Bool)0 [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND TRUE \read(mode3) [L234] COND FALSE !(r3 == 255) [L237] r3 = r3 + 1 [L238] COND TRUE \read(ep13) [L239] m3 = p13_old [L240] p13_old = nomsg [L241] COND FALSE !((int )m3 > (int )max3) [L246] COND TRUE \read(ep23) [L247] m3 = p23_old [L248] p23_old = nomsg [L249] COND FALSE !((int )m3 > (int )max3) [L254] newmax3 = newmax [L255] COND TRUE (int )r3 == 2 [L256] COND FALSE !((int )max3 == (int )id3) [L259] nl3 = (char)1 [L262] mode3 = (_Bool)0 [L626] p12_old = p12_new [L627] p12_new = nomsg [L628] p13_old = p13_new [L629] p13_new = nomsg [L630] p21_old = p21_new [L631] p21_new = nomsg [L632] p23_old = p23_new [L633] p23_new = nomsg [L634] p31_old = p31_new [L635] p31_new = nomsg [L636] p32_old = p32_new [L637] p32_new = nomsg [L515] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=3, id3=1, m1=3, m2=3, m3=-1, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L518] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L564] tmp = 0 VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=3, id3=1, m1=3, m2=3, m3=-1, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L566] return (tmp); [L638] c1 = check() [L650] COND TRUE ! arg VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=3, id3=1, m1=3, m2=3, m3=-1, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L652] __VERIFIER_error() VAL [ep12=0, ep13=1, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=3, id3=1, m1=3, m2=3, m3=-1, max1=3, max2=3, max3=3, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 237.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -137.7 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.75 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.74 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1485.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 948.8 MB in the end (delta: 134.2 MB). Peak memory consumption was 261.4 MB. Max. memory is 11.5 GB. * CodeCheck took 144342.88 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 218.1 MB). Free memory was 948.8 MB in the beginning and 1.1 GB in the end (delta: -155.1 MB). Peak memory consumption was 63.0 MB. Max. memory is 11.5 GB. * Witness Printer took 80.79 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...