./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_133b04ef-949c-4c48-b5f8-8c1575c62600/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_133b04ef-949c-4c48-b5f8-8c1575c62600/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_133b04ef-949c-4c48-b5f8-8c1575c62600/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_133b04ef-949c-4c48-b5f8-8c1575c62600/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_133b04ef-949c-4c48-b5f8-8c1575c62600/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_133b04ef-949c-4c48-b5f8-8c1575c62600/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3381374679dc4a7458d725215e8a6e295cc6e6a1 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 07:51:33,619 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:51:33,620 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:51:33,629 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:51:33,630 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:51:33,630 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:51:33,631 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:51:33,632 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:51:33,633 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:51:33,634 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:51:33,634 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:51:33,635 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:51:33,635 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:51:33,636 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:51:33,637 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:51:33,637 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:51:33,639 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:51:33,640 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:51:33,641 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:51:33,642 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:51:33,643 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:51:33,644 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:51:33,645 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:51:33,646 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:51:33,646 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:51:33,647 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:51:33,647 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:51:33,648 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:51:33,649 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:51:33,649 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:51:33,650 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:51:33,651 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:51:33,651 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:51:33,651 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:51:33,652 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:51:33,652 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:51:33,652 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_133b04ef-949c-4c48-b5f8-8c1575c62600/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-10 07:51:33,663 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:51:33,663 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:51:33,663 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 07:51:33,664 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 07:51:33,664 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 07:51:33,664 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 07:51:33,664 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:51:33,664 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 07:51:33,665 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:51:33,665 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 07:51:33,665 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:51:33,665 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 07:51:33,665 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 07:51:33,665 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 07:51:33,667 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 07:51:33,667 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:51:33,667 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 07:51:33,667 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-10 07:51:33,667 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-10 07:51:33,667 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:51:33,667 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 07:51:33,668 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 07:51:33,668 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:51:33,668 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 07:51:33,668 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 07:51:33,668 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-10 07:51:33,668 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 07:51:33,668 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 07:51:33,669 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_133b04ef-949c-4c48-b5f8-8c1575c62600/bin-2019/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3381374679dc4a7458d725215e8a6e295cc6e6a1 [2018-11-10 07:51:33,693 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:51:33,703 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:51:33,705 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:51:33,706 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:51:33,706 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:51:33,706 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_133b04ef-949c-4c48-b5f8-8c1575c62600/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c [2018-11-10 07:51:33,741 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_133b04ef-949c-4c48-b5f8-8c1575c62600/bin-2019/ukojak/data/38cae63ad/0331e4275c6e4fff917c8223e1001c42/FLAG373ef173f [2018-11-10 07:51:34,156 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:51:34,157 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_133b04ef-949c-4c48-b5f8-8c1575c62600/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c [2018-11-10 07:51:34,165 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_133b04ef-949c-4c48-b5f8-8c1575c62600/bin-2019/ukojak/data/38cae63ad/0331e4275c6e4fff917c8223e1001c42/FLAG373ef173f [2018-11-10 07:51:34,175 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_133b04ef-949c-4c48-b5f8-8c1575c62600/bin-2019/ukojak/data/38cae63ad/0331e4275c6e4fff917c8223e1001c42 [2018-11-10 07:51:34,177 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:51:34,178 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 07:51:34,179 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:51:34,179 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:51:34,181 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:51:34,182 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:51:34" (1/1) ... [2018-11-10 07:51:34,183 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11bcb58d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:34, skipping insertion in model container [2018-11-10 07:51:34,183 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:51:34" (1/1) ... [2018-11-10 07:51:34,189 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:51:34,215 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:51:34,364 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:51:34,370 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:51:34,401 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:51:34,413 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:51:34,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:34 WrapperNode [2018-11-10 07:51:34,413 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:51:34,414 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 07:51:34,414 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 07:51:34,414 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 07:51:34,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:34" (1/1) ... [2018-11-10 07:51:34,429 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:34" (1/1) ... [2018-11-10 07:51:34,492 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 07:51:34,493 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:51:34,493 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:51:34,493 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:51:34,501 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:34" (1/1) ... [2018-11-10 07:51:34,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:34" (1/1) ... [2018-11-10 07:51:34,503 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:34" (1/1) ... [2018-11-10 07:51:34,503 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:34" (1/1) ... [2018-11-10 07:51:34,508 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:34" (1/1) ... [2018-11-10 07:51:34,515 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:34" (1/1) ... [2018-11-10 07:51:34,518 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:34" (1/1) ... [2018-11-10 07:51:34,520 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:51:34,521 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:51:34,521 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:51:34,521 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:51:34,522 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:51:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_133b04ef-949c-4c48-b5f8-8c1575c62600/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 07:51:34,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:51:34,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:51:35,957 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:51:35,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:51:35 BoogieIcfgContainer [2018-11-10 07:51:35,958 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:51:35,958 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-10 07:51:35,958 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-10 07:51:35,965 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-10 07:51:35,965 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:51:35" (1/1) ... [2018-11-10 07:51:35,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:51:35,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:35,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 21 states and 33 transitions. [2018-11-10 07:51:35,997 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 33 transitions. [2018-11-10 07:51:36,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-10 07:51:36,001 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:36,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:36,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:36,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:36,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 24 states and 37 transitions. [2018-11-10 07:51:36,428 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions. [2018-11-10 07:51:36,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-10 07:51:36,429 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:36,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:36,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:36,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 28 states and 45 transitions. [2018-11-10 07:51:36,753 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 45 transitions. [2018-11-10 07:51:36,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-10 07:51:36,753 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:36,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:36,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:37,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:37,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 33 states and 55 transitions. [2018-11-10 07:51:37,105 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 55 transitions. [2018-11-10 07:51:37,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-10 07:51:37,108 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:37,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:37,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:37,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:37,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 39 states and 67 transitions. [2018-11-10 07:51:37,576 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 67 transitions. [2018-11-10 07:51:37,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-10 07:51:37,576 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:37,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:37,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:38,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:38,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 47 states and 81 transitions. [2018-11-10 07:51:38,273 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 81 transitions. [2018-11-10 07:51:38,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 07:51:38,273 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:38,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:38,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:39,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:39,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 54 states and 94 transitions. [2018-11-10 07:51:39,255 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 94 transitions. [2018-11-10 07:51:39,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 07:51:39,256 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:39,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:39,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:39,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:39,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 55 states and 94 transitions. [2018-11-10 07:51:39,447 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 94 transitions. [2018-11-10 07:51:39,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 07:51:39,448 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:39,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:39,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:39,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 56 states and 95 transitions. [2018-11-10 07:51:39,477 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 95 transitions. [2018-11-10 07:51:39,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 07:51:39,478 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:39,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:39,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:40,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:40,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 67 states and 113 transitions. [2018-11-10 07:51:40,702 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 113 transitions. [2018-11-10 07:51:40,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 07:51:40,702 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:40,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:41,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:41,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 70 states and 118 transitions. [2018-11-10 07:51:41,016 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 118 transitions. [2018-11-10 07:51:41,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 07:51:41,017 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:41,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:41,589 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:44,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:44,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 88 states and 149 transitions. [2018-11-10 07:51:44,145 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 149 transitions. [2018-11-10 07:51:44,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 07:51:44,145 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:44,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:44,550 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:46,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:46,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 103 states and 172 transitions. [2018-11-10 07:51:46,654 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 172 transitions. [2018-11-10 07:51:46,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 07:51:46,655 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:46,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:46,766 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:47,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:47,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 104 states and 174 transitions. [2018-11-10 07:51:47,000 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 174 transitions. [2018-11-10 07:51:47,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 07:51:47,001 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:47,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:47,334 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:50,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:50,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 124 states and 209 transitions. [2018-11-10 07:51:50,116 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 209 transitions. [2018-11-10 07:51:50,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 07:51:50,117 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:50,215 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:50,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:50,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 126 states and 213 transitions. [2018-11-10 07:51:50,690 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 213 transitions. [2018-11-10 07:51:50,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 07:51:50,691 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:50,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:51,064 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:53,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:53,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 134 states and 230 transitions. [2018-11-10 07:51:53,603 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 230 transitions. [2018-11-10 07:51:53,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 07:51:53,603 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:53,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:53,701 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:54,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:54,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 137 states and 237 transitions. [2018-11-10 07:51:54,474 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 237 transitions. [2018-11-10 07:51:54,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 07:51:54,475 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:55,194 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:58,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:58,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 146 states and 256 transitions. [2018-11-10 07:51:58,643 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 256 transitions. [2018-11-10 07:51:58,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 07:51:58,643 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:58,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:58,801 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:51:59,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:51:59,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 149 states and 264 transitions. [2018-11-10 07:51:59,718 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 264 transitions. [2018-11-10 07:51:59,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 07:51:59,719 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:51:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:51:59,871 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:00,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:52:00,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 150 states and 265 transitions. [2018-11-10 07:52:00,168 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 265 transitions. [2018-11-10 07:52:00,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 07:52:00,168 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:52:00,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:00,551 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:01,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:52:01,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 155 states and 274 transitions. [2018-11-10 07:52:01,557 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 274 transitions. [2018-11-10 07:52:01,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 07:52:01,557 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:52:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:01,763 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:02,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:52:02,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 159 states and 281 transitions. [2018-11-10 07:52:02,760 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 281 transitions. [2018-11-10 07:52:02,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 07:52:02,760 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:52:02,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:02,971 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:03,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:52:03,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 162 states and 286 transitions. [2018-11-10 07:52:03,796 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 286 transitions. [2018-11-10 07:52:03,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 07:52:03,796 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:52:03,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:04,612 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:07,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:52:07,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 169 states and 303 transitions. [2018-11-10 07:52:07,362 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 303 transitions. [2018-11-10 07:52:07,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 07:52:07,362 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:52:07,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:07,536 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:08,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:52:08,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 171 states and 306 transitions. [2018-11-10 07:52:08,161 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 306 transitions. [2018-11-10 07:52:08,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 07:52:08,161 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:52:08,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:08,397 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:08,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:52:08,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 172 states and 307 transitions. [2018-11-10 07:52:08,815 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 307 transitions. [2018-11-10 07:52:08,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 07:52:08,815 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:52:08,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:08,956 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:09,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:52:09,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 175 states and 313 transitions. [2018-11-10 07:52:09,791 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 313 transitions. [2018-11-10 07:52:09,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 07:52:09,792 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:52:09,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:09,975 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:10,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:52:10,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 178 states and 319 transitions. [2018-11-10 07:52:10,642 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 319 transitions. [2018-11-10 07:52:10,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 07:52:10,642 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:52:10,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:11,543 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:16,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:52:16,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 193 states and 374 transitions. [2018-11-10 07:52:16,207 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 374 transitions. [2018-11-10 07:52:16,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 07:52:16,208 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:52:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:16,595 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:17,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:52:17,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 197 states and 382 transitions. [2018-11-10 07:52:17,981 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 382 transitions. [2018-11-10 07:52:17,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 07:52:17,982 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:52:18,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:18,224 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:18,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:52:18,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 198 states and 383 transitions. [2018-11-10 07:52:18,622 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 383 transitions. [2018-11-10 07:52:18,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 07:52:18,623 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:52:18,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:18,905 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:20,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:52:20,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 202 states and 390 transitions. [2018-11-10 07:52:20,183 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 390 transitions. [2018-11-10 07:52:20,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 07:52:20,183 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:52:20,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:20,984 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:25,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:52:25,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 213 states and 409 transitions. [2018-11-10 07:52:25,083 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 409 transitions. [2018-11-10 07:52:25,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 07:52:25,084 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:52:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:25,282 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:26,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:52:26,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 216 states and 412 transitions. [2018-11-10 07:52:26,153 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 412 transitions. [2018-11-10 07:52:26,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 07:52:26,154 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:52:26,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:26,446 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:27,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:52:27,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 217 states and 413 transitions. [2018-11-10 07:52:27,190 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 413 transitions. [2018-11-10 07:52:27,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 07:52:27,191 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:52:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:27,388 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:27,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:52:27,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 215 states and 410 transitions. [2018-11-10 07:52:27,809 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 410 transitions. [2018-11-10 07:52:27,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 07:52:27,810 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:52:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:28,003 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:28,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:52:28,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 216 states and 411 transitions. [2018-11-10 07:52:28,403 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 411 transitions. [2018-11-10 07:52:28,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 07:52:28,403 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:52:28,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:29,331 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:33,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:52:33,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 227 states and 435 transitions. [2018-11-10 07:52:33,493 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 435 transitions. [2018-11-10 07:52:33,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 07:52:33,493 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:52:33,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:33,740 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:35,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:52:35,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 230 states and 443 transitions. [2018-11-10 07:52:35,435 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 443 transitions. [2018-11-10 07:52:35,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 07:52:35,436 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:52:35,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:35,630 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:36,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:52:36,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 226 states and 438 transitions. [2018-11-10 07:52:36,569 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 438 transitions. [2018-11-10 07:52:36,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 07:52:36,569 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:52:36,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:37,604 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:43,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:52:43,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 241 states and 474 transitions. [2018-11-10 07:52:43,033 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 474 transitions. [2018-11-10 07:52:43,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 07:52:43,033 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:52:43,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:43,247 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:43,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:52:43,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 243 states and 481 transitions. [2018-11-10 07:52:43,724 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 481 transitions. [2018-11-10 07:52:43,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 07:52:43,724 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:52:43,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:43,931 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:46,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:52:46,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 250 states and 499 transitions. [2018-11-10 07:52:46,183 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 499 transitions. [2018-11-10 07:52:46,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 07:52:46,183 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:52:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:46,438 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:46,616 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-10 07:52:48,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:52:48,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 255 states and 506 transitions. [2018-11-10 07:52:48,374 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 506 transitions. [2018-11-10 07:52:48,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 07:52:48,375 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:52:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:48,673 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:49,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:52:49,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 256 states and 507 transitions. [2018-11-10 07:52:49,162 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 507 transitions. [2018-11-10 07:52:49,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 07:52:49,163 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:52:49,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:50,264 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:53,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:52:53,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 261 states and 521 transitions. [2018-11-10 07:52:53,817 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 521 transitions. [2018-11-10 07:52:53,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 07:52:53,817 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:52:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:54,101 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:55,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:52:55,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 265 states and 534 transitions. [2018-11-10 07:52:55,288 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 534 transitions. [2018-11-10 07:52:55,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 07:52:55,288 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:52:55,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:55,544 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:56,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:52:56,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 267 states and 540 transitions. [2018-11-10 07:52:56,105 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 540 transitions. [2018-11-10 07:52:56,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 07:52:56,106 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:52:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:57,571 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:53:00,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:53:00,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 272 states and 554 transitions. [2018-11-10 07:53:00,389 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 554 transitions. [2018-11-10 07:53:00,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 07:53:00,390 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:53:00,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:53:00,676 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:53:01,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:53:01,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 274 states and 557 transitions. [2018-11-10 07:53:01,180 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 557 transitions. [2018-11-10 07:53:01,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 07:53:01,180 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:53:01,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:53:01,450 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:53:02,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:53:02,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 278 states and 567 transitions. [2018-11-10 07:53:02,498 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 567 transitions. [2018-11-10 07:53:02,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 07:53:02,499 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:53:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:53:02,764 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:53:03,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:53:03,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 280 states and 570 transitions. [2018-11-10 07:53:03,256 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 570 transitions. [2018-11-10 07:53:03,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 07:53:03,256 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:53:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:53:04,477 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:53:07,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:53:07,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 284 states and 580 transitions. [2018-11-10 07:53:07,427 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 580 transitions. [2018-11-10 07:53:07,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 07:53:07,427 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:53:07,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:53:07,703 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:53:08,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:53:08,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 286 states and 583 transitions. [2018-11-10 07:53:08,217 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 583 transitions. [2018-11-10 07:53:08,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 07:53:08,217 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:53:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:53:08,514 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:53:09,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:53:09,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 290 states and 594 transitions. [2018-11-10 07:53:09,628 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 594 transitions. [2018-11-10 07:53:09,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 07:53:09,628 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:53:09,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:53:09,888 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:53:10,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:53:10,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 292 states and 598 transitions. [2018-11-10 07:53:10,433 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 598 transitions. [2018-11-10 07:53:10,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-10 07:53:10,434 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:53:10,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:53:10,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:53:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:53:11,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:53:11,528 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 57 iterations. [2018-11-10 07:53:11,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 10.11 07:53:11 ImpRootNode [2018-11-10 07:53:11,615 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-10 07:53:11,615 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:53:11,615 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:53:11,615 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:53:11,615 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:51:35" (3/4) ... [2018-11-10 07:53:11,617 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 07:53:11,714 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_133b04ef-949c-4c48-b5f8-8c1575c62600/bin-2019/ukojak/witness.graphml [2018-11-10 07:53:11,714 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:53:11,715 INFO L168 Benchmark]: Toolchain (without parser) took 97537.05 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.6 GB). Free memory was 954.8 MB in the beginning and 921.7 MB in the end (delta: 33.2 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-11-10 07:53:11,715 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:53:11,715 INFO L168 Benchmark]: CACSL2BoogieTranslator took 234.90 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 936.0 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 07:53:11,716 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 936.0 MB in the beginning and 1.1 GB in the end (delta: -211.0 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2018-11-10 07:53:11,716 INFO L168 Benchmark]: Boogie Preprocessor took 27.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-10 07:53:11,716 INFO L168 Benchmark]: RCFGBuilder took 1437.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 868.0 MB in the end (delta: 275.7 MB). Peak memory consumption was 275.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:53:11,716 INFO L168 Benchmark]: CodeCheck took 95656.55 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 868.0 MB in the beginning and 954.0 MB in the end (delta: -86.0 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-11-10 07:53:11,717 INFO L168 Benchmark]: Witness Printer took 99.22 ms. Allocated memory is still 2.6 GB. Free memory was 954.0 MB in the beginning and 921.7 MB in the end (delta: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. [2018-11-10 07:53:11,718 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 124 locations, 1 error locations. UNSAFE Result, 95.5s OverallTime, 57 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 589275132 SDtfs, -1328889874 SDslu, -1208619342 SDs, 0 SdLazy, 1184591346 SolverSat, 976917978 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 78.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 17133 GetRequests, 15087 SyntacticMatches, 1076 SemanticMatches, 970 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 614544 ImplicationChecksByTransitivity, 85.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 3.2s SatisfiabilityAnalysisTime, 16.3s InterpolantComputationTime, 1785 NumberOfCodeBlocks, 1785 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 1677 ConstructedInterpolants, 0 QuantifiedInterpolants, 679579 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 56 InterpolantComputations, 10 PerfectInterpolantSequences, 199/1058 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 577]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L71] char p12_old ; [L72] char p12_new ; [L73] _Bool ep12 ; [L75] char p13_old ; [L76] char p13_new ; [L77] _Bool ep13 ; [L79] char p21_old ; [L80] char p21_new ; [L81] _Bool ep21 ; [L83] char p23_old ; [L84] char p23_new ; [L85] _Bool ep23 ; [L87] char p31_old ; [L88] char p31_new ; [L89] _Bool ep31 ; [L91] char p32_old ; [L92] char p32_new ; [L93] _Bool ep32 ; [L94] char id1 ; [L95] char r1 ; [L96] char st1 ; [L97] char nl1 ; [L98] char m1 ; [L99] char max1 ; [L100] _Bool mode1 ; [L101] char id2 ; [L102] char r2 ; [L103] char st2 ; [L104] char nl2 ; [L105] char m2 ; [L106] char max2 ; [L107] _Bool mode2 ; [L108] char id3 ; [L109] char r3 ; [L110] char st3 ; [L111] char nl3 ; [L112] char m3 ; [L113] char max3 ; [L114] _Bool mode3 ; [L69] msg_t nomsg = (msg_t )-1; [L70] port_t p12 ; [L74] port_t p13 ; [L78] port_t p21 ; [L82] port_t p23 ; [L86] port_t p31 ; [L90] port_t p32 ; [L244] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L498] int c1 ; [L499] int i2 ; [L502] c1 = 0 [L503] ep12 = __VERIFIER_nondet_bool() [L504] ep13 = __VERIFIER_nondet_bool() [L505] ep21 = __VERIFIER_nondet_bool() [L506] ep23 = __VERIFIER_nondet_bool() [L507] ep31 = __VERIFIER_nondet_bool() [L508] ep32 = __VERIFIER_nondet_bool() [L509] id1 = __VERIFIER_nondet_char() [L510] r1 = __VERIFIER_nondet_char() [L511] st1 = __VERIFIER_nondet_char() [L512] nl1 = __VERIFIER_nondet_char() [L513] m1 = __VERIFIER_nondet_char() [L514] max1 = __VERIFIER_nondet_char() [L515] mode1 = __VERIFIER_nondet_bool() [L516] id2 = __VERIFIER_nondet_char() [L517] r2 = __VERIFIER_nondet_char() [L518] st2 = __VERIFIER_nondet_char() [L519] nl2 = __VERIFIER_nondet_char() [L520] m2 = __VERIFIER_nondet_char() [L521] max2 = __VERIFIER_nondet_char() [L522] mode2 = __VERIFIER_nondet_bool() [L523] id3 = __VERIFIER_nondet_char() [L524] r3 = __VERIFIER_nondet_char() [L525] st3 = __VERIFIER_nondet_char() [L526] nl3 = __VERIFIER_nondet_char() [L527] m3 = __VERIFIER_nondet_char() [L528] max3 = __VERIFIER_nondet_char() [L529] mode3 = __VERIFIER_nondet_bool() [L530] CALL, EXPR init() [L247] _Bool r121 ; [L248] _Bool r131 ; [L249] _Bool r211 ; [L250] _Bool r231 ; [L251] _Bool r311 ; [L252] _Bool r321 ; [L253] _Bool r122 ; [L254] int tmp ; [L255] _Bool r132 ; [L256] int tmp___0 ; [L257] _Bool r212 ; [L258] int tmp___1 ; [L259] _Bool r232 ; [L260] int tmp___2 ; [L261] _Bool r312 ; [L262] int tmp___3 ; [L263] _Bool r322 ; [L264] int tmp___4 ; [L265] int tmp___5 ; [L268] r121 = ep12 [L269] r131 = ep13 [L270] r211 = ep21 [L271] r231 = ep23 [L272] r311 = ep31 [L273] r321 = ep32 [L274] COND FALSE !(\read(r121)) [L277] COND FALSE !(\read(r131)) [L284] tmp = 0 [L286] r122 = (_Bool )tmp [L287] COND FALSE !(\read(r131)) [L290] COND FALSE !(\read(r121)) [L297] tmp___0 = 0 [L299] r132 = (_Bool )tmp___0 [L300] COND TRUE \read(r211) [L301] tmp___1 = 1 [L312] r212 = (_Bool )tmp___1 [L313] COND FALSE !(\read(r231)) [L316] COND TRUE \read(r211) [L317] COND FALSE !(\read(ep13)) [L320] tmp___2 = 0 [L325] r232 = (_Bool )tmp___2 [L326] COND FALSE !(\read(r311)) [L329] COND FALSE !(\read(r321)) [L336] tmp___3 = 0 [L338] r312 = (_Bool )tmp___3 [L339] COND FALSE !(\read(r321)) [L342] COND FALSE !(\read(r311)) [L349] tmp___4 = 0 [L351] r322 = (_Bool )tmp___4 [L352] COND TRUE (int )id1 != (int )id2 [L353] COND TRUE (int )id1 != (int )id3 [L354] COND TRUE (int )id2 != (int )id3 [L355] COND TRUE (int )id1 >= 0 [L356] COND TRUE (int )id2 >= 0 [L357] COND TRUE (int )id3 >= 0 [L358] COND TRUE (int )r1 == 0 [L359] COND TRUE (int )r2 == 0 [L360] COND TRUE (int )r3 == 0 [L361] COND TRUE (int )max1 == (int )id1 [L362] COND TRUE (int )max2 == (int )id2 [L363] COND TRUE (int )max3 == (int )id3 [L364] COND TRUE (int )st1 == 0 [L365] COND TRUE (int )st2 == 0 [L366] COND TRUE (int )st3 == 0 [L367] COND TRUE (int )nl1 == 0 [L368] COND TRUE (int )nl2 == 0 [L369] COND TRUE (int )nl3 == 0 [L370] COND TRUE (int )mode1 == 0 [L371] COND TRUE (int )mode2 == 0 [L372] COND TRUE (int )mode3 == 0 [L373] tmp___5 = 1 [L437] RET return (tmp___5); [L530] EXPR init() [L530] i2 = init() [L532] p12_old = nomsg [L533] p12_new = nomsg [L534] p13_old = nomsg [L535] p13_new = nomsg [L536] p21_old = nomsg [L537] p21_new = nomsg [L538] p23_old = nomsg [L539] p23_new = nomsg [L540] p31_old = nomsg [L541] p31_new = nomsg [L542] p32_old = nomsg [L543] p32_new = nomsg [L544] i2 = 0 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=3, m1=1, m2=5, m3=2, max1=0, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L545] COND TRUE i2 < 6 [L547] CALL node1() [L120] COND FALSE !(\read(mode1)) [L145] COND TRUE (int )r1 < 2 [L146] COND FALSE !(\read(ep12)) [L149] COND FALSE !(\read(ep13)) [L153] RET mode1 = (_Bool)1 [L547] node1() [L548] CALL node2() [L163] COND FALSE !(\read(mode2)) [L188] COND TRUE (int )r2 < 2 [L189] COND TRUE \read(ep21) [L190] COND TRUE, EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L190] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L192] COND FALSE !(\read(ep23)) [L196] RET mode2 = (_Bool)1 [L548] node2() [L549] CALL node3() [L206] COND FALSE !(\read(mode3)) [L231] COND TRUE (int )r3 < 2 [L232] COND FALSE !(\read(ep31)) [L235] COND FALSE !(\read(ep32)) [L239] RET mode3 = (_Bool)1 [L549] node3() [L550] p12_old = p12_new [L551] p12_new = nomsg [L552] p13_old = p13_new [L553] p13_new = nomsg [L554] p21_old = p21_new [L555] p21_new = nomsg [L556] p23_old = p23_new [L557] p23_new = nomsg [L558] p31_old = p31_new [L559] p31_new = nomsg [L560] p32_old = p32_new [L561] p32_new = nomsg [L562] CALL, EXPR check() [L442] int tmp ; VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=3, m1=1, m2=5, m3=2, max1=0, max2=2, max3=3, 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=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L445] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=3, m1=1, m2=5, m3=2, max1=0, max2=2, max3=3, 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=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L446] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=3, m1=1, m2=5, m3=2, max1=0, max2=2, max3=3, 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=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L447] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=3, m1=1, m2=5, m3=2, max1=0, max2=2, max3=3, 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=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L448] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=3, m1=1, m2=5, m3=2, max1=0, max2=2, max3=3, 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=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L449] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=3, m1=1, m2=5, m3=2, max1=0, max2=2, max3=3, 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=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L452] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=3, m1=1, m2=5, m3=2, max1=0, max2=2, max3=3, 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=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L454] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=3, m1=1, m2=5, m3=2, max1=0, max2=2, max3=3, 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=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L459] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=3, m1=1, m2=5, m3=2, max1=0, max2=2, max3=3, 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=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L462] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=3, m1=1, m2=5, m3=2, max1=0, max2=2, max3=3, 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=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L464] COND TRUE (int )r1 < 2 [L465] tmp = 1 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=3, m1=1, m2=5, m3=2, max1=0, max2=2, max3=3, 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=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L493] RET return (tmp); [L562] EXPR check() [L562] c1 = check() [L563] CALL assert(c1) [L575] COND FALSE, RET !(! arg) VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=3, m1=1, m2=5, m3=2, max1=0, max2=2, max3=3, 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=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L563] assert(c1) [L564] i2 ++ VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=3, m1=1, m2=5, m3=2, max1=0, max2=2, max3=3, 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=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L545] COND TRUE i2 < 6 [L547] CALL node1() [L120] COND TRUE \read(mode1) [L121] r1 = (char )((int )r1 + 1) [L122] COND TRUE \read(ep21) [L123] m1 = p21_old [L124] p21_old = nomsg [L125] COND TRUE (int )m1 > (int )max1 [L126] max1 = m1 [L129] COND FALSE !(\read(ep31)) [L136] COND FALSE !((int )r1 == 2) [L143] RET mode1 = (_Bool)0 [L547] node1() [L548] CALL node2() [L163] COND TRUE \read(mode2) [L164] r2 = (char )((int )r2 + 1) [L165] COND FALSE !(\read(ep12)) [L172] COND FALSE !(\read(ep32)) [L179] COND FALSE !((int )r2 == 2) [L186] RET mode2 = (_Bool)0 [L548] node2() [L549] CALL node3() [L206] COND TRUE \read(mode3) [L207] r3 = (char )((int )r3 + 1) [L208] COND FALSE !(\read(ep13)) [L215] COND FALSE !(\read(ep23)) [L222] COND FALSE !((int )r3 == 2) [L229] RET mode3 = (_Bool)0 [L549] node3() [L550] p12_old = p12_new [L551] p12_new = nomsg [L552] p13_old = p13_new [L553] p13_new = nomsg [L554] p21_old = p21_new [L555] p21_new = nomsg [L556] p23_old = p23_new [L557] p23_new = nomsg [L558] p31_old = p31_new [L559] p31_new = nomsg [L560] p32_old = p32_new [L561] p32_new = nomsg [L562] CALL, EXPR check() [L442] int tmp ; VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=3, m1=2, m2=5, m3=2, max1=2, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L445] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=3, m1=2, m2=5, m3=2, max1=2, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L446] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=3, m1=2, m2=5, m3=2, max1=2, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L447] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=3, m1=2, m2=5, m3=2, max1=2, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L448] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=3, m1=2, m2=5, m3=2, max1=2, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L449] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=3, m1=2, m2=5, m3=2, max1=2, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L452] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=3, m1=2, m2=5, m3=2, max1=2, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L454] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=3, m1=2, m2=5, m3=2, max1=2, max2=2, max3=3, 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=0, ep32=0, id1=0, id2=2, id3=3, m1=2, m2=5, m3=2, max1=2, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L462] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=3, m1=2, m2=5, m3=2, max1=2, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L464] COND TRUE (int )r1 < 2 [L465] tmp = 1 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=3, m1=2, m2=5, m3=2, max1=2, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L493] RET return (tmp); [L562] EXPR check() [L562] c1 = check() [L563] CALL assert(c1) [L575] COND FALSE, RET !(! arg) VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=3, m1=2, m2=5, m3=2, max1=2, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L563] assert(c1) [L564] i2 ++ VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=3, m1=2, m2=5, m3=2, max1=2, max2=2, max3=3, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L545] COND TRUE i2 < 6 [L547] CALL node1() [L120] COND FALSE !(\read(mode1)) [L145] COND TRUE (int )r1 < 2 [L146] COND FALSE !(\read(ep12)) [L149] COND FALSE !(\read(ep13)) [L153] RET mode1 = (_Bool)1 [L547] node1() [L548] CALL node2() [L163] COND FALSE !(\read(mode2)) [L188] COND TRUE (int )r2 < 2 [L189] COND TRUE \read(ep21) [L190] COND TRUE, EXPR max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L190] p21_new = max2 != nomsg && p21_new == nomsg ? max2 : p21_new [L192] COND FALSE !(\read(ep23)) [L196] RET mode2 = (_Bool)1 [L548] node2() [L549] CALL node3() [L206] COND FALSE !(\read(mode3)) [L231] COND TRUE (int )r3 < 2 [L232] COND FALSE !(\read(ep31)) [L235] COND FALSE !(\read(ep32)) [L239] RET mode3 = (_Bool)1 [L549] node3() [L550] p12_old = p12_new [L551] p12_new = nomsg [L552] p13_old = p13_new [L553] p13_new = nomsg [L554] p21_old = p21_new [L555] p21_new = nomsg [L556] p23_old = p23_new [L557] p23_new = nomsg [L558] p31_old = p31_new [L559] p31_new = nomsg [L560] p32_old = p32_new [L561] p32_new = nomsg [L562] CALL, EXPR check() [L442] int tmp ; VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=3, m1=2, m2=5, m3=2, max1=2, max2=2, max3=3, 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=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L445] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=3, m1=2, m2=5, m3=2, max1=2, max2=2, max3=3, 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=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L446] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=3, m1=2, m2=5, m3=2, max1=2, max2=2, max3=3, 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=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L447] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=3, m1=2, m2=5, m3=2, max1=2, max2=2, max3=3, 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=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L448] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=3, m1=2, m2=5, m3=2, max1=2, max2=2, max3=3, 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=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L449] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=3, m1=2, m2=5, m3=2, max1=2, max2=2, max3=3, 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=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L452] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=3, m1=2, m2=5, m3=2, max1=2, max2=2, max3=3, 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=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L454] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=3, m1=2, m2=5, m3=2, max1=2, max2=2, max3=3, 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=2, 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=0, ep32=0, id1=0, id2=2, id3=3, m1=2, m2=5, m3=2, max1=2, max2=2, max3=3, 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=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L462] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=3, m1=2, m2=5, m3=2, max1=2, max2=2, max3=3, 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=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L464] COND TRUE (int )r1 < 2 [L465] tmp = 1 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=3, m1=2, m2=5, m3=2, max1=2, max2=2, max3=3, 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=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L493] RET return (tmp); [L562] EXPR check() [L562] c1 = check() [L563] CALL assert(c1) [L575] COND FALSE, RET !(! arg) VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=3, m1=2, m2=5, m3=2, max1=2, max2=2, max3=3, 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=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L563] assert(c1) [L564] i2 ++ VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=3, m1=2, m2=5, m3=2, max1=2, max2=2, max3=3, 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=2, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L545] COND TRUE i2 < 6 [L547] CALL node1() [L120] COND TRUE \read(mode1) [L121] r1 = (char )((int )r1 + 1) [L122] COND TRUE \read(ep21) [L123] m1 = p21_old [L124] p21_old = nomsg [L125] COND FALSE !((int )m1 > (int )max1) [L129] COND FALSE !(\read(ep31)) [L136] COND TRUE (int )r1 == 2 [L137] COND FALSE !((int )max1 == (int )id1) [L140] nl1 = (char)1 [L143] RET mode1 = (_Bool)0 [L547] node1() [L548] CALL node2() [L163] COND TRUE \read(mode2) [L164] r2 = (char )((int )r2 + 1) [L165] COND FALSE !(\read(ep12)) [L172] COND FALSE !(\read(ep32)) [L179] COND TRUE (int )r2 == 2 [L180] COND TRUE (int )max2 == (int )id2 [L181] st2 = (char)1 [L186] RET mode2 = (_Bool)0 [L548] node2() [L549] CALL node3() [L206] COND TRUE \read(mode3) [L207] r3 = (char )((int )r3 + 1) [L208] COND FALSE !(\read(ep13)) [L215] COND FALSE !(\read(ep23)) [L222] COND TRUE (int )r3 == 2 [L223] COND TRUE (int )max3 == (int )id3 [L224] st3 = (char)1 [L229] RET mode3 = (_Bool)0 [L549] node3() [L550] p12_old = p12_new [L551] p12_new = nomsg [L552] p13_old = p13_new [L553] p13_new = nomsg [L554] p21_old = p21_new [L555] p21_new = nomsg [L556] p23_old = p23_new [L557] p23_new = nomsg [L558] p31_old = p31_new [L559] p31_new = nomsg [L560] p32_old = p32_new [L561] p32_new = nomsg [L562] CALL, EXPR check() [L442] int tmp ; VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=3, m1=2, m2=5, m3=2, max1=2, max2=2, max3=3, 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] [L445] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L491] tmp = 0 VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=3, m1=2, m2=5, m3=2, max1=2, max2=2, max3=3, 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] [L493] RET return (tmp); [L562] EXPR check() [L562] c1 = check() [L563] CALL assert(c1) [L575] COND TRUE ! arg VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=3, m1=2, m2=5, m3=2, max1=2, max2=2, max3=3, 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] [L577] __VERIFIER_error() VAL [ep12=0, ep13=0, ep21=1, ep23=0, ep31=0, ep32=0, id1=0, id2=2, id3=3, m1=2, m2=5, m3=2, max1=2, max2=2, max3=3, 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 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 234.90 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 936.0 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 78.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 936.0 MB in the beginning and 1.1 GB in the end (delta: -211.0 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1437.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 868.0 MB in the end (delta: 275.7 MB). Peak memory consumption was 275.7 MB. Max. memory is 11.5 GB. * CodeCheck took 95656.55 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 868.0 MB in the beginning and 954.0 MB in the end (delta: -86.0 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 99.22 ms. Allocated memory is still 2.6 GB. Free memory was 954.0 MB in the beginning and 921.7 MB in the end (delta: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...