./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.4.ufo.BOUNDED-6.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bacb244d-d89e-42e3-bf6b-9d6aea9309d1/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bacb244d-d89e-42e3-bf6b-9d6aea9309d1/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bacb244d-d89e-42e3-bf6b-9d6aea9309d1/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bacb244d-d89e-42e3-bf6b-9d6aea9309d1/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.4.ufo.BOUNDED-6.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_bacb244d-d89e-42e3-bf6b-9d6aea9309d1/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bacb244d-d89e-42e3-bf6b-9d6aea9309d1/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 421c1ce510bb92ff52c2b6487f32b0bc37caaab2 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-1dbac8b [2018-10-26 19:47:35,054 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 19:47:35,056 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 19:47:35,065 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 19:47:35,066 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 19:47:35,067 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 19:47:35,068 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 19:47:35,069 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 19:47:35,071 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 19:47:35,072 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 19:47:35,073 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 19:47:35,073 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 19:47:35,074 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 19:47:35,074 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 19:47:35,076 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 19:47:35,076 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 19:47:35,077 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 19:47:35,079 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 19:47:35,080 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 19:47:35,082 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 19:47:35,083 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 19:47:35,084 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 19:47:35,086 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 19:47:35,086 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 19:47:35,086 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 19:47:35,088 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 19:47:35,088 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 19:47:35,089 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 19:47:35,090 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 19:47:35,091 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 19:47:35,091 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 19:47:35,092 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 19:47:35,092 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 19:47:35,092 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 19:47:35,093 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 19:47:35,094 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 19:47:35,094 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bacb244d-d89e-42e3-bf6b-9d6aea9309d1/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-10-26 19:47:35,107 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 19:47:35,111 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 19:47:35,112 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 19:47:35,112 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 19:47:35,113 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 19:47:35,113 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 19:47:35,113 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 19:47:35,113 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 19:47:35,113 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 19:47:35,113 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 19:47:35,113 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 19:47:35,114 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 19:47:35,114 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 19:47:35,114 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 19:47:35,114 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 19:47:35,114 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 19:47:35,114 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 19:47:35,114 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-10-26 19:47:35,115 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-10-26 19:47:35,115 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 19:47:35,115 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 19:47:35,115 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-26 19:47:35,115 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 19:47:35,115 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 19:47:35,115 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 19:47:35,116 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-10-26 19:47:35,116 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 19:47:35,116 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 19:47:35,116 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_bacb244d-d89e-42e3-bf6b-9d6aea9309d1/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 -> 421c1ce510bb92ff52c2b6487f32b0bc37caaab2 [2018-10-26 19:47:35,145 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 19:47:35,161 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 19:47:35,167 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 19:47:35,169 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 19:47:35,170 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 19:47:35,171 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bacb244d-d89e-42e3-bf6b-9d6aea9309d1/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.4.ufo.BOUNDED-6.pals_true-termination.c [2018-10-26 19:47:35,217 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bacb244d-d89e-42e3-bf6b-9d6aea9309d1/bin-2019/ukojak/data/e36269c8d/f75ca8446ca8491482e3ff586e61aa20/FLAG706c85980 [2018-10-26 19:47:35,603 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 19:47:35,604 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bacb244d-d89e-42e3-bf6b-9d6aea9309d1/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.4.ufo.BOUNDED-6.pals_true-termination.c [2018-10-26 19:47:35,616 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bacb244d-d89e-42e3-bf6b-9d6aea9309d1/bin-2019/ukojak/data/e36269c8d/f75ca8446ca8491482e3ff586e61aa20/FLAG706c85980 [2018-10-26 19:47:35,628 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bacb244d-d89e-42e3-bf6b-9d6aea9309d1/bin-2019/ukojak/data/e36269c8d/f75ca8446ca8491482e3ff586e61aa20 [2018-10-26 19:47:35,633 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 19:47:35,635 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 19:47:35,635 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 19:47:35,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 19:47:35,639 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 19:47:35,640 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:47:35" (1/1) ... [2018-10-26 19:47:35,643 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4de62d8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:47:35, skipping insertion in model container [2018-10-26 19:47:35,643 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:47:35" (1/1) ... [2018-10-26 19:47:35,653 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 19:47:35,686 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 19:47:35,929 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:47:35,945 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 19:47:36,010 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:47:36,025 INFO L193 MainTranslator]: Completed translation [2018-10-26 19:47:36,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:47:36 WrapperNode [2018-10-26 19:47:36,025 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 19:47:36,026 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 19:47:36,026 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 19:47:36,026 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 19:47:36,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:47:36" (1/1) ... [2018-10-26 19:47:36,044 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:47:36" (1/1) ... [2018-10-26 19:47:36,080 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 19:47:36,081 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 19:47:36,081 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 19:47:36,081 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 19:47:36,155 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:47:36" (1/1) ... [2018-10-26 19:47:36,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:47:36" (1/1) ... [2018-10-26 19:47:36,159 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:47:36" (1/1) ... [2018-10-26 19:47:36,175 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:47:36" (1/1) ... [2018-10-26 19:47:36,181 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:47:36" (1/1) ... [2018-10-26 19:47:36,189 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:47:36" (1/1) ... [2018-10-26 19:47:36,191 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:47:36" (1/1) ... [2018-10-26 19:47:36,195 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 19:47:36,195 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 19:47:36,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 19:47:36,196 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 19:47:36,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:47:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bacb244d-d89e-42e3-bf6b-9d6aea9309d1/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-10-26 19:47:36,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 19:47:36,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 19:47:40,503 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 19:47:40,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:47:40 BoogieIcfgContainer [2018-10-26 19:47:40,504 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 19:47:40,504 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-10-26 19:47:40,504 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-10-26 19:47:40,514 INFO L276 PluginConnector]: CodeCheck initialized [2018-10-26 19:47:40,515 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:47:40" (1/1) ... [2018-10-26 19:47:40,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:47:40,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:47:40,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 21 states and 33 transitions. [2018-10-26 19:47:40,560 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 33 transitions. [2018-10-26 19:47:40,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-26 19:47:40,563 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:47:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:47:41,094 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-26 19:47:41,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:47:41,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:47:41,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 24 states and 37 transitions. [2018-10-26 19:47:41,267 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions. [2018-10-26 19:47:41,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-26 19:47:41,267 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:47:41,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:47:41,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:47:41,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:47:41,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 28 states and 45 transitions. [2018-10-26 19:47:41,810 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 45 transitions. [2018-10-26 19:47:41,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-26 19:47:41,810 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:47:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:47:42,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:47:42,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:47:42,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 33 states and 55 transitions. [2018-10-26 19:47:42,565 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 55 transitions. [2018-10-26 19:47:42,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-26 19:47:42,568 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:47:42,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:47:42,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:47:43,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:47:43,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 39 states and 67 transitions. [2018-10-26 19:47:43,329 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 67 transitions. [2018-10-26 19:47:43,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-26 19:47:43,330 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:47:43,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:47:44,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:47:44,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:47:44,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 47 states and 81 transitions. [2018-10-26 19:47:44,973 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 81 transitions. [2018-10-26 19:47:44,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-26 19:47:44,973 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:47:44,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:47:45,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:47:46,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:47:46,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 54 states and 94 transitions. [2018-10-26 19:47:46,125 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 94 transitions. [2018-10-26 19:47:46,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-26 19:47:46,126 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:47:46,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:47:46,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:47:46,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:47:46,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 55 states and 94 transitions. [2018-10-26 19:47:46,476 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 94 transitions. [2018-10-26 19:47:46,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-26 19:47:46,477 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:47:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:47:46,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:47:46,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:47:46,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 56 states and 95 transitions. [2018-10-26 19:47:46,601 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 95 transitions. [2018-10-26 19:47:46,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-26 19:47:46,602 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:47:46,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:47:46,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:47:48,800 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-10-26 19:47:49,324 WARN L179 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-26 19:47:49,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:47:49,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 67 states and 114 transitions. [2018-10-26 19:47:49,789 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 114 transitions. [2018-10-26 19:47:49,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-26 19:47:49,789 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:47:49,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:47:49,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:47:50,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:47:50,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 70 states and 120 transitions. [2018-10-26 19:47:50,203 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 120 transitions. [2018-10-26 19:47:50,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-26 19:47:50,204 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:47:50,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:47:51,150 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:47:54,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:47:54,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 88 states and 157 transitions. [2018-10-26 19:47:54,893 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 157 transitions. [2018-10-26 19:47:54,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-26 19:47:54,894 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:47:54,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:47:55,243 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:47:56,848 WARN L179 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-10-26 19:47:58,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:47:58,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 103 states and 181 transitions. [2018-10-26 19:47:58,477 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 181 transitions. [2018-10-26 19:47:58,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-26 19:47:58,478 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:47:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:47:58,570 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:47:58,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:47:58,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 104 states and 183 transitions. [2018-10-26 19:47:58,998 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 183 transitions. [2018-10-26 19:47:58,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 19:47:58,998 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:47:59,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:47:59,581 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:48:00,960 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-10-26 19:48:03,528 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-10-26 19:48:04,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:48:04,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 122 states and 219 transitions. [2018-10-26 19:48:04,066 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 219 transitions. [2018-10-26 19:48:04,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 19:48:04,067 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:48:04,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:48:04,416 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:48:04,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:48:04,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 124 states and 225 transitions. [2018-10-26 19:48:04,984 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 225 transitions. [2018-10-26 19:48:04,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 19:48:04,985 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:48:05,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:48:05,312 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:48:05,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:48:05,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 125 states and 228 transitions. [2018-10-26 19:48:05,566 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 228 transitions. [2018-10-26 19:48:05,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 19:48:05,568 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:48:05,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:48:06,622 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:48:10,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:48:10,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 140 states and 256 transitions. [2018-10-26 19:48:10,692 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 256 transitions. [2018-10-26 19:48:10,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 19:48:10,693 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:48:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:48:11,956 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:48:12,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:48:12,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 142 states and 262 transitions. [2018-10-26 19:48:12,637 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 262 transitions. [2018-10-26 19:48:12,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 19:48:12,638 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:48:12,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:48:12,958 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:48:13,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:48:13,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 143 states and 267 transitions. [2018-10-26 19:48:13,344 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 267 transitions. [2018-10-26 19:48:13,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 19:48:13,344 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:48:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:48:13,640 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:48:14,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:48:14,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 144 states and 271 transitions. [2018-10-26 19:48:14,074 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 271 transitions. [2018-10-26 19:48:14,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 19:48:14,074 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:48:14,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:48:15,726 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:48:21,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:48:21,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 164 states and 305 transitions. [2018-10-26 19:48:21,868 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 305 transitions. [2018-10-26 19:48:21,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 19:48:21,869 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:48:21,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:48:22,208 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:48:22,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:48:22,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 165 states and 306 transitions. [2018-10-26 19:48:22,642 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 306 transitions. [2018-10-26 19:48:22,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 19:48:22,643 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:48:22,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:48:23,062 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:48:23,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:48:23,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 166 states and 309 transitions. [2018-10-26 19:48:23,625 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 309 transitions. [2018-10-26 19:48:23,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-26 19:48:23,625 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:48:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:48:24,563 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:48:29,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:48:29,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 181 states and 335 transitions. [2018-10-26 19:48:29,749 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 335 transitions. [2018-10-26 19:48:29,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 19:48:29,750 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:48:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:48:31,410 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:48:38,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:48:38,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 194 states and 360 transitions. [2018-10-26 19:48:38,604 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 360 transitions. [2018-10-26 19:48:38,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-26 19:48:38,605 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:48:38,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:48:39,733 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 19:48:40,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:48:40,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 193 states and 350 transitions. [2018-10-26 19:48:40,334 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 350 transitions. [2018-10-26 19:48:40,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-26 19:48:40,335 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:48:40,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:48:41,790 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:48:46,970 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-10-26 19:48:48,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:48:48,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 206 states and 382 transitions. [2018-10-26 19:48:48,076 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 382 transitions. [2018-10-26 19:48:48,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-26 19:48:48,077 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:48:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:48:49,150 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:48:50,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:48:50,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 210 states and 386 transitions. [2018-10-26 19:48:50,194 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 386 transitions. [2018-10-26 19:48:50,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-26 19:48:50,194 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:48:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:48:51,229 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:48:56,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:48:56,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 220 states and 405 transitions. [2018-10-26 19:48:56,496 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 405 transitions. [2018-10-26 19:48:56,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-26 19:48:56,496 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:48:56,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:48:57,380 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:48:58,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:48:58,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 224 states and 409 transitions. [2018-10-26 19:48:58,232 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 409 transitions. [2018-10-26 19:48:58,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-26 19:48:58,233 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:48:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:49:00,898 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:49:04,508 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2018-10-26 19:49:08,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:49:08,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 239 states and 442 transitions. [2018-10-26 19:49:08,731 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 442 transitions. [2018-10-26 19:49:08,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-26 19:49:08,732 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:49:08,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:49:09,116 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:49:11,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:49:11,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 245 states and 451 transitions. [2018-10-26 19:49:11,348 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 451 transitions. [2018-10-26 19:49:11,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-26 19:49:11,348 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:49:11,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:49:13,059 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:49:17,015 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-10-26 19:49:20,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:49:20,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 259 states and 480 transitions. [2018-10-26 19:49:20,296 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 480 transitions. [2018-10-26 19:49:20,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-26 19:49:20,298 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:49:20,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:49:20,669 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:49:22,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:49:22,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 265 states and 489 transitions. [2018-10-26 19:49:22,487 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 489 transitions. [2018-10-26 19:49:22,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-26 19:49:22,488 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:49:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:49:22,673 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:49:23,203 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-10-26 19:49:23,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:49:23,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 267 states and 493 transitions. [2018-10-26 19:49:23,430 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 493 transitions. [2018-10-26 19:49:23,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-26 19:49:23,431 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:49:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:49:23,973 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:49:27,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:49:27,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 272 states and 504 transitions. [2018-10-26 19:49:27,871 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 504 transitions. [2018-10-26 19:49:27,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-26 19:49:27,872 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:49:27,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:49:28,745 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:49:30,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:49:30,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 273 states and 505 transitions. [2018-10-26 19:49:30,030 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 505 transitions. [2018-10-26 19:49:30,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-26 19:49:30,030 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:49:30,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:49:30,985 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:49:32,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:49:32,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 276 states and 514 transitions. [2018-10-26 19:49:32,298 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 514 transitions. [2018-10-26 19:49:32,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-26 19:49:32,299 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:49:32,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:49:33,219 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:49:35,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:49:35,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 281 states and 527 transitions. [2018-10-26 19:49:35,497 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 527 transitions. [2018-10-26 19:49:35,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-26 19:49:35,498 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:49:35,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:49:35,732 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:49:37,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:49:37,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 285 states and 537 transitions. [2018-10-26 19:49:37,662 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 537 transitions. [2018-10-26 19:49:37,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-26 19:49:37,662 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:49:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:49:38,022 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:49:39,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:49:39,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 288 states and 546 transitions. [2018-10-26 19:49:39,209 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 546 transitions. [2018-10-26 19:49:39,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 19:49:39,210 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:49:39,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:49:41,004 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:49:44,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:49:44,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 291 states and 554 transitions. [2018-10-26 19:49:44,383 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 554 transitions. [2018-10-26 19:49:44,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 19:49:44,384 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:49:44,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:49:45,161 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:49:48,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:49:48,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 298 states and 567 transitions. [2018-10-26 19:49:48,671 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 567 transitions. [2018-10-26 19:49:48,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 19:49:48,672 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:49:48,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:49:49,417 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:49:50,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 19:49:50,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 301 states and 576 transitions. [2018-10-26 19:49:50,806 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 576 transitions. [2018-10-26 19:49:50,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-26 19:49:50,807 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 19:49:51,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 19:49:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 19:49:54,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 19:49:55,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 19:49:55,666 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 45 iterations. [2018-10-26 19:49:55,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 26.10 07:49:55 ImpRootNode [2018-10-26 19:49:55,838 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-10-26 19:49:55,839 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 19:49:55,839 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 19:49:55,839 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 19:49:55,840 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:47:40" (3/4) ... [2018-10-26 19:49:55,842 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-26 19:49:56,020 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_bacb244d-d89e-42e3-bf6b-9d6aea9309d1/bin-2019/ukojak/witness.graphml [2018-10-26 19:49:56,020 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 19:49:56,021 INFO L168 Benchmark]: Toolchain (without parser) took 140386.94 ms. Allocated memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: 1.5 GB). Free memory was 953.8 MB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 371.7 MB. Max. memory is 11.5 GB. [2018-10-26 19:49:56,021 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 19:49:56,022 INFO L168 Benchmark]: CACSL2BoogieTranslator took 390.15 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 935.0 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-10-26 19:49:56,022 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.50 ms. Allocated memory is still 1.0 GB. Free memory was 935.0 MB in the beginning and 929.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-26 19:49:56,022 INFO L168 Benchmark]: Boogie Preprocessor took 114.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 929.6 MB in the beginning and 1.1 GB in the end (delta: -193.9 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-10-26 19:49:56,022 INFO L168 Benchmark]: RCFGBuilder took 4308.10 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -33.2 MB). Peak memory consumption was 338.0 MB. Max. memory is 11.5 GB. [2018-10-26 19:49:56,025 INFO L168 Benchmark]: CodeCheck took 135334.42 ms. Allocated memory was 1.2 GB in the beginning and 2.5 GB in the end (delta: 1.3 GB). Free memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: -956.6 MB). Peak memory consumption was 336.3 MB. Max. memory is 11.5 GB. [2018-10-26 19:49:56,025 INFO L168 Benchmark]: Witness Printer took 180.89 ms. Allocated memory is still 2.5 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. [2018-10-26 19:49:56,027 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, 142 locations, 1 error locations. UNSAFE Result, 135.1s OverallTime, 45 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 576912380 SDtfs, -1779227702 SDslu, -1979251008 SDs, 0 SdLazy, -1090931922 SolverSat, -1414756556 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 85.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12180 GetRequests, 10504 SyntacticMatches, 730 SemanticMatches, 946 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579357 ImplicationChecksByTransitivity, 120.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 4.1s SatisfiabilityAnalysisTime, 29.2s InterpolantComputationTime, 1319 NumberOfCodeBlocks, 1319 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 1223 ConstructedInterpolants, 0 QuantifiedInterpolants, 456077 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 44 InterpolantComputations, 10 PerfectInterpolantSequences, 142/725 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: [L71] char p12_old ; [L72] char p12_new ; [L73] _Bool ep12 ; [L75] char p13_old ; [L76] char p13_new ; [L77] _Bool ep13 ; [L79] char p21_old ; [L80] char p21_new ; [L81] _Bool ep21 ; [L83] char p23_old ; [L84] char p23_new ; [L85] _Bool ep23 ; [L87] char p31_old ; [L88] char p31_new ; [L89] _Bool ep31 ; [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 ; [L69] msg_t nomsg = (msg_t )-1; [L70] port_t p12 ; [L74] port_t p13 ; [L78] port_t p21 ; [L82] port_t p23 ; [L86] port_t p31 ; [L90] port_t p32 ; [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() [L596] CALL, EXPR init() [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] RET return (tmp___5); [L596] EXPR init() [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=2, id2=62, id3=4, m1=3, m2=61, m3=3, max1=2, max2=62, 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 [L613] CALL node1() [L120] _Bool newmax ; [L123] newmax = (_Bool)0 [L124] COND FALSE !(\read(mode1)) [L152] COND TRUE (int )r1 < 1 [L153] COND FALSE !(\read(ep12)) [L158] COND TRUE \read(ep13) [L159] COND TRUE \read(newmax1) [L160] COND TRUE, EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L160] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L164] RET mode1 = (_Bool)1 [L613] node1() [L614] CALL node2() [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] COND TRUE, 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] RET mode2 = (_Bool)1 [L614] node2() [L615] CALL node3() [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] COND TRUE, EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L262] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L266] RET mode3 = (_Bool)1 [L615] node3() [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 [L628] CALL, EXPR check() [L505] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=62, id3=4, m1=3, m2=61, m3=3, max1=2, max2=62, 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=2, p21=0, p21_new=-1, p21_old=62, 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=2, id2=62, id3=4, m1=3, m2=61, m3=3, max1=2, max2=62, 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=2, p21=0, p21_new=-1, p21_old=62, 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=2, id2=62, id3=4, m1=3, m2=61, m3=3, max1=2, max2=62, 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=2, p21=0, p21_new=-1, p21_old=62, 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=2, id2=62, id3=4, m1=3, m2=61, m3=3, max1=2, max2=62, 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=2, p21=0, p21_new=-1, p21_old=62, 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=2, id2=62, id3=4, m1=3, m2=61, m3=3, max1=2, max2=62, 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=2, p21=0, p21_new=-1, p21_old=62, 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=2, id2=62, id3=4, m1=3, m2=61, m3=3, max1=2, max2=62, 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=2, p21=0, p21_new=-1, p21_old=62, 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=2, id2=62, id3=4, m1=3, m2=61, m3=3, max1=2, max2=62, 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=2, p21=0, p21_new=-1, p21_old=62, 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=2, id2=62, id3=4, m1=3, m2=61, m3=3, max1=2, max2=62, 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=2, p21=0, p21_new=-1, p21_old=62, 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=2, id2=62, id3=4, m1=3, m2=61, m3=3, max1=2, max2=62, 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=2, p21=0, p21_new=-1, p21_old=62, 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=2, id2=62, id3=4, m1=3, m2=61, m3=3, max1=2, max2=62, 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=2, p21=0, p21_new=-1, p21_old=62, 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=2, id2=62, id3=4, m1=3, m2=61, m3=3, max1=2, max2=62, 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=2, p21=0, p21_new=-1, p21_old=62, 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] RET return (tmp); [L628] EXPR check() [L628] c1 = check() [L629] CALL assert(c1) [L641] COND FALSE, RET !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=62, id3=4, m1=3, m2=61, m3=3, max1=2, max2=62, 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=2, p21=0, p21_new=-1, p21_old=62, 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] [L629] assert(c1) [L630] i2 ++ VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=62, id3=4, m1=3, m2=61, m3=3, max1=2, max2=62, 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=2, p21=0, p21_new=-1, p21_old=62, 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 [L613] CALL node1() [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] RET mode1 = (_Bool)0 [L613] node1() [L614] CALL node2() [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 FALSE !((int )r2 == 2) [L201] RET mode2 = (_Bool)0 [L614] node2() [L615] CALL node3() [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] RET mode3 = (_Bool)0 [L615] node3() [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 [L628] CALL, EXPR check() [L505] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=62, id3=4, m1=62, m2=4, m3=2, max1=62, max2=62, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, 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=2, id2=62, id3=4, m1=62, m2=4, m3=2, max1=62, max2=62, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, 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=2, id2=62, id3=4, m1=62, m2=4, m3=2, max1=62, max2=62, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, 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=2, id2=62, id3=4, m1=62, m2=4, m3=2, max1=62, max2=62, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, 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=2, id2=62, id3=4, m1=62, m2=4, m3=2, max1=62, max2=62, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, 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=2, id2=62, id3=4, m1=62, m2=4, m3=2, max1=62, max2=62, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, 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=2, id2=62, id3=4, m1=62, m2=4, m3=2, max1=62, max2=62, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, 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=2, id2=62, id3=4, m1=62, m2=4, m3=2, max1=62, max2=62, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, 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=2, id2=62, id3=4, m1=62, m2=4, m3=2, max1=62, max2=62, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, 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=2, id2=62, id3=4, m1=62, m2=4, m3=2, max1=62, max2=62, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, 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=2, id2=62, id3=4, m1=62, m2=4, m3=2, max1=62, max2=62, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, 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] RET return (tmp); [L628] EXPR check() [L628] c1 = check() [L629] CALL assert(c1) [L641] COND FALSE, RET !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=62, id3=4, m1=62, m2=4, m3=2, max1=62, max2=62, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, 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] [L629] assert(c1) [L630] i2 ++ VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=62, id3=4, m1=62, m2=4, m3=2, max1=62, max2=62, max3=4, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, 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 [L613] CALL node1() [L120] _Bool newmax ; [L123] newmax = (_Bool)0 [L124] COND FALSE !(\read(mode1)) [L152] COND FALSE !((int )r1 < 1) [L164] RET mode1 = (_Bool)1 [L613] node1() [L614] CALL node2() [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 FALSE !(\read(newmax2)) [L209] COND FALSE !(\read(ep23)) [L215] RET mode2 = (_Bool)1 [L614] node2() [L615] CALL node3() [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] RET mode3 = (_Bool)1 [L615] node3() [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 [L628] CALL, EXPR check() [L505] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=62, id3=4, m1=62, m2=4, m3=2, max1=62, max2=62, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, 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=2, id2=62, id3=4, m1=62, m2=4, m3=2, max1=62, max2=62, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, 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=2, id2=62, id3=4, m1=62, m2=4, m3=2, max1=62, max2=62, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, 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=2, id2=62, id3=4, m1=62, m2=4, m3=2, max1=62, max2=62, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, 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=2, id2=62, id3=4, m1=62, m2=4, m3=2, max1=62, max2=62, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, 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=2, id2=62, id3=4, m1=62, m2=4, m3=2, max1=62, max2=62, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, 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=2, id2=62, id3=4, m1=62, m2=4, m3=2, max1=62, max2=62, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, 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=2, id2=62, id3=4, m1=62, m2=4, m3=2, max1=62, max2=62, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, 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=2, id2=62, id3=4, m1=62, m2=4, m3=2, max1=62, max2=62, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, 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=2, id2=62, id3=4, m1=62, m2=4, m3=2, max1=62, max2=62, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, 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=2, id2=62, id3=4, m1=62, m2=4, m3=2, max1=62, max2=62, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, 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] RET return (tmp); [L628] EXPR check() [L628] c1 = check() [L629] CALL assert(c1) [L641] COND FALSE, RET !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=62, id3=4, m1=62, m2=4, m3=2, max1=62, max2=62, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, 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] [L629] assert(c1) [L630] i2 ++ VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=62, id3=4, m1=62, m2=4, m3=2, max1=62, max2=62, max3=4, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=0, 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 [L613] CALL node1() [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 FALSE !((int )m1 > (int )max1) [L134] COND FALSE !(\read(ep31)) [L142] newmax1 = newmax [L143] COND TRUE (int )r1 == 2 [L144] COND FALSE !((int )max1 == (int )id1) [L147] nl1 = (char)1 [L150] RET mode1 = (_Bool)0 [L613] node1() [L614] CALL node2() [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 TRUE (int )max2 == (int )id2 [L196] st2 = (char)1 [L201] RET mode2 = (_Bool)0 [L614] node2() [L615] CALL node3() [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] RET mode3 = (_Bool)0 [L615] node3() [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 [L628] CALL, EXPR check() [L505] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=62, id3=4, m1=-1, m2=-1, m3=-1, max1=62, max2=62, max3=4, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, 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=2, id2=62, id3=4, m1=-1, m2=-1, m3=-1, max1=62, max2=62, max3=4, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L556] RET return (tmp); [L628] EXPR check() [L628] c1 = check() [L629] CALL assert(c1) [L641] COND TRUE ! arg VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=62, id3=4, m1=-1, m2=-1, m3=-1, max1=62, max2=62, max3=4, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L643] __VERIFIER_error() VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=2, id2=62, id3=4, m1=-1, m2=-1, m3=-1, max1=62, max2=62, max3=4, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=1, 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=2, r2=2, r3=2, st1=0, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 390.15 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 935.0 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.50 ms. Allocated memory is still 1.0 GB. Free memory was 935.0 MB in the beginning and 929.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 114.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 929.6 MB in the beginning and 1.1 GB in the end (delta: -193.9 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4308.10 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -33.2 MB). Peak memory consumption was 338.0 MB. Max. memory is 11.5 GB. * CodeCheck took 135334.42 ms. Allocated memory was 1.2 GB in the beginning and 2.5 GB in the end (delta: 1.3 GB). Free memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: -956.6 MB). Peak memory consumption was 336.3 MB. Max. memory is 11.5 GB. * Witness Printer took 180.89 ms. Allocated memory is still 2.5 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...