./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_284ca8b1-b24f-4ddb-9fc2-e3d81804cdc8/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_284ca8b1-b24f-4ddb-9fc2-e3d81804cdc8/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_284ca8b1-b24f-4ddb-9fc2-e3d81804cdc8/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_284ca8b1-b24f-4ddb-9fc2-e3d81804cdc8/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/working_dir_284ca8b1-b24f-4ddb-9fc2-e3d81804cdc8/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_284ca8b1-b24f-4ddb-9fc2-e3d81804cdc8/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 adc229f0a7bc8afe44d4e19612f0edd5de4d255f ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 21:22:57,817 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 21:22:57,819 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 21:22:57,829 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 21:22:57,829 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 21:22:57,830 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 21:22:57,832 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 21:22:57,833 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 21:22:57,835 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 21:22:57,836 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 21:22:57,838 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 21:22:57,841 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 21:22:57,842 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 21:22:57,843 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 21:22:57,844 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 21:22:57,845 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 21:22:57,848 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 21:22:57,850 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 21:22:57,852 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 21:22:57,853 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 21:22:57,864 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 21:22:57,865 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 21:22:57,867 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 21:22:57,867 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 21:22:57,868 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 21:22:57,868 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 21:22:57,869 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 21:22:57,870 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 21:22:57,870 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 21:22:57,871 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 21:22:57,872 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 21:22:57,872 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 21:22:57,872 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 21:22:57,873 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 21:22:57,880 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 21:22:57,881 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 21:22:57,881 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_284ca8b1-b24f-4ddb-9fc2-e3d81804cdc8/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-10-26 21:22:57,896 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 21:22:57,897 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 21:22:57,897 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 21:22:57,897 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 21:22:57,898 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 21:22:57,898 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 21:22:57,898 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 21:22:57,899 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 21:22:57,899 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 21:22:57,899 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 21:22:57,899 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 21:22:57,899 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 21:22:57,899 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 21:22:57,899 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 21:22:57,900 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 21:22:57,900 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 21:22:57,900 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 21:22:57,900 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-10-26 21:22:57,900 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-10-26 21:22:57,901 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 21:22:57,901 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 21:22:57,901 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-26 21:22:57,901 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 21:22:57,901 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 21:22:57,901 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 21:22:57,904 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-10-26 21:22:57,904 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 21:22:57,904 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 21:22:57,905 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_284ca8b1-b24f-4ddb-9fc2-e3d81804cdc8/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 -> adc229f0a7bc8afe44d4e19612f0edd5de4d255f [2018-10-26 21:22:57,934 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 21:22:57,945 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 21:22:57,948 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 21:22:57,949 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 21:22:57,949 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 21:22:57,950 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_284ca8b1-b24f-4ddb-9fc2-e3d81804cdc8/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.1.ufo.UNBOUNDED.pals.c [2018-10-26 21:22:58,015 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_284ca8b1-b24f-4ddb-9fc2-e3d81804cdc8/bin-2019/ukojak/data/134524a6a/263649b196424e11b9f46e35c78418bc/FLAG49755ab36 [2018-10-26 21:22:58,425 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 21:22:58,426 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_284ca8b1-b24f-4ddb-9fc2-e3d81804cdc8/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.1.ufo.UNBOUNDED.pals.c [2018-10-26 21:22:58,432 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_284ca8b1-b24f-4ddb-9fc2-e3d81804cdc8/bin-2019/ukojak/data/134524a6a/263649b196424e11b9f46e35c78418bc/FLAG49755ab36 [2018-10-26 21:22:58,447 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_284ca8b1-b24f-4ddb-9fc2-e3d81804cdc8/bin-2019/ukojak/data/134524a6a/263649b196424e11b9f46e35c78418bc [2018-10-26 21:22:58,449 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 21:22:58,450 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 21:22:58,451 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 21:22:58,451 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 21:22:58,454 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 21:22:58,455 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:22:58" (1/1) ... [2018-10-26 21:22:58,457 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45c90e0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:22:58, skipping insertion in model container [2018-10-26 21:22:58,458 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:22:58" (1/1) ... [2018-10-26 21:22:58,466 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 21:22:58,499 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 21:22:58,690 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:22:58,697 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 21:22:58,745 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:22:58,757 INFO L193 MainTranslator]: Completed translation [2018-10-26 21:22:58,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:22:58 WrapperNode [2018-10-26 21:22:58,758 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 21:22:58,758 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 21:22:58,759 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 21:22:58,759 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 21:22:58,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:22:58" (1/1) ... [2018-10-26 21:22:58,779 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:22:58" (1/1) ... [2018-10-26 21:22:58,814 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 21:22:58,814 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 21:22:58,815 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 21:22:58,815 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 21:22:58,888 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:22:58" (1/1) ... [2018-10-26 21:22:58,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:22:58" (1/1) ... [2018-10-26 21:22:58,892 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:22:58" (1/1) ... [2018-10-26 21:22:58,892 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:22:58" (1/1) ... [2018-10-26 21:22:58,910 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:22:58" (1/1) ... [2018-10-26 21:22:58,935 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:22:58" (1/1) ... [2018-10-26 21:22:58,937 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:22:58" (1/1) ... [2018-10-26 21:22:58,948 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 21:22:58,948 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 21:22:58,948 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 21:22:58,948 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 21:22:58,949 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:22:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_284ca8b1-b24f-4ddb-9fc2-e3d81804cdc8/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-26 21:22:59,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 21:22:59,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 21:23:02,399 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 21:23:02,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:23:02 BoogieIcfgContainer [2018-10-26 21:23:02,399 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 21:23:02,400 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-10-26 21:23:02,400 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-10-26 21:23:02,407 INFO L276 PluginConnector]: CodeCheck initialized [2018-10-26 21:23:02,407 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:23:02" (1/1) ... [2018-10-26 21:23:02,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:23:02,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:23:02,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 21 states and 33 transitions. [2018-10-26 21:23:02,441 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 33 transitions. [2018-10-26 21:23:02,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-26 21:23:02,444 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:23:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:23:03,124 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-26 21:23:03,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:23:03,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:23:03,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 22 states and 34 transitions. [2018-10-26 21:23:03,391 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 34 transitions. [2018-10-26 21:23:03,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-26 21:23:03,392 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:23:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:23:03,806 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-26 21:23:03,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:23:04,122 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-26 21:23:04,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:23:04,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 26 states and 41 transitions. [2018-10-26 21:23:04,470 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 41 transitions. [2018-10-26 21:23:04,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-26 21:23:04,471 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:23:04,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:23:04,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:23:05,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:23:05,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 31 states and 50 transitions. [2018-10-26 21:23:05,352 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 50 transitions. [2018-10-26 21:23:05,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-26 21:23:05,355 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:23:05,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:23:05,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:23:06,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:23:06,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 37 states and 61 transitions. [2018-10-26 21:23:06,174 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 61 transitions. [2018-10-26 21:23:06,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-26 21:23:06,175 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:23:06,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:23:06,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:23:07,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:23:07,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 45 states and 74 transitions. [2018-10-26 21:23:07,209 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 74 transitions. [2018-10-26 21:23:07,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-26 21:23:07,210 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:23:07,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:23:08,106 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2018-10-26 21:23:08,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:23:09,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:23:09,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 52 states and 86 transitions. [2018-10-26 21:23:09,392 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 86 transitions. [2018-10-26 21:23:09,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-26 21:23:09,393 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:23:09,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:23:09,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:23:10,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:23:10,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 53 states and 86 transitions. [2018-10-26 21:23:10,069 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 86 transitions. [2018-10-26 21:23:10,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-26 21:23:10,069 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:23:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:23:10,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:23:10,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:23:10,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 54 states and 87 transitions. [2018-10-26 21:23:10,195 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 87 transitions. [2018-10-26 21:23:10,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-26 21:23:10,196 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:23:10,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:23:10,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:23:12,058 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-10-26 21:23:13,318 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-10-26 21:23:13,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:23:13,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 65 states and 104 transitions. [2018-10-26 21:23:13,638 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 104 transitions. [2018-10-26 21:23:13,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-26 21:23:13,638 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:23:13,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:23:14,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:23:14,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:23:14,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 68 states and 109 transitions. [2018-10-26 21:23:14,990 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 109 transitions. [2018-10-26 21:23:14,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-26 21:23:14,991 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:23:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:23:16,245 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2018-10-26 21:23:16,666 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:23:20,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:23:20,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 86 states and 138 transitions. [2018-10-26 21:23:20,340 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 138 transitions. [2018-10-26 21:23:20,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-26 21:23:20,341 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:23:20,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:23:21,146 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:23:24,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:23:24,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 104 states and 168 transitions. [2018-10-26 21:23:24,424 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 168 transitions. [2018-10-26 21:23:24,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-26 21:23:24,425 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:23:24,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:23:24,693 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:23:24,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:23:24,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 105 states and 170 transitions. [2018-10-26 21:23:24,934 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 170 transitions. [2018-10-26 21:23:24,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 21:23:24,935 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:23:25,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:23:25,661 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:23:29,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:23:29,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 125 states and 202 transitions. [2018-10-26 21:23:29,878 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 202 transitions. [2018-10-26 21:23:29,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 21:23:29,879 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:23:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:23:30,170 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:23:30,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:23:30,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 126 states and 206 transitions. [2018-10-26 21:23:30,493 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 206 transitions. [2018-10-26 21:23:30,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 21:23:30,493 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:23:30,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:23:31,068 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:23:31,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:23:31,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 127 states and 210 transitions. [2018-10-26 21:23:31,378 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 210 transitions. [2018-10-26 21:23:31,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 21:23:31,381 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:23:31,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:23:32,083 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:23:34,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:23:34,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 142 states and 236 transitions. [2018-10-26 21:23:34,910 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 236 transitions. [2018-10-26 21:23:34,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 21:23:34,911 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:23:34,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:23:35,108 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:23:35,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:23:35,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 145 states and 243 transitions. [2018-10-26 21:23:35,927 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 243 transitions. [2018-10-26 21:23:35,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 21:23:35,927 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:23:35,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:23:36,289 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:23:36,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:23:36,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 146 states and 248 transitions. [2018-10-26 21:23:36,633 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 248 transitions. [2018-10-26 21:23:36,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 21:23:36,634 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:23:36,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:23:37,125 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:23:37,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:23:37,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 147 states and 253 transitions. [2018-10-26 21:23:37,491 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 253 transitions. [2018-10-26 21:23:37,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 21:23:37,491 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:23:37,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:23:38,841 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:23:44,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:23:44,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 169 states and 283 transitions. [2018-10-26 21:23:44,521 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 283 transitions. [2018-10-26 21:23:44,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-26 21:23:44,522 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:23:44,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:23:45,186 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:23:46,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:23:46,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 174 states and 292 transitions. [2018-10-26 21:23:46,969 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 292 transitions. [2018-10-26 21:23:46,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 21:23:46,969 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:23:47,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:23:48,184 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:23:52,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:23:52,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 183 states and 311 transitions. [2018-10-26 21:23:52,336 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 311 transitions. [2018-10-26 21:23:52,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-26 21:23:52,337 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:23:52,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:23:53,755 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:24:00,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:24:00,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 198 states and 364 transitions. [2018-10-26 21:24:00,258 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 364 transitions. [2018-10-26 21:24:00,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-26 21:24:00,258 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:24:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:24:01,875 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:24:07,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:24:07,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 212 states and 387 transitions. [2018-10-26 21:24:07,680 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 387 transitions. [2018-10-26 21:24:07,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-26 21:24:07,680 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:24:07,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:24:07,827 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:24:08,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:24:08,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 214 states and 395 transitions. [2018-10-26 21:24:08,553 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 395 transitions. [2018-10-26 21:24:08,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-26 21:24:08,554 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:24:08,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:24:10,236 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-10-26 21:24:11,892 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:24:18,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:24:18,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 227 states and 422 transitions. [2018-10-26 21:24:18,455 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 422 transitions. [2018-10-26 21:24:18,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-26 21:24:18,456 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:24:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:24:18,887 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:24:19,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:24:19,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 229 states and 426 transitions. [2018-10-26 21:24:19,401 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 426 transitions. [2018-10-26 21:24:19,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-26 21:24:19,401 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:24:19,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:24:19,862 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:24:20,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:24:20,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 231 states and 439 transitions. [2018-10-26 21:24:20,409 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 439 transitions. [2018-10-26 21:24:20,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-26 21:24:20,410 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:24:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:24:22,571 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:24:27,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:24:27,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 241 states and 456 transitions. [2018-10-26 21:24:27,008 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 456 transitions. [2018-10-26 21:24:27,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-26 21:24:27,008 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:24:27,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:24:27,344 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:24:28,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:24:28,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 243 states and 460 transitions. [2018-10-26 21:24:28,303 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 460 transitions. [2018-10-26 21:24:28,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-26 21:24:28,303 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:24:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:24:28,925 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:24:29,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:24:29,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 245 states and 461 transitions. [2018-10-26 21:24:29,493 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 461 transitions. [2018-10-26 21:24:29,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-26 21:24:29,494 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:24:29,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:24:30,516 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 22 [2018-10-26 21:24:32,003 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:24:38,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:24:38,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 259 states and 489 transitions. [2018-10-26 21:24:38,144 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 489 transitions. [2018-10-26 21:24:38,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-26 21:24:38,145 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:24:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:24:38,963 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:24:40,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:24:40,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 262 states and 501 transitions. [2018-10-26 21:24:40,217 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 501 transitions. [2018-10-26 21:24:40,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-26 21:24:40,218 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:24:40,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:24:42,433 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:24:49,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:24:49,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 277 states and 542 transitions. [2018-10-26 21:24:49,073 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 542 transitions. [2018-10-26 21:24:49,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-26 21:24:49,074 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:24:49,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:24:49,407 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:24:50,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:24:50,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 279 states and 548 transitions. [2018-10-26 21:24:50,098 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 548 transitions. [2018-10-26 21:24:50,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 21:24:50,099 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:24:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:24:53,072 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:24:57,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:24:57,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 283 states and 557 transitions. [2018-10-26 21:24:57,645 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 557 transitions. [2018-10-26 21:24:57,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 21:24:57,646 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:24:57,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:24:58,787 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:25:00,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 21:25:00,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 286 states and 570 transitions. [2018-10-26 21:25:00,409 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 570 transitions. [2018-10-26 21:25:00,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-26 21:25:00,410 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 21:25:00,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 21:25:01,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 21:25:01,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 21:25:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 21:25:01,600 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 39 iterations. [2018-10-26 21:25:01,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 26.10 09:25:01 ImpRootNode [2018-10-26 21:25:01,726 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-10-26 21:25:01,726 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 21:25:01,726 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 21:25:01,726 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 21:25:01,728 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:23:02" (3/4) ... [2018-10-26 21:25:01,730 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-26 21:25:01,899 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_284ca8b1-b24f-4ddb-9fc2-e3d81804cdc8/bin-2019/ukojak/witness.graphml [2018-10-26 21:25:01,899 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 21:25:01,900 INFO L168 Benchmark]: Toolchain (without parser) took 123449.96 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.3 GB). Free memory was 959.6 MB in the beginning and 2.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 301.9 MB. Max. memory is 11.5 GB. [2018-10-26 21:25:01,900 INFO L168 Benchmark]: CDTParser took 0.17 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-10-26 21:25:01,900 INFO L168 Benchmark]: CACSL2BoogieTranslator took 306.89 ms. Allocated memory is still 1.0 GB. Free memory was 959.6 MB in the beginning and 940.8 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2018-10-26 21:25:01,901 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.87 ms. Allocated memory is still 1.0 GB. Free memory was 940.8 MB in the beginning and 938.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 11.5 GB. [2018-10-26 21:25:01,901 INFO L168 Benchmark]: Boogie Preprocessor took 133.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 185.1 MB). Free memory was 938.1 MB in the beginning and 1.2 GB in the end (delta: -240.9 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. [2018-10-26 21:25:01,901 INFO L168 Benchmark]: RCFGBuilder took 3451.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 895.6 MB in the end (delta: 283.3 MB). Peak memory consumption was 283.3 MB. Max. memory is 11.5 GB. [2018-10-26 21:25:01,901 INFO L168 Benchmark]: CodeCheck took 119325.91 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 895.6 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2018-10-26 21:25:01,901 INFO L168 Benchmark]: Witness Printer took 172.77 ms. Allocated memory is still 2.3 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2018-10-26 21:25:01,903 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, 130 locations, 1 error locations. UNSAFE Result, 119.1s OverallTime, 39 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: -2147483648 SDtfs, -1492022816 SDslu, -296282428 SDs, 0 SdLazy, 1982476440 SolverSat, -1875194544 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 61.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10284 GetRequests, 8822 SyntacticMatches, 602 SemanticMatches, 860 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484732 ImplicationChecksByTransitivity, 108.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 3.4s SatisfiabilityAnalysisTime, 32.0s InterpolantComputationTime, 1106 NumberOfCodeBlocks, 1106 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1016 ConstructedInterpolants, 0 QuantifiedInterpolants, 534765 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 10 PerfectInterpolantSequences, 109/584 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: 586]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L72] char p12_old ; [L73] char p12_new ; [L74] _Bool ep12 ; [L76] char p13_old ; [L77] char p13_new ; [L78] _Bool ep13 ; [L80] char p21_old ; [L81] char p21_new ; [L82] _Bool ep21 ; [L84] char p23_old ; [L85] char p23_new ; [L86] _Bool ep23 ; [L88] char p31_old ; [L89] char p31_new ; [L90] _Bool ep31 ; [L92] char p32_old ; [L93] char p32_new ; [L94] _Bool ep32 ; [L95] char id1 ; [L96] unsigned char r1 ; [L97] char st1 ; [L98] char nl1 ; [L99] char m1 ; [L100] char max1 ; [L101] _Bool mode1 ; [L102] char id2 ; [L103] unsigned char r2 ; [L104] char st2 ; [L105] char nl2 ; [L106] char m2 ; [L107] char max2 ; [L108] _Bool mode2 ; [L109] char id3 ; [L110] unsigned char r3 ; [L111] char st3 ; [L112] char nl3 ; [L113] char m3 ; [L114] char max3 ; [L115] _Bool mode3 ; [L70] msg_t nomsg = (msg_t )-1; [L71] port_t p12 ; [L75] port_t p13 ; [L79] port_t p21 ; [L83] port_t p23 ; [L87] port_t p31 ; [L91] port_t p32 ; [L254] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L508] int c1 ; [L509] int i2 ; [L512] c1 = 0 [L513] ep12 = __VERIFIER_nondet_bool() [L514] ep13 = __VERIFIER_nondet_bool() [L515] ep21 = __VERIFIER_nondet_bool() [L516] ep23 = __VERIFIER_nondet_bool() [L517] ep31 = __VERIFIER_nondet_bool() [L518] ep32 = __VERIFIER_nondet_bool() [L519] id1 = __VERIFIER_nondet_char() [L520] r1 = __VERIFIER_nondet_uchar() [L521] st1 = __VERIFIER_nondet_char() [L522] nl1 = __VERIFIER_nondet_char() [L523] m1 = __VERIFIER_nondet_char() [L524] max1 = __VERIFIER_nondet_char() [L525] mode1 = __VERIFIER_nondet_bool() [L526] id2 = __VERIFIER_nondet_char() [L527] r2 = __VERIFIER_nondet_uchar() [L528] st2 = __VERIFIER_nondet_char() [L529] nl2 = __VERIFIER_nondet_char() [L530] m2 = __VERIFIER_nondet_char() [L531] max2 = __VERIFIER_nondet_char() [L532] mode2 = __VERIFIER_nondet_bool() [L533] id3 = __VERIFIER_nondet_char() [L534] r3 = __VERIFIER_nondet_uchar() [L535] st3 = __VERIFIER_nondet_char() [L536] nl3 = __VERIFIER_nondet_char() [L537] m3 = __VERIFIER_nondet_char() [L538] max3 = __VERIFIER_nondet_char() [L539] mode3 = __VERIFIER_nondet_bool() [L540] CALL, EXPR init() [L257] _Bool r121 ; [L258] _Bool r131 ; [L259] _Bool r211 ; [L260] _Bool r231 ; [L261] _Bool r311 ; [L262] _Bool r321 ; [L263] _Bool r122 ; [L264] int tmp ; [L265] _Bool r132 ; [L266] int tmp___0 ; [L267] _Bool r212 ; [L268] int tmp___1 ; [L269] _Bool r232 ; [L270] int tmp___2 ; [L271] _Bool r312 ; [L272] int tmp___3 ; [L273] _Bool r322 ; [L274] int tmp___4 ; [L275] int tmp___5 ; [L278] r121 = ep12 [L279] r131 = ep13 [L280] r211 = ep21 [L281] r231 = ep23 [L282] r311 = ep31 [L283] r321 = ep32 [L284] COND FALSE !(\read(r121)) [L287] COND TRUE \read(r131) [L288] COND TRUE \read(ep32) [L289] tmp = 1 [L296] r122 = (_Bool )tmp [L297] COND TRUE \read(r131) [L298] tmp___0 = 1 [L309] r132 = (_Bool )tmp___0 [L310] COND FALSE !(\read(r211)) [L313] COND TRUE \read(r231) [L314] COND FALSE !(\read(ep31)) [L317] tmp___1 = 0 [L322] r212 = (_Bool )tmp___1 [L323] COND TRUE \read(r231) [L324] tmp___2 = 1 [L335] r232 = (_Bool )tmp___2 [L336] COND FALSE !(\read(r311)) [L339] COND TRUE \read(r321) [L340] COND FALSE !(\read(ep21)) [L343] tmp___3 = 0 [L348] r312 = (_Bool )tmp___3 [L349] COND TRUE \read(r321) [L350] tmp___4 = 1 [L361] r322 = (_Bool )tmp___4 [L362] COND TRUE (int )id1 != (int )id2 [L363] COND TRUE (int )id1 != (int )id3 [L364] COND TRUE (int )id2 != (int )id3 [L365] COND TRUE (int )id1 >= 0 [L366] COND TRUE (int )id2 >= 0 [L367] COND TRUE (int )id3 >= 0 [L368] COND TRUE (int )r1 == 0 [L369] COND TRUE (int )r2 == 0 [L370] COND TRUE (int )r3 == 0 [L371] COND TRUE (int )max1 == (int )id1 [L372] COND TRUE (int )max2 == (int )id2 [L373] COND TRUE (int )max3 == (int )id3 [L374] COND TRUE (int )st1 == 0 [L375] COND TRUE (int )st2 == 0 [L376] COND TRUE (int )st3 == 0 [L377] COND TRUE (int )nl1 == 0 [L378] COND TRUE (int )nl2 == 0 [L379] COND TRUE (int )nl3 == 0 [L380] COND TRUE (int )mode1 == 0 [L381] COND TRUE (int )mode2 == 0 [L382] COND TRUE (int )mode3 == 0 [L383] tmp___5 = 1 [L447] RET return (tmp___5); [L540] EXPR init() [L540] i2 = init() [L542] p12_old = nomsg [L543] p12_new = nomsg [L544] p13_old = nomsg [L545] p13_new = nomsg [L546] p21_old = nomsg [L547] p21_new = nomsg [L548] p23_old = nomsg [L549] p23_new = nomsg [L550] p31_old = nomsg [L551] p31_new = nomsg [L552] p32_old = nomsg [L553] p32_new = nomsg [L554] i2 = 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=1, id1=3, id2=4, id3=127, m1=-128, m2=1, m3=2, max1=3, max2=4, max3=127, 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] [L555] COND TRUE 1 [L557] CALL node1() [L121] COND FALSE !(\read(mode1)) [L149] COND TRUE (int )r1 < 2 [L150] COND FALSE !(\read(ep12)) [L153] COND TRUE \read(ep13) [L154] COND TRUE, EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L154] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L157] RET mode1 = (_Bool)1 [L557] node1() [L558] CALL node2() [L167] COND FALSE !(\read(mode2)) [L195] COND TRUE (int )r2 < 2 [L196] COND FALSE !(\read(ep21)) [L199] COND TRUE \read(ep23) [L200] COND TRUE, EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L200] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L203] RET mode2 = (_Bool)1 [L558] node2() [L559] CALL node3() [L213] COND FALSE !(\read(mode3)) [L241] COND TRUE (int )r3 < 2 [L242] COND FALSE !(\read(ep31)) [L245] COND TRUE \read(ep32) [L246] COND TRUE, EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L246] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L249] RET mode3 = (_Bool)1 [L559] node3() [L560] p12_old = p12_new [L561] p12_new = nomsg [L562] p13_old = p13_new [L563] p13_new = nomsg [L564] p21_old = p21_new [L565] p21_new = nomsg [L566] p23_old = p23_new [L567] p23_new = nomsg [L568] p31_old = p31_new [L569] p31_new = nomsg [L570] p32_old = p32_new [L571] p32_new = nomsg [L572] CALL, EXPR check() [L452] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=1, id1=3, id2=4, id3=127, m1=-128, m2=1, m3=2, max1=3, max2=4, max3=127, 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=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L455] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=1, id1=3, id2=4, id3=127, m1=-128, m2=1, m3=2, max1=3, max2=4, max3=127, 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=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L456] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=1, id1=3, id2=4, id3=127, m1=-128, m2=1, m3=2, max1=3, max2=4, max3=127, 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=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L457] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=1, id1=3, id2=4, id3=127, m1=-128, m2=1, m3=2, max1=3, max2=4, max3=127, 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=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L458] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=1, id1=3, id2=4, id3=127, m1=-128, m2=1, m3=2, max1=3, max2=4, max3=127, 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=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, 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=1, ep31=0, ep32=1, id1=3, id2=4, id3=127, m1=-128, m2=1, m3=2, max1=3, max2=4, max3=127, 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=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L462] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=1, id1=3, id2=4, id3=127, m1=-128, m2=1, m3=2, max1=3, max2=4, max3=127, 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=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L464] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=1, id1=3, id2=4, id3=127, m1=-128, m2=1, m3=2, max1=3, max2=4, max3=127, 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=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=1, id1=3, id2=4, id3=127, m1=-128, m2=1, m3=2, max1=3, max2=4, max3=127, 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=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L472] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=1, id1=3, id2=4, id3=127, m1=-128, m2=1, m3=2, max1=3, max2=4, max3=127, 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=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L474] COND TRUE (int )r1 < 2 [L475] tmp = 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=1, id1=3, id2=4, id3=127, m1=-128, m2=1, m3=2, max1=3, max2=4, max3=127, 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=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L503] RET return (tmp); [L572] EXPR check() [L572] c1 = check() [L573] CALL assert(c1) [L584] COND FALSE, RET !(! arg) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=1, id1=3, id2=4, id3=127, m1=-128, m2=1, m3=2, max1=3, max2=4, max3=127, 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=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L573] assert(c1) [L555] COND TRUE 1 [L557] CALL node1() [L121] COND TRUE \read(mode1) [L122] COND FALSE !(r1 == 255) [L125] r1 = r1 + 1 [L126] COND FALSE !(\read(ep21)) [L133] COND FALSE !(\read(ep31)) [L140] COND FALSE !((int )r1 == 2) [L147] RET mode1 = (_Bool)0 [L557] node1() [L558] CALL node2() [L167] COND TRUE \read(mode2) [L168] COND FALSE !(r2 == 255) [L171] r2 = r2 + 1 [L172] COND FALSE !(\read(ep12)) [L179] COND TRUE \read(ep32) [L180] m2 = p32_old [L181] p32_old = nomsg [L182] COND TRUE (int )m2 > (int )max2 [L183] max2 = m2 [L186] COND FALSE !((int )r2 == 2) [L193] RET mode2 = (_Bool)0 [L558] node2() [L559] CALL node3() [L213] COND TRUE \read(mode3) [L214] COND FALSE !(r3 == 255) [L217] r3 = r3 + 1 [L218] COND TRUE \read(ep13) [L219] m3 = p13_old [L220] p13_old = nomsg [L221] COND FALSE !((int )m3 > (int )max3) [L225] COND TRUE \read(ep23) [L226] m3 = p23_old [L227] p23_old = nomsg [L228] COND FALSE !((int )m3 > (int )max3) [L232] COND FALSE !((int )r3 == 2) [L239] RET mode3 = (_Bool)0 [L559] node3() [L560] p12_old = p12_new [L561] p12_new = nomsg [L562] p13_old = p13_new [L563] p13_new = nomsg [L564] p21_old = p21_new [L565] p21_new = nomsg [L566] p23_old = p23_new [L567] p23_new = nomsg [L568] p31_old = p31_new [L569] p31_new = nomsg [L570] p32_old = p32_new [L571] p32_new = nomsg [L572] CALL, EXPR check() [L452] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=1, id1=3, id2=4, id3=127, m1=-128, m2=127, m3=4, max1=3, max2=127, max3=127, 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] [L455] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=1, id1=3, id2=4, id3=127, m1=-128, m2=127, m3=4, max1=3, max2=127, max3=127, 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] [L456] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=1, id1=3, id2=4, id3=127, m1=-128, m2=127, m3=4, max1=3, max2=127, max3=127, 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] [L457] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=1, id1=3, id2=4, id3=127, m1=-128, m2=127, m3=4, max1=3, max2=127, max3=127, 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] [L458] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=1, id1=3, id2=4, id3=127, m1=-128, m2=127, m3=4, max1=3, max2=127, max3=127, 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=1, ep31=0, ep32=1, id1=3, id2=4, id3=127, m1=-128, m2=127, m3=4, max1=3, max2=127, max3=127, 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 )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=1, id1=3, id2=4, id3=127, m1=-128, m2=127, m3=4, max1=3, max2=127, max3=127, 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 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=1, id1=3, id2=4, id3=127, m1=-128, m2=127, m3=4, max1=3, max2=127, max3=127, 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] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=1, id1=3, id2=4, id3=127, m1=-128, m2=127, m3=4, max1=3, max2=127, max3=127, 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] [L472] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=1, id1=3, id2=4, id3=127, m1=-128, m2=127, m3=4, max1=3, max2=127, max3=127, 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] [L474] COND TRUE (int )r1 < 2 [L475] tmp = 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=1, id1=3, id2=4, id3=127, m1=-128, m2=127, m3=4, max1=3, max2=127, max3=127, 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] [L503] RET return (tmp); [L572] EXPR check() [L572] c1 = check() [L573] CALL assert(c1) [L584] COND FALSE, RET !(! arg) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=1, id1=3, id2=4, id3=127, m1=-128, m2=127, m3=4, max1=3, max2=127, max3=127, 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] [L573] assert(c1) [L555] COND TRUE 1 [L557] CALL node1() [L121] COND FALSE !(\read(mode1)) [L149] COND TRUE (int )r1 < 2 [L150] COND FALSE !(\read(ep12)) [L153] COND TRUE \read(ep13) [L154] COND TRUE, EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L154] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L157] RET mode1 = (_Bool)1 [L557] node1() [L558] CALL node2() [L167] COND FALSE !(\read(mode2)) [L195] COND TRUE (int )r2 < 2 [L196] COND FALSE !(\read(ep21)) [L199] COND TRUE \read(ep23) [L200] COND TRUE, EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L200] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L203] RET mode2 = (_Bool)1 [L558] node2() [L559] CALL node3() [L213] COND FALSE !(\read(mode3)) [L241] COND TRUE (int )r3 < 2 [L242] COND FALSE !(\read(ep31)) [L245] COND TRUE \read(ep32) [L246] COND TRUE, EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L246] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L249] RET mode3 = (_Bool)1 [L559] node3() [L560] p12_old = p12_new [L561] p12_new = nomsg [L562] p13_old = p13_new [L563] p13_new = nomsg [L564] p21_old = p21_new [L565] p21_new = nomsg [L566] p23_old = p23_new [L567] p23_new = nomsg [L568] p31_old = p31_new [L569] p31_new = nomsg [L570] p32_old = p32_new [L571] p32_new = nomsg [L572] CALL, EXPR check() [L452] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=1, id1=3, id2=4, id3=127, m1=-128, m2=127, m3=4, max1=3, max2=127, max3=127, 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=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L455] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=1, id1=3, id2=4, id3=127, m1=-128, m2=127, m3=4, max1=3, max2=127, max3=127, 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=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L456] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=1, id1=3, id2=4, id3=127, m1=-128, m2=127, m3=4, max1=3, max2=127, max3=127, 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=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L457] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=1, id1=3, id2=4, id3=127, m1=-128, m2=127, m3=4, max1=3, max2=127, max3=127, 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=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L458] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=1, id1=3, id2=4, id3=127, m1=-128, m2=127, m3=4, max1=3, max2=127, max3=127, 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=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, 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=1, ep31=0, ep32=1, id1=3, id2=4, id3=127, m1=-128, m2=127, m3=4, max1=3, max2=127, max3=127, 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=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L462] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=1, id1=3, id2=4, id3=127, m1=-128, m2=127, m3=4, max1=3, max2=127, max3=127, 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=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L464] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=1, id1=3, id2=4, id3=127, m1=-128, m2=127, m3=4, max1=3, max2=127, max3=127, 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=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=1, id1=3, id2=4, id3=127, m1=-128, m2=127, m3=4, max1=3, max2=127, max3=127, 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=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L472] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=1, id1=3, id2=4, id3=127, m1=-128, m2=127, m3=4, max1=3, max2=127, max3=127, 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=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L474] COND TRUE (int )r1 < 2 [L475] tmp = 1 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=1, id1=3, id2=4, id3=127, m1=-128, m2=127, m3=4, max1=3, max2=127, max3=127, 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=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L503] RET return (tmp); [L572] EXPR check() [L572] c1 = check() [L573] CALL assert(c1) [L584] COND FALSE, RET !(! arg) VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=1, id1=3, id2=4, id3=127, m1=-128, m2=127, m3=4, max1=3, max2=127, max3=127, 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=3, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=127, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=127, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L573] assert(c1) [L555] COND TRUE 1 [L557] CALL node1() [L121] COND TRUE \read(mode1) [L122] COND FALSE !(r1 == 255) [L125] r1 = r1 + 1 [L126] COND FALSE !(\read(ep21)) [L133] COND FALSE !(\read(ep31)) [L140] COND TRUE (int )r1 == 2 [L141] COND TRUE (int )max1 == (int )id1 [L142] st1 = (char)1 [L147] RET mode1 = (_Bool)0 [L557] node1() [L558] CALL node2() [L167] COND TRUE \read(mode2) [L168] COND FALSE !(r2 == 255) [L171] r2 = r2 + 1 [L172] COND FALSE !(\read(ep12)) [L179] COND TRUE \read(ep32) [L180] m2 = p32_old [L181] p32_old = nomsg [L182] COND FALSE !((int )m2 > (int )max2) [L186] COND TRUE (int )r2 == 2 [L187] COND FALSE !((int )max2 == (int )id2) [L190] nl2 = (char)1 [L193] RET mode2 = (_Bool)0 [L558] node2() [L559] CALL node3() [L213] COND TRUE \read(mode3) [L214] COND FALSE !(r3 == 255) [L217] r3 = r3 + 1 [L218] COND TRUE \read(ep13) [L219] m3 = p13_old [L220] p13_old = nomsg [L221] COND FALSE !((int )m3 > (int )max3) [L225] COND TRUE \read(ep23) [L226] m3 = p23_old [L227] p23_old = nomsg [L228] COND FALSE !((int )m3 > (int )max3) [L232] COND TRUE (int )r3 == 2 [L233] COND TRUE (int )max3 == (int )id3 [L234] st3 = (char)1 [L239] RET mode3 = (_Bool)0 [L559] node3() [L560] p12_old = p12_new [L561] p12_new = nomsg [L562] p13_old = p13_new [L563] p13_new = nomsg [L564] p21_old = p21_new [L565] p21_new = nomsg [L566] p23_old = p23_new [L567] p23_new = nomsg [L568] p31_old = p31_new [L569] p31_new = nomsg [L570] p32_old = p32_new [L571] p32_new = nomsg [L572] CALL, EXPR check() [L452] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=1, id1=3, id2=4, id3=127, m1=-128, m2=127, m3=127, max1=3, max2=127, max3=127, mode1=0, mode2=0, mode3=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] [L455] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L501] tmp = 0 VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=1, id1=3, id2=4, id3=127, m1=-128, m2=127, m3=127, max1=3, max2=127, max3=127, mode1=0, mode2=0, mode3=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] [L503] RET return (tmp); [L572] EXPR check() [L572] c1 = check() [L573] CALL assert(c1) [L584] COND TRUE ! arg VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=1, id1=3, id2=4, id3=127, m1=-128, m2=127, m3=127, max1=3, max2=127, max3=127, mode1=0, mode2=0, mode3=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] [L586] __VERIFIER_error() VAL [ep12=0, ep13=1, ep21=0, ep23=1, ep31=0, ep32=1, id1=3, id2=4, id3=127, m1=-128, m2=127, m3=127, max1=3, max2=127, max3=127, mode1=0, mode2=0, mode3=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.17 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 306.89 ms. Allocated memory is still 1.0 GB. Free memory was 959.6 MB in the beginning and 940.8 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.87 ms. Allocated memory is still 1.0 GB. Free memory was 940.8 MB in the beginning and 938.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 133.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 185.1 MB). Free memory was 938.1 MB in the beginning and 1.2 GB in the end (delta: -240.9 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3451.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 895.6 MB in the end (delta: 283.3 MB). Peak memory consumption was 283.3 MB. Max. memory is 11.5 GB. * CodeCheck took 119325.91 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 895.6 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. * Witness Printer took 172.77 ms. Allocated memory is still 2.3 GB. Free memory was 2.0 GB in the beginning and 2.0 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...