./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_19dc7994-b392-4807-b0fb-a0e2de011305/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_19dc7994-b392-4807-b0fb-a0e2de011305/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_19dc7994-b392-4807-b0fb-a0e2de011305/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_19dc7994-b392-4807-b0fb-a0e2de011305/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_19dc7994-b392-4807-b0fb-a0e2de011305/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_19dc7994-b392-4807-b0fb-a0e2de011305/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 3381374679dc4a7458d725215e8a6e295cc6e6a1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 09:49:26,877 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 09:49:26,878 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 09:49:26,889 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 09:49:26,889 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 09:49:26,890 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 09:49:26,891 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 09:49:26,892 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 09:49:26,894 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 09:49:26,895 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 09:49:26,896 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 09:49:26,896 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 09:49:26,897 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 09:49:26,898 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 09:49:26,899 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 09:49:26,899 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 09:49:26,900 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 09:49:26,901 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 09:49:26,903 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 09:49:26,904 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 09:49:26,905 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 09:49:26,906 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 09:49:26,908 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 09:49:26,908 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 09:49:26,908 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 09:49:26,909 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 09:49:26,910 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 09:49:26,911 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 09:49:26,911 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 09:49:26,912 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 09:49:26,912 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 09:49:26,913 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 09:49:26,913 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 09:49:26,913 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 09:49:26,914 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 09:49:26,915 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 09:49:26,915 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_19dc7994-b392-4807-b0fb-a0e2de011305/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-18 09:49:26,926 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 09:49:26,927 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 09:49:26,927 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 09:49:26,928 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 09:49:26,928 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 09:49:26,928 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 09:49:26,928 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 09:49:26,929 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 09:49:26,929 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 09:49:26,929 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 09:49:26,929 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 09:49:26,929 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 09:49:26,929 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 09:49:26,930 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 09:49:26,930 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 09:49:26,930 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 09:49:26,930 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 09:49:26,930 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 09:49:26,930 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-18 09:49:26,930 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-18 09:49:26,931 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 09:49:26,931 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 09:49:26,931 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-18 09:49:26,931 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 09:49:26,931 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 09:49:26,931 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 09:49:26,932 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-18 09:49:26,932 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 09:49:26,932 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 09:49:26,932 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_19dc7994-b392-4807-b0fb-a0e2de011305/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 -> 3381374679dc4a7458d725215e8a6e295cc6e6a1 [2018-11-18 09:49:26,957 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 09:49:26,965 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 09:49:26,967 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 09:49:26,968 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 09:49:26,969 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 09:49:26,969 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_19dc7994-b392-4807-b0fb-a0e2de011305/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c [2018-11-18 09:49:27,010 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_19dc7994-b392-4807-b0fb-a0e2de011305/bin-2019/ukojak/data/1144bc4d2/39b4b05968034f8ba5a7254812a18a5f/FLAGaab56436a [2018-11-18 09:49:27,400 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 09:49:27,401 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_19dc7994-b392-4807-b0fb-a0e2de011305/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c [2018-11-18 09:49:27,409 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_19dc7994-b392-4807-b0fb-a0e2de011305/bin-2019/ukojak/data/1144bc4d2/39b4b05968034f8ba5a7254812a18a5f/FLAGaab56436a [2018-11-18 09:49:27,420 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_19dc7994-b392-4807-b0fb-a0e2de011305/bin-2019/ukojak/data/1144bc4d2/39b4b05968034f8ba5a7254812a18a5f [2018-11-18 09:49:27,423 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 09:49:27,424 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 09:49:27,425 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 09:49:27,425 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 09:49:27,428 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 09:49:27,429 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:49:27" (1/1) ... [2018-11-18 09:49:27,432 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11c3b532 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:49:27, skipping insertion in model container [2018-11-18 09:49:27,432 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:49:27" (1/1) ... [2018-11-18 09:49:27,441 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 09:49:27,471 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 09:49:27,633 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:49:27,641 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 09:49:27,729 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:49:27,745 INFO L195 MainTranslator]: Completed translation [2018-11-18 09:49:27,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:49:27 WrapperNode [2018-11-18 09:49:27,745 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 09:49:27,746 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 09:49:27,746 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 09:49:27,746 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 09:49:27,754 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:49:27" (1/1) ... [2018-11-18 09:49:27,762 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:49:27" (1/1) ... [2018-11-18 09:49:27,783 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 09:49:27,783 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 09:49:27,783 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 09:49:27,783 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 09:49:27,790 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:49:27" (1/1) ... [2018-11-18 09:49:27,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:49:27" (1/1) ... [2018-11-18 09:49:27,792 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:49:27" (1/1) ... [2018-11-18 09:49:27,792 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:49:27" (1/1) ... [2018-11-18 09:49:27,796 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:49:27" (1/1) ... [2018-11-18 09:49:27,802 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:49:27" (1/1) ... [2018-11-18 09:49:27,804 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:49:27" (1/1) ... [2018-11-18 09:49:27,806 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 09:49:27,806 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 09:49:27,806 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 09:49:27,807 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 09:49:27,807 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:49:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_19dc7994-b392-4807-b0fb-a0e2de011305/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-18 09:49:27,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 09:49:27,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 09:49:29,485 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 09:49:29,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:49:29 BoogieIcfgContainer [2018-11-18 09:49:29,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 09:49:29,486 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-18 09:49:29,486 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-18 09:49:29,493 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-18 09:49:29,494 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:49:29" (1/1) ... [2018-11-18 09:49:29,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:49:29,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:49:29,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 21 states and 33 transitions. [2018-11-18 09:49:29,527 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 33 transitions. [2018-11-18 09:49:29,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-18 09:49:29,529 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:49:29,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:49:29,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:49:29,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:49:29,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 24 states and 37 transitions. [2018-11-18 09:49:29,931 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions. [2018-11-18 09:49:29,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-18 09:49:29,931 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:49:29,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:49:30,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:49:30,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:49:30,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 28 states and 45 transitions. [2018-11-18 09:49:30,285 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 45 transitions. [2018-11-18 09:49:30,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-18 09:49:30,286 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:49:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:49:30,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:49:30,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:49:30,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 33 states and 55 transitions. [2018-11-18 09:49:30,696 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 55 transitions. [2018-11-18 09:49:30,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-18 09:49:30,700 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:49:30,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:49:30,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:49:31,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:49:31,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 39 states and 67 transitions. [2018-11-18 09:49:31,206 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 67 transitions. [2018-11-18 09:49:31,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-18 09:49:31,209 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:49:31,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:49:31,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:49:31,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:49:31,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 47 states and 81 transitions. [2018-11-18 09:49:31,941 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 81 transitions. [2018-11-18 09:49:31,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 09:49:31,942 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:49:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:49:32,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:49:32,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:49:32,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 54 states and 94 transitions. [2018-11-18 09:49:32,773 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 94 transitions. [2018-11-18 09:49:32,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 09:49:32,774 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:49:32,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:49:32,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:49:33,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:49:33,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 55 states and 94 transitions. [2018-11-18 09:49:33,045 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 94 transitions. [2018-11-18 09:49:33,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 09:49:33,045 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:49:33,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:49:33,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:49:33,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:49:33,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 56 states and 95 transitions. [2018-11-18 09:49:33,088 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 95 transitions. [2018-11-18 09:49:33,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 09:49:33,089 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:49:33,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:49:33,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:49:34,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:49:34,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 67 states and 113 transitions. [2018-11-18 09:49:34,667 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 113 transitions. [2018-11-18 09:49:34,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 09:49:34,668 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:49:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:49:34,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:49:35,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:49:35,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 70 states and 118 transitions. [2018-11-18 09:49:35,170 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 118 transitions. [2018-11-18 09:49:35,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 09:49:35,171 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:49:35,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:49:36,110 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:49:39,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:49:39,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 88 states and 153 transitions. [2018-11-18 09:49:39,070 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 153 transitions. [2018-11-18 09:49:39,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 09:49:39,071 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:49:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:49:39,357 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:49:42,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:49:42,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 107 states and 190 transitions. [2018-11-18 09:49:42,464 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 190 transitions. [2018-11-18 09:49:42,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 09:49:42,464 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:49:42,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:49:42,617 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:49:42,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:49:42,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 108 states and 192 transitions. [2018-11-18 09:49:42,852 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 192 transitions. [2018-11-18 09:49:42,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 09:49:42,852 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:49:42,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:49:43,585 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:49:46,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:49:46,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 122 states and 213 transitions. [2018-11-18 09:49:46,508 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 213 transitions. [2018-11-18 09:49:46,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 09:49:46,508 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:49:46,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:49:47,266 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:49:50,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:49:50,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 143 states and 251 transitions. [2018-11-18 09:49:50,865 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 251 transitions. [2018-11-18 09:49:50,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 09:49:50,865 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:49:50,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:49:51,040 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:49:51,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:49:51,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 144 states and 252 transitions. [2018-11-18 09:49:51,259 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 252 transitions. [2018-11-18 09:49:51,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 09:49:51,260 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:49:51,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:49:51,432 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:49:51,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:49:51,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 145 states and 256 transitions. [2018-11-18 09:49:51,761 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 256 transitions. [2018-11-18 09:49:51,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 09:49:51,761 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:49:51,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:49:52,784 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:49:55,724 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2018-11-18 09:49:58,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:49:58,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 167 states and 296 transitions. [2018-11-18 09:49:58,045 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 296 transitions. [2018-11-18 09:49:58,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 09:49:58,067 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:49:58,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:49:58,570 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:49:59,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:49:59,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 172 states and 305 transitions. [2018-11-18 09:49:59,622 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 305 transitions. [2018-11-18 09:49:59,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 09:49:59,622 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:49:59,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:50:00,835 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:50:03,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:50:03,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 176 states and 313 transitions. [2018-11-18 09:50:03,642 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 313 transitions. [2018-11-18 09:50:03,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 09:50:03,643 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:50:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:50:03,875 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:50:05,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:50:05,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 181 states and 325 transitions. [2018-11-18 09:50:05,161 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 325 transitions. [2018-11-18 09:50:05,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 09:50:05,162 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:50:05,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:50:06,561 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:50:12,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:50:12,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 196 states and 374 transitions. [2018-11-18 09:50:12,749 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 374 transitions. [2018-11-18 09:50:12,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 09:50:12,750 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:50:12,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:50:12,902 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:50:14,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:50:14,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 201 states and 383 transitions. [2018-11-18 09:50:14,503 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 383 transitions. [2018-11-18 09:50:14,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 09:50:14,504 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:50:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:50:15,453 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:50:19,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:50:19,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 212 states and 400 transitions. [2018-11-18 09:50:19,333 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 400 transitions. [2018-11-18 09:50:19,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 09:50:19,333 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:50:19,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:50:19,394 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:50:21,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:50:21,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 217 states and 409 transitions. [2018-11-18 09:50:21,068 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 409 transitions. [2018-11-18 09:50:21,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 09:50:21,069 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:50:21,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:50:22,617 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:50:28,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:50:28,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 235 states and 448 transitions. [2018-11-18 09:50:28,995 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 448 transitions. [2018-11-18 09:50:28,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 09:50:28,995 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:50:29,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:50:29,066 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:50:31,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:50:31,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 242 states and 468 transitions. [2018-11-18 09:50:31,181 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 468 transitions. [2018-11-18 09:50:31,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 09:50:31,182 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:50:31,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:50:31,285 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:50:32,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:50:32,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 244 states and 474 transitions. [2018-11-18 09:50:32,230 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 474 transitions. [2018-11-18 09:50:32,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 09:50:32,231 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:50:32,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:50:33,226 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:50:39,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:50:39,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 257 states and 502 transitions. [2018-11-18 09:50:39,580 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 502 transitions. [2018-11-18 09:50:39,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 09:50:39,580 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:50:39,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:50:39,624 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:50:41,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:50:41,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 254 states and 502 transitions. [2018-11-18 09:50:41,010 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 502 transitions. [2018-11-18 09:50:41,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 09:50:41,010 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:50:41,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:50:41,063 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:50:41,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:50:41,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 256 states and 508 transitions. [2018-11-18 09:50:41,722 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 508 transitions. [2018-11-18 09:50:41,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 09:50:41,722 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:50:41,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:50:41,768 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:50:42,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:50:42,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 258 states and 512 transitions. [2018-11-18 09:50:42,333 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 512 transitions. [2018-11-18 09:50:42,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 09:50:42,334 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:50:42,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:50:43,539 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:50:51,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:50:51,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 275 states and 548 transitions. [2018-11-18 09:50:51,076 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 548 transitions. [2018-11-18 09:50:51,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 09:50:51,077 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:50:51,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:50:51,243 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:50:53,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:50:53,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 282 states and 560 transitions. [2018-11-18 09:50:53,328 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 560 transitions. [2018-11-18 09:50:53,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 09:50:53,329 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:50:53,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:50:53,513 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:50:55,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:50:55,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 287 states and 576 transitions. [2018-11-18 09:50:55,655 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 576 transitions. [2018-11-18 09:50:55,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 09:50:55,655 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:50:55,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:50:56,834 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:51:01,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:51:01,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 296 states and 599 transitions. [2018-11-18 09:51:01,707 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 599 transitions. [2018-11-18 09:51:01,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 09:51:01,707 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:51:01,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:51:01,754 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:51:03,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:51:03,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 301 states and 613 transitions. [2018-11-18 09:51:03,643 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 613 transitions. [2018-11-18 09:51:03,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 09:51:03,644 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:51:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:51:03,689 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:51:04,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:51:04,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 303 states and 620 transitions. [2018-11-18 09:51:04,279 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 620 transitions. [2018-11-18 09:51:04,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 09:51:04,279 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:51:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:51:04,721 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:51:07,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:51:07,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 307 states and 631 transitions. [2018-11-18 09:51:07,215 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 631 transitions. [2018-11-18 09:51:07,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 09:51:07,216 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:51:07,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:51:07,470 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:51:09,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:51:09,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 313 states and 650 transitions. [2018-11-18 09:51:09,982 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 650 transitions. [2018-11-18 09:51:09,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 09:51:09,983 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:51:10,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:51:10,251 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:51:12,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 09:51:12,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 318 states and 666 transitions. [2018-11-18 09:51:12,113 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 666 transitions. [2018-11-18 09:51:12,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-18 09:51:12,114 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 09:51:12,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:51:12,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:51:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:51:13,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:51:13,350 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 42 iterations. [2018-11-18 09:51:13,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 18.11 09:51:13 ImpRootNode [2018-11-18 09:51:13,471 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-18 09:51:13,471 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 09:51:13,471 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 09:51:13,471 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 09:51:13,472 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:49:29" (3/4) ... [2018-11-18 09:51:13,475 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 09:51:13,572 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_19dc7994-b392-4807-b0fb-a0e2de011305/bin-2019/ukojak/witness.graphml [2018-11-18 09:51:13,573 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 09:51:13,573 INFO L168 Benchmark]: Toolchain (without parser) took 106150.22 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.3 GB). Free memory was 958.0 MB in the beginning and 1.5 GB in the end (delta: -501.5 MB). Peak memory consumption was 756.3 MB. Max. memory is 11.5 GB. [2018-11-18 09:51:13,574 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:51:13,574 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 955.4 MB in the beginning and 1.1 GB in the end (delta: -159.4 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. [2018-11-18 09:51:13,574 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-18 09:51:13,574 INFO L168 Benchmark]: Boogie Preprocessor took 22.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-18 09:51:13,575 INFO L168 Benchmark]: RCFGBuilder took 1679.32 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 820.3 MB in the end (delta: 287.6 MB). Peak memory consumption was 287.6 MB. Max. memory is 11.5 GB. [2018-11-18 09:51:13,575 INFO L168 Benchmark]: CodeCheck took 103984.83 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 820.3 MB in the beginning and 1.5 GB in the end (delta: -666.4 MB). Peak memory consumption was 470.7 MB. Max. memory is 11.5 GB. [2018-11-18 09:51:13,575 INFO L168 Benchmark]: Witness Printer took 101.65 ms. Allocated memory is still 2.3 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2018-11-18 09:51:13,576 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, 124 locations, 1 error locations. UNSAFE Result, 103.8s OverallTime, 42 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1151818748 SDtfs, 836165044 SDslu, -2112494176 SDs, 0 SdLazy, -9584476 SolverSat, 327801604 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 54.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12415 GetRequests, 10776 SyntacticMatches, 675 SemanticMatches, 964 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574768 ImplicationChecksByTransitivity, 96.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 15.6s InterpolantComputationTime, 1270 NumberOfCodeBlocks, 1270 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 1177 ConstructedInterpolants, 0 QuantifiedInterpolants, 495592 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 41 InterpolantComputations, 10 PerfectInterpolantSequences, 133/742 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: 577]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L71] char p12_old ; [L72] char p12_new ; [L73] _Bool ep12 ; [L75] char p13_old ; [L76] char p13_new ; [L77] _Bool ep13 ; [L79] char p21_old ; [L80] char p21_new ; [L81] _Bool ep21 ; [L83] char p23_old ; [L84] char p23_new ; [L85] _Bool ep23 ; [L87] char p31_old ; [L88] char p31_new ; [L89] _Bool ep31 ; [L91] char p32_old ; [L92] char p32_new ; [L93] _Bool ep32 ; [L94] char id1 ; [L95] char r1 ; [L96] char st1 ; [L97] char nl1 ; [L98] char m1 ; [L99] char max1 ; [L100] _Bool mode1 ; [L101] char id2 ; [L102] char r2 ; [L103] char st2 ; [L104] char nl2 ; [L105] char m2 ; [L106] char max2 ; [L107] _Bool mode2 ; [L108] char id3 ; [L109] char r3 ; [L110] char st3 ; [L111] char nl3 ; [L112] char m3 ; [L113] char max3 ; [L114] _Bool mode3 ; [L69] msg_t nomsg = (msg_t )-1; [L70] port_t p12 ; [L74] port_t p13 ; [L78] port_t p21 ; [L82] port_t p23 ; [L86] port_t p31 ; [L90] port_t p32 ; [L244] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L498] int c1 ; [L499] int i2 ; [L502] c1 = 0 [L503] ep12 = __VERIFIER_nondet_bool() [L504] ep13 = __VERIFIER_nondet_bool() [L505] ep21 = __VERIFIER_nondet_bool() [L506] ep23 = __VERIFIER_nondet_bool() [L507] ep31 = __VERIFIER_nondet_bool() [L508] ep32 = __VERIFIER_nondet_bool() [L509] id1 = __VERIFIER_nondet_char() [L510] r1 = __VERIFIER_nondet_char() [L511] st1 = __VERIFIER_nondet_char() [L512] nl1 = __VERIFIER_nondet_char() [L513] m1 = __VERIFIER_nondet_char() [L514] max1 = __VERIFIER_nondet_char() [L515] mode1 = __VERIFIER_nondet_bool() [L516] id2 = __VERIFIER_nondet_char() [L517] r2 = __VERIFIER_nondet_char() [L518] st2 = __VERIFIER_nondet_char() [L519] nl2 = __VERIFIER_nondet_char() [L520] m2 = __VERIFIER_nondet_char() [L521] max2 = __VERIFIER_nondet_char() [L522] mode2 = __VERIFIER_nondet_bool() [L523] id3 = __VERIFIER_nondet_char() [L524] r3 = __VERIFIER_nondet_char() [L525] st3 = __VERIFIER_nondet_char() [L526] nl3 = __VERIFIER_nondet_char() [L527] m3 = __VERIFIER_nondet_char() [L528] max3 = __VERIFIER_nondet_char() [L529] mode3 = __VERIFIER_nondet_bool() [L530] CALL, EXPR init() [L247] _Bool r121 ; [L248] _Bool r131 ; [L249] _Bool r211 ; [L250] _Bool r231 ; [L251] _Bool r311 ; [L252] _Bool r321 ; [L253] _Bool r122 ; [L254] int tmp ; [L255] _Bool r132 ; [L256] int tmp___0 ; [L257] _Bool r212 ; [L258] int tmp___1 ; [L259] _Bool r232 ; [L260] int tmp___2 ; [L261] _Bool r312 ; [L262] int tmp___3 ; [L263] _Bool r322 ; [L264] int tmp___4 ; [L265] int tmp___5 ; [L268] r121 = ep12 [L269] r131 = ep13 [L270] r211 = ep21 [L271] r231 = ep23 [L272] r311 = ep31 [L273] r321 = ep32 [L274] COND FALSE !(\read(r121)) [L277] COND TRUE \read(r131) [L278] COND FALSE !(\read(ep32)) [L281] tmp = 0 [L286] r122 = (_Bool )tmp [L287] COND TRUE \read(r131) [L288] tmp___0 = 1 [L299] r132 = (_Bool )tmp___0 [L300] COND FALSE !(\read(r211)) [L303] COND FALSE !(\read(r231)) [L310] tmp___1 = 0 [L312] r212 = (_Bool )tmp___1 [L313] COND FALSE !(\read(r231)) [L316] COND FALSE !(\read(r211)) [L323] tmp___2 = 0 [L325] r232 = (_Bool )tmp___2 [L326] COND FALSE !(\read(r311)) [L329] COND FALSE !(\read(r321)) [L336] tmp___3 = 0 [L338] r312 = (_Bool )tmp___3 [L339] COND FALSE !(\read(r321)) [L342] COND FALSE !(\read(r311)) [L349] tmp___4 = 0 [L351] r322 = (_Bool )tmp___4 [L352] COND TRUE (int )id1 != (int )id2 [L353] COND TRUE (int )id1 != (int )id3 [L354] COND TRUE (int )id2 != (int )id3 [L355] COND TRUE (int )id1 >= 0 [L356] COND TRUE (int )id2 >= 0 [L357] COND TRUE (int )id3 >= 0 [L358] COND TRUE (int )r1 == 0 [L359] COND TRUE (int )r2 == 0 [L360] COND TRUE (int )r3 == 0 [L361] COND TRUE (int )max1 == (int )id1 [L362] COND TRUE (int )max2 == (int )id2 [L363] COND TRUE (int )max3 == (int )id3 [L364] COND TRUE (int )st1 == 0 [L365] COND TRUE (int )st2 == 0 [L366] COND TRUE (int )st3 == 0 [L367] COND TRUE (int )nl1 == 0 [L368] COND TRUE (int )nl2 == 0 [L369] COND TRUE (int )nl3 == 0 [L370] COND TRUE (int )mode1 == 0 [L371] COND TRUE (int )mode2 == 0 [L372] COND TRUE (int )mode3 == 0 [L373] tmp___5 = 1 [L437] RET return (tmp___5); [L530] EXPR init() [L530] i2 = init() [L532] p12_old = nomsg [L533] p12_new = nomsg [L534] p13_old = nomsg [L535] p13_new = nomsg [L536] p21_old = nomsg [L537] p21_new = nomsg [L538] p23_old = nomsg [L539] p23_new = nomsg [L540] p31_old = nomsg [L541] p31_new = nomsg [L542] p32_old = nomsg [L543] p32_new = nomsg [L544] i2 = 0 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=0, max3=1, mode1=0, mode2=0, mode3=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=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L545] COND TRUE i2 < 6 [L547] CALL node1() [L120] COND FALSE !(\read(mode1)) [L145] COND TRUE (int )r1 < 2 [L146] COND FALSE !(\read(ep12)) [L149] COND TRUE \read(ep13) [L150] COND TRUE, EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L150] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L153] RET mode1 = (_Bool)1 [L547] node1() [L548] CALL node2() [L163] COND FALSE !(\read(mode2)) [L188] COND TRUE (int )r2 < 2 [L189] COND FALSE !(\read(ep21)) [L192] COND FALSE !(\read(ep23)) [L196] RET mode2 = (_Bool)1 [L548] node2() [L549] CALL node3() [L206] COND FALSE !(\read(mode3)) [L231] COND TRUE (int )r3 < 2 [L232] COND FALSE !(\read(ep31)) [L235] COND FALSE !(\read(ep32)) [L239] RET mode3 = (_Bool)1 [L549] node3() [L550] p12_old = p12_new [L551] p12_new = nomsg [L552] p13_old = p13_new [L553] p13_new = nomsg [L554] p21_old = p21_new [L555] p21_new = nomsg [L556] p23_old = p23_new [L557] p23_new = nomsg [L558] p31_old = p31_new [L559] p31_new = nomsg [L560] p32_old = p32_new [L561] p32_new = nomsg [L562] CALL, EXPR check() [L442] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-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] [L445] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-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] [L446] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-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] [L447] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-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] [L448] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-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] [L449] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-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] [L452] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-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] [L454] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-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] [L459] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-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] [L462] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-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] [L464] COND TRUE (int )r1 < 2 [L465] tmp = 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-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] [L493] RET return (tmp); [L562] EXPR check() [L562] c1 = check() [L563] CALL assert(c1) [L575] COND FALSE, RET !(! arg) VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-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] [L563] assert(c1) [L564] i2 ++ VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=0, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-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] [L545] COND TRUE i2 < 6 [L547] CALL node1() [L120] COND TRUE \read(mode1) [L121] r1 = (char )((int )r1 + 1) [L122] COND FALSE !(\read(ep21)) [L129] COND FALSE !(\read(ep31)) [L136] COND FALSE !((int )r1 == 2) [L143] RET mode1 = (_Bool)0 [L547] node1() [L548] CALL node2() [L163] COND TRUE \read(mode2) [L164] r2 = (char )((int )r2 + 1) [L165] COND FALSE !(\read(ep12)) [L172] COND FALSE !(\read(ep32)) [L179] COND FALSE !((int )r2 == 2) [L186] RET mode2 = (_Bool)0 [L548] node2() [L549] CALL node3() [L206] COND TRUE \read(mode3) [L207] r3 = (char )((int )r3 + 1) [L208] COND TRUE \read(ep13) [L209] m3 = p13_old [L210] p13_old = nomsg [L211] COND TRUE (int )m3 > (int )max3 [L212] max3 = m3 [L215] COND FALSE !(\read(ep23)) [L222] COND FALSE !((int )r3 == 2) [L229] RET mode3 = (_Bool)0 [L549] node3() [L550] p12_old = p12_new [L551] p12_new = nomsg [L552] p13_old = p13_new [L553] p13_new = nomsg [L554] p21_old = p21_new [L555] p21_new = nomsg [L556] p23_old = p23_new [L557] p23_new = nomsg [L558] p31_old = p31_new [L559] p31_new = nomsg [L560] p32_old = p32_new [L561] p32_new = nomsg [L562] CALL, EXPR check() [L442] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=0, max3=2, mode1=0, mode2=0, mode3=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] [L445] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=0, max3=2, mode1=0, mode2=0, mode3=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] [L446] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=0, max3=2, mode1=0, mode2=0, mode3=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] [L447] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=0, max3=2, mode1=0, mode2=0, mode3=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] [L448] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=0, max3=2, mode1=0, mode2=0, mode3=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] [L449] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=0, max3=2, mode1=0, mode2=0, mode3=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] [L452] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=0, max3=2, mode1=0, mode2=0, mode3=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] [L454] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=0, max3=2, mode1=0, mode2=0, mode3=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] [L459] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=0, max3=2, mode1=0, mode2=0, mode3=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] [L462] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=0, max3=2, mode1=0, mode2=0, mode3=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] [L464] COND TRUE (int )r1 < 2 [L465] tmp = 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=0, max3=2, mode1=0, mode2=0, mode3=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] [L493] RET return (tmp); [L562] EXPR check() [L562] c1 = check() [L563] CALL assert(c1) [L575] COND FALSE, RET !(! arg) VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=0, max3=2, mode1=0, mode2=0, mode3=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] [L563] assert(c1) [L564] i2 ++ VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=0, max3=2, mode1=0, mode2=0, mode3=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] [L545] COND TRUE i2 < 6 [L547] CALL node1() [L120] COND FALSE !(\read(mode1)) [L145] COND TRUE (int )r1 < 2 [L146] COND FALSE !(\read(ep12)) [L149] COND TRUE \read(ep13) [L150] COND TRUE, EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L150] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L153] RET mode1 = (_Bool)1 [L547] node1() [L548] CALL node2() [L163] COND FALSE !(\read(mode2)) [L188] COND TRUE (int )r2 < 2 [L189] COND FALSE !(\read(ep21)) [L192] COND FALSE !(\read(ep23)) [L196] RET mode2 = (_Bool)1 [L548] node2() [L549] CALL node3() [L206] COND FALSE !(\read(mode3)) [L231] COND TRUE (int )r3 < 2 [L232] COND FALSE !(\read(ep31)) [L235] COND FALSE !(\read(ep32)) [L239] RET mode3 = (_Bool)1 [L549] node3() [L550] p12_old = p12_new [L551] p12_new = nomsg [L552] p13_old = p13_new [L553] p13_new = nomsg [L554] p21_old = p21_new [L555] p21_new = nomsg [L556] p23_old = p23_new [L557] p23_new = nomsg [L558] p31_old = p31_new [L559] p31_new = nomsg [L560] p32_old = p32_new [L561] p32_new = nomsg [L562] CALL, EXPR check() [L442] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=0, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-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] [L445] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=0, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-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] [L446] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=0, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-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] [L447] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=0, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-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] [L448] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=0, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-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] [L449] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=0, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-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] [L452] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=0, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-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] [L454] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=0, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-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] [L459] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=0, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-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] [L462] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=0, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-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] [L464] COND TRUE (int )r1 < 2 [L465] tmp = 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=0, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-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] [L493] RET return (tmp); [L562] EXPR check() [L562] c1 = check() [L563] CALL assert(c1) [L575] COND FALSE, RET !(! arg) VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=0, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-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] [L563] assert(c1) [L564] i2 ++ VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=0, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-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] [L545] COND TRUE i2 < 6 [L547] CALL node1() [L120] COND TRUE \read(mode1) [L121] r1 = (char )((int )r1 + 1) [L122] COND FALSE !(\read(ep21)) [L129] COND FALSE !(\read(ep31)) [L136] COND TRUE (int )r1 == 2 [L137] COND TRUE (int )max1 == (int )id1 [L138] st1 = (char)1 [L143] RET mode1 = (_Bool)0 [L547] node1() [L548] CALL node2() [L163] COND TRUE \read(mode2) [L164] r2 = (char )((int )r2 + 1) [L165] COND FALSE !(\read(ep12)) [L172] COND FALSE !(\read(ep32)) [L179] COND TRUE (int )r2 == 2 [L180] COND TRUE (int )max2 == (int )id2 [L181] st2 = (char)1 [L186] RET mode2 = (_Bool)0 [L548] node2() [L549] CALL node3() [L206] COND TRUE \read(mode3) [L207] r3 = (char )((int )r3 + 1) [L208] COND TRUE \read(ep13) [L209] m3 = p13_old [L210] p13_old = nomsg [L211] COND FALSE !((int )m3 > (int )max3) [L215] COND FALSE !(\read(ep23)) [L222] COND TRUE (int )r3 == 2 [L223] COND FALSE !((int )max3 == (int )id3) [L226] nl3 = (char)1 [L229] RET mode3 = (_Bool)0 [L549] node3() [L550] p12_old = p12_new [L551] p12_new = nomsg [L552] p13_old = p13_new [L553] p13_new = nomsg [L554] p21_old = p21_new [L555] p21_new = nomsg [L556] p23_old = p23_new [L557] p23_new = nomsg [L558] p31_old = p31_new [L559] p31_new = nomsg [L560] p32_old = p32_new [L561] p32_new = nomsg [L562] CALL, EXPR check() [L442] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=0, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L445] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L491] tmp = 0 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=0, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L493] RET return (tmp); [L562] EXPR check() [L562] c1 = check() [L563] CALL assert(c1) [L575] COND TRUE ! arg VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=0, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L577] __VERIFIER_error() VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=0, ep32=0, id1=2, id2=0, id3=1, m1=3, m2=1, m3=2, max1=2, max2=0, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 320.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 955.4 MB in the beginning and 1.1 GB in the end (delta: -159.4 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1679.32 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 820.3 MB in the end (delta: 287.6 MB). Peak memory consumption was 287.6 MB. Max. memory is 11.5 GB. * CodeCheck took 103984.83 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 820.3 MB in the beginning and 1.5 GB in the end (delta: -666.4 MB). Peak memory consumption was 470.7 MB. Max. memory is 11.5 GB. * Witness Printer took 101.65 ms. Allocated memory is still 2.3 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...