./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8c70cf03-bd79-497f-849c-88491b3d6770/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8c70cf03-bd79-497f-849c-88491b3d6770/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8c70cf03-bd79-497f-849c-88491b3d6770/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8c70cf03-bd79-497f-849c-88491b3d6770/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_8c70cf03-bd79-497f-849c-88491b3d6770/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8c70cf03-bd79-497f-849c-88491b3d6770/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 64424a1c8c8e4b1dfa6f86e97492679716532609 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 13:50:10,890 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 13:50:10,891 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 13:50:10,897 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 13:50:10,897 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 13:50:10,897 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 13:50:10,898 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 13:50:10,899 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 13:50:10,900 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 13:50:10,901 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 13:50:10,901 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 13:50:10,901 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 13:50:10,902 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 13:50:10,902 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 13:50:10,903 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 13:50:10,903 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 13:50:10,904 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 13:50:10,905 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 13:50:10,906 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 13:50:10,907 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 13:50:10,907 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 13:50:10,908 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 13:50:10,909 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 13:50:10,909 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 13:50:10,909 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 13:50:10,910 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 13:50:10,910 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 13:50:10,911 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 13:50:10,911 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 13:50:10,912 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 13:50:10,912 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 13:50:10,912 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 13:50:10,913 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 13:50:10,913 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 13:50:10,913 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 13:50:10,914 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 13:50:10,914 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8c70cf03-bd79-497f-849c-88491b3d6770/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-08 13:50:10,921 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 13:50:10,922 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 13:50:10,922 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 13:50:10,922 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-08 13:50:10,922 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 13:50:10,923 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 13:50:10,923 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 13:50:10,923 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 13:50:10,923 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 13:50:10,923 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 13:50:10,923 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 13:50:10,923 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 13:50:10,923 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 13:50:10,924 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 13:50:10,924 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 13:50:10,924 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 13:50:10,924 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 13:50:10,924 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 13:50:10,924 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-08 13:50:10,924 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-08 13:50:10,924 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 13:50:10,924 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 13:50:10,925 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-08 13:50:10,925 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 13:50:10,925 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 13:50:10,925 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 13:50:10,925 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-08 13:50:10,925 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 13:50:10,925 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 13:50:10,925 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_8c70cf03-bd79-497f-849c-88491b3d6770/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 -> 64424a1c8c8e4b1dfa6f86e97492679716532609 [2018-12-08 13:50:10,942 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 13:50:10,949 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 13:50:10,951 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 13:50:10,952 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 13:50:10,952 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 13:50:10,952 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8c70cf03-bd79-497f-849c-88491b3d6770/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c [2018-12-08 13:50:10,987 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8c70cf03-bd79-497f-849c-88491b3d6770/bin-2019/ukojak/data/0ed1b64cf/47c3c84a32c348adb733d1b9a2b46c88/FLAG1d84d5626 [2018-12-08 13:50:11,387 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 13:50:11,387 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8c70cf03-bd79-497f-849c-88491b3d6770/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c [2018-12-08 13:50:11,392 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8c70cf03-bd79-497f-849c-88491b3d6770/bin-2019/ukojak/data/0ed1b64cf/47c3c84a32c348adb733d1b9a2b46c88/FLAG1d84d5626 [2018-12-08 13:50:11,400 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8c70cf03-bd79-497f-849c-88491b3d6770/bin-2019/ukojak/data/0ed1b64cf/47c3c84a32c348adb733d1b9a2b46c88 [2018-12-08 13:50:11,401 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 13:50:11,402 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 13:50:11,403 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 13:50:11,403 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 13:50:11,405 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 13:50:11,405 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 01:50:11" (1/1) ... [2018-12-08 13:50:11,407 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2648fef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:50:11, skipping insertion in model container [2018-12-08 13:50:11,407 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 01:50:11" (1/1) ... [2018-12-08 13:50:11,411 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 13:50:11,428 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 13:50:11,549 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 13:50:11,555 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 13:50:11,616 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 13:50:11,626 INFO L195 MainTranslator]: Completed translation [2018-12-08 13:50:11,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:50:11 WrapperNode [2018-12-08 13:50:11,626 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 13:50:11,627 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 13:50:11,627 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 13:50:11,627 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 13:50:11,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:50:11" (1/1) ... [2018-12-08 13:50:11,638 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:50:11" (1/1) ... [2018-12-08 13:50:11,657 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 13:50:11,657 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 13:50:11,657 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 13:50:11,657 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 13:50:11,663 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:50:11" (1/1) ... [2018-12-08 13:50:11,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:50:11" (1/1) ... [2018-12-08 13:50:11,665 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:50:11" (1/1) ... [2018-12-08 13:50:11,665 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:50:11" (1/1) ... [2018-12-08 13:50:11,669 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:50:11" (1/1) ... [2018-12-08 13:50:11,674 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:50:11" (1/1) ... [2018-12-08 13:50:11,675 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:50:11" (1/1) ... [2018-12-08 13:50:11,677 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 13:50:11,678 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 13:50:11,678 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 13:50:11,678 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 13:50:11,678 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 01:50:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8c70cf03-bd79-497f-849c-88491b3d6770/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-08 13:50:11,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 13:50:11,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 13:50:13,110 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 13:50:13,110 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-12-08 13:50:13,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 01:50:13 BoogieIcfgContainer [2018-12-08 13:50:13,111 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 13:50:13,111 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-08 13:50:13,111 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-08 13:50:13,117 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-08 13:50:13,117 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 01:50:13" (1/1) ... [2018-12-08 13:50:13,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 13:50:13,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:50:13,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 19 states and 30 transitions. [2018-12-08 13:50:13,144 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 30 transitions. [2018-12-08 13:50:13,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-08 13:50:13,146 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:50:13,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:50:13,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:50:13,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:50:13,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 21 states and 34 transitions. [2018-12-08 13:50:13,483 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2018-12-08 13:50:13,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-08 13:50:13,483 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:50:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:50:13,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:50:13,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:50:13,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 24 states and 41 transitions. [2018-12-08 13:50:13,730 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 41 transitions. [2018-12-08 13:50:13,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-08 13:50:13,731 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:50:13,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:50:13,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:50:14,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:50:14,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 28 states and 50 transitions. [2018-12-08 13:50:14,106 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2018-12-08 13:50:14,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-08 13:50:14,108 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:50:14,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:50:14,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-12-08 13:50:14,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:50:14,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 33 states and 61 transitions. [2018-12-08 13:50:14,561 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 61 transitions. [2018-12-08 13:50:14,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-08 13:50:14,562 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:50:14,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:50:14,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:50:15,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:50:15,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 40 states and 74 transitions. [2018-12-08 13:50:15,247 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 74 transitions. [2018-12-08 13:50:15,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-08 13:50:15,248 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:50:15,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:50:15,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:50:16,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:50:16,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 46 states and 86 transitions. [2018-12-08 13:50:16,008 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 86 transitions. [2018-12-08 13:50:16,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 13:50:16,008 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:50:16,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:50:16,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:50:16,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:50:16,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 47 states and 86 transitions. [2018-12-08 13:50:16,197 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 86 transitions. [2018-12-08 13:50:16,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-08 13:50:16,197 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:50:16,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:50:16,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:50:16,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:50:16,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 48 states and 87 transitions. [2018-12-08 13:50:16,225 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 87 transitions. [2018-12-08 13:50:16,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-08 13:50:16,225 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:50:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:50:16,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:50:18,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:50:18,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 58 states and 105 transitions. [2018-12-08 13:50:18,180 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 105 transitions. [2018-12-08 13:50:18,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-08 13:50:18,180 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:50:18,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:50:18,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:50:18,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:50:18,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 61 states and 111 transitions. [2018-12-08 13:50:18,452 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 111 transitions. [2018-12-08 13:50:18,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-08 13:50:18,453 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:50:18,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:50:18,959 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:50:21,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:50:21,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 77 states and 144 transitions. [2018-12-08 13:50:21,126 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 144 transitions. [2018-12-08 13:50:21,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-08 13:50:21,126 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:50:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:50:21,494 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:50:24,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:50:24,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 91 states and 167 transitions. [2018-12-08 13:50:24,596 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 167 transitions. [2018-12-08 13:50:24,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 13:50:24,597 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:50:24,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:50:25,044 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:50:28,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:50:28,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 105 states and 193 transitions. [2018-12-08 13:50:28,810 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 193 transitions. [2018-12-08 13:50:28,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 13:50:28,811 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:50:28,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:50:28,980 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:50:29,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:50:29,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 106 states and 197 transitions. [2018-12-08 13:50:29,191 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 197 transitions. [2018-12-08 13:50:29,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 13:50:29,192 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:50:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:50:29,334 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:50:29,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:50:29,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 107 states and 198 transitions. [2018-12-08 13:50:29,515 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 198 transitions. [2018-12-08 13:50:29,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-08 13:50:29,515 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:50:29,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:50:29,898 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:50:33,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:50:33,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 126 states and 235 transitions. [2018-12-08 13:50:33,879 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 235 transitions. [2018-12-08 13:50:33,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-08 13:50:33,879 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:50:33,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:50:34,038 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:50:34,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:50:34,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 129 states and 244 transitions. [2018-12-08 13:50:34,869 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 244 transitions. [2018-12-08 13:50:34,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 13:50:34,869 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:50:34,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:50:36,581 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:50:39,184 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2018-12-08 13:50:42,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:50:42,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 148 states and 277 transitions. [2018-12-08 13:50:42,975 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 277 transitions. [2018-12-08 13:50:42,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 13:50:42,975 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:50:43,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:50:43,117 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:50:45,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:50:45,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 152 states and 287 transitions. [2018-12-08 13:50:45,540 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 287 transitions. [2018-12-08 13:50:45,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-08 13:50:45,541 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:50:45,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:50:45,859 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:50:46,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:50:46,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 157 states and 296 transitions. [2018-12-08 13:50:46,818 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 296 transitions. [2018-12-08 13:50:46,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-08 13:50:46,819 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:50:46,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:50:46,938 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:50:48,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:50:48,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 161 states and 303 transitions. [2018-12-08 13:50:48,025 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 303 transitions. [2018-12-08 13:50:48,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 13:50:48,025 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:50:48,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:50:49,268 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:50:52,438 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2018-12-08 13:50:53,032 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2018-12-08 13:50:55,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:50:55,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 180 states and 337 transitions. [2018-12-08 13:50:55,869 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 337 transitions. [2018-12-08 13:50:55,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-08 13:50:55,869 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:50:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:50:56,150 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:50:57,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:50:57,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 184 states and 347 transitions. [2018-12-08 13:50:57,356 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 347 transitions. [2018-12-08 13:50:57,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-08 13:50:57,356 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:50:57,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:50:58,682 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:51:11,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:51:11,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 208 states and 420 transitions. [2018-12-08 13:51:11,884 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 420 transitions. [2018-12-08 13:51:11,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-08 13:51:11,885 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:51:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:51:12,024 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:51:13,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:51:13,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 213 states and 430 transitions. [2018-12-08 13:51:13,997 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 430 transitions. [2018-12-08 13:51:13,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-08 13:51:13,998 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:51:14,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:51:14,810 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:51:19,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:51:19,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 224 states and 449 transitions. [2018-12-08 13:51:19,981 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 449 transitions. [2018-12-08 13:51:19,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-08 13:51:19,981 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:51:20,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:51:20,083 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:51:21,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:51:21,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 227 states and 456 transitions. [2018-12-08 13:51:21,233 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 456 transitions. [2018-12-08 13:51:21,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-08 13:51:21,233 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:51:21,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:51:22,211 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:51:30,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:51:30,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 242 states and 496 transitions. [2018-12-08 13:51:30,969 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 496 transitions. [2018-12-08 13:51:30,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-08 13:51:30,969 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:51:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:51:31,058 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:51:33,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:51:33,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 248 states and 509 transitions. [2018-12-08 13:51:33,328 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 509 transitions. [2018-12-08 13:51:33,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-08 13:51:33,328 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:51:33,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:51:35,892 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:51:43,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:51:43,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 257 states and 527 transitions. [2018-12-08 13:51:43,435 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 527 transitions. [2018-12-08 13:51:43,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-08 13:51:43,435 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:51:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:51:43,521 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:51:44,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:51:44,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 254 states and 529 transitions. [2018-12-08 13:51:44,498 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 529 transitions. [2018-12-08 13:51:44,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-08 13:51:44,499 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:51:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:51:44,578 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:51:47,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:51:47,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 257 states and 540 transitions. [2018-12-08 13:51:47,225 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 540 transitions. [2018-12-08 13:51:47,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-08 13:51:47,226 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:51:47,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:51:49,621 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:51:56,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:51:56,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 261 states and 550 transitions. [2018-12-08 13:51:56,135 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 550 transitions. [2018-12-08 13:51:56,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-08 13:51:56,136 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:51:56,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:51:56,361 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:51:59,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:51:59,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 265 states and 564 transitions. [2018-12-08 13:51:59,923 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 564 transitions. [2018-12-08 13:51:59,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-08 13:51:59,924 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:52:00,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:52:00,161 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:52:00,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:52:00,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 266 states and 569 transitions. [2018-12-08 13:52:00,746 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 569 transitions. [2018-12-08 13:52:00,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-08 13:52:00,746 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:52:00,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:52:00,971 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:52:03,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:52:03,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 269 states and 583 transitions. [2018-12-08 13:52:03,064 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 583 transitions. [2018-12-08 13:52:03,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-08 13:52:03,064 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:52:03,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:52:03,314 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:52:05,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:52:05,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 273 states and 596 transitions. [2018-12-08 13:52:05,590 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 596 transitions. [2018-12-08 13:52:05,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-08 13:52:05,590 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:52:05,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:52:05,679 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:52:06,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:52:06,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 274 states and 600 transitions. [2018-12-08 13:52:06,226 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 600 transitions. [2018-12-08 13:52:06,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-08 13:52:06,227 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:52:06,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:52:06,319 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:52:07,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:52:07,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 277 states and 610 transitions. [2018-12-08 13:52:07,628 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 610 transitions. [2018-12-08 13:52:07,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-08 13:52:07,629 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:52:07,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:52:07,719 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:52:08,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:52:08,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 278 states and 611 transitions. [2018-12-08 13:52:08,278 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 611 transitions. [2018-12-08 13:52:08,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-08 13:52:08,279 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:52:08,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:52:08,375 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:52:10,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:52:10,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 281 states and 620 transitions. [2018-12-08 13:52:10,212 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 620 transitions. [2018-12-08 13:52:10,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-08 13:52:10,212 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:52:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:52:11,773 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:52:21,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:52:21,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 289 states and 636 transitions. [2018-12-08 13:52:21,432 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 636 transitions. [2018-12-08 13:52:21,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-08 13:52:21,432 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:52:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:52:21,535 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:52:23,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:52:23,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 293 states and 653 transitions. [2018-12-08 13:52:23,856 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 653 transitions. [2018-12-08 13:52:23,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-08 13:52:23,856 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:52:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:52:23,938 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:52:25,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:52:25,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 296 states and 657 transitions. [2018-12-08 13:52:25,747 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 657 transitions. [2018-12-08 13:52:25,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-08 13:52:25,748 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:52:25,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:52:25,829 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:52:26,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:52:26,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 298 states and 659 transitions. [2018-12-08 13:52:26,804 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 659 transitions. [2018-12-08 13:52:26,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-08 13:52:26,804 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:52:26,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:52:26,895 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 13:52:28,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:52:28,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 301 states and 669 transitions. [2018-12-08 13:52:28,160 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 669 transitions. [2018-12-08 13:52:28,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-08 13:52:28,160 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:52:28,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 13:52:28,402 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-08 13:52:29,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 13:52:29,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 300 states and 652 transitions. [2018-12-08 13:52:29,146 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 652 transitions. [2018-12-08 13:52:29,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-08 13:52:29,147 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 13:52:29,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:52:29,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:52:29,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:52:29,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 13:52:29,851 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 48 iterations. [2018-12-08 13:52:29,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.12 01:52:29 ImpRootNode [2018-12-08 13:52:29,937 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-08 13:52:29,937 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 13:52:29,937 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 13:52:29,937 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 13:52:29,938 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 01:50:13" (3/4) ... [2018-12-08 13:52:29,940 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 13:52:30,057 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8c70cf03-bd79-497f-849c-88491b3d6770/bin-2019/ukojak/witness.graphml [2018-12-08 13:52:30,057 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 13:52:30,057 INFO L168 Benchmark]: Toolchain (without parser) took 138655.49 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 232.3 MB). Free memory was 962.4 MB in the beginning and 1.1 GB in the end (delta: -111.0 MB). Peak memory consumption was 593.5 MB. Max. memory is 11.5 GB. [2018-12-08 13:52:30,058 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 13:52:30,058 INFO L168 Benchmark]: CACSL2BoogieTranslator took 223.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.3 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -126.0 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. [2018-12-08 13:52:30,058 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.03 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 13:52:30,058 INFO L168 Benchmark]: Boogie Preprocessor took 20.44 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-08 13:52:30,058 INFO L168 Benchmark]: RCFGBuilder took 1432.99 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 108.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -108.8 MB). Peak memory consumption was 338.2 MB. Max. memory is 11.5 GB. [2018-12-08 13:52:30,058 INFO L168 Benchmark]: CodeCheck took 136825.76 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 41.9 MB). Free memory was 1.2 GB in the beginning and 623.0 MB in the end (delta: 562.0 MB). Peak memory consumption was 603.9 MB. Max. memory is 11.5 GB. [2018-12-08 13:52:30,058 INFO L168 Benchmark]: Witness Printer took 119.78 ms. Allocated memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: -10.0 MB). Free memory was 623.0 MB in the beginning and 1.1 GB in the end (delta: -450.5 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-12-08 13:52:30,060 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, 135 locations, 1 error locations. UNSAFE Result, 136.7s OverallTime, 48 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: -1929446024 SDtfs, -1373771002 SDslu, 803769968 SDs, 0 SdLazy, 811080238 SolverSat, -928020000 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 73.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14465 GetRequests, 12709 SyntacticMatches, 732 SemanticMatches, 1024 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 651349 ImplicationChecksByTransitivity, 128.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 16.5s InterpolantComputationTime, 1398 NumberOfCodeBlocks, 1398 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 1303 ConstructedInterpolants, 0 QuantifiedInterpolants, 420500 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 47 InterpolantComputations, 10 PerfectInterpolantSequences, 184/847 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: 619]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L69] msg_t nomsg = (msg_t )-1; [L70] port_t p12 ; [L71] char p12_old ; [L72] char p12_new ; [L73] _Bool ep12 ; [L74] port_t p13 ; [L75] char p13_old ; [L76] char p13_new ; [L77] _Bool ep13 ; [L78] port_t p21 ; [L79] char p21_old ; [L80] char p21_new ; [L81] _Bool ep21 ; [L82] port_t p23 ; [L83] char p23_old ; [L84] char p23_new ; [L85] _Bool ep23 ; [L86] port_t p31 ; [L87] char p31_old ; [L88] char p31_new ; [L89] _Bool ep31 ; [L90] port_t p32 ; [L91] char p32_old ; [L92] char p32_new ; [L93] _Bool ep32 ; [L94] char id1 ; [L95] char r1 ; [L96] char st1 ; [L97] char nl1 ; [L98] char m1 ; [L99] char max1 ; [L100] _Bool mode1 ; [L101] _Bool newmax1 ; [L102] char id2 ; [L103] char r2 ; [L104] char st2 ; [L105] char nl2 ; [L106] char m2 ; [L107] char max2 ; [L108] _Bool mode2 ; [L109] _Bool newmax2 ; [L110] char id3 ; [L111] char r3 ; [L112] char st3 ; [L113] char nl3 ; [L114] char m3 ; [L115] char max3 ; [L116] _Bool mode3 ; [L117] _Bool newmax3 ; [L271] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L537] int c1 ; [L538] int i2 ; [L541] c1 = 0 [L542] ep12 = __VERIFIER_nondet_bool() [L543] ep13 = __VERIFIER_nondet_bool() [L544] ep21 = __VERIFIER_nondet_bool() [L545] ep23 = __VERIFIER_nondet_bool() [L546] ep31 = __VERIFIER_nondet_bool() [L547] ep32 = __VERIFIER_nondet_bool() [L548] id1 = __VERIFIER_nondet_char() [L549] r1 = __VERIFIER_nondet_char() [L550] st1 = __VERIFIER_nondet_char() [L551] nl1 = __VERIFIER_nondet_char() [L552] m1 = __VERIFIER_nondet_char() [L553] max1 = __VERIFIER_nondet_char() [L554] mode1 = __VERIFIER_nondet_bool() [L555] newmax1 = __VERIFIER_nondet_bool() [L556] id2 = __VERIFIER_nondet_char() [L557] r2 = __VERIFIER_nondet_char() [L558] st2 = __VERIFIER_nondet_char() [L559] nl2 = __VERIFIER_nondet_char() [L560] m2 = __VERIFIER_nondet_char() [L561] max2 = __VERIFIER_nondet_char() [L562] mode2 = __VERIFIER_nondet_bool() [L563] newmax2 = __VERIFIER_nondet_bool() [L564] id3 = __VERIFIER_nondet_char() [L565] r3 = __VERIFIER_nondet_char() [L566] st3 = __VERIFIER_nondet_char() [L567] nl3 = __VERIFIER_nondet_char() [L568] m3 = __VERIFIER_nondet_char() [L569] max3 = __VERIFIER_nondet_char() [L570] mode3 = __VERIFIER_nondet_bool() [L571] newmax3 = __VERIFIER_nondet_bool() [L274] _Bool r121 ; [L275] _Bool r131 ; [L276] _Bool r211 ; [L277] _Bool r231 ; [L278] _Bool r311 ; [L279] _Bool r321 ; [L280] _Bool r122 ; [L281] int tmp ; [L282] _Bool r132 ; [L283] int tmp___0 ; [L284] _Bool r212 ; [L285] int tmp___1 ; [L286] _Bool r232 ; [L287] int tmp___2 ; [L288] _Bool r312 ; [L289] int tmp___3 ; [L290] _Bool r322 ; [L291] int tmp___4 ; [L292] int tmp___5 ; [L295] r121 = ep12 [L296] r131 = ep13 [L297] r211 = ep21 [L298] r231 = ep23 [L299] r311 = ep31 [L300] r321 = ep32 [L301] COND FALSE !(\read(r121)) [L304] COND FALSE !(\read(r131)) [L311] tmp = 0 [L313] r122 = (_Bool )tmp [L314] COND FALSE !(\read(r131)) [L317] COND FALSE !(\read(r121)) [L324] tmp___0 = 0 [L326] r132 = (_Bool )tmp___0 [L327] COND FALSE !(\read(r211)) [L330] COND FALSE !(\read(r231)) [L337] tmp___1 = 0 [L339] r212 = (_Bool )tmp___1 [L340] COND FALSE !(\read(r231)) [L343] COND FALSE !(\read(r211)) [L350] tmp___2 = 0 [L352] r232 = (_Bool )tmp___2 [L353] COND FALSE !(\read(r311)) [L356] COND TRUE \read(r321) [L357] COND FALSE !(\read(ep21)) [L360] tmp___3 = 0 [L365] r312 = (_Bool )tmp___3 [L366] COND TRUE \read(r321) [L367] tmp___4 = 1 [L378] r322 = (_Bool )tmp___4 [L379] COND TRUE (int )id1 != (int )id2 [L380] COND TRUE (int )id1 != (int )id3 [L381] COND TRUE (int )id2 != (int )id3 [L382] COND TRUE (int )id1 >= 0 [L383] COND TRUE (int )id2 >= 0 [L384] COND TRUE (int )id3 >= 0 [L385] COND TRUE (int )r1 == 0 [L386] COND TRUE (int )r2 == 0 [L387] COND TRUE (int )r3 == 0 [L388] COND TRUE (int )max1 == (int )id1 [L389] COND TRUE (int )max2 == (int )id2 [L390] COND TRUE (int )max3 == (int )id3 [L391] COND TRUE (int )st1 == 0 [L392] COND TRUE (int )st2 == 0 [L393] COND TRUE (int )st3 == 0 [L394] COND TRUE (int )nl1 == 0 [L395] COND TRUE (int )nl2 == 0 [L396] COND TRUE (int )nl3 == 0 [L397] COND TRUE (int )mode1 == 0 [L398] COND TRUE (int )mode2 == 0 [L399] COND TRUE (int )mode3 == 0 [L400] COND TRUE \read(newmax1) [L401] COND TRUE \read(newmax2) [L402] COND TRUE \read(newmax3) [L403] tmp___5 = 1 [L476] return (tmp___5); [L572] i2 = init() [L574] p12_old = nomsg [L575] p12_new = nomsg [L576] p13_old = nomsg [L577] p13_new = nomsg [L578] p21_old = nomsg [L579] p21_new = nomsg [L580] p23_old = nomsg [L581] p23_new = nomsg [L582] p31_old = nomsg [L583] p31_new = nomsg [L584] p32_old = nomsg [L585] p32_new = nomsg [L586] i2 = 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=126, m1=1, m2=-128, m3=127, max1=0, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L587] COND TRUE i2 < 6 [L120] _Bool newmax ; [L123] newmax = (_Bool)0 [L124] COND FALSE !(\read(mode1)) [L152] COND TRUE (int )r1 < 2 [L153] COND FALSE !(\read(ep12)) [L158] COND FALSE !(\read(ep13)) [L164] mode1 = (_Bool)1 [L171] _Bool newmax ; [L174] newmax = (_Bool)0 [L175] COND FALSE !(\read(mode2)) [L203] COND TRUE (int )r2 < 2 [L204] COND FALSE !(\read(ep21)) [L209] COND FALSE !(\read(ep23)) [L215] mode2 = (_Bool)1 [L222] _Bool newmax ; [L225] newmax = (_Bool)0 [L226] COND FALSE !(\read(mode3)) [L254] COND TRUE (int )r3 < 2 [L255] COND FALSE !(\read(ep31)) [L260] COND TRUE \read(ep32) [L261] COND TRUE \read(newmax3) [L262] EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L262] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L266] mode3 = (_Bool)1 [L592] p12_old = p12_new [L593] p12_new = nomsg [L594] p13_old = p13_new [L595] p13_new = nomsg [L596] p21_old = p21_new [L597] p21_new = nomsg [L598] p23_old = p23_new [L599] p23_new = nomsg [L600] p31_old = p31_new [L601] p31_new = nomsg [L602] p32_old = p32_new [L603] p32_new = nomsg [L481] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=126, m1=1, m2=-128, m3=127, max1=0, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L484] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=126, m1=1, m2=-128, m3=127, max1=0, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L485] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=126, m1=1, m2=-128, m3=127, max1=0, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L486] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=126, m1=1, m2=-128, m3=127, max1=0, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L487] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=126, m1=1, m2=-128, m3=127, max1=0, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L488] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=126, m1=1, m2=-128, m3=127, max1=0, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L491] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=126, m1=1, m2=-128, m3=127, max1=0, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L493] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=126, m1=1, m2=-128, m3=127, max1=0, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L498] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=126, m1=1, m2=-128, m3=127, max1=0, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L501] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=126, m1=1, m2=-128, m3=127, max1=0, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L503] COND TRUE (int )r1 < 2 [L504] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=126, m1=1, m2=-128, m3=127, max1=0, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L532] return (tmp); [L604] c1 = check() [L617] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=126, m1=1, m2=-128, m3=127, max1=0, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L606] i2 ++ VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=126, m1=1, m2=-128, m3=127, max1=0, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=126, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L587] COND TRUE i2 < 6 [L120] _Bool newmax ; [L123] newmax = (_Bool)0 [L124] COND TRUE \read(mode1) [L125] r1 = (char )((int )r1 + 1) [L126] COND FALSE !(\read(ep21)) [L134] COND FALSE !(\read(ep31)) [L142] newmax1 = newmax [L143] COND FALSE !((int )r1 == 2) [L150] mode1 = (_Bool)0 [L171] _Bool newmax ; [L174] newmax = (_Bool)0 [L175] COND TRUE \read(mode2) [L176] r2 = (char )((int )r2 + 1) [L177] COND FALSE !(\read(ep12)) [L185] COND TRUE \read(ep32) [L186] m2 = p32_old [L187] p32_old = nomsg [L188] COND FALSE !((int )m2 > (int )max2) [L193] newmax2 = newmax [L194] COND FALSE !((int )r2 == 2) [L201] mode2 = (_Bool)0 [L222] _Bool newmax ; [L225] newmax = (_Bool)0 [L226] COND TRUE \read(mode3) [L227] r3 = (char )((int )r3 + 1) [L228] COND FALSE !(\read(ep13)) [L236] COND FALSE !(\read(ep23)) [L244] newmax3 = newmax [L245] COND FALSE !((int )r3 == 2) [L252] mode3 = (_Bool)0 [L592] p12_old = p12_new [L593] p12_new = nomsg [L594] p13_old = p13_new [L595] p13_new = nomsg [L596] p21_old = p21_new [L597] p21_new = nomsg [L598] p23_old = p23_new [L599] p23_new = nomsg [L600] p31_old = p31_new [L601] p31_new = nomsg [L602] p32_old = p32_new [L603] p32_new = nomsg [L481] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=126, m1=1, m2=126, m3=127, max1=0, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L484] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=126, m1=1, m2=126, m3=127, max1=0, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L485] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=126, m1=1, m2=126, m3=127, max1=0, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L486] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=126, m1=1, m2=126, m3=127, max1=0, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L487] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=126, m1=1, m2=126, m3=127, max1=0, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L488] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=126, m1=1, m2=126, m3=127, max1=0, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L491] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=126, m1=1, m2=126, m3=127, max1=0, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L493] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=126, m1=1, m2=126, m3=127, max1=0, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L498] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=126, m1=1, m2=126, m3=127, max1=0, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L501] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=126, m1=1, m2=126, m3=127, max1=0, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L503] COND TRUE (int )r1 < 2 [L504] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=126, m1=1, m2=126, m3=127, max1=0, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L532] return (tmp); [L604] c1 = check() [L617] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=126, m1=1, m2=126, m3=127, max1=0, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L606] i2 ++ VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=126, m1=1, m2=126, m3=127, max1=0, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L587] COND TRUE i2 < 6 [L120] _Bool newmax ; [L123] newmax = (_Bool)0 [L124] COND FALSE !(\read(mode1)) [L152] COND TRUE (int )r1 < 2 [L153] COND FALSE !(\read(ep12)) [L158] COND FALSE !(\read(ep13)) [L164] mode1 = (_Bool)1 [L171] _Bool newmax ; [L174] newmax = (_Bool)0 [L175] COND FALSE !(\read(mode2)) [L203] COND TRUE (int )r2 < 2 [L204] COND FALSE !(\read(ep21)) [L209] COND FALSE !(\read(ep23)) [L215] mode2 = (_Bool)1 [L222] _Bool newmax ; [L225] newmax = (_Bool)0 [L226] COND FALSE !(\read(mode3)) [L254] COND TRUE (int )r3 < 2 [L255] COND FALSE !(\read(ep31)) [L260] COND TRUE \read(ep32) [L261] COND FALSE !(\read(newmax3)) [L266] mode3 = (_Bool)1 [L592] p12_old = p12_new [L593] p12_new = nomsg [L594] p13_old = p13_new [L595] p13_new = nomsg [L596] p21_old = p21_new [L597] p21_new = nomsg [L598] p23_old = p23_new [L599] p23_new = nomsg [L600] p31_old = p31_new [L601] p31_new = nomsg [L602] p32_old = p32_new [L603] p32_new = nomsg [L481] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=126, m1=1, m2=126, m3=127, max1=0, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L484] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=126, m1=1, m2=126, m3=127, max1=0, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L485] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=126, m1=1, m2=126, m3=127, max1=0, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L486] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=126, m1=1, m2=126, m3=127, max1=0, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L487] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=126, m1=1, m2=126, m3=127, max1=0, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L488] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=126, m1=1, m2=126, m3=127, max1=0, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L491] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=126, m1=1, m2=126, m3=127, max1=0, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L493] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=126, m1=1, m2=126, m3=127, max1=0, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L498] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=126, m1=1, m2=126, m3=127, max1=0, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L501] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=126, m1=1, m2=126, m3=127, max1=0, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L503] COND TRUE (int )r1 < 2 [L504] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=126, m1=1, m2=126, m3=127, max1=0, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L532] return (tmp); [L604] c1 = check() [L617] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=126, m1=1, m2=126, m3=127, max1=0, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L606] i2 ++ VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=126, m1=1, m2=126, m3=127, max1=0, max2=127, max3=126, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L587] COND TRUE i2 < 6 [L120] _Bool newmax ; [L123] newmax = (_Bool)0 [L124] COND TRUE \read(mode1) [L125] r1 = (char )((int )r1 + 1) [L126] COND FALSE !(\read(ep21)) [L134] COND FALSE !(\read(ep31)) [L142] newmax1 = newmax [L143] COND TRUE (int )r1 == 2 [L144] COND TRUE (int )max1 == (int )id1 [L145] st1 = (char)1 [L150] mode1 = (_Bool)0 [L171] _Bool newmax ; [L174] newmax = (_Bool)0 [L175] COND TRUE \read(mode2) [L176] r2 = (char )((int )r2 + 1) [L177] COND FALSE !(\read(ep12)) [L185] COND TRUE \read(ep32) [L186] m2 = p32_old [L187] p32_old = nomsg [L188] COND FALSE !((int )m2 > (int )max2) [L193] newmax2 = newmax [L194] COND TRUE (int )r2 == 2 [L195] COND TRUE (int )max2 == (int )id2 [L196] st2 = (char)1 [L201] mode2 = (_Bool)0 [L222] _Bool newmax ; [L225] newmax = (_Bool)0 [L226] COND TRUE \read(mode3) [L227] r3 = (char )((int )r3 + 1) [L228] COND FALSE !(\read(ep13)) [L236] COND FALSE !(\read(ep23)) [L244] newmax3 = newmax [L245] COND TRUE (int )r3 == 2 [L246] COND TRUE (int )max3 == (int )id3 [L247] st3 = (char)1 [L252] mode3 = (_Bool)0 [L592] p12_old = p12_new [L593] p12_new = nomsg [L594] p13_old = p13_new [L595] p13_new = nomsg [L596] p21_old = p21_new [L597] p21_new = nomsg [L598] p23_old = p23_new [L599] p23_new = nomsg [L600] p31_old = p31_new [L601] p31_new = nomsg [L602] p32_old = p32_new [L603] p32_new = nomsg [L481] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=126, m1=1, m2=-1, m3=127, max1=0, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1] [L484] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L530] tmp = 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=126, m1=1, m2=-1, m3=127, max1=0, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1] [L532] return (tmp); [L604] c1 = check() [L617] COND TRUE ! arg VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=126, m1=1, m2=-1, m3=127, max1=0, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1] [L619] __VERIFIER_error() VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=0, id2=127, id3=126, m1=1, m2=-1, m3=127, max1=0, max2=127, max3=126, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 223.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.3 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -126.0 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.03 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.44 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1432.99 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 108.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -108.8 MB). Peak memory consumption was 338.2 MB. Max. memory is 11.5 GB. * CodeCheck took 136825.76 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 41.9 MB). Free memory was 1.2 GB in the beginning and 623.0 MB in the end (delta: 562.0 MB). Peak memory consumption was 603.9 MB. Max. memory is 11.5 GB. * Witness Printer took 119.78 ms. Allocated memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: -10.0 MB). Free memory was 623.0 MB in the beginning and 1.1 GB in the end (delta: -450.5 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...