./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_997200b8-313f-41d3-b628-812ccd25896f/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_997200b8-313f-41d3-b628-812ccd25896f/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_997200b8-313f-41d3-b628-812ccd25896f/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_997200b8-313f-41d3-b628-812ccd25896f/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/working_dir_997200b8-313f-41d3-b628-812ccd25896f/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_997200b8-313f-41d3-b628-812ccd25896f/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 597d75969acc1d8bcee1b027bc47b6559ce75136 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-5842f4b [2018-11-18 13:09:30,584 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 13:09:30,586 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 13:09:30,594 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 13:09:30,594 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 13:09:30,595 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 13:09:30,596 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 13:09:30,597 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 13:09:30,598 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 13:09:30,599 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 13:09:30,599 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 13:09:30,600 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 13:09:30,600 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 13:09:30,602 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 13:09:30,603 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 13:09:30,603 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 13:09:30,604 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 13:09:30,605 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 13:09:30,607 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 13:09:30,608 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 13:09:30,608 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 13:09:30,610 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 13:09:30,611 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 13:09:30,611 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 13:09:30,612 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 13:09:30,612 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 13:09:30,613 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 13:09:30,614 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 13:09:30,615 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 13:09:30,615 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 13:09:30,615 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 13:09:30,616 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 13:09:30,616 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 13:09:30,616 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 13:09:30,618 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 13:09:30,618 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 13:09:30,619 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_997200b8-313f-41d3-b628-812ccd25896f/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-18 13:09:30,629 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 13:09:30,629 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 13:09:30,630 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 13:09:30,630 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 13:09:30,630 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 13:09:30,630 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 13:09:30,631 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 13:09:30,631 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 13:09:30,631 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 13:09:30,631 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 13:09:30,631 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 13:09:30,631 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 13:09:30,631 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 13:09:30,632 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 13:09:30,632 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 13:09:30,632 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 13:09:30,632 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 13:09:30,632 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 13:09:30,632 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-18 13:09:30,632 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-18 13:09:30,634 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 13:09:30,634 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 13:09:30,634 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-18 13:09:30,635 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 13:09:30,635 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 13:09:30,635 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 13:09:30,635 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-18 13:09:30,635 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 13:09:30,635 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 13:09:30,635 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_997200b8-313f-41d3-b628-812ccd25896f/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 -> 597d75969acc1d8bcee1b027bc47b6559ce75136 [2018-11-18 13:09:30,659 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 13:09:30,668 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 13:09:30,671 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 13:09:30,672 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 13:09:30,672 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 13:09:30,673 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_997200b8-313f-41d3-b628-812ccd25896f/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.1.ufo.UNBOUNDED.pals.c [2018-11-18 13:09:30,716 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_997200b8-313f-41d3-b628-812ccd25896f/bin-2019/ukojak/data/c8c770aa7/bbb29afff56a4c59a7c55f79558113e0/FLAG98edec73e [2018-11-18 13:09:31,150 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 13:09:31,151 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_997200b8-313f-41d3-b628-812ccd25896f/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.1.ufo.UNBOUNDED.pals.c [2018-11-18 13:09:31,159 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_997200b8-313f-41d3-b628-812ccd25896f/bin-2019/ukojak/data/c8c770aa7/bbb29afff56a4c59a7c55f79558113e0/FLAG98edec73e [2018-11-18 13:09:31,169 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_997200b8-313f-41d3-b628-812ccd25896f/bin-2019/ukojak/data/c8c770aa7/bbb29afff56a4c59a7c55f79558113e0 [2018-11-18 13:09:31,171 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 13:09:31,171 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 13:09:31,172 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 13:09:31,172 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 13:09:31,174 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 13:09:31,175 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:09:31" (1/1) ... [2018-11-18 13:09:31,176 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@345e74ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:09:31, skipping insertion in model container [2018-11-18 13:09:31,177 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:09:31" (1/1) ... [2018-11-18 13:09:31,183 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 13:09:31,210 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 13:09:31,359 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:09:31,369 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 13:09:31,445 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:09:31,459 INFO L195 MainTranslator]: Completed translation [2018-11-18 13:09:31,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:09:31 WrapperNode [2018-11-18 13:09:31,460 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 13:09:31,460 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 13:09:31,460 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 13:09:31,460 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 13:09:31,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:09:31" (1/1) ... [2018-11-18 13:09:31,475 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:09:31" (1/1) ... [2018-11-18 13:09:31,498 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 13:09:31,498 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 13:09:31,498 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 13:09:31,498 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 13:09:31,504 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:09:31" (1/1) ... [2018-11-18 13:09:31,504 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:09:31" (1/1) ... [2018-11-18 13:09:31,506 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:09:31" (1/1) ... [2018-11-18 13:09:31,506 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:09:31" (1/1) ... [2018-11-18 13:09:31,510 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:09:31" (1/1) ... [2018-11-18 13:09:31,517 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:09:31" (1/1) ... [2018-11-18 13:09:31,519 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:09:31" (1/1) ... [2018-11-18 13:09:31,521 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 13:09:31,522 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 13:09:31,522 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 13:09:31,522 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 13:09:31,523 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:09:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_997200b8-313f-41d3-b628-812ccd25896f/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-11-18 13:09:31,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 13:09:31,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 13:09:33,254 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 13:09:33,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:09:33 BoogieIcfgContainer [2018-11-18 13:09:33,254 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 13:09:33,255 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-18 13:09:33,255 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-18 13:09:33,262 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-18 13:09:33,262 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:09:33" (1/1) ... [2018-11-18 13:09:33,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:09:33,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:09:33,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 21 states and 33 transitions. [2018-11-18 13:09:33,293 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 33 transitions. [2018-11-18 13:09:33,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-18 13:09:33,295 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:09:33,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:09:33,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:09:33,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:09:33,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 22 states and 34 transitions. [2018-11-18 13:09:33,727 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 34 transitions. [2018-11-18 13:09:33,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-18 13:09:33,727 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:09:33,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:09:33,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:09:34,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:09:34,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 26 states and 41 transitions. [2018-11-18 13:09:34,110 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 41 transitions. [2018-11-18 13:09:34,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-18 13:09:34,111 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:09:34,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:09:34,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:09:34,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:09:34,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 31 states and 50 transitions. [2018-11-18 13:09:34,546 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 50 transitions. [2018-11-18 13:09:34,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-18 13:09:34,549 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:09:34,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:09:34,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:09:35,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:09:35,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 37 states and 61 transitions. [2018-11-18 13:09:35,114 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 61 transitions. [2018-11-18 13:09:35,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-18 13:09:35,114 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:09:35,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:09:35,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:09:35,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:09:35,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 45 states and 74 transitions. [2018-11-18 13:09:35,823 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 74 transitions. [2018-11-18 13:09:35,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 13:09:35,824 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:09:35,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:09:36,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:09:36,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:09:36,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 52 states and 86 transitions. [2018-11-18 13:09:36,686 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 86 transitions. [2018-11-18 13:09:36,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 13:09:36,687 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:09:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:09:36,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:09:36,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:09:36,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 53 states and 86 transitions. [2018-11-18 13:09:36,967 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 86 transitions. [2018-11-18 13:09:36,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 13:09:36,967 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:09:36,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:09:37,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:09:37,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:09:37,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 54 states and 87 transitions. [2018-11-18 13:09:37,016 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 87 transitions. [2018-11-18 13:09:37,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 13:09:37,017 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:09:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:09:37,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:09:38,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:09:38,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 65 states and 106 transitions. [2018-11-18 13:09:38,900 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 106 transitions. [2018-11-18 13:09:38,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 13:09:38,900 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:09:38,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:09:39,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:09:39,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:09:39,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 68 states and 112 transitions. [2018-11-18 13:09:39,255 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 112 transitions. [2018-11-18 13:09:39,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 13:09:39,256 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:09:39,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:09:39,854 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:09:42,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:09:42,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 86 states and 145 transitions. [2018-11-18 13:09:42,555 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 145 transitions. [2018-11-18 13:09:42,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 13:09:42,556 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:09:42,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:09:43,027 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:09:46,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:09:46,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 105 states and 179 transitions. [2018-11-18 13:09:46,012 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 179 transitions. [2018-11-18 13:09:46,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 13:09:46,013 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:09:46,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:09:46,494 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:09:49,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:09:49,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 123 states and 210 transitions. [2018-11-18 13:09:49,536 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 210 transitions. [2018-11-18 13:09:49,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 13:09:49,537 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:09:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:09:49,701 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:09:49,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:09:49,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 124 states and 211 transitions. [2018-11-18 13:09:49,926 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 211 transitions. [2018-11-18 13:09:49,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 13:09:49,927 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:09:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:09:50,094 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:09:50,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:09:50,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 125 states and 215 transitions. [2018-11-18 13:09:50,411 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 215 transitions. [2018-11-18 13:09:50,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 13:09:50,412 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:09:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:09:51,228 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:09:54,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:09:54,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 140 states and 243 transitions. [2018-11-18 13:09:54,609 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 243 transitions. [2018-11-18 13:09:54,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 13:09:54,609 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:09:54,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:09:54,722 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:09:55,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:09:55,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 141 states and 248 transitions. [2018-11-18 13:09:55,083 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 248 transitions. [2018-11-18 13:09:55,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 13:09:55,083 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:09:55,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:09:55,191 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:09:55,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:09:55,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 143 states and 251 transitions. [2018-11-18 13:09:55,727 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 251 transitions. [2018-11-18 13:09:55,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 13:09:55,728 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:09:55,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:09:55,846 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:09:56,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:09:56,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 144 states and 256 transitions. [2018-11-18 13:09:56,198 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 256 transitions. [2018-11-18 13:09:56,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 13:09:56,198 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:09:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:09:56,271 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:09:56,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:09:56,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 145 states and 257 transitions. [2018-11-18 13:09:56,541 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 257 transitions. [2018-11-18 13:09:56,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 13:09:56,541 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:09:56,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:09:57,602 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:10:02,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:10:02,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 167 states and 293 transitions. [2018-11-18 13:10:02,732 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 293 transitions. [2018-11-18 13:10:02,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 13:10:02,732 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:10:02,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:10:03,154 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:10:04,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:10:04,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 172 states and 302 transitions. [2018-11-18 13:10:04,541 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 302 transitions. [2018-11-18 13:10:04,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 13:10:04,541 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:10:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:10:05,840 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:10:12,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:10:12,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 185 states and 329 transitions. [2018-11-18 13:10:12,012 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 329 transitions. [2018-11-18 13:10:12,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 13:10:12,012 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:10:12,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:10:12,172 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 13:10:12,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:10:12,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 185 states and 321 transitions. [2018-11-18 13:10:12,689 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 321 transitions. [2018-11-18 13:10:12,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 13:10:12,709 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:10:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:10:13,979 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:10:19,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:10:19,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 200 states and 374 transitions. [2018-11-18 13:10:19,672 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 374 transitions. [2018-11-18 13:10:19,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 13:10:19,673 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:10:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:10:19,967 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:10:21,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:10:21,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 204 states and 378 transitions. [2018-11-18 13:10:21,069 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 378 transitions. [2018-11-18 13:10:21,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 13:10:21,070 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:10:21,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:10:22,108 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:10:27,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:10:27,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 217 states and 403 transitions. [2018-11-18 13:10:27,394 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 403 transitions. [2018-11-18 13:10:27,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 13:10:27,395 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:10:27,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:10:27,524 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:10:29,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:10:29,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 223 states and 408 transitions. [2018-11-18 13:10:29,035 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 408 transitions. [2018-11-18 13:10:29,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 13:10:29,035 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:10:29,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:10:30,253 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:10:35,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:10:35,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 234 states and 430 transitions. [2018-11-18 13:10:35,150 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 430 transitions. [2018-11-18 13:10:35,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 13:10:35,150 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:10:35,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:10:35,295 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:10:37,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:10:37,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 241 states and 442 transitions. [2018-11-18 13:10:37,288 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 442 transitions. [2018-11-18 13:10:37,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 13:10:37,288 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:10:37,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:10:37,457 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:10:38,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:10:38,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 243 states and 443 transitions. [2018-11-18 13:10:38,126 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 443 transitions. [2018-11-18 13:10:38,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 13:10:38,126 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:10:38,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:10:39,265 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:10:45,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:10:45,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 258 states and 478 transitions. [2018-11-18 13:10:45,646 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 478 transitions. [2018-11-18 13:10:45,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 13:10:45,646 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:10:45,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:10:45,755 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:10:47,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:10:47,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 265 states and 491 transitions. [2018-11-18 13:10:47,854 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 491 transitions. [2018-11-18 13:10:47,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 13:10:47,854 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:10:47,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:10:47,966 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:10:48,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:10:48,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 267 states and 494 transitions. [2018-11-18 13:10:48,510 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 494 transitions. [2018-11-18 13:10:48,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 13:10:48,510 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:10:48,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:10:49,991 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:10:55,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:10:55,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 276 states and 518 transitions. [2018-11-18 13:10:55,770 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 518 transitions. [2018-11-18 13:10:55,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 13:10:55,770 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:10:55,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:10:56,062 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:10:58,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:10:58,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 280 states and 529 transitions. [2018-11-18 13:10:58,873 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 529 transitions. [2018-11-18 13:10:58,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 13:10:58,873 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:10:58,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:10:59,163 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:10:59,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:10:59,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 282 states and 532 transitions. [2018-11-18 13:10:59,694 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 532 transitions. [2018-11-18 13:10:59,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 13:10:59,694 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:10:59,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:10:59,946 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:11:00,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:11:00,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 283 states and 533 transitions. [2018-11-18 13:11:00,494 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 533 transitions. [2018-11-18 13:11:00,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 13:11:00,495 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:11:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:11:01,348 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:11:07,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:11:07,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 296 states and 564 transitions. [2018-11-18 13:11:07,618 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 564 transitions. [2018-11-18 13:11:07,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 13:11:07,619 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:11:07,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:11:07,742 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:11:10,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:11:10,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 305 states and 588 transitions. [2018-11-18 13:11:10,970 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 588 transitions. [2018-11-18 13:11:10,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 13:11:10,970 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:11:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:11:11,148 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:11:11,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:11:11,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 306 states and 599 transitions. [2018-11-18 13:11:11,983 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 599 transitions. [2018-11-18 13:11:11,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 13:11:11,984 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:11:12,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:11:12,103 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:11:13,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:11:13,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 310 states and 616 transitions. [2018-11-18 13:11:13,921 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 616 transitions. [2018-11-18 13:11:13,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 13:11:13,921 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:11:14,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:11:14,051 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:11:14,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:11:14,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 311 states and 617 transitions. [2018-11-18 13:11:14,831 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 617 transitions. [2018-11-18 13:11:14,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 13:11:14,831 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:11:14,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:11:14,958 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:11:16,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:11:16,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 315 states and 626 transitions. [2018-11-18 13:11:16,926 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 626 transitions. [2018-11-18 13:11:16,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 13:11:16,926 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:11:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:11:17,896 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:11:20,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:11:20,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 318 states and 635 transitions. [2018-11-18 13:11:20,828 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 635 transitions. [2018-11-18 13:11:20,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 13:11:20,828 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:11:20,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:11:21,552 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:11:25,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:11:25,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 325 states and 654 transitions. [2018-11-18 13:11:25,482 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 654 transitions. [2018-11-18 13:11:25,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 13:11:25,482 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:11:25,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:11:26,214 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:11:28,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:11:28,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 330 states and 669 transitions. [2018-11-18 13:11:28,622 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 669 transitions. [2018-11-18 13:11:28,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 13:11:28,622 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:11:28,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:11:29,341 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:11:32,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:11:32,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 336 states and 684 transitions. [2018-11-18 13:11:32,278 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 684 transitions. [2018-11-18 13:11:32,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 13:11:32,278 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:11:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:11:32,982 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:11:34,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 13:11:34,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 340 states and 697 transitions. [2018-11-18 13:11:34,592 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 697 transitions. [2018-11-18 13:11:34,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-18 13:11:34,593 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 13:11:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:11:35,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:11:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:11:35,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:11:35,725 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 50 iterations. [2018-11-18 13:11:35,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 18.11 01:11:35 ImpRootNode [2018-11-18 13:11:35,830 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-18 13:11:35,830 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 13:11:35,830 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 13:11:35,831 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 13:11:35,832 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:09:33" (3/4) ... [2018-11-18 13:11:35,834 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 13:11:35,936 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_997200b8-313f-41d3-b628-812ccd25896f/bin-2019/ukojak/witness.graphml [2018-11-18 13:11:35,936 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 13:11:35,937 INFO L168 Benchmark]: Toolchain (without parser) took 124766.08 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 959.1 MB in the beginning and 2.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 596.0 MB. Max. memory is 11.5 GB. [2018-11-18 13:11:35,938 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:11:35,938 INFO L168 Benchmark]: CACSL2BoogieTranslator took 287.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -157.6 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2018-11-18 13:11:35,939 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 13:11:35,939 INFO L168 Benchmark]: Boogie Preprocessor took 23.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 13:11:35,939 INFO L168 Benchmark]: RCFGBuilder took 1732.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 85.8 MB). Peak memory consumption was 261.3 MB. Max. memory is 11.5 GB. [2018-11-18 13:11:35,939 INFO L168 Benchmark]: CodeCheck took 122575.50 ms. Allocated memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: -963.5 MB). Peak memory consumption was 540.2 MB. Max. memory is 11.5 GB. [2018-11-18 13:11:35,939 INFO L168 Benchmark]: Witness Printer took 106.18 ms. Allocated memory is still 2.7 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:11:35,941 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, 122.4s OverallTime, 50 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 0 SDtfs, -790043052 SDslu, 1477086684 SDs, 0 SdLazy, -230678644 SolverSat, 1657810008 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 82.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14834 GetRequests, 12933 SyntacticMatches, 863 SemanticMatches, 1038 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673987 ImplicationChecksByTransitivity, 111.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 4.1s SatisfiabilityAnalysisTime, 16.8s InterpolantComputationTime, 1567 NumberOfCodeBlocks, 1567 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 1466 ConstructedInterpolants, 0 QuantifiedInterpolants, 601288 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 49 InterpolantComputations, 10 PerfectInterpolantSequences, 198/958 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: 628]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L72] char p12_old ; [L73] char p12_new ; [L74] _Bool ep12 ; [L76] char p13_old ; [L77] char p13_new ; [L78] _Bool ep13 ; [L80] char p21_old ; [L81] char p21_new ; [L82] _Bool ep21 ; [L84] char p23_old ; [L85] char p23_new ; [L86] _Bool ep23 ; [L88] char p31_old ; [L89] char p31_new ; [L90] _Bool ep31 ; [L92] char p32_old ; [L93] char p32_new ; [L94] _Bool ep32 ; [L95] char id1 ; [L96] unsigned char r1 ; [L97] char st1 ; [L98] char nl1 ; [L99] char m1 ; [L100] char max1 ; [L101] _Bool mode1 ; [L102] _Bool newmax1 ; [L103] char id2 ; [L104] unsigned char r2 ; [L105] char st2 ; [L106] char nl2 ; [L107] char m2 ; [L108] char max2 ; [L109] _Bool mode2 ; [L110] _Bool newmax2 ; [L111] char id3 ; [L112] unsigned char r3 ; [L113] char st3 ; [L114] char nl3 ; [L115] char m3 ; [L116] char max3 ; [L117] _Bool mode3 ; [L118] _Bool newmax3 ; [L70] msg_t nomsg = (msg_t )-1; [L71] port_t p12 ; [L75] port_t p13 ; [L79] port_t p21 ; [L83] port_t p23 ; [L87] port_t p31 ; [L91] port_t p32 ; [L281] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L547] int c1 ; [L548] int i2 ; [L551] c1 = 0 [L552] ep12 = __VERIFIER_nondet_bool() [L553] ep13 = __VERIFIER_nondet_bool() [L554] ep21 = __VERIFIER_nondet_bool() [L555] ep23 = __VERIFIER_nondet_bool() [L556] ep31 = __VERIFIER_nondet_bool() [L557] ep32 = __VERIFIER_nondet_bool() [L558] id1 = __VERIFIER_nondet_char() [L559] r1 = __VERIFIER_nondet_uchar() [L560] st1 = __VERIFIER_nondet_char() [L561] nl1 = __VERIFIER_nondet_char() [L562] m1 = __VERIFIER_nondet_char() [L563] max1 = __VERIFIER_nondet_char() [L564] mode1 = __VERIFIER_nondet_bool() [L565] newmax1 = __VERIFIER_nondet_bool() [L566] id2 = __VERIFIER_nondet_char() [L567] r2 = __VERIFIER_nondet_uchar() [L568] st2 = __VERIFIER_nondet_char() [L569] nl2 = __VERIFIER_nondet_char() [L570] m2 = __VERIFIER_nondet_char() [L571] max2 = __VERIFIER_nondet_char() [L572] mode2 = __VERIFIER_nondet_bool() [L573] newmax2 = __VERIFIER_nondet_bool() [L574] id3 = __VERIFIER_nondet_char() [L575] r3 = __VERIFIER_nondet_uchar() [L576] st3 = __VERIFIER_nondet_char() [L577] nl3 = __VERIFIER_nondet_char() [L578] m3 = __VERIFIER_nondet_char() [L579] max3 = __VERIFIER_nondet_char() [L580] mode3 = __VERIFIER_nondet_bool() [L581] newmax3 = __VERIFIER_nondet_bool() [L582] CALL, EXPR init() [L284] _Bool r121 ; [L285] _Bool r131 ; [L286] _Bool r211 ; [L287] _Bool r231 ; [L288] _Bool r311 ; [L289] _Bool r321 ; [L290] _Bool r122 ; [L291] int tmp ; [L292] _Bool r132 ; [L293] int tmp___0 ; [L294] _Bool r212 ; [L295] int tmp___1 ; [L296] _Bool r232 ; [L297] int tmp___2 ; [L298] _Bool r312 ; [L299] int tmp___3 ; [L300] _Bool r322 ; [L301] int tmp___4 ; [L302] int tmp___5 ; [L305] r121 = ep12 [L306] r131 = ep13 [L307] r211 = ep21 [L308] r231 = ep23 [L309] r311 = ep31 [L310] r321 = ep32 [L311] COND FALSE !(\read(r121)) [L314] COND FALSE !(\read(r131)) [L321] tmp = 0 [L323] r122 = (_Bool )tmp [L324] COND FALSE !(\read(r131)) [L327] COND FALSE !(\read(r121)) [L334] tmp___0 = 0 [L336] r132 = (_Bool )tmp___0 [L337] COND FALSE !(\read(r211)) [L340] COND FALSE !(\read(r231)) [L347] tmp___1 = 0 [L349] r212 = (_Bool )tmp___1 [L350] COND FALSE !(\read(r231)) [L353] COND FALSE !(\read(r211)) [L360] tmp___2 = 0 [L362] r232 = (_Bool )tmp___2 [L363] COND TRUE \read(r311) [L364] tmp___3 = 1 [L375] r312 = (_Bool )tmp___3 [L376] COND FALSE !(\read(r321)) [L379] COND TRUE \read(r311) [L380] COND FALSE !(\read(ep12)) [L383] tmp___4 = 0 [L388] r322 = (_Bool )tmp___4 [L389] COND TRUE (int )id1 != (int )id2 [L390] COND TRUE (int )id1 != (int )id3 [L391] COND TRUE (int )id2 != (int )id3 [L392] COND TRUE (int )id1 >= 0 [L393] COND TRUE (int )id2 >= 0 [L394] COND TRUE (int )id3 >= 0 [L395] COND TRUE (int )r1 == 0 [L396] COND TRUE (int )r2 == 0 [L397] COND TRUE (int )r3 == 0 [L398] COND TRUE (int )max1 == (int )id1 [L399] COND TRUE (int )max2 == (int )id2 [L400] COND TRUE (int )max3 == (int )id3 [L401] COND TRUE (int )st1 == 0 [L402] COND TRUE (int )st2 == 0 [L403] COND TRUE (int )st3 == 0 [L404] COND TRUE (int )nl1 == 0 [L405] COND TRUE (int )nl2 == 0 [L406] COND TRUE (int )nl3 == 0 [L407] COND TRUE (int )mode1 == 0 [L408] COND TRUE (int )mode2 == 0 [L409] COND TRUE (int )mode3 == 0 [L410] COND TRUE \read(newmax1) [L411] COND TRUE \read(newmax2) [L412] COND TRUE \read(newmax3) [L413] tmp___5 = 1 [L486] RET return (tmp___5); [L582] EXPR init() [L582] i2 = init() [L584] p12_old = nomsg [L585] p12_new = nomsg [L586] p13_old = nomsg [L587] p13_new = nomsg [L588] p21_old = nomsg [L589] p21_new = nomsg [L590] p23_old = nomsg [L591] p23_new = nomsg [L592] p31_old = nomsg [L593] p31_new = nomsg [L594] p32_old = nomsg [L595] p32_new = nomsg [L596] i2 = 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=3, m3=2, max1=0, max2=2, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L597] COND TRUE 1 [L599] CALL node1() [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND FALSE !(\read(mode1)) [L156] COND TRUE (int )r1 < 2 [L157] COND FALSE !(\read(ep12)) [L162] COND FALSE !(\read(ep13)) [L168] RET mode1 = (_Bool)1 [L599] node1() [L600] CALL node2() [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND FALSE !(\read(mode2)) [L210] COND TRUE (int )r2 < 2 [L211] COND FALSE !(\read(ep21)) [L216] COND FALSE !(\read(ep23)) [L222] RET mode2 = (_Bool)1 [L600] node2() [L601] CALL node3() [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND FALSE !(\read(mode3)) [L264] COND TRUE (int )r3 < 2 [L265] COND TRUE \read(ep31) [L266] COND TRUE \read(newmax3) [L267] COND TRUE, EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L267] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L270] COND FALSE !(\read(ep32)) [L276] RET mode3 = (_Bool)1 [L601] node3() [L602] p12_old = p12_new [L603] p12_new = nomsg [L604] p13_old = p13_new [L605] p13_new = nomsg [L606] p21_old = p21_new [L607] p21_new = nomsg [L608] p23_old = p23_new [L609] p23_new = nomsg [L610] p31_old = p31_new [L611] p31_new = nomsg [L612] p32_old = p32_new [L613] p32_new = nomsg [L614] CALL, EXPR check() [L491] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=3, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-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] [L494] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=3, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-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] [L495] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=3, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-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] [L496] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=3, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-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] [L497] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=3, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-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] [L498] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=3, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-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] [L501] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=3, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-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] [L503] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=3, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-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] [L508] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=3, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-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] [L511] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=3, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-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] [L513] COND TRUE (int )r1 < 2 [L514] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=3, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-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] [L542] RET return (tmp); [L614] EXPR check() [L614] c1 = check() [L615] CALL assert(c1) [L626] COND FALSE, RET !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=3, m3=2, max1=0, max2=2, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-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] [L615] assert(c1) [L597] COND TRUE 1 [L599] CALL node1() [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND TRUE \read(mode1) [L126] COND FALSE !(r1 == 255) [L129] r1 = r1 + 1 [L130] COND FALSE !(\read(ep21)) [L138] COND TRUE \read(ep31) [L139] m1 = p31_old [L140] p31_old = nomsg [L141] COND TRUE (int )m1 > (int )max1 [L142] max1 = m1 [L143] newmax = (_Bool)1 [L146] newmax1 = newmax [L147] COND FALSE !((int )r1 == 2) [L154] RET mode1 = (_Bool)0 [L599] node1() [L600] CALL node2() [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND TRUE \read(mode2) [L180] COND FALSE !(r2 == 255) [L183] r2 = r2 + 1 [L184] COND FALSE !(\read(ep12)) [L192] COND FALSE !(\read(ep32)) [L200] newmax2 = newmax [L201] COND FALSE !((int )r2 == 2) [L208] RET mode2 = (_Bool)0 [L600] node2() [L601] CALL node3() [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND TRUE \read(mode3) [L234] COND FALSE !(r3 == 255) [L237] r3 = r3 + 1 [L238] COND FALSE !(\read(ep13)) [L246] COND FALSE !(\read(ep23)) [L254] newmax3 = newmax [L255] COND FALSE !((int )r3 == 2) [L262] RET mode3 = (_Bool)0 [L601] node3() [L602] p12_old = p12_new [L603] p12_new = nomsg [L604] p13_old = p13_new [L605] p13_new = nomsg [L606] p21_old = p21_new [L607] p21_new = nomsg [L608] p23_old = p23_new [L609] p23_new = nomsg [L610] p31_old = p31_new [L611] p31_new = nomsg [L612] p32_old = p32_new [L613] p32_new = nomsg [L614] CALL, EXPR check() [L491] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, max3=1, 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] [L494] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, max3=1, 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] [L495] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, max3=1, 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] [L496] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, max3=1, 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] [L497] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, max3=1, 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] [L498] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, max3=1, 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] [L501] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, max3=1, 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] [L503] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, max3=1, 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 FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, max3=1, 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 )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, max3=1, 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] [L513] COND TRUE (int )r1 < 2 [L514] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, max3=1, 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] [L542] RET return (tmp); [L614] EXPR check() [L614] c1 = check() [L615] CALL assert(c1) [L626] COND FALSE, RET !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, max3=1, 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] [L615] assert(c1) [L597] COND TRUE 1 [L599] CALL node1() [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND FALSE !(\read(mode1)) [L156] COND TRUE (int )r1 < 2 [L157] COND FALSE !(\read(ep12)) [L162] COND FALSE !(\read(ep13)) [L168] RET mode1 = (_Bool)1 [L599] node1() [L600] CALL node2() [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND FALSE !(\read(mode2)) [L210] COND TRUE (int )r2 < 2 [L211] COND FALSE !(\read(ep21)) [L216] COND FALSE !(\read(ep23)) [L222] RET mode2 = (_Bool)1 [L600] node2() [L601] CALL node3() [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND FALSE !(\read(mode3)) [L264] COND TRUE (int )r3 < 2 [L265] COND TRUE \read(ep31) [L266] COND FALSE !(\read(newmax3)) [L270] COND FALSE !(\read(ep32)) [L276] RET mode3 = (_Bool)1 [L601] node3() [L602] p12_old = p12_new [L603] p12_new = nomsg [L604] p13_old = p13_new [L605] p13_new = nomsg [L606] p21_old = p21_new [L607] p21_new = nomsg [L608] p23_old = p23_new [L609] p23_new = nomsg [L610] p31_old = p31_new [L611] p31_new = nomsg [L612] p32_old = p32_new [L613] p32_new = nomsg [L614] CALL, EXPR check() [L491] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, max3=1, 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] [L494] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, max3=1, 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] [L495] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, max3=1, 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] [L496] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, max3=1, 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] [L497] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, max3=1, 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] [L498] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, max3=1, 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] [L501] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, max3=1, 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] [L503] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, max3=1, 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 FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, max3=1, 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 )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, max3=1, 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] [L513] COND TRUE (int )r1 < 2 [L514] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, max3=1, 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] [L542] RET return (tmp); [L614] EXPR check() [L614] c1 = check() [L615] CALL assert(c1) [L626] COND FALSE, RET !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=1, m2=3, m3=2, max1=1, max2=2, max3=1, 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] [L615] assert(c1) [L597] COND TRUE 1 [L599] CALL node1() [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND TRUE \read(mode1) [L126] COND FALSE !(r1 == 255) [L129] r1 = r1 + 1 [L130] COND FALSE !(\read(ep21)) [L138] COND TRUE \read(ep31) [L139] m1 = p31_old [L140] p31_old = nomsg [L141] COND FALSE !((int )m1 > (int )max1) [L146] newmax1 = newmax [L147] COND TRUE (int )r1 == 2 [L148] COND FALSE !((int )max1 == (int )id1) [L151] nl1 = (char)1 [L154] RET mode1 = (_Bool)0 [L599] node1() [L600] CALL node2() [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND TRUE \read(mode2) [L180] COND FALSE !(r2 == 255) [L183] r2 = r2 + 1 [L184] COND FALSE !(\read(ep12)) [L192] COND FALSE !(\read(ep32)) [L200] newmax2 = newmax [L201] COND TRUE (int )r2 == 2 [L202] COND TRUE (int )max2 == (int )id2 [L203] st2 = (char)1 [L208] RET mode2 = (_Bool)0 [L600] node2() [L601] CALL node3() [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND TRUE \read(mode3) [L234] COND FALSE !(r3 == 255) [L237] r3 = r3 + 1 [L238] COND FALSE !(\read(ep13)) [L246] COND FALSE !(\read(ep23)) [L254] newmax3 = newmax [L255] COND TRUE (int )r3 == 2 [L256] COND TRUE (int )max3 == (int )id3 [L257] st3 = (char)1 [L262] RET mode3 = (_Bool)0 [L601] node3() [L602] p12_old = p12_new [L603] p12_new = nomsg [L604] p13_old = p13_new [L605] p13_new = nomsg [L606] p21_old = p21_new [L607] p21_new = nomsg [L608] p23_old = p23_new [L609] p23_new = nomsg [L610] p31_old = p31_new [L611] p31_new = nomsg [L612] p32_old = p32_new [L613] p32_new = nomsg [L614] CALL, EXPR check() [L491] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=3, m3=2, max1=1, max2=2, max3=1, 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] [L494] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L540] tmp = 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=3, m3=2, max1=1, max2=2, max3=1, 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] [L542] RET return (tmp); [L614] EXPR check() [L614] c1 = check() [L615] CALL assert(c1) [L626] COND TRUE ! arg VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=3, m3=2, max1=1, max2=2, max3=1, 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] [L628] __VERIFIER_error() VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=0, id1=0, id2=2, id3=1, m1=-1, m2=3, m3=2, max1=1, max2=2, max3=1, 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 287.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -157.6 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1732.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 85.8 MB). Peak memory consumption was 261.3 MB. Max. memory is 11.5 GB. * CodeCheck took 122575.50 ms. Allocated memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: -963.5 MB). Peak memory consumption was 540.2 MB. Max. memory is 11.5 GB. * Witness Printer took 106.18 ms. Allocated memory is still 2.7 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...