./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.3.ufo.BOUNDED-6.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_80f62c20-74ca-4009-89c8-f1629924d2ed/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_80f62c20-74ca-4009-89c8-f1629924d2ed/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_80f62c20-74ca-4009-89c8-f1629924d2ed/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_80f62c20-74ca-4009-89c8-f1629924d2ed/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.3.ufo.BOUNDED-6.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_80f62c20-74ca-4009-89c8-f1629924d2ed/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_80f62c20-74ca-4009-89c8-f1629924d2ed/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c8186bb9e195ec2f40116dc473c413c4e1a34c0f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 12:40:37,399 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 12:40:37,401 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 12:40:37,408 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 12:40:37,408 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 12:40:37,409 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 12:40:37,410 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 12:40:37,411 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 12:40:37,412 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 12:40:37,413 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 12:40:37,413 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 12:40:37,414 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 12:40:37,414 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 12:40:37,415 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 12:40:37,416 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 12:40:37,417 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 12:40:37,417 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 12:40:37,418 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 12:40:37,420 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 12:40:37,421 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 12:40:37,422 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 12:40:37,422 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 12:40:37,424 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 12:40:37,424 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 12:40:37,424 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 12:40:37,425 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 12:40:37,426 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 12:40:37,426 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 12:40:37,427 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 12:40:37,428 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 12:40:37,428 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 12:40:37,428 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 12:40:37,428 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 12:40:37,428 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 12:40:37,429 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 12:40:37,430 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 12:40:37,430 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_80f62c20-74ca-4009-89c8-f1629924d2ed/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-02 12:40:37,440 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 12:40:37,440 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 12:40:37,441 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 12:40:37,441 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-02 12:40:37,441 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 12:40:37,441 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 12:40:37,441 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 12:40:37,442 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 12:40:37,442 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 12:40:37,442 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 12:40:37,442 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 12:40:37,442 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 12:40:37,442 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 12:40:37,442 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 12:40:37,442 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 12:40:37,442 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 12:40:37,443 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 12:40:37,443 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 12:40:37,443 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-02 12:40:37,443 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-02 12:40:37,443 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 12:40:37,443 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 12:40:37,443 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-02 12:40:37,444 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 12:40:37,444 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 12:40:37,444 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 12:40:37,444 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-02 12:40:37,444 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 12:40:37,444 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 12:40:37,444 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_80f62c20-74ca-4009-89c8-f1629924d2ed/bin-2019/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c8186bb9e195ec2f40116dc473c413c4e1a34c0f [2018-12-02 12:40:37,465 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 12:40:37,472 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 12:40:37,474 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 12:40:37,475 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 12:40:37,475 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 12:40:37,476 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_80f62c20-74ca-4009-89c8-f1629924d2ed/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.3.ufo.BOUNDED-6.pals_true-termination.c [2018-12-02 12:40:37,510 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_80f62c20-74ca-4009-89c8-f1629924d2ed/bin-2019/ukojak/data/6eed8f336/07f650e8304f4b76a22dcd2d86471589/FLAG5fdb67b67 [2018-12-02 12:40:37,821 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 12:40:37,821 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_80f62c20-74ca-4009-89c8-f1629924d2ed/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.3.ufo.BOUNDED-6.pals_true-termination.c [2018-12-02 12:40:37,826 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_80f62c20-74ca-4009-89c8-f1629924d2ed/bin-2019/ukojak/data/6eed8f336/07f650e8304f4b76a22dcd2d86471589/FLAG5fdb67b67 [2018-12-02 12:40:37,835 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_80f62c20-74ca-4009-89c8-f1629924d2ed/bin-2019/ukojak/data/6eed8f336/07f650e8304f4b76a22dcd2d86471589 [2018-12-02 12:40:37,837 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 12:40:37,839 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 12:40:37,839 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 12:40:37,839 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 12:40:37,842 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 12:40:37,843 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:40:37" (1/1) ... [2018-12-02 12:40:37,845 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42d622ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:40:37, skipping insertion in model container [2018-12-02 12:40:37,845 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:40:37" (1/1) ... [2018-12-02 12:40:37,851 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 12:40:37,871 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 12:40:37,995 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 12:40:38,001 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 12:40:38,073 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 12:40:38,086 INFO L195 MainTranslator]: Completed translation [2018-12-02 12:40:38,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:40:38 WrapperNode [2018-12-02 12:40:38,086 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 12:40:38,086 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 12:40:38,087 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 12:40:38,087 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 12:40:38,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:40:38" (1/1) ... [2018-12-02 12:40:38,097 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:40:38" (1/1) ... [2018-12-02 12:40:38,118 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 12:40:38,118 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 12:40:38,118 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 12:40:38,118 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 12:40:38,124 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:40:38" (1/1) ... [2018-12-02 12:40:38,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:40:38" (1/1) ... [2018-12-02 12:40:38,126 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:40:38" (1/1) ... [2018-12-02 12:40:38,126 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:40:38" (1/1) ... [2018-12-02 12:40:38,130 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:40:38" (1/1) ... [2018-12-02 12:40:38,135 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:40:38" (1/1) ... [2018-12-02 12:40:38,137 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:40:38" (1/1) ... [2018-12-02 12:40:38,139 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 12:40:38,139 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 12:40:38,139 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 12:40:38,139 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 12:40:38,140 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:40:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_80f62c20-74ca-4009-89c8-f1629924d2ed/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-02 12:40:38,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 12:40:38,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 12:40:39,594 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 12:40:39,594 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-12-02 12:40:39,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:40:39 BoogieIcfgContainer [2018-12-02 12:40:39,595 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 12:40:39,595 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-02 12:40:39,595 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-02 12:40:39,602 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-02 12:40:39,602 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:40:39" (1/1) ... [2018-12-02 12:40:39,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:40:39,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 12:40:39,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2018-12-02 12:40:39,632 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2018-12-02 12:40:39,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-02 12:40:39,635 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 12:40:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:40:39,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:40:39,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 12:40:39,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2018-12-02 12:40:39,917 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2018-12-02 12:40:39,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-02 12:40:39,918 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 12:40:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:40:40,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:40:40,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 12:40:40,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 24 states and 41 transitions. [2018-12-02 12:40:40,164 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2018-12-02 12:40:40,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-02 12:40:40,166 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 12:40:40,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:40:40,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:40:40,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 12:40:40,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 28 states and 50 transitions. [2018-12-02 12:40:40,455 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2018-12-02 12:40:40,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-02 12:40:40,455 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 12:40:40,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:40:40,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:40:40,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 12:40:40,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 33 states and 61 transitions. [2018-12-02 12:40:40,896 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 61 transitions. [2018-12-02 12:40:40,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-02 12:40:40,897 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 12:40:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:40:40,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:40:41,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 12:40:41,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 40 states and 74 transitions. [2018-12-02 12:40:41,530 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 74 transitions. [2018-12-02 12:40:41,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-02 12:40:41,530 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 12:40:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:40:41,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:40:42,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 12:40:42,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 46 states and 86 transitions. [2018-12-02 12:40:42,615 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 86 transitions. [2018-12-02 12:40:42,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 12:40:42,616 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 12:40:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:40:42,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:40:42,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 12:40:42,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 47 states and 86 transitions. [2018-12-02 12:40:42,798 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 86 transitions. [2018-12-02 12:40:42,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 12:40:42,798 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 12:40:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:40:42,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:40:42,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 12:40:42,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 48 states and 87 transitions. [2018-12-02 12:40:42,833 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 87 transitions. [2018-12-02 12:40:42,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 12:40:42,833 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 12:40:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:40:42,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:40:44,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 12:40:44,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 58 states and 104 transitions. [2018-12-02 12:40:44,025 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 104 transitions. [2018-12-02 12:40:44,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 12:40:44,026 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 12:40:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:40:44,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:40:44,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 12:40:44,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 61 states and 109 transitions. [2018-12-02 12:40:44,280 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 109 transitions. [2018-12-02 12:40:44,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 12:40:44,281 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 12:40:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:40:44,856 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:40:48,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 12:40:48,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 77 states and 145 transitions. [2018-12-02 12:40:48,923 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 145 transitions. [2018-12-02 12:40:48,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 12:40:48,924 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 12:40:48,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:40:49,114 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:40:52,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 12:40:52,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 94 states and 184 transitions. [2018-12-02 12:40:52,514 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 184 transitions. [2018-12-02 12:40:52,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 12:40:52,515 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 12:40:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:40:52,564 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:40:52,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 12:40:52,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 95 states and 185 transitions. [2018-12-02 12:40:52,835 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 185 transitions. [2018-12-02 12:40:52,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 12:40:52,836 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 12:40:52,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:40:53,186 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:40:56,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 12:40:56,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 113 states and 224 transitions. [2018-12-02 12:40:56,970 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 224 transitions. [2018-12-02 12:40:56,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 12:40:56,971 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 12:40:56,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:40:57,014 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:40:57,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 12:40:57,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 114 states and 225 transitions. [2018-12-02 12:40:57,313 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 225 transitions. [2018-12-02 12:40:57,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 12:40:57,314 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 12:40:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:40:57,370 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:40:57,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 12:40:57,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 115 states and 229 transitions. [2018-12-02 12:40:57,703 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 229 transitions. [2018-12-02 12:40:57,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 12:40:57,703 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 12:40:57,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:40:58,247 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:41:03,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 12:41:03,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 129 states and 257 transitions. [2018-12-02 12:41:03,446 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 257 transitions. [2018-12-02 12:41:03,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 12:41:03,446 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 12:41:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:41:03,516 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:41:04,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 12:41:04,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 131 states and 260 transitions. [2018-12-02 12:41:04,279 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 260 transitions. [2018-12-02 12:41:04,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 12:41:04,280 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 12:41:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:41:04,345 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:41:04,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 12:41:04,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 133 states and 266 transitions. [2018-12-02 12:41:04,998 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 266 transitions. [2018-12-02 12:41:04,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 12:41:04,999 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 12:41:05,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:41:06,258 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:41:13,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 12:41:13,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 152 states and 304 transitions. [2018-12-02 12:41:13,227 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 304 transitions. [2018-12-02 12:41:13,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 12:41:13,227 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 12:41:13,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:41:13,301 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:41:14,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 12:41:14,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 156 states and 313 transitions. [2018-12-02 12:41:14,654 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 313 transitions. [2018-12-02 12:41:14,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 12:41:14,654 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 12:41:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:41:14,728 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:41:15,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 12:41:15,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 158 states and 316 transitions. [2018-12-02 12:41:15,526 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 316 transitions. [2018-12-02 12:41:15,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 12:41:15,527 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 12:41:15,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:41:15,603 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:41:16,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 12:41:16,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 159 states and 317 transitions. [2018-12-02 12:41:16,044 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 317 transitions. [2018-12-02 12:41:16,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 12:41:16,045 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 12:41:16,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:41:16,116 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:41:16,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 12:41:16,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 160 states and 320 transitions. [2018-12-02 12:41:16,613 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 320 transitions. [2018-12-02 12:41:16,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 12:41:16,614 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 12:41:16,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:41:17,072 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:41:22,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 12:41:22,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 179 states and 356 transitions. [2018-12-02 12:41:22,516 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 356 transitions. [2018-12-02 12:41:22,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 12:41:22,516 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 12:41:22,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:41:22,754 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:41:24,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 12:41:24,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 183 states and 366 transitions. [2018-12-02 12:41:24,018 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 366 transitions. [2018-12-02 12:41:24,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 12:41:24,018 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 12:41:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:41:24,683 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:41:28,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 12:41:28,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 186 states and 374 transitions. [2018-12-02 12:41:28,286 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 374 transitions. [2018-12-02 12:41:28,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 12:41:28,286 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 12:41:28,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:41:28,425 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:41:30,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 12:41:30,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 191 states and 387 transitions. [2018-12-02 12:41:30,780 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 387 transitions. [2018-12-02 12:41:30,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 12:41:30,781 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 12:41:30,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:41:31,959 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:41:42,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 12:41:42,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 218 states and 444 transitions. [2018-12-02 12:41:42,194 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 444 transitions. [2018-12-02 12:41:42,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 12:41:42,195 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 12:41:42,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:41:42,262 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:41:44,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 12:41:44,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 223 states and 457 transitions. [2018-12-02 12:41:44,620 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 457 transitions. [2018-12-02 12:41:44,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-02 12:41:44,621 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 12:41:44,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:41:45,675 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:41:52,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 12:41:52,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 234 states and 479 transitions. [2018-12-02 12:41:52,722 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 479 transitions. [2018-12-02 12:41:52,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-02 12:41:52,723 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 12:41:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:41:52,772 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:41:54,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 12:41:54,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 236 states and 482 transitions. [2018-12-02 12:41:54,707 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 482 transitions. [2018-12-02 12:41:54,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 12:41:54,708 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 12:41:54,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:41:56,616 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:42:07,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 12:42:07,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 251 states and 518 transitions. [2018-12-02 12:42:07,967 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 518 transitions. [2018-12-02 12:42:07,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 12:42:07,968 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 12:42:07,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:42:08,018 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:42:12,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 12:42:12,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 257 states and 532 transitions. [2018-12-02 12:42:12,414 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 532 transitions. [2018-12-02 12:42:12,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-02 12:42:12,415 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 12:42:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:42:16,498 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:42:28,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 12:42:28,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 272 states and 565 transitions. [2018-12-02 12:42:28,264 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 565 transitions. [2018-12-02 12:42:28,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-02 12:42:28,264 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 12:42:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:42:28,317 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:42:31,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 12:42:31,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 278 states and 576 transitions. [2018-12-02 12:42:31,285 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 576 transitions. [2018-12-02 12:42:31,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-02 12:42:31,286 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 12:42:31,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:42:34,437 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:42:43,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 12:42:43,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 281 states and 583 transitions. [2018-12-02 12:42:43,797 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 583 transitions. [2018-12-02 12:42:43,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-02 12:42:43,797 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 12:42:43,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:42:43,990 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:42:45,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 12:42:45,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 282 states and 585 transitions. [2018-12-02 12:42:45,140 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 585 transitions. [2018-12-02 12:42:45,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-02 12:42:45,141 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 12:42:45,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:42:45,326 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:42:46,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 12:42:46,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 284 states and 594 transitions. [2018-12-02 12:42:46,856 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 594 transitions. [2018-12-02 12:42:46,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 12:42:46,856 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 12:42:46,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:42:47,137 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:42:49,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 12:42:49,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 288 states and 607 transitions. [2018-12-02 12:42:49,576 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 607 transitions. [2018-12-02 12:42:49,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 12:42:49,577 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 12:42:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:42:49,630 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:42:53,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 12:42:53,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 292 states and 618 transitions. [2018-12-02 12:42:53,824 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 618 transitions. [2018-12-02 12:42:53,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 12:42:53,824 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 12:42:53,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:42:53,897 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:42:55,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 12:42:55,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 294 states and 626 transitions. [2018-12-02 12:42:55,357 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 626 transitions. [2018-12-02 12:42:55,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-02 12:42:55,357 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 12:42:55,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:42:56,684 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:43:00,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 12:43:00,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 297 states and 636 transitions. [2018-12-02 12:43:00,720 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 636 transitions. [2018-12-02 12:43:00,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-02 12:43:00,720 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 12:43:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:43:01,674 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:43:05,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 12:43:05,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 302 states and 650 transitions. [2018-12-02 12:43:05,884 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 650 transitions. [2018-12-02 12:43:05,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-02 12:43:05,885 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 12:43:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:43:06,774 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:43:09,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 12:43:09,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 305 states and 660 transitions. [2018-12-02 12:43:09,568 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 660 transitions. [2018-12-02 12:43:09,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-02 12:43:09,569 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 12:43:09,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:43:11,333 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:43:13,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 12:43:13,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 306 states and 661 transitions. [2018-12-02 12:43:13,228 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 661 transitions. [2018-12-02 12:43:13,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 12:43:13,229 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 12:43:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:43:13,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:43:14,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:43:14,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:43:14,587 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 47 iterations. [2018-12-02 12:43:14,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 02.12 12:43:14 ImpRootNode [2018-12-02 12:43:14,677 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-02 12:43:14,678 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 12:43:14,678 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 12:43:14,678 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 12:43:14,678 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:40:39" (3/4) ... [2018-12-02 12:43:14,680 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 12:43:14,757 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_80f62c20-74ca-4009-89c8-f1629924d2ed/bin-2019/ukojak/witness.graphml [2018-12-02 12:43:14,757 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 12:43:14,757 INFO L168 Benchmark]: Toolchain (without parser) took 156919.71 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 334.5 MB). Free memory was 956.0 MB in the beginning and 991.9 MB in the end (delta: -35.9 MB). Peak memory consumption was 298.6 MB. Max. memory is 11.5 GB. [2018-12-02 12:43:14,758 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 12:43:14,758 INFO L168 Benchmark]: CACSL2BoogieTranslator took 246.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -188.6 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2018-12-02 12:43:14,758 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-02 12:43:14,759 INFO L168 Benchmark]: Boogie Preprocessor took 21.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 12:43:14,759 INFO L168 Benchmark]: RCFGBuilder took 1455.67 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 87.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -28.0 MB). Peak memory consumption was 321.6 MB. Max. memory is 11.5 GB. [2018-12-02 12:43:14,759 INFO L168 Benchmark]: CodeCheck took 155082.42 ms. Allocated memory was 1.3 GB in the beginning and 1.4 GB in the end (delta: 95.9 MB). Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 139.8 MB). Peak memory consumption was 235.7 MB. Max. memory is 11.5 GB. [2018-12-02 12:43:14,759 INFO L168 Benchmark]: Witness Printer took 79.16 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 991.9 MB in the end (delta: 28.9 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. [2018-12-02 12:43:14,760 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 141 locations, 1 error locations. UNSAFE Result, 154.9s OverallTime, 47 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: -1859454984 SDtfs, 1468050884 SDslu, 574872872 SDs, 0 SdLazy, 1096713856 SolverSat, 1265882280 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 66.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13129 GetRequests, 11365 SyntacticMatches, 758 SemanticMatches, 1006 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665258 ImplicationChecksByTransitivity, 147.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 21.9s InterpolantComputationTime, 1276 NumberOfCodeBlocks, 1276 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 1182 ConstructedInterpolants, 0 QuantifiedInterpolants, 457972 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 46 InterpolantComputations, 10 PerfectInterpolantSequences, 130/684 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 643]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L69] msg_t nomsg = (msg_t )-1; [L70] port_t p12 ; [L71] char p12_old ; [L72] char p12_new ; [L73] _Bool ep12 ; [L74] port_t p13 ; [L75] char p13_old ; [L76] char p13_new ; [L77] _Bool ep13 ; [L78] port_t p21 ; [L79] char p21_old ; [L80] char p21_new ; [L81] _Bool ep21 ; [L82] port_t p23 ; [L83] char p23_old ; [L84] char p23_new ; [L85] _Bool ep23 ; [L86] port_t p31 ; [L87] char p31_old ; [L88] char p31_new ; [L89] _Bool ep31 ; [L90] port_t p32 ; [L91] char p32_old ; [L92] char p32_new ; [L93] _Bool ep32 ; [L94] char id1 ; [L95] char r1 ; [L96] char st1 ; [L97] char nl1 ; [L98] char m1 ; [L99] char max1 ; [L100] _Bool mode1 ; [L101] _Bool newmax1 ; [L102] char id2 ; [L103] char r2 ; [L104] char st2 ; [L105] char nl2 ; [L106] char m2 ; [L107] char max2 ; [L108] _Bool mode2 ; [L109] _Bool newmax2 ; [L110] char id3 ; [L111] char r3 ; [L112] char st3 ; [L113] char nl3 ; [L114] char m3 ; [L115] char max3 ; [L116] _Bool mode3 ; [L117] _Bool newmax3 ; [L271] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L561] int c1 ; [L562] int i2 ; [L565] c1 = 0 [L566] ep12 = __VERIFIER_nondet_bool() [L567] ep13 = __VERIFIER_nondet_bool() [L568] ep21 = __VERIFIER_nondet_bool() [L569] ep23 = __VERIFIER_nondet_bool() [L570] ep31 = __VERIFIER_nondet_bool() [L571] ep32 = __VERIFIER_nondet_bool() [L572] id1 = __VERIFIER_nondet_char() [L573] r1 = __VERIFIER_nondet_char() [L574] st1 = __VERIFIER_nondet_char() [L575] nl1 = __VERIFIER_nondet_char() [L576] m1 = __VERIFIER_nondet_char() [L577] max1 = __VERIFIER_nondet_char() [L578] mode1 = __VERIFIER_nondet_bool() [L579] newmax1 = __VERIFIER_nondet_bool() [L580] id2 = __VERIFIER_nondet_char() [L581] r2 = __VERIFIER_nondet_char() [L582] st2 = __VERIFIER_nondet_char() [L583] nl2 = __VERIFIER_nondet_char() [L584] m2 = __VERIFIER_nondet_char() [L585] max2 = __VERIFIER_nondet_char() [L586] mode2 = __VERIFIER_nondet_bool() [L587] newmax2 = __VERIFIER_nondet_bool() [L588] id3 = __VERIFIER_nondet_char() [L589] r3 = __VERIFIER_nondet_char() [L590] st3 = __VERIFIER_nondet_char() [L591] nl3 = __VERIFIER_nondet_char() [L592] m3 = __VERIFIER_nondet_char() [L593] max3 = __VERIFIER_nondet_char() [L594] mode3 = __VERIFIER_nondet_bool() [L595] newmax3 = __VERIFIER_nondet_bool() [L274] _Bool r121 ; [L275] _Bool r131 ; [L276] _Bool r211 ; [L277] _Bool r231 ; [L278] _Bool r311 ; [L279] _Bool r321 ; [L280] _Bool r122 ; [L281] int tmp ; [L282] _Bool r132 ; [L283] int tmp___0 ; [L284] _Bool r212 ; [L285] int tmp___1 ; [L286] _Bool r232 ; [L287] int tmp___2 ; [L288] _Bool r312 ; [L289] int tmp___3 ; [L290] _Bool r322 ; [L291] int tmp___4 ; [L292] int tmp___5 ; [L295] r121 = ep12 [L296] r131 = ep13 [L297] r211 = ep21 [L298] r231 = ep23 [L299] r311 = ep31 [L300] r321 = ep32 [L301] COND FALSE !(\read(r121)) [L304] COND TRUE \read(r131) [L305] COND TRUE \read(ep32) [L306] tmp = 1 [L313] r122 = (_Bool )tmp [L314] COND TRUE \read(r131) [L315] tmp___0 = 1 [L326] r132 = (_Bool )tmp___0 [L327] COND TRUE \read(r211) [L328] tmp___1 = 1 [L339] r212 = (_Bool )tmp___1 [L340] COND FALSE !(\read(r231)) [L343] COND TRUE \read(r211) [L344] COND TRUE \read(ep13) [L345] tmp___2 = 1 [L352] r232 = (_Bool )tmp___2 [L353] COND FALSE !(\read(r311)) [L356] COND TRUE \read(r321) [L357] COND TRUE \read(ep21) [L358] tmp___3 = 1 [L365] r312 = (_Bool )tmp___3 [L366] COND TRUE \read(r321) [L367] tmp___4 = 1 [L378] r322 = (_Bool )tmp___4 [L379] COND TRUE (int )id1 != (int )id2 [L380] COND TRUE (int )id1 != (int )id3 [L381] COND TRUE (int )id2 != (int )id3 [L382] COND TRUE (int )id1 >= 0 [L383] COND TRUE (int )id2 >= 0 [L384] COND TRUE (int )id3 >= 0 [L385] COND TRUE (int )r1 == 0 [L386] COND TRUE (int )r2 == 0 [L387] COND TRUE (int )r3 == 0 [L388] COND TRUE \read(r122) [L389] COND TRUE \read(r132) [L390] COND TRUE \read(r212) [L391] COND TRUE \read(r232) [L392] COND TRUE \read(r312) [L393] COND TRUE \read(r322) [L394] COND TRUE (int )max1 == (int )id1 [L395] COND TRUE (int )max2 == (int )id2 [L396] COND TRUE (int )max3 == (int )id3 [L397] COND TRUE (int )st1 == 0 [L398] COND TRUE (int )st2 == 0 [L399] COND TRUE (int )st3 == 0 [L400] COND TRUE (int )nl1 == 0 [L401] COND TRUE (int )nl2 == 0 [L402] COND TRUE (int )nl3 == 0 [L403] COND TRUE (int )mode1 == 0 [L404] COND TRUE (int )mode2 == 0 [L405] COND TRUE (int )mode3 == 0 [L406] COND TRUE \read(newmax1) [L407] COND TRUE \read(newmax2) [L408] COND TRUE \read(newmax3) [L409] tmp___5 = 1 [L500] return (tmp___5); [L596] i2 = init() [L598] p12_old = nomsg [L599] p12_new = nomsg [L600] p13_old = nomsg [L601] p13_new = nomsg [L602] p21_old = nomsg [L603] p21_new = nomsg [L604] p23_old = nomsg [L605] p23_new = nomsg [L606] p31_old = nomsg [L607] p31_new = nomsg [L608] p32_old = nomsg [L609] p32_new = nomsg [L610] i2 = 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=2, id3=6, m1=3, m2=1, m3=5, max1=4, max2=2, max3=6, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L611] COND TRUE i2 < 6 [L120] _Bool newmax ; [L123] newmax = (_Bool)0 [L124] COND FALSE !(\read(mode1)) [L152] COND TRUE (int )r1 < 2 [L153] COND FALSE !(\read(ep12)) [L158] COND TRUE \read(ep13) [L159] COND TRUE \read(newmax1) [L160] EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L160] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L164] mode1 = (_Bool)1 [L171] _Bool newmax ; [L174] newmax = (_Bool)0 [L175] COND FALSE !(\read(mode2)) [L203] COND TRUE (int )r2 < 2 [L204] COND TRUE \read(ep21) [L205] COND TRUE \read(newmax2) [L206] EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L206] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L209] COND FALSE !(\read(ep23)) [L215] mode2 = (_Bool)1 [L222] _Bool newmax ; [L225] newmax = (_Bool)0 [L226] COND FALSE !(\read(mode3)) [L254] COND TRUE (int )r3 < 2 [L255] COND FALSE !(\read(ep31)) [L260] COND TRUE \read(ep32) [L261] COND TRUE \read(newmax3) [L262] EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L262] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L266] mode3 = (_Bool)1 [L616] p12_old = p12_new [L617] p12_new = nomsg [L618] p13_old = p13_new [L619] p13_new = nomsg [L620] p21_old = p21_new [L621] p21_new = nomsg [L622] p23_old = p23_new [L623] p23_new = nomsg [L624] p31_old = p31_new [L625] p31_new = nomsg [L626] p32_old = p32_new [L627] p32_new = nomsg [L505] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=2, id3=6, m1=3, m2=1, m3=5, max1=4, max2=2, max3=6, 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=4, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=6, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L508] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=2, id3=6, m1=3, m2=1, m3=5, max1=4, max2=2, max3=6, 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=4, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=6, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L509] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=2, id3=6, m1=3, m2=1, m3=5, max1=4, max2=2, max3=6, 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=4, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=6, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L510] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=2, id3=6, m1=3, m2=1, m3=5, max1=4, max2=2, max3=6, 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=4, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=6, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L511] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=2, id3=6, m1=3, m2=1, m3=5, max1=4, max2=2, max3=6, 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=4, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=6, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L512] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=2, id3=6, m1=3, m2=1, m3=5, max1=4, max2=2, max3=6, 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=4, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=6, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L515] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=2, id3=6, m1=3, m2=1, m3=5, max1=4, max2=2, max3=6, 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=4, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=6, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L517] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=2, id3=6, m1=3, m2=1, m3=5, max1=4, max2=2, max3=6, 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=4, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=6, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L522] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=2, id3=6, m1=3, m2=1, m3=5, max1=4, max2=2, max3=6, 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=4, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=6, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L525] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=2, id3=6, m1=3, m2=1, m3=5, max1=4, max2=2, max3=6, 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=4, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=6, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L527] COND TRUE (int )r1 < 2 [L528] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=2, id3=6, m1=3, m2=1, m3=5, max1=4, max2=2, max3=6, 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=4, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=6, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L556] return (tmp); [L628] c1 = check() [L641] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=2, id3=6, m1=3, m2=1, m3=5, max1=4, max2=2, max3=6, 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=4, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=6, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L630] i2 ++ VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=2, id3=6, m1=3, m2=1, m3=5, max1=4, max2=2, max3=6, 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=4, p21=0, p21_new=-1, p21_old=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=6, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L611] COND TRUE i2 < 6 [L120] _Bool newmax ; [L123] newmax = (_Bool)0 [L124] COND TRUE \read(mode1) [L125] r1 = (char )((int )r1 + 1) [L126] COND TRUE \read(ep21) [L127] m1 = p21_old [L128] p21_old = nomsg [L129] COND FALSE !((int )m1 > (int )max1) [L134] COND FALSE !(\read(ep31)) [L142] newmax1 = newmax [L143] COND FALSE !((int )r1 == 2) [L150] mode1 = (_Bool)0 [L171] _Bool newmax ; [L174] newmax = (_Bool)0 [L175] COND TRUE \read(mode2) [L176] r2 = (char )((int )r2 + 1) [L177] COND FALSE !(\read(ep12)) [L185] COND TRUE \read(ep32) [L186] m2 = p32_old [L187] p32_old = nomsg [L188] COND TRUE (int )m2 > (int )max2 [L189] max2 = m2 [L190] newmax = (_Bool)1 [L193] newmax2 = newmax [L194] COND FALSE !((int )r2 == 2) [L201] mode2 = (_Bool)0 [L222] _Bool newmax ; [L225] newmax = (_Bool)0 [L226] COND TRUE \read(mode3) [L227] r3 = (char )((int )r3 + 1) [L228] COND TRUE \read(ep13) [L229] m3 = p13_old [L230] p13_old = nomsg [L231] COND FALSE !((int )m3 > (int )max3) [L236] COND FALSE !(\read(ep23)) [L244] newmax3 = newmax [L245] COND FALSE !((int )r3 == 2) [L252] mode3 = (_Bool)0 [L616] p12_old = p12_new [L617] p12_new = nomsg [L618] p13_old = p13_new [L619] p13_new = nomsg [L620] p21_old = p21_new [L621] p21_new = nomsg [L622] p23_old = p23_new [L623] p23_new = nomsg [L624] p31_old = p31_new [L625] p31_new = nomsg [L626] p32_old = p32_new [L627] p32_new = nomsg [L505] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=2, id3=6, m1=2, m2=6, m3=4, max1=4, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L508] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=2, id3=6, m1=2, m2=6, m3=4, max1=4, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L509] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=2, id3=6, m1=2, m2=6, m3=4, max1=4, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L510] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=2, id3=6, m1=2, m2=6, m3=4, max1=4, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L511] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=2, id3=6, m1=2, m2=6, m3=4, max1=4, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L512] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=2, id3=6, m1=2, m2=6, m3=4, max1=4, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L515] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=2, id3=6, m1=2, m2=6, m3=4, max1=4, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L517] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=2, id3=6, m1=2, m2=6, m3=4, max1=4, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L522] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=2, id3=6, m1=2, m2=6, m3=4, max1=4, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L525] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=2, id3=6, m1=2, m2=6, m3=4, max1=4, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L527] COND TRUE (int )r1 < 2 [L528] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=2, id3=6, m1=2, m2=6, m3=4, max1=4, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L556] return (tmp); [L628] c1 = check() [L641] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=2, id3=6, m1=2, m2=6, m3=4, max1=4, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L630] i2 ++ VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=2, id3=6, m1=2, m2=6, m3=4, max1=4, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L611] COND TRUE i2 < 6 [L120] _Bool newmax ; [L123] newmax = (_Bool)0 [L124] COND FALSE !(\read(mode1)) [L152] COND TRUE (int )r1 < 2 [L153] COND FALSE !(\read(ep12)) [L158] COND TRUE \read(ep13) [L159] COND FALSE !(\read(newmax1)) [L164] mode1 = (_Bool)1 [L171] _Bool newmax ; [L174] newmax = (_Bool)0 [L175] COND FALSE !(\read(mode2)) [L203] COND TRUE (int )r2 < 2 [L204] COND TRUE \read(ep21) [L205] COND TRUE \read(newmax2) [L206] EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L206] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L209] COND FALSE !(\read(ep23)) [L215] mode2 = (_Bool)1 [L222] _Bool newmax ; [L225] newmax = (_Bool)0 [L226] COND FALSE !(\read(mode3)) [L254] COND TRUE (int )r3 < 2 [L255] COND FALSE !(\read(ep31)) [L260] COND TRUE \read(ep32) [L261] COND FALSE !(\read(newmax3)) [L266] mode3 = (_Bool)1 [L616] p12_old = p12_new [L617] p12_new = nomsg [L618] p13_old = p13_new [L619] p13_new = nomsg [L620] p21_old = p21_new [L621] p21_new = nomsg [L622] p23_old = p23_new [L623] p23_new = nomsg [L624] p31_old = p31_new [L625] p31_new = nomsg [L626] p32_old = p32_new [L627] p32_new = nomsg [L505] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=2, id3=6, m1=2, m2=6, m3=4, max1=4, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=6, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L508] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=2, id3=6, m1=2, m2=6, m3=4, max1=4, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=6, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L509] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=2, id3=6, m1=2, m2=6, m3=4, max1=4, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=6, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L510] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=2, id3=6, m1=2, m2=6, m3=4, max1=4, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=6, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L511] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=2, id3=6, m1=2, m2=6, m3=4, max1=4, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=6, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L512] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=2, id3=6, m1=2, m2=6, m3=4, max1=4, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=6, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L515] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=2, id3=6, m1=2, m2=6, m3=4, max1=4, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=6, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L517] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=2, id3=6, m1=2, m2=6, m3=4, max1=4, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=6, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L522] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=2, id3=6, m1=2, m2=6, m3=4, max1=4, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=6, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L525] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=2, id3=6, m1=2, m2=6, m3=4, max1=4, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=6, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L527] COND TRUE (int )r1 < 2 [L528] tmp = 1 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=2, id3=6, m1=2, m2=6, m3=4, max1=4, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=6, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L556] return (tmp); [L628] c1 = check() [L641] COND FALSE !(! arg) VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=2, id3=6, m1=2, m2=6, m3=4, max1=4, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=6, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L630] i2 ++ VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=2, id3=6, m1=2, m2=6, m3=4, max1=4, max2=6, max3=6, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=6, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L611] COND TRUE i2 < 6 [L120] _Bool newmax ; [L123] newmax = (_Bool)0 [L124] COND TRUE \read(mode1) [L125] r1 = (char )((int )r1 + 1) [L126] COND TRUE \read(ep21) [L127] m1 = p21_old [L128] p21_old = nomsg [L129] COND TRUE (int )m1 > (int )max1 [L130] max1 = m1 [L131] newmax = (_Bool)1 [L134] COND FALSE !(\read(ep31)) [L142] newmax1 = newmax [L143] COND TRUE (int )r1 == 2 [L144] COND FALSE !((int )max1 == (int )id1) [L147] st1 = (char)1 [L150] mode1 = (_Bool)0 [L171] _Bool newmax ; [L174] newmax = (_Bool)0 [L175] COND TRUE \read(mode2) [L176] r2 = (char )((int )r2 + 1) [L177] COND FALSE !(\read(ep12)) [L185] COND TRUE \read(ep32) [L186] m2 = p32_old [L187] p32_old = nomsg [L188] COND FALSE !((int )m2 > (int )max2) [L193] newmax2 = newmax [L194] COND TRUE (int )r2 == 2 [L195] COND FALSE !((int )max2 == (int )id2) [L198] nl2 = (char)1 [L201] mode2 = (_Bool)0 [L222] _Bool newmax ; [L225] newmax = (_Bool)0 [L226] COND TRUE \read(mode3) [L227] r3 = (char )((int )r3 + 1) [L228] COND TRUE \read(ep13) [L229] m3 = p13_old [L230] p13_old = nomsg [L231] COND FALSE !((int )m3 > (int )max3) [L236] COND FALSE !(\read(ep23)) [L244] newmax3 = newmax [L245] COND TRUE (int )r3 == 2 [L246] COND TRUE (int )max3 == (int )id3 [L247] st3 = (char)1 [L252] mode3 = (_Bool)0 [L616] p12_old = p12_new [L617] p12_new = nomsg [L618] p13_old = p13_new [L619] p13_new = nomsg [L620] p21_old = p21_new [L621] p21_new = nomsg [L622] p23_old = p23_new [L623] p23_new = nomsg [L624] p31_old = p31_new [L625] p31_new = nomsg [L626] p32_old = p32_new [L627] p32_new = nomsg [L505] int tmp ; VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=2, id3=6, m1=6, m2=-1, m3=-1, max1=6, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L508] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L554] tmp = 0 VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=2, id3=6, m1=6, m2=-1, m3=-1, max1=6, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L556] return (tmp); [L628] c1 = check() [L641] COND TRUE ! arg VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=2, id3=6, m1=6, m2=-1, m3=-1, max1=6, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L643] __VERIFIER_error() VAL [ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=4, id2=2, id3=6, m1=6, m2=-1, m3=-1, max1=6, max2=6, max3=6, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=0, newmax3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 246.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -188.6 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1455.67 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 87.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -28.0 MB). Peak memory consumption was 321.6 MB. Max. memory is 11.5 GB. * CodeCheck took 155082.42 ms. Allocated memory was 1.3 GB in the beginning and 1.4 GB in the end (delta: 95.9 MB). Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 139.8 MB). Peak memory consumption was 235.7 MB. Max. memory is 11.5 GB. * Witness Printer took 79.16 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 991.9 MB in the end (delta: 28.9 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...