./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f8365a69-2b9c-4df1-8b29-b46d26535536/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f8365a69-2b9c-4df1-8b29-b46d26535536/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f8365a69-2b9c-4df1-8b29-b46d26535536/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f8365a69-2b9c-4df1-8b29-b46d26535536/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f8365a69-2b9c-4df1-8b29-b46d26535536/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f8365a69-2b9c-4df1-8b29-b46d26535536/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash adc229f0a7bc8afe44d4e19612f0edd5de4d255f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 16:38:19,354 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 16:38:19,355 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 16:38:19,364 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 16:38:19,364 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 16:38:19,365 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 16:38:19,366 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 16:38:19,367 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 16:38:19,368 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 16:38:19,369 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 16:38:19,370 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 16:38:19,370 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 16:38:19,370 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 16:38:19,371 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 16:38:19,372 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 16:38:19,373 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 16:38:19,373 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 16:38:19,375 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 16:38:19,376 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 16:38:19,377 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 16:38:19,378 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 16:38:19,379 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 16:38:19,381 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 16:38:19,381 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 16:38:19,381 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 16:38:19,382 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 16:38:19,382 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 16:38:19,383 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 16:38:19,383 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 16:38:19,384 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 16:38:19,384 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 16:38:19,385 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 16:38:19,385 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 16:38:19,385 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 16:38:19,386 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 16:38:19,386 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 16:38:19,386 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f8365a69-2b9c-4df1-8b29-b46d26535536/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-01 16:38:19,397 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 16:38:19,397 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 16:38:19,398 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 16:38:19,398 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-01 16:38:19,399 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 16:38:19,399 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 16:38:19,399 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 16:38:19,399 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 16:38:19,399 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 16:38:19,399 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 16:38:19,399 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 16:38:19,400 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-01 16:38:19,400 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 16:38:19,400 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-01 16:38:19,400 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 16:38:19,400 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 16:38:19,400 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 16:38:19,400 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-01 16:38:19,400 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-01 16:38:19,401 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-01 16:38:19,401 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 16:38:19,401 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 16:38:19,401 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-01 16:38:19,401 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 16:38:19,401 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 16:38:19,401 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-01 16:38:19,401 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-01 16:38:19,402 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 16:38:19,402 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-01 16:38:19,402 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_f8365a69-2b9c-4df1-8b29-b46d26535536/bin-2019/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> adc229f0a7bc8afe44d4e19612f0edd5de4d255f [2018-12-01 16:38:19,422 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 16:38:19,429 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 16:38:19,431 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 16:38:19,431 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 16:38:19,432 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 16:38:19,432 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f8365a69-2b9c-4df1-8b29-b46d26535536/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.1.ufo.UNBOUNDED.pals.c [2018-12-01 16:38:19,465 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f8365a69-2b9c-4df1-8b29-b46d26535536/bin-2019/ukojak/data/ede4d2969/0752a66674284ba0b168111b9f22edf6/FLAG9c79d620d [2018-12-01 16:38:19,876 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 16:38:19,877 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f8365a69-2b9c-4df1-8b29-b46d26535536/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.1.ufo.UNBOUNDED.pals.c [2018-12-01 16:38:19,882 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f8365a69-2b9c-4df1-8b29-b46d26535536/bin-2019/ukojak/data/ede4d2969/0752a66674284ba0b168111b9f22edf6/FLAG9c79d620d [2018-12-01 16:38:19,890 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f8365a69-2b9c-4df1-8b29-b46d26535536/bin-2019/ukojak/data/ede4d2969/0752a66674284ba0b168111b9f22edf6 [2018-12-01 16:38:19,891 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 16:38:19,892 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 16:38:19,893 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 16:38:19,893 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 16:38:19,895 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 16:38:19,895 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 04:38:19" (1/1) ... [2018-12-01 16:38:19,897 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 01.12 04:38:19, skipping insertion in model container [2018-12-01 16:38:19,897 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 04:38:19" (1/1) ... [2018-12-01 16:38:19,901 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 16:38:19,918 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 16:38:20,036 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 16:38:20,042 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 16:38:20,104 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 16:38:20,113 INFO L195 MainTranslator]: Completed translation [2018-12-01 16:38:20,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:38:20 WrapperNode [2018-12-01 16:38:20,114 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 16:38:20,114 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 16:38:20,114 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 16:38:20,114 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 16:38:20,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:38:20" (1/1) ... [2018-12-01 16:38:20,126 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:38:20" (1/1) ... [2018-12-01 16:38:20,144 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 16:38:20,144 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 16:38:20,144 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 16:38:20,144 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 16:38:20,150 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:38:20" (1/1) ... [2018-12-01 16:38:20,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:38:20" (1/1) ... [2018-12-01 16:38:20,152 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:38:20" (1/1) ... [2018-12-01 16:38:20,152 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:38:20" (1/1) ... [2018-12-01 16:38:20,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:38:20" (1/1) ... [2018-12-01 16:38:20,161 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:38:20" (1/1) ... [2018-12-01 16:38:20,162 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:38:20" (1/1) ... [2018-12-01 16:38:20,164 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 16:38:20,164 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 16:38:20,164 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 16:38:20,164 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 16:38:20,165 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:38:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f8365a69-2b9c-4df1-8b29-b46d26535536/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-01 16:38:20,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 16:38:20,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 16:38:21,424 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 16:38:21,424 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-12-01 16:38:21,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 04:38:21 BoogieIcfgContainer [2018-12-01 16:38:21,424 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 16:38:21,425 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-01 16:38:21,425 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-01 16:38:21,431 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-01 16:38:21,431 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 04:38:21" (1/1) ... [2018-12-01 16:38:21,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 16:38:21,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:38:21,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 18 states and 29 transitions. [2018-12-01 16:38:21,461 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 29 transitions. [2018-12-01 16:38:21,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-01 16:38:21,463 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:38:21,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:38:21,739 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-01 16:38:21,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:38:21,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 19 states and 31 transitions. [2018-12-01 16:38:21,800 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 31 transitions. [2018-12-01 16:38:21,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-01 16:38:21,800 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:38:21,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:38:21,888 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-01 16:38:22,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:38:22,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 22 states and 37 transitions. [2018-12-01 16:38:22,048 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 37 transitions. [2018-12-01 16:38:22,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-01 16:38:22,050 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:38:22,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:38:22,192 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-01 16:38:22,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:38:22,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 26 states and 45 transitions. [2018-12-01 16:38:22,455 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 45 transitions. [2018-12-01 16:38:22,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-01 16:38:22,455 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:38:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:38:22,570 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-01 16:38:23,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:38:23,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 31 states and 55 transitions. [2018-12-01 16:38:23,018 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 55 transitions. [2018-12-01 16:38:23,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-01 16:38:23,018 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:38:23,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:38:23,159 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-01 16:38:23,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:38:23,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 38 states and 67 transitions. [2018-12-01 16:38:23,826 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 67 transitions. [2018-12-01 16:38:23,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-01 16:38:23,826 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:38:23,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:38:23,946 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-01 16:38:24,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:38:24,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 44 states and 78 transitions. [2018-12-01 16:38:24,814 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 78 transitions. [2018-12-01 16:38:24,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-01 16:38:24,815 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:38:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:38:24,835 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-01 16:38:24,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:38:24,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 45 states and 78 transitions. [2018-12-01 16:38:24,850 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 78 transitions. [2018-12-01 16:38:24,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-01 16:38:24,851 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:38:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:38:24,879 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-01 16:38:24,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:38:24,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 46 states and 79 transitions. [2018-12-01 16:38:24,888 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 79 transitions. [2018-12-01 16:38:24,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-01 16:38:24,889 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:38:24,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:38:25,044 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-01 16:38:26,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:38:26,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 56 states and 95 transitions. [2018-12-01 16:38:26,569 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 95 transitions. [2018-12-01 16:38:26,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-01 16:38:26,570 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:38:26,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:38:26,696 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-01 16:38:26,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:38:26,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 59 states and 107 transitions. [2018-12-01 16:38:26,858 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 107 transitions. [2018-12-01 16:38:26,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-01 16:38:26,858 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:38:26,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:38:27,473 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-01 16:38:32,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:38:32,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 74 states and 136 transitions. [2018-12-01 16:38:32,322 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 136 transitions. [2018-12-01 16:38:32,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-01 16:38:32,323 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:38:32,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:38:32,624 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-01 16:38:37,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:38:37,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 90 states and 167 transitions. [2018-12-01 16:38:37,773 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 167 transitions. [2018-12-01 16:38:37,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-01 16:38:37,774 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:38:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:38:37,834 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-01 16:38:38,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:38:38,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 91 states and 169 transitions. [2018-12-01 16:38:38,025 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 169 transitions. [2018-12-01 16:38:38,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-01 16:38:38,026 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:38:38,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:38:38,356 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-01 16:38:41,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:38:41,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 104 states and 193 transitions. [2018-12-01 16:38:41,621 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 193 transitions. [2018-12-01 16:38:41,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-01 16:38:41,622 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:38:41,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:38:41,777 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-01 16:38:41,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:38:41,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 105 states and 196 transitions. [2018-12-01 16:38:41,992 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 196 transitions. [2018-12-01 16:38:41,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-01 16:38:41,993 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:38:42,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:38:42,142 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-01 16:38:42,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:38:42,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 106 states and 197 transitions. [2018-12-01 16:38:42,344 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 197 transitions. [2018-12-01 16:38:42,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-01 16:38:42,344 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:38:42,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:38:43,185 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-01 16:38:46,452 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2018-12-01 16:38:47,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:38:47,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 119 states and 222 transitions. [2018-12-01 16:38:47,569 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 222 transitions. [2018-12-01 16:38:47,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-01 16:38:47,570 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:38:47,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:38:47,681 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-01 16:38:48,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:38:48,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 121 states and 227 transitions. [2018-12-01 16:38:48,151 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 227 transitions. [2018-12-01 16:38:48,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-01 16:38:48,152 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:38:48,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:38:48,220 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-01 16:38:48,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:38:48,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 122 states and 232 transitions. [2018-12-01 16:38:48,573 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 232 transitions. [2018-12-01 16:38:48,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-01 16:38:48,574 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:38:48,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:38:49,576 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-01 16:38:57,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:38:57,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 141 states and 266 transitions. [2018-12-01 16:38:57,803 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 266 transitions. [2018-12-01 16:38:57,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-01 16:38:57,804 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:38:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:38:58,870 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-01 16:39:01,545 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2018-12-01 16:39:02,253 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2018-12-01 16:39:03,729 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2018-12-01 16:39:04,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:39:04,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 143 states and 270 transitions. [2018-12-01 16:39:04,304 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 270 transitions. [2018-12-01 16:39:04,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-01 16:39:04,304 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:39:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:06,933 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:39:16,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:39:16,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 156 states and 315 transitions. [2018-12-01 16:39:16,277 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 315 transitions. [2018-12-01 16:39:16,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-01 16:39:16,277 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:39:16,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:17,137 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:39:24,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:39:24,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 168 states and 341 transitions. [2018-12-01 16:39:24,011 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 341 transitions. [2018-12-01 16:39:24,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-01 16:39:24,011 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:39:24,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:24,090 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:39:24,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:39:24,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 169 states and 344 transitions. [2018-12-01 16:39:24,481 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 344 transitions. [2018-12-01 16:39:24,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-01 16:39:24,481 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:39:24,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:25,407 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:39:31,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:39:31,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 172 states and 355 transitions. [2018-12-01 16:39:31,149 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 355 transitions. [2018-12-01 16:39:31,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-01 16:39:31,149 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:39:31,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:31,275 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:39:32,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:39:32,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 174 states and 363 transitions. [2018-12-01 16:39:32,055 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 363 transitions. [2018-12-01 16:39:32,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-01 16:39:32,055 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:39:32,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:32,994 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:39:39,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:39:39,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 178 states and 378 transitions. [2018-12-01 16:39:39,559 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 378 transitions. [2018-12-01 16:39:39,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-01 16:39:39,560 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:39:39,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:39,657 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:39:40,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:39:40,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 179 states and 382 transitions. [2018-12-01 16:39:40,141 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 382 transitions. [2018-12-01 16:39:40,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-01 16:39:40,141 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:39:40,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:40,236 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:39:40,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:39:40,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 180 states and 387 transitions. [2018-12-01 16:39:40,719 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 387 transitions. [2018-12-01 16:39:40,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-01 16:39:40,719 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:39:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:44,031 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:39:49,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:39:49,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 185 states and 406 transitions. [2018-12-01 16:39:49,532 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 406 transitions. [2018-12-01 16:39:49,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-01 16:39:49,533 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:39:49,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:50,000 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:39:52,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:39:52,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 187 states and 417 transitions. [2018-12-01 16:39:52,545 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 417 transitions. [2018-12-01 16:39:52,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-01 16:39:52,545 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:39:52,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:53,097 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:39:54,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:39:54,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 188 states and 420 transitions. [2018-12-01 16:39:54,463 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 420 transitions. [2018-12-01 16:39:54,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-01 16:39:54,464 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:39:54,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:39:55,222 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:40:01,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:40:01,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 200 states and 446 transitions. [2018-12-01 16:40:01,389 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 446 transitions. [2018-12-01 16:40:01,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-01 16:40:01,390 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:40:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:40:01,503 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:40:03,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:40:03,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 202 states and 461 transitions. [2018-12-01 16:40:03,812 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 461 transitions. [2018-12-01 16:40:03,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-01 16:40:03,812 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:40:03,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:40:03,912 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:40:05,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:40:05,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 205 states and 476 transitions. [2018-12-01 16:40:05,614 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 476 transitions. [2018-12-01 16:40:05,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-01 16:40:05,614 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:40:05,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:40:05,709 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:40:08,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:40:08,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 207 states and 491 transitions. [2018-12-01 16:40:08,033 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 491 transitions. [2018-12-01 16:40:08,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-01 16:40:08,034 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:40:08,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:40:11,627 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:40:20,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:40:20,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 210 states and 509 transitions. [2018-12-01 16:40:20,852 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 509 transitions. [2018-12-01 16:40:20,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-01 16:40:20,852 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:40:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:40:21,222 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:40:22,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:40:22,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 211 states and 512 transitions. [2018-12-01 16:40:22,220 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 512 transitions. [2018-12-01 16:40:22,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-01 16:40:22,221 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:40:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:40:22,625 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:40:25,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:40:25,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 213 states and 523 transitions. [2018-12-01 16:40:25,372 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 523 transitions. [2018-12-01 16:40:25,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-01 16:40:25,372 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:40:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 16:40:25,893 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 16:40:27,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-01 16:40:27,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 216 states and 534 transitions. [2018-12-01 16:40:27,508 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 534 transitions. [2018-12-01 16:40:27,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-01 16:40:27,508 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-01 16:40:27,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:40:28,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:40:28,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:40:28,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 16:40:28,419 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 41 iterations. [2018-12-01 16:40:28,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 01.12 04:40:28 ImpRootNode [2018-12-01 16:40:28,506 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-01 16:40:28,507 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 16:40:28,507 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 16:40:28,507 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 16:40:28,507 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 04:38:21" (3/4) ... [2018-12-01 16:40:28,509 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-01 16:40:28,619 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f8365a69-2b9c-4df1-8b29-b46d26535536/bin-2019/ukojak/witness.graphml [2018-12-01 16:40:28,619 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 16:40:28,620 INFO L168 Benchmark]: Toolchain (without parser) took 128728.02 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 404.8 MB). Free memory was 961.4 MB in the beginning and 1.1 GB in the end (delta: -133.7 MB). Peak memory consumption was 271.1 MB. Max. memory is 11.5 GB. [2018-12-01 16:40:28,620 INFO L168 Benchmark]: CDTParser took 0.10 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-01 16:40:28,621 INFO L168 Benchmark]: CACSL2BoogieTranslator took 221.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 173.5 MB). Free memory was 956.0 MB in the beginning and 1.2 GB in the end (delta: -210.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2018-12-01 16:40:28,621 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2018-12-01 16:40:28,621 INFO L168 Benchmark]: Boogie Preprocessor took 19.86 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 16:40:28,621 INFO L168 Benchmark]: RCFGBuilder took 1259.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 866.2 MB in the end (delta: 293.5 MB). Peak memory consumption was 293.5 MB. Max. memory is 11.5 GB. [2018-12-01 16:40:28,622 INFO L168 Benchmark]: CodeCheck took 127081.99 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 231.2 MB). Free memory was 866.2 MB in the beginning and 1.1 GB in the end (delta: -249.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 16:40:28,622 INFO L168 Benchmark]: Witness Printer took 112.38 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2018-12-01 16:40:28,623 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, 128 locations, 1 error locations. UNSAFE Result, 126.9s OverallTime, 41 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 0 SDtfs, -89368948 SDslu, 0 SDs, 0 SdLazy, 1216784788 SolverSat, -348910700 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 63.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11469 GetRequests, 10056 SyntacticMatches, 595 SemanticMatches, 818 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421844 ImplicationChecksByTransitivity, 117.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 19.3s InterpolantComputationTime, 1087 NumberOfCodeBlocks, 1087 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1002 ConstructedInterpolants, 0 QuantifiedInterpolants, 573986 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 10 PerfectInterpolantSequences, 124/637 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 586]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L70] msg_t nomsg = (msg_t )-1; [L71] port_t p12 ; [L72] char p12_old ; [L73] char p12_new ; [L74] _Bool ep12 ; [L75] port_t p13 ; [L76] char p13_old ; [L77] char p13_new ; [L78] _Bool ep13 ; [L79] port_t p21 ; [L80] char p21_old ; [L81] char p21_new ; [L82] _Bool ep21 ; [L83] port_t p23 ; [L84] char p23_old ; [L85] char p23_new ; [L86] _Bool ep23 ; [L87] port_t p31 ; [L88] char p31_old ; [L89] char p31_new ; [L90] _Bool ep31 ; [L91] port_t p32 ; [L92] char p32_old ; [L93] char p32_new ; [L94] _Bool ep32 ; [L95] char id1 ; [L96] unsigned char r1 ; [L97] char st1 ; [L98] char nl1 ; [L99] char m1 ; [L100] char max1 ; [L101] _Bool mode1 ; [L102] char id2 ; [L103] unsigned char r2 ; [L104] char st2 ; [L105] char nl2 ; [L106] char m2 ; [L107] char max2 ; [L108] _Bool mode2 ; [L109] char id3 ; [L110] unsigned char r3 ; [L111] char st3 ; [L112] char nl3 ; [L113] char m3 ; [L114] char max3 ; [L115] _Bool mode3 ; [L254] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L508] int c1 ; [L509] int i2 ; [L512] c1 = 0 [L513] ep12 = __VERIFIER_nondet_bool() [L514] ep13 = __VERIFIER_nondet_bool() [L515] ep21 = __VERIFIER_nondet_bool() [L516] ep23 = __VERIFIER_nondet_bool() [L517] ep31 = __VERIFIER_nondet_bool() [L518] ep32 = __VERIFIER_nondet_bool() [L519] id1 = __VERIFIER_nondet_char() [L520] r1 = __VERIFIER_nondet_uchar() [L521] st1 = __VERIFIER_nondet_char() [L522] nl1 = __VERIFIER_nondet_char() [L523] m1 = __VERIFIER_nondet_char() [L524] max1 = __VERIFIER_nondet_char() [L525] mode1 = __VERIFIER_nondet_bool() [L526] id2 = __VERIFIER_nondet_char() [L527] r2 = __VERIFIER_nondet_uchar() [L528] st2 = __VERIFIER_nondet_char() [L529] nl2 = __VERIFIER_nondet_char() [L530] m2 = __VERIFIER_nondet_char() [L531] max2 = __VERIFIER_nondet_char() [L532] mode2 = __VERIFIER_nondet_bool() [L533] id3 = __VERIFIER_nondet_char() [L534] r3 = __VERIFIER_nondet_uchar() [L535] st3 = __VERIFIER_nondet_char() [L536] nl3 = __VERIFIER_nondet_char() [L537] m3 = __VERIFIER_nondet_char() [L538] max3 = __VERIFIER_nondet_char() [L539] mode3 = __VERIFIER_nondet_bool() [L257] _Bool r121 ; [L258] _Bool r131 ; [L259] _Bool r211 ; [L260] _Bool r231 ; [L261] _Bool r311 ; [L262] _Bool r321 ; [L263] _Bool r122 ; [L264] int tmp ; [L265] _Bool r132 ; [L266] int tmp___0 ; [L267] _Bool r212 ; [L268] int tmp___1 ; [L269] _Bool r232 ; [L270] int tmp___2 ; [L271] _Bool r312 ; [L272] int tmp___3 ; [L273] _Bool r322 ; [L274] int tmp___4 ; [L275] int tmp___5 ; [L278] r121 = ep12 [L279] r131 = ep13 [L280] r211 = ep21 [L281] r231 = ep23 [L282] r311 = ep31 [L283] r321 = ep32 [L284] COND FALSE !(\read(r121)) [L287] COND FALSE !(\read(r131)) [L294] tmp = 0 [L296] r122 = (_Bool )tmp [L297] COND FALSE !(\read(r131)) [L300] COND FALSE !(\read(r121)) [L307] tmp___0 = 0 [L309] r132 = (_Bool )tmp___0 [L310] COND TRUE \read(r211) [L311] tmp___1 = 1 [L322] r212 = (_Bool )tmp___1 [L323] COND FALSE !(\read(r231)) [L326] COND TRUE \read(r211) [L327] COND FALSE !(\read(ep13)) [L330] tmp___2 = 0 [L335] r232 = (_Bool )tmp___2 [L336] COND TRUE \read(r311) [L337] tmp___3 = 1 [L348] r312 = (_Bool )tmp___3 [L349] COND FALSE !(\read(r321)) [L352] COND TRUE \read(r311) [L353] COND FALSE !(\read(ep12)) [L356] tmp___4 = 0 [L361] r322 = (_Bool )tmp___4 [L362] COND TRUE (int )id1 != (int )id2 [L363] COND TRUE (int )id1 != (int )id3 [L364] COND TRUE (int )id2 != (int )id3 [L365] COND TRUE (int )id1 >= 0 [L366] COND TRUE (int )id2 >= 0 [L367] COND TRUE (int )id3 >= 0 [L368] COND TRUE (int )r1 == 0 [L369] COND TRUE (int )r2 == 0 [L370] COND TRUE (int )r3 == 0 [L371] COND TRUE (int )max1 == (int )id1 [L372] COND TRUE (int )max2 == (int )id2 [L373] COND TRUE (int )max3 == (int )id3 [L374] COND TRUE (int )st1 == 0 [L375] COND TRUE (int )st2 == 0 [L376] COND TRUE (int )st3 == 0 [L377] COND TRUE (int )nl1 == 0 [L378] COND TRUE (int )nl2 == 0 [L379] COND TRUE (int )nl3 == 0 [L380] COND TRUE (int )mode1 == 0 [L381] COND TRUE (int )mode2 == 0 [L382] COND TRUE (int )mode3 == 0 [L383] tmp___5 = 1 [L447] return (tmp___5); [L540] i2 = init() [L542] p12_old = nomsg [L543] p12_new = nomsg [L544] p13_old = nomsg [L545] p13_new = nomsg [L546] p21_old = nomsg [L547] p21_new = nomsg [L548] p23_old = nomsg [L549] p23_new = nomsg [L550] p31_old = nomsg [L551] p31_new = nomsg [L552] p32_old = nomsg [L553] p32_new = nomsg [L554] i2 = 0 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=2, m3=3, max1=0, max2=1, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L555] COND TRUE 1 [L121] COND FALSE !(\read(mode1)) [L149] COND TRUE (int )r1 < 2 [L150] COND FALSE !(\read(ep12)) [L153] COND FALSE !(\read(ep13)) [L157] mode1 = (_Bool)1 [L167] COND FALSE !(\read(mode2)) [L195] COND TRUE (int )r2 < 2 [L196] COND TRUE \read(ep21) [L197] EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L197] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L199] COND FALSE !(\read(ep23)) [L203] mode2 = (_Bool)1 [L213] COND FALSE !(\read(mode3)) [L241] COND TRUE (int )r3 < 2 [L242] COND TRUE \read(ep31) [L243] EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L243] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L245] COND FALSE !(\read(ep32)) [L249] mode3 = (_Bool)1 [L560] p12_old = p12_new [L561] p12_new = nomsg [L562] p13_old = p13_new [L563] p13_new = nomsg [L564] p21_old = p21_new [L565] p21_new = nomsg [L566] p23_old = p23_new [L567] p23_new = nomsg [L568] p31_old = p31_new [L569] p31_new = nomsg [L570] p32_old = p32_new [L571] p32_new = nomsg [L452] int tmp ; VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=2, m3=3, max1=0, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L455] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=2, m3=3, max1=0, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L456] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=2, m3=3, max1=0, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L457] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=2, m3=3, max1=0, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L458] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=2, m3=3, max1=0, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L459] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=2, m3=3, max1=0, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L462] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=2, m3=3, max1=0, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L464] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=2, m3=3, max1=0, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=2, m3=3, max1=0, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L472] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=2, m3=3, max1=0, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L474] COND TRUE (int )r1 < 2 [L475] tmp = 1 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=2, m3=3, max1=0, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L503] return (tmp); [L572] c1 = check() [L584] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=2, m3=3, max1=0, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L555] COND TRUE 1 [L121] COND TRUE \read(mode1) [L122] COND FALSE !(r1 == 255) [L125] r1 = r1 + 1 [L126] COND TRUE \read(ep21) [L127] m1 = p21_old [L128] p21_old = nomsg [L129] COND TRUE (int )m1 > (int )max1 [L130] max1 = m1 [L133] COND TRUE \read(ep31) [L134] m1 = p31_old [L135] p31_old = nomsg [L136] COND TRUE (int )m1 > (int )max1 [L137] max1 = m1 [L140] COND FALSE !((int )r1 == 2) [L147] mode1 = (_Bool)0 [L167] COND TRUE \read(mode2) [L168] COND FALSE !(r2 == 255) [L171] r2 = r2 + 1 [L172] COND FALSE !(\read(ep12)) [L179] COND FALSE !(\read(ep32)) [L186] COND FALSE !((int )r2 == 2) [L193] mode2 = (_Bool)0 [L213] COND TRUE \read(mode3) [L214] COND FALSE !(r3 == 255) [L217] r3 = r3 + 1 [L218] COND FALSE !(\read(ep13)) [L225] COND FALSE !(\read(ep23)) [L232] COND FALSE !((int )r3 == 2) [L239] mode3 = (_Bool)0 [L560] p12_old = p12_new [L561] p12_new = nomsg [L562] p13_old = p13_new [L563] p13_new = nomsg [L564] p21_old = p21_new [L565] p21_new = nomsg [L566] p23_old = p23_new [L567] p23_new = nomsg [L568] p31_old = p31_new [L569] p31_new = nomsg [L570] p32_old = p32_new [L571] p32_new = nomsg [L452] int tmp ; VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=2, m3=3, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L455] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=2, m3=3, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L456] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=2, m3=3, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L457] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=2, m3=3, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L458] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=2, m3=3, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L459] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=2, m3=3, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L462] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=2, m3=3, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L464] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=2, m3=3, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=2, m3=3, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L472] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=2, m3=3, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L474] COND TRUE (int )r1 < 2 [L475] tmp = 1 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=2, m3=3, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L503] return (tmp); [L572] c1 = check() [L584] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=2, m3=3, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L555] COND TRUE 1 [L121] COND FALSE !(\read(mode1)) [L149] COND TRUE (int )r1 < 2 [L150] COND FALSE !(\read(ep12)) [L153] COND FALSE !(\read(ep13)) [L157] mode1 = (_Bool)1 [L167] COND FALSE !(\read(mode2)) [L195] COND TRUE (int )r2 < 2 [L196] COND TRUE \read(ep21) [L197] EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L197] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L199] COND FALSE !(\read(ep23)) [L203] mode2 = (_Bool)1 [L213] COND FALSE !(\read(mode3)) [L241] COND TRUE (int )r3 < 2 [L242] COND TRUE \read(ep31) [L243] EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L243] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L245] COND FALSE !(\read(ep32)) [L249] mode3 = (_Bool)1 [L560] p12_old = p12_new [L561] p12_new = nomsg [L562] p13_old = p13_new [L563] p13_new = nomsg [L564] p21_old = p21_new [L565] p21_new = nomsg [L566] p23_old = p23_new [L567] p23_new = nomsg [L568] p31_old = p31_new [L569] p31_new = nomsg [L570] p32_old = p32_new [L571] p32_new = nomsg [L452] int tmp ; VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=2, m3=3, max1=2, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L455] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=2, m3=3, max1=2, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L456] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=2, m3=3, max1=2, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L457] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=2, m3=3, max1=2, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L458] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=2, m3=3, max1=2, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L459] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=2, m3=3, max1=2, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L462] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=2, m3=3, max1=2, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L464] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=2, m3=3, max1=2, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=2, m3=3, max1=2, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L472] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=2, m3=3, max1=2, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L474] COND TRUE (int )r1 < 2 [L475] tmp = 1 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=2, m3=3, max1=2, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L503] return (tmp); [L572] c1 = check() [L584] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=2, m3=3, max1=2, max2=1, max3=2, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L555] COND TRUE 1 [L121] COND TRUE \read(mode1) [L122] COND FALSE !(r1 == 255) [L125] r1 = r1 + 1 [L126] COND TRUE \read(ep21) [L127] m1 = p21_old [L128] p21_old = nomsg [L129] COND FALSE !((int )m1 > (int )max1) [L133] COND TRUE \read(ep31) [L134] m1 = p31_old [L135] p31_old = nomsg [L136] COND FALSE !((int )m1 > (int )max1) [L140] COND TRUE (int )r1 == 2 [L141] COND FALSE !((int )max1 == (int )id1) [L144] nl1 = (char)1 [L147] mode1 = (_Bool)0 [L167] COND TRUE \read(mode2) [L168] COND FALSE !(r2 == 255) [L171] r2 = r2 + 1 [L172] COND FALSE !(\read(ep12)) [L179] COND FALSE !(\read(ep32)) [L186] COND TRUE (int )r2 == 2 [L187] COND TRUE (int )max2 == (int )id2 [L188] st2 = (char)1 [L193] mode2 = (_Bool)0 [L213] COND TRUE \read(mode3) [L214] COND FALSE !(r3 == 255) [L217] r3 = r3 + 1 [L218] COND FALSE !(\read(ep13)) [L225] COND FALSE !(\read(ep23)) [L232] COND TRUE (int )r3 == 2 [L233] COND TRUE (int )max3 == (int )id3 [L234] st3 = (char)1 [L239] mode3 = (_Bool)0 [L560] p12_old = p12_new [L561] p12_new = nomsg [L562] p13_old = p13_new [L563] p13_new = nomsg [L564] p21_old = p21_new [L565] p21_new = nomsg [L566] p23_old = p23_new [L567] p23_new = nomsg [L568] p31_old = p31_new [L569] p31_new = nomsg [L570] p32_old = p32_new [L571] p32_new = nomsg [L452] int tmp ; VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=2, m3=3, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L455] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L501] tmp = 0 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=2, m3=3, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L503] return (tmp); [L572] c1 = check() [L584] COND TRUE ! arg VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=2, m3=3, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] [L586] __VERIFIER_error() VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=1, ep32=0, id1=0, id2=1, id3=2, m1=2, m2=2, m3=3, max1=2, max2=1, max3=2, mode1=0, mode2=0, mode3=0, nl1=1, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=0, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 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 221.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 173.5 MB). Free memory was 956.0 MB in the beginning and 1.2 GB in the end (delta: -210.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.86 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1259.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 866.2 MB in the end (delta: 293.5 MB). Peak memory consumption was 293.5 MB. Max. memory is 11.5 GB. * CodeCheck took 127081.99 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 231.2 MB). Free memory was 866.2 MB in the beginning and 1.1 GB in the end (delta: -249.0 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 112.38 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...