./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.BOUNDED-6.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_42281d58-e355-45dc-9b5c-7cd153893848/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_42281d58-e355-45dc-9b5c-7cd153893848/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_42281d58-e355-45dc-9b5c-7cd153893848/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_42281d58-e355-45dc-9b5c-7cd153893848/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.3.ufo.BOUNDED-6.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_42281d58-e355-45dc-9b5c-7cd153893848/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_42281d58-e355-45dc-9b5c-7cd153893848/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 c8186bb9e195ec2f40116dc473c413c4e1a34c0f ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:25:22,153 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 15:25:22,154 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 15:25:22,163 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 15:25:22,163 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 15:25:22,164 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 15:25:22,165 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 15:25:22,166 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 15:25:22,166 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 15:25:22,167 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 15:25:22,167 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 15:25:22,167 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 15:25:22,168 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 15:25:22,168 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 15:25:22,169 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 15:25:22,169 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 15:25:22,169 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 15:25:22,170 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 15:25:22,171 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 15:25:22,172 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 15:25:22,172 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 15:25:22,173 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 15:25:22,174 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 15:25:22,174 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 15:25:22,174 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 15:25:22,175 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 15:25:22,175 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 15:25:22,176 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 15:25:22,176 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 15:25:22,176 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 15:25:22,177 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 15:25:22,177 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 15:25:22,177 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 15:25:22,177 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 15:25:22,178 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 15:25:22,178 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 15:25:22,178 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_42281d58-e355-45dc-9b5c-7cd153893848/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-09 15:25:22,185 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 15:25:22,185 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 15:25:22,186 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 15:25:22,186 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-09 15:25:22,186 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 15:25:22,186 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 15:25:22,187 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 15:25:22,187 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 15:25:22,187 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 15:25:22,187 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 15:25:22,187 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 15:25:22,187 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 15:25:22,187 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 15:25:22,187 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 15:25:22,187 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 15:25:22,187 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 15:25:22,188 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 15:25:22,188 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 15:25:22,188 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-09 15:25:22,188 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-09 15:25:22,188 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 15:25:22,188 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 15:25:22,188 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-09 15:25:22,188 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 15:25:22,188 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 15:25:22,188 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 15:25:22,188 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-09 15:25:22,189 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 15:25:22,189 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 15:25:22,189 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_42281d58-e355-45dc-9b5c-7cd153893848/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 -> c8186bb9e195ec2f40116dc473c413c4e1a34c0f [2018-12-09 15:25:22,206 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 15:25:22,215 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 15:25:22,218 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 15:25:22,219 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 15:25:22,219 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 15:25:22,220 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_42281d58-e355-45dc-9b5c-7cd153893848/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.3.ufo.BOUNDED-6.pals_true-termination.c [2018-12-09 15:25:22,260 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_42281d58-e355-45dc-9b5c-7cd153893848/bin-2019/ukojak/data/67af78b24/031593bc4b69412c82df29bee33645a4/FLAG1851a4904 [2018-12-09 15:25:22,693 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 15:25:22,693 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_42281d58-e355-45dc-9b5c-7cd153893848/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.3.ufo.BOUNDED-6.pals_true-termination.c [2018-12-09 15:25:22,699 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_42281d58-e355-45dc-9b5c-7cd153893848/bin-2019/ukojak/data/67af78b24/031593bc4b69412c82df29bee33645a4/FLAG1851a4904 [2018-12-09 15:25:22,707 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_42281d58-e355-45dc-9b5c-7cd153893848/bin-2019/ukojak/data/67af78b24/031593bc4b69412c82df29bee33645a4 [2018-12-09 15:25:22,709 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 15:25:22,710 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 15:25:22,710 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 15:25:22,710 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 15:25:22,712 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 15:25:22,713 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:25:22" (1/1) ... [2018-12-09 15:25:22,714 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:25:22, skipping insertion in model container [2018-12-09 15:25:22,715 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:25:22" (1/1) ... [2018-12-09 15:25:22,719 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 15:25:22,738 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 15:25:22,864 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 15:25:22,870 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 15:25:22,931 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 15:25:22,941 INFO L195 MainTranslator]: Completed translation [2018-12-09 15:25:22,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:22 WrapperNode [2018-12-09 15:25:22,942 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 15:25:22,942 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 15:25:22,942 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 15:25:22,942 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 15:25:22,947 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:25:22" (1/1) ... [2018-12-09 15:25:22,953 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:25:22" (1/1) ... [2018-12-09 15:25:22,970 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 15:25:22,970 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 15:25:22,970 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 15:25:22,970 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 15:25:22,976 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:22" (1/1) ... [2018-12-09 15:25:22,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:22" (1/1) ... [2018-12-09 15:25:22,978 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:22" (1/1) ... [2018-12-09 15:25:22,978 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:22" (1/1) ... [2018-12-09 15:25:22,982 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:22" (1/1) ... [2018-12-09 15:25:22,987 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:22" (1/1) ... [2018-12-09 15:25:22,988 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:22" (1/1) ... [2018-12-09 15:25:22,990 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 15:25:22,990 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 15:25:22,990 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 15:25:22,990 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 15:25:22,991 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:25:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_42281d58-e355-45dc-9b5c-7cd153893848/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:25:23,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 15:25:23,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 15:25:24,476 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 15:25:24,477 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-12-09 15:25:24,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:25:24 BoogieIcfgContainer [2018-12-09 15:25:24,477 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 15:25:24,477 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-09 15:25:24,477 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-09 15:25:24,483 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-09 15:25:24,484 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:25:24" (1/1) ... [2018-12-09 15:25:24,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:25:24,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:25:24,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2018-12-09 15:25:24,511 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2018-12-09 15:25:24,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-09 15:25:24,513 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:25:24,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:24,730 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:25:24,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:25:24,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2018-12-09 15:25:24,793 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2018-12-09 15:25:24,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-09 15:25:24,794 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:25:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:24,869 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:25:25,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:25:25,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 24 states and 41 transitions. [2018-12-09 15:25:25,006 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2018-12-09 15:25:25,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-09 15:25:25,008 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:25:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:25,103 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:25:25,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:25:25,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 28 states and 50 transitions. [2018-12-09 15:25:25,349 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2018-12-09 15:25:25,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 15:25:25,349 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:25:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:25,429 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:25:25,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:25:25,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 33 states and 61 transitions. [2018-12-09 15:25:25,795 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 61 transitions. [2018-12-09 15:25:25,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 15:25:25,796 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:25:25,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:25,911 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:25:26,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:25:26,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 40 states and 74 transitions. [2018-12-09 15:25:26,450 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 74 transitions. [2018-12-09 15:25:26,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-09 15:25:26,450 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:25:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:26,528 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:25:27,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:25:27,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 46 states and 86 transitions. [2018-12-09 15:25:27,318 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 86 transitions. [2018-12-09 15:25:27,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-09 15:25:27,318 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:25:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:27,380 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:25:27,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:25:27,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 47 states and 86 transitions. [2018-12-09 15:25:27,510 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 86 transitions. [2018-12-09 15:25:27,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 15:25:27,511 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:25:27,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:27,531 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:25:27,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:25:27,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 48 states and 87 transitions. [2018-12-09 15:25:27,536 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 87 transitions. [2018-12-09 15:25:27,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 15:25:27,537 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:25:27,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:27,646 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:25:28,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:25:28,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 58 states and 104 transitions. [2018-12-09 15:25:28,803 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 104 transitions. [2018-12-09 15:25:28,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 15:25:28,803 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:25:28,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:28,913 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:25:29,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:25:29,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 61 states and 109 transitions. [2018-12-09 15:25:29,063 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 109 transitions. [2018-12-09 15:25:29,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 15:25:29,064 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:25:29,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:29,633 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:25:33,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:25:33,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 77 states and 145 transitions. [2018-12-09 15:25:33,055 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 145 transitions. [2018-12-09 15:25:33,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 15:25:33,056 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:25:33,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:33,248 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:25:36,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:25:36,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 94 states and 184 transitions. [2018-12-09 15:25:36,697 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 184 transitions. [2018-12-09 15:25:36,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 15:25:36,697 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:25:36,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:36,746 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:25:36,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:25:36,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 95 states and 185 transitions. [2018-12-09 15:25:36,997 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 185 transitions. [2018-12-09 15:25:36,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 15:25:36,998 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:25:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:37,372 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:25:42,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:25:42,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 113 states and 224 transitions. [2018-12-09 15:25:42,201 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 224 transitions. [2018-12-09 15:25:42,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 15:25:42,202 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:25:42,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:42,242 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:25:42,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:25:42,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 114 states and 225 transitions. [2018-12-09 15:25:42,547 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 225 transitions. [2018-12-09 15:25:42,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 15:25:42,548 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:25:42,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:42,589 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:25:42,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:25:42,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 115 states and 229 transitions. [2018-12-09 15:25:42,930 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 229 transitions. [2018-12-09 15:25:42,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 15:25:42,930 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:25:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:43,500 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:25:48,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:25:48,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 129 states and 257 transitions. [2018-12-09 15:25:48,361 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 257 transitions. [2018-12-09 15:25:48,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 15:25:48,361 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:25:48,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:48,401 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:25:49,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:25:49,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 132 states and 265 transitions. [2018-12-09 15:25:49,426 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 265 transitions. [2018-12-09 15:25:49,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 15:25:49,426 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:25:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:49,464 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:25:49,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:25:49,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 133 states and 266 transitions. [2018-12-09 15:25:49,943 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 266 transitions. [2018-12-09 15:25:49,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 15:25:49,944 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:25:49,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:52,220 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:25:57,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:25:57,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 152 states and 304 transitions. [2018-12-09 15:25:57,614 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 304 transitions. [2018-12-09 15:25:57,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 15:25:57,614 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:25:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:57,691 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:25:59,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:25:59,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 156 states and 314 transitions. [2018-12-09 15:25:59,316 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 314 transitions. [2018-12-09 15:25:59,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 15:25:59,316 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:25:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:25:59,394 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:26:00,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:26:00,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 159 states and 319 transitions. [2018-12-09 15:26:00,548 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 319 transitions. [2018-12-09 15:26:00,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 15:26:00,548 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:26:00,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:26:00,612 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:26:01,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:26:01,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 160 states and 320 transitions. [2018-12-09 15:26:01,038 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 320 transitions. [2018-12-09 15:26:01,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 15:26:01,038 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:26:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:26:01,533 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:26:06,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:26:06,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 180 states and 360 transitions. [2018-12-09 15:26:06,638 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 360 transitions. [2018-12-09 15:26:06,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 15:26:06,638 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:26:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:26:07,250 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:26:10,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:26:10,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 183 states and 368 transitions. [2018-12-09 15:26:10,012 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 368 transitions. [2018-12-09 15:26:10,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 15:26:10,013 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:26:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:26:10,119 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:26:12,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:26:12,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 188 states and 381 transitions. [2018-12-09 15:26:12,079 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 381 transitions. [2018-12-09 15:26:12,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 15:26:12,080 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:26:12,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:26:13,156 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:26:24,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:26:24,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 215 states and 438 transitions. [2018-12-09 15:26:24,659 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 438 transitions. [2018-12-09 15:26:24,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 15:26:24,659 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:26:24,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:26:24,716 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:26:26,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:26:26,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 220 states and 451 transitions. [2018-12-09 15:26:26,513 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 451 transitions. [2018-12-09 15:26:26,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 15:26:26,513 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:26:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:26:27,533 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:26:32,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:26:32,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 231 states and 473 transitions. [2018-12-09 15:26:32,417 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 473 transitions. [2018-12-09 15:26:32,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 15:26:32,417 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:26:32,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:26:32,477 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:26:33,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:26:33,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 233 states and 476 transitions. [2018-12-09 15:26:33,700 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 476 transitions. [2018-12-09 15:26:33,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 15:26:33,701 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:26:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:26:34,905 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:26:44,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:26:44,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 247 states and 510 transitions. [2018-12-09 15:26:44,597 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 510 transitions. [2018-12-09 15:26:44,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 15:26:44,597 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:26:44,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:26:44,663 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:26:49,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:26:49,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 254 states and 526 transitions. [2018-12-09 15:26:49,361 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 526 transitions. [2018-12-09 15:26:49,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 15:26:49,362 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:26:49,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:26:52,637 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:27:09,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:27:09,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 268 states and 555 transitions. [2018-12-09 15:27:09,612 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 555 transitions. [2018-12-09 15:27:09,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 15:27:09,612 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:27:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:27:09,668 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:27:16,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:27:16,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 275 states and 570 transitions. [2018-12-09 15:27:16,050 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 570 transitions. [2018-12-09 15:27:16,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 15:27:16,051 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:27:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:27:18,534 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:27:26,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:27:26,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 278 states and 577 transitions. [2018-12-09 15:27:26,600 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 577 transitions. [2018-12-09 15:27:26,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 15:27:26,601 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:27:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:27:26,856 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:27:27,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:27:27,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 279 states and 579 transitions. [2018-12-09 15:27:27,525 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 579 transitions. [2018-12-09 15:27:27,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 15:27:27,526 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:27:27,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:27:27,712 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:27:28,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:27:28,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 281 states and 588 transitions. [2018-12-09 15:27:28,992 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 588 transitions. [2018-12-09 15:27:28,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 15:27:28,992 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:27:29,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:27:29,230 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:27:34,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:27:34,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 287 states and 606 transitions. [2018-12-09 15:27:34,327 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 606 transitions. [2018-12-09 15:27:34,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 15:27:34,327 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:27:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:27:34,379 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:27:36,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:27:36,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 289 states and 609 transitions. [2018-12-09 15:27:36,987 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 609 transitions. [2018-12-09 15:27:36,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 15:27:36,987 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:27:37,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:27:37,045 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:27:37,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:27:37,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 290 states and 610 transitions. [2018-12-09 15:27:37,676 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 610 transitions. [2018-12-09 15:27:37,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 15:27:37,676 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:27:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:27:37,745 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:27:39,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:27:39,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 293 states and 620 transitions. [2018-12-09 15:27:39,799 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 620 transitions. [2018-12-09 15:27:39,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 15:27:39,799 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:27:39,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:27:39,851 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:27:40,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:27:40,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 294 states and 626 transitions. [2018-12-09 15:27:40,976 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 626 transitions. [2018-12-09 15:27:40,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 15:27:40,976 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:27:40,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:27:42,095 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:27:47,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:27:47,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 301 states and 646 transitions. [2018-12-09 15:27:47,777 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 646 transitions. [2018-12-09 15:27:47,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 15:27:47,777 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:27:47,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:27:48,642 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:27:49,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:27:49,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 302 states and 650 transitions. [2018-12-09 15:27:49,375 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 650 transitions. [2018-12-09 15:27:49,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 15:27:49,375 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:27:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:27:50,233 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:27:53,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:27:53,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 305 states and 660 transitions. [2018-12-09 15:27:53,777 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 660 transitions. [2018-12-09 15:27:53,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 15:27:53,777 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:27:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:27:54,789 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:27:55,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 15:27:55,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 306 states and 661 transitions. [2018-12-09 15:27:55,654 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 661 transitions. [2018-12-09 15:27:55,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 15:27:55,654 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 15:27:55,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:27:56,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:27:56,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:27:57,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:27:57,338 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 47 iterations. [2018-12-09 15:27:57,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 09.12 03:27:57 ImpRootNode [2018-12-09 15:27:57,422 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-09 15:27:57,422 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 15:27:57,422 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 15:27:57,422 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 15:27:57,422 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:25:24" (3/4) ... [2018-12-09 15:27:57,424 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 15:27:57,502 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_42281d58-e355-45dc-9b5c-7cd153893848/bin-2019/ukojak/witness.graphml [2018-12-09 15:27:57,502 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 15:27:57,503 INFO L168 Benchmark]: Toolchain (without parser) took 154793.55 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 222.3 MB). Free memory was 954.4 MB in the beginning and 776.5 MB in the end (delta: 177.9 MB). Peak memory consumption was 400.2 MB. Max. memory is 11.5 GB. [2018-12-09 15:27:57,503 INFO L168 Benchmark]: CDTParser took 0.14 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:27:57,504 INFO L168 Benchmark]: CACSL2BoogieTranslator took 231.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -138.7 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2018-12-09 15:27:57,504 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.15 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:27:57,504 INFO L168 Benchmark]: Boogie Preprocessor took 19.50 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:27:57,504 INFO L168 Benchmark]: RCFGBuilder took 1487.13 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 954.8 MB in the end (delta: 130.2 MB). Peak memory consumption was 261.3 MB. Max. memory is 11.5 GB. [2018-12-09 15:27:57,504 INFO L168 Benchmark]: CodeCheck took 152944.29 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 126.9 MB). Free memory was 954.8 MB in the beginning and 800.9 MB in the end (delta: 153.9 MB). Peak memory consumption was 280.8 MB. Max. memory is 11.5 GB. [2018-12-09 15:27:57,504 INFO L168 Benchmark]: Witness Printer took 80.36 ms. Allocated memory is still 1.3 GB. Free memory was 800.9 MB in the beginning and 776.5 MB in the end (delta: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. [2018-12-09 15:27:57,505 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, 141 locations, 1 error locations. UNSAFE Result, 152.8s OverallTime, 47 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: -1834230536 SDtfs, 1451258500 SDslu, 638542528 SDs, 0 SdLazy, 552922160 SolverSat, 1674533008 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 68.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13503 GetRequests, 11736 SyntacticMatches, 761 SemanticMatches, 1006 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660283 ImplicationChecksByTransitivity, 144.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 19.2s InterpolantComputationTime, 1305 NumberOfCodeBlocks, 1305 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 1211 ConstructedInterpolants, 0 QuantifiedInterpolants, 450058 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 46 InterpolantComputations, 10 PerfectInterpolantSequences, 139/730 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: 643]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L69] msg_t nomsg = (msg_t )-1; [L70] port_t p12 ; [L71] char p12_old ; [L72] char p12_new ; [L73] _Bool ep12 ; [L74] port_t p13 ; [L75] char p13_old ; [L76] char p13_new ; [L77] _Bool ep13 ; [L78] port_t p21 ; [L79] char p21_old ; [L80] char p21_new ; [L81] _Bool ep21 ; [L82] port_t p23 ; [L83] char p23_old ; [L84] char p23_new ; [L85] _Bool ep23 ; [L86] port_t p31 ; [L87] char p31_old ; [L88] char p31_new ; [L89] _Bool ep31 ; [L90] port_t p32 ; [L91] char p32_old ; [L92] char p32_new ; [L93] _Bool ep32 ; [L94] char id1 ; [L95] char r1 ; [L96] char st1 ; [L97] char nl1 ; [L98] char m1 ; [L99] char max1 ; [L100] _Bool mode1 ; [L101] _Bool newmax1 ; [L102] char id2 ; [L103] char r2 ; [L104] char st2 ; [L105] char nl2 ; [L106] char m2 ; [L107] char max2 ; [L108] _Bool mode2 ; [L109] _Bool newmax2 ; [L110] char id3 ; [L111] char r3 ; [L112] char st3 ; [L113] char nl3 ; [L114] char m3 ; [L115] char max3 ; [L116] _Bool mode3 ; [L117] _Bool newmax3 ; [L271] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L561] int c1 ; [L562] int i2 ; [L565] c1 = 0 [L566] ep12 = __VERIFIER_nondet_bool() [L567] ep13 = __VERIFIER_nondet_bool() [L568] ep21 = __VERIFIER_nondet_bool() [L569] ep23 = __VERIFIER_nondet_bool() [L570] ep31 = __VERIFIER_nondet_bool() [L571] ep32 = __VERIFIER_nondet_bool() [L572] id1 = __VERIFIER_nondet_char() [L573] r1 = __VERIFIER_nondet_char() [L574] st1 = __VERIFIER_nondet_char() [L575] nl1 = __VERIFIER_nondet_char() [L576] m1 = __VERIFIER_nondet_char() [L577] max1 = __VERIFIER_nondet_char() [L578] mode1 = __VERIFIER_nondet_bool() [L579] newmax1 = __VERIFIER_nondet_bool() [L580] id2 = __VERIFIER_nondet_char() [L581] r2 = __VERIFIER_nondet_char() [L582] st2 = __VERIFIER_nondet_char() [L583] nl2 = __VERIFIER_nondet_char() [L584] m2 = __VERIFIER_nondet_char() [L585] max2 = __VERIFIER_nondet_char() [L586] mode2 = __VERIFIER_nondet_bool() [L587] newmax2 = __VERIFIER_nondet_bool() [L588] id3 = __VERIFIER_nondet_char() [L589] r3 = __VERIFIER_nondet_char() [L590] st3 = __VERIFIER_nondet_char() [L591] nl3 = __VERIFIER_nondet_char() [L592] m3 = __VERIFIER_nondet_char() [L593] max3 = __VERIFIER_nondet_char() [L594] mode3 = __VERIFIER_nondet_bool() [L595] newmax3 = __VERIFIER_nondet_bool() [L274] _Bool r121 ; [L275] _Bool r131 ; [L276] _Bool r211 ; [L277] _Bool r231 ; [L278] _Bool r311 ; [L279] _Bool r321 ; [L280] _Bool r122 ; [L281] int tmp ; [L282] _Bool r132 ; [L283] int tmp___0 ; [L284] _Bool r212 ; [L285] int tmp___1 ; [L286] _Bool r232 ; [L287] int tmp___2 ; [L288] _Bool r312 ; [L289] int tmp___3 ; [L290] _Bool r322 ; [L291] int tmp___4 ; [L292] int tmp___5 ; [L295] r121 = ep12 [L296] r131 = ep13 [L297] r211 = ep21 [L298] r231 = ep23 [L299] r311 = ep31 [L300] r321 = ep32 [L301] COND FALSE !(\read(r121)) [L304] COND TRUE \read(r131) [L305] COND TRUE \read(ep32) [L306] tmp = 1 [L313] r122 = (_Bool )tmp [L314] COND TRUE \read(r131) [L315] tmp___0 = 1 [L326] r132 = (_Bool )tmp___0 [L327] COND TRUE \read(r211) [L328] tmp___1 = 1 [L339] r212 = (_Bool )tmp___1 [L340] COND FALSE !(\read(r231)) [L343] COND TRUE \read(r211) [L344] COND TRUE \read(ep13) [L345] tmp___2 = 1 [L352] r232 = (_Bool )tmp___2 [L353] COND FALSE !(\read(r311)) [L356] COND TRUE \read(r321) [L357] COND TRUE \read(ep21) [L358] tmp___3 = 1 [L365] r312 = (_Bool )tmp___3 [L366] COND TRUE \read(r321) [L367] tmp___4 = 1 [L378] r322 = (_Bool )tmp___4 [L379] COND TRUE (int )id1 != (int )id2 [L380] COND TRUE (int )id1 != (int )id3 [L381] COND TRUE (int )id2 != (int )id3 [L382] COND TRUE (int )id1 >= 0 [L383] COND TRUE (int )id2 >= 0 [L384] COND TRUE (int )id3 >= 0 [L385] COND TRUE (int )r1 == 0 [L386] COND TRUE (int )r2 == 0 [L387] COND TRUE (int )r3 == 0 [L388] COND TRUE \read(r122) [L389] COND TRUE \read(r132) [L390] COND TRUE \read(r212) [L391] COND TRUE \read(r232) [L392] COND TRUE \read(r312) [L393] COND TRUE \read(r322) [L394] COND TRUE (int )max1 == (int )id1 [L395] COND TRUE (int )max2 == (int )id2 [L396] COND TRUE (int )max3 == (int )id3 [L397] COND TRUE (int )st1 == 0 [L398] COND TRUE (int )st2 == 0 [L399] COND TRUE (int )st3 == 0 [L400] COND TRUE (int )nl1 == 0 [L401] COND TRUE (int )nl2 == 0 [L402] COND TRUE (int )nl3 == 0 [L403] COND TRUE (int )mode1 == 0 [L404] COND TRUE (int )mode2 == 0 [L405] COND TRUE (int )mode3 == 0 [L406] COND TRUE \read(newmax1) [L407] COND TRUE \read(newmax2) [L408] COND TRUE \read(newmax3) [L409] tmp___5 = 1 [L500] return (tmp___5); [L596] i2 = init() [L598] p12_old = nomsg [L599] p12_new = nomsg [L600] p13_old = nomsg [L601] p13_new = nomsg [L602] p21_old = nomsg [L603] p21_new = nomsg [L604] p23_old = nomsg [L605] p23_new = nomsg [L606] p31_old = nomsg [L607] p31_new = nomsg [L608] p32_old = nomsg [L609] p32_new = nomsg [L610] i2 = 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=4, m1=0, m2=3, m3=-2, max1=1, max2=2, max3=4, 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] [L611] COND TRUE i2 < 6 [L120] _Bool newmax ; [L123] newmax = (_Bool)0 [L124] COND FALSE !(\read(mode1)) [L152] COND TRUE (int )r1 < 2 [L153] COND FALSE !(\read(ep12)) [L158] COND TRUE \read(ep13) [L159] COND TRUE \read(newmax1) [L160] EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L160] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L164] mode1 = (_Bool)1 [L171] _Bool newmax ; [L174] newmax = (_Bool)0 [L175] COND FALSE !(\read(mode2)) [L203] COND TRUE (int )r2 < 2 [L204] COND TRUE \read(ep21) [L205] COND TRUE \read(newmax2) [L206] EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L206] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L209] COND FALSE !(\read(ep23)) [L215] mode2 = (_Bool)1 [L222] _Bool newmax ; [L225] newmax = (_Bool)0 [L226] COND FALSE !(\read(mode3)) [L254] COND TRUE (int )r3 < 2 [L255] COND FALSE !(\read(ep31)) [L260] COND TRUE \read(ep32) [L261] COND TRUE \read(newmax3) [L262] EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L262] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L266] mode3 = (_Bool)1 [L616] p12_old = p12_new [L617] p12_new = nomsg [L618] p13_old = p13_new [L619] p13_new = nomsg [L620] p21_old = p21_new [L621] p21_new = nomsg [L622] p23_old = p23_new [L623] p23_new = nomsg [L624] p31_old = p31_new [L625] p31_new = nomsg [L626] p32_old = p32_new [L627] p32_new = nomsg [L505] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=4, m1=0, m2=3, m3=-2, max1=1, max2=2, max3=4, 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=1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L508] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=4, m1=0, m2=3, m3=-2, max1=1, max2=2, max3=4, 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=1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L509] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=4, m1=0, m2=3, m3=-2, max1=1, max2=2, max3=4, 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=1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L510] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=4, m1=0, m2=3, m3=-2, max1=1, max2=2, max3=4, 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=1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L511] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=4, m1=0, m2=3, m3=-2, max1=1, max2=2, max3=4, 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=1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L512] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=4, m1=0, m2=3, m3=-2, max1=1, max2=2, max3=4, 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=1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L515] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=4, m1=0, m2=3, m3=-2, max1=1, max2=2, max3=4, 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=1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L517] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=4, m1=0, m2=3, m3=-2, max1=1, max2=2, max3=4, 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=1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, 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=0, ep31=0, ep32=1, id1=1, id2=2, id3=4, m1=0, m2=3, m3=-2, max1=1, max2=2, max3=4, 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=1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L525] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=4, m1=0, m2=3, m3=-2, max1=1, max2=2, max3=4, 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=1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L527] COND TRUE (int )r1 < 2 [L528] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=4, m1=0, m2=3, m3=-2, max1=1, max2=2, max3=4, 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=1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L556] return (tmp); [L628] c1 = check() [L641] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=4, m1=0, m2=3, m3=-2, max1=1, max2=2, max3=4, 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=1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L630] i2 ++ VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=4, m1=0, m2=3, m3=-2, max1=1, max2=2, max3=4, 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=1, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=4, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L611] COND TRUE i2 < 6 [L120] _Bool newmax ; [L123] newmax = (_Bool)0 [L124] COND TRUE \read(mode1) [L125] r1 = (char )((int )r1 + 1) [L126] COND TRUE \read(ep21) [L127] m1 = p21_old [L128] p21_old = nomsg [L129] COND TRUE (int )m1 > (int )max1 [L130] max1 = m1 [L131] newmax = (_Bool)1 [L134] COND FALSE !(\read(ep31)) [L142] newmax1 = newmax [L143] COND FALSE !((int )r1 == 2) [L150] mode1 = (_Bool)0 [L171] _Bool newmax ; [L174] newmax = (_Bool)0 [L175] COND TRUE \read(mode2) [L176] r2 = (char )((int )r2 + 1) [L177] COND FALSE !(\read(ep12)) [L185] COND TRUE \read(ep32) [L186] m2 = p32_old [L187] p32_old = nomsg [L188] COND TRUE (int )m2 > (int )max2 [L189] max2 = m2 [L190] newmax = (_Bool)1 [L193] newmax2 = newmax [L194] COND FALSE !((int )r2 == 2) [L201] mode2 = (_Bool)0 [L222] _Bool newmax ; [L225] newmax = (_Bool)0 [L226] COND TRUE \read(mode3) [L227] r3 = (char )((int )r3 + 1) [L228] COND TRUE \read(ep13) [L229] m3 = p13_old [L230] p13_old = nomsg [L231] COND FALSE !((int )m3 > (int )max3) [L236] COND FALSE !(\read(ep23)) [L244] newmax3 = newmax [L245] COND FALSE !((int )r3 == 2) [L252] mode3 = (_Bool)0 [L616] p12_old = p12_new [L617] p12_new = nomsg [L618] p13_old = p13_new [L619] p13_new = nomsg [L620] p21_old = p21_new [L621] p21_new = nomsg [L622] p23_old = p23_new [L623] p23_new = nomsg [L624] p31_old = p31_new [L625] p31_new = nomsg [L626] p32_old = p32_new [L627] p32_new = nomsg [L505] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=4, m1=2, m2=4, m3=1, max1=2, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, 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] [L508] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=4, m1=2, m2=4, m3=1, max1=2, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, 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] [L509] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=4, m1=2, m2=4, m3=1, max1=2, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, 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] [L510] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=4, m1=2, m2=4, m3=1, max1=2, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, 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] [L511] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=4, m1=2, m2=4, m3=1, max1=2, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, 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] [L512] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=4, m1=2, m2=4, m3=1, max1=2, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, 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] [L515] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=4, m1=2, m2=4, m3=1, max1=2, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, 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] [L517] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=4, m1=2, m2=4, m3=1, max1=2, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, 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=0, ep31=0, ep32=1, id1=1, id2=2, id3=4, m1=2, m2=4, m3=1, max1=2, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, 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 )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=4, m1=2, m2=4, m3=1, max1=2, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, 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 [L528] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=4, m1=2, m2=4, m3=1, max1=2, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, 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] [L556] return (tmp); [L628] c1 = check() [L641] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=4, m1=2, m2=4, m3=1, max1=2, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, 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] [L630] i2 ++ VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=4, m1=2, m2=4, m3=1, max1=2, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=0, 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] [L611] COND TRUE i2 < 6 [L120] _Bool newmax ; [L123] newmax = (_Bool)0 [L124] COND FALSE !(\read(mode1)) [L152] COND TRUE (int )r1 < 2 [L153] COND FALSE !(\read(ep12)) [L158] COND TRUE \read(ep13) [L159] COND TRUE \read(newmax1) [L160] EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L160] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L164] mode1 = (_Bool)1 [L171] _Bool newmax ; [L174] newmax = (_Bool)0 [L175] COND FALSE !(\read(mode2)) [L203] COND TRUE (int )r2 < 2 [L204] COND TRUE \read(ep21) [L205] COND TRUE \read(newmax2) [L206] EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L206] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L209] COND FALSE !(\read(ep23)) [L215] mode2 = (_Bool)1 [L222] _Bool newmax ; [L225] newmax = (_Bool)0 [L226] COND FALSE !(\read(mode3)) [L254] COND TRUE (int )r3 < 2 [L255] COND FALSE !(\read(ep31)) [L260] COND TRUE \read(ep32) [L261] COND FALSE !(\read(newmax3)) [L266] mode3 = (_Bool)1 [L616] p12_old = p12_new [L617] p12_new = nomsg [L618] p13_old = p13_new [L619] p13_new = nomsg [L620] p21_old = p21_new [L621] p21_new = nomsg [L622] p23_old = p23_new [L623] p23_new = nomsg [L624] p31_old = p31_new [L625] p31_new = nomsg [L626] p32_old = p32_new [L627] p32_new = nomsg [L505] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=4, m1=2, m2=4, m3=1, max1=2, max2=4, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, 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=4, 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] [L508] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=4, m1=2, m2=4, m3=1, max1=2, max2=4, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, 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=4, 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] [L509] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=4, m1=2, m2=4, m3=1, max1=2, max2=4, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, 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=4, 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] [L510] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=4, m1=2, m2=4, m3=1, max1=2, max2=4, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, 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=4, 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] [L511] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=4, m1=2, m2=4, m3=1, max1=2, max2=4, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, 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=4, 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] [L512] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=4, m1=2, m2=4, m3=1, max1=2, max2=4, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, 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=4, 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] [L515] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=4, m1=2, m2=4, m3=1, max1=2, max2=4, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, 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=4, 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] [L517] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=4, m1=2, m2=4, m3=1, max1=2, max2=4, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, 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=4, 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=0, ep31=0, ep32=1, id1=1, id2=2, id3=4, m1=2, m2=4, m3=1, max1=2, max2=4, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, 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=4, 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 )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=4, m1=2, m2=4, m3=1, max1=2, max2=4, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, 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=4, 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 [L528] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=4, m1=2, m2=4, m3=1, max1=2, max2=4, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, 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=4, 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] [L556] return (tmp); [L628] c1 = check() [L641] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=4, m1=2, m2=4, m3=1, max1=2, max2=4, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, 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=4, 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] [L630] i2 ++ VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=4, m1=2, m2=4, m3=1, max1=2, max2=4, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=0, 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=4, 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] [L611] COND TRUE i2 < 6 [L120] _Bool newmax ; [L123] newmax = (_Bool)0 [L124] COND TRUE \read(mode1) [L125] r1 = (char )((int )r1 + 1) [L126] COND TRUE \read(ep21) [L127] m1 = p21_old [L128] p21_old = nomsg [L129] COND TRUE (int )m1 > (int )max1 [L130] max1 = m1 [L131] newmax = (_Bool)1 [L134] COND FALSE !(\read(ep31)) [L142] newmax1 = newmax [L143] COND TRUE (int )r1 == 2 [L144] COND FALSE !((int )max1 == (int )id1) [L147] st1 = (char)1 [L150] mode1 = (_Bool)0 [L171] _Bool newmax ; [L174] newmax = (_Bool)0 [L175] COND TRUE \read(mode2) [L176] r2 = (char )((int )r2 + 1) [L177] COND FALSE !(\read(ep12)) [L185] COND TRUE \read(ep32) [L186] m2 = p32_old [L187] p32_old = nomsg [L188] COND FALSE !((int )m2 > (int )max2) [L193] newmax2 = newmax [L194] COND TRUE (int )r2 == 2 [L195] COND FALSE !((int )max2 == (int )id2) [L198] nl2 = (char)1 [L201] mode2 = (_Bool)0 [L222] _Bool newmax ; [L225] newmax = (_Bool)0 [L226] COND TRUE \read(mode3) [L227] r3 = (char )((int )r3 + 1) [L228] COND TRUE \read(ep13) [L229] m3 = p13_old [L230] p13_old = nomsg [L231] COND FALSE !((int )m3 > (int )max3) [L236] COND FALSE !(\read(ep23)) [L244] newmax3 = newmax [L245] COND TRUE (int )r3 == 2 [L246] COND TRUE (int )max3 == (int )id3 [L247] st3 = (char)1 [L252] mode3 = (_Bool)0 [L616] p12_old = p12_new [L617] p12_new = nomsg [L618] p13_old = p13_new [L619] p13_new = nomsg [L620] p21_old = p21_new [L621] p21_new = nomsg [L622] p23_old = p23_new [L623] p23_new = nomsg [L624] p31_old = p31_new [L625] p31_new = nomsg [L626] p32_old = p32_new [L627] p32_new = nomsg [L505] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=4, m1=4, m2=-1, m3=2, max1=4, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=1, 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=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L508] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L554] tmp = 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=4, m1=4, m2=-1, m3=2, max1=4, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=1, 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=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L556] return (tmp); [L628] c1 = check() [L641] COND TRUE ! arg VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=4, m1=4, m2=-1, m3=2, max1=4, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=1, 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=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L643] __VERIFIER_error() VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=1, id2=2, id3=4, m1=4, m2=-1, m3=2, max1=4, max2=4, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=1, 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=2, r2=2, r3=2, st1=1, st2=0, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 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 231.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -138.7 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.15 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.50 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 1487.13 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 954.8 MB in the end (delta: 130.2 MB). Peak memory consumption was 261.3 MB. Max. memory is 11.5 GB. * CodeCheck took 152944.29 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 126.9 MB). Free memory was 954.8 MB in the beginning and 800.9 MB in the end (delta: 153.9 MB). Peak memory consumption was 280.8 MB. Max. memory is 11.5 GB. * Witness Printer took 80.36 ms. Allocated memory is still 1.3 GB. Free memory was 800.9 MB in the beginning and 776.5 MB in the end (delta: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...