./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.3.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_6a845e21-ba22-44c6-ba72-8c990861181b/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6a845e21-ba22-44c6-ba72-8c990861181b/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6a845e21-ba22-44c6-ba72-8c990861181b/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6a845e21-ba22-44c6-ba72-8c990861181b/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.3.ufo.BOUNDED-6.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_6a845e21-ba22-44c6-ba72-8c990861181b/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6a845e21-ba22-44c6-ba72-8c990861181b/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 b21da786d95e06bc319c05bb1d8697b6b032c077 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 09:59:37,752 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 09:59:37,753 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 09:59:37,760 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 09:59:37,760 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 09:59:37,761 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 09:59:37,761 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 09:59:37,763 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 09:59:37,764 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 09:59:37,764 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 09:59:37,765 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 09:59:37,765 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 09:59:37,766 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 09:59:37,766 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 09:59:37,767 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 09:59:37,768 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 09:59:37,768 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 09:59:37,770 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 09:59:37,771 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 09:59:37,772 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 09:59:37,773 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 09:59:37,773 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 09:59:37,775 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 09:59:37,775 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 09:59:37,775 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 09:59:37,776 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 09:59:37,776 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 09:59:37,777 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 09:59:37,777 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 09:59:37,778 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 09:59:37,778 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 09:59:37,778 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 09:59:37,778 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 09:59:37,778 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 09:59:37,779 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 09:59:37,779 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 09:59:37,780 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6a845e21-ba22-44c6-ba72-8c990861181b/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-10 09:59:37,787 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 09:59:37,787 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 09:59:37,788 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 09:59:37,788 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 09:59:37,788 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 09:59:37,789 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 09:59:37,789 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 09:59:37,789 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 09:59:37,789 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 09:59:37,789 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 09:59:37,789 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 09:59:37,789 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 09:59:37,790 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 09:59:37,790 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 09:59:37,790 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 09:59:37,790 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 09:59:37,790 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 09:59:37,790 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-10 09:59:37,790 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-10 09:59:37,791 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 09:59:37,791 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 09:59:37,791 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 09:59:37,791 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 09:59:37,791 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 09:59:37,791 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 09:59:37,791 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-10 09:59:37,792 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 09:59:37,792 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 09:59:37,792 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_6a845e21-ba22-44c6-ba72-8c990861181b/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 -> b21da786d95e06bc319c05bb1d8697b6b032c077 [2018-11-10 09:59:37,819 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 09:59:37,827 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 09:59:37,828 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 09:59:37,829 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 09:59:37,829 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 09:59:37,830 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6a845e21-ba22-44c6-ba72-8c990861181b/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.3.ufo.BOUNDED-6.pals_true-termination.c [2018-11-10 09:59:37,866 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6a845e21-ba22-44c6-ba72-8c990861181b/bin-2019/ukojak/data/4c2014e5f/1171e4b5f9eb4c018fcefe8f41f3ddb5/FLAG540d2fe7e [2018-11-10 09:59:38,290 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 09:59:38,291 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6a845e21-ba22-44c6-ba72-8c990861181b/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.3.ufo.BOUNDED-6.pals_true-termination.c [2018-11-10 09:59:38,298 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6a845e21-ba22-44c6-ba72-8c990861181b/bin-2019/ukojak/data/4c2014e5f/1171e4b5f9eb4c018fcefe8f41f3ddb5/FLAG540d2fe7e [2018-11-10 09:59:38,310 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6a845e21-ba22-44c6-ba72-8c990861181b/bin-2019/ukojak/data/4c2014e5f/1171e4b5f9eb4c018fcefe8f41f3ddb5 [2018-11-10 09:59:38,312 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 09:59:38,313 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 09:59:38,313 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 09:59:38,313 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 09:59:38,316 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 09:59:38,317 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:59:38" (1/1) ... [2018-11-10 09:59:38,319 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70607c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:59:38, skipping insertion in model container [2018-11-10 09:59:38,319 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:59:38" (1/1) ... [2018-11-10 09:59:38,324 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 09:59:38,351 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 09:59:38,490 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:59:38,496 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 09:59:38,532 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:59:38,546 INFO L193 MainTranslator]: Completed translation [2018-11-10 09:59:38,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:59:38 WrapperNode [2018-11-10 09:59:38,547 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 09:59:38,547 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 09:59:38,547 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 09:59:38,548 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 09:59:38,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:59:38" (1/1) ... [2018-11-10 09:59:38,602 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:59:38" (1/1) ... [2018-11-10 09:59:38,627 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 09:59:38,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 09:59:38,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 09:59:38,628 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 09:59:38,636 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:59:38" (1/1) ... [2018-11-10 09:59:38,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:59:38" (1/1) ... [2018-11-10 09:59:38,639 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:59:38" (1/1) ... [2018-11-10 09:59:38,639 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:59:38" (1/1) ... [2018-11-10 09:59:38,645 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:59:38" (1/1) ... [2018-11-10 09:59:38,652 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:59:38" (1/1) ... [2018-11-10 09:59:38,654 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:59:38" (1/1) ... [2018-11-10 09:59:38,657 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 09:59:38,657 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 09:59:38,657 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 09:59:38,657 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 09:59:38,658 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:59:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a845e21-ba22-44c6-ba72-8c990861181b/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 09:59:38,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 09:59:38,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 09:59:40,439 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 09:59:40,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:59:40 BoogieIcfgContainer [2018-11-10 09:59:40,440 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 09:59:40,440 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-10 09:59:40,440 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-10 09:59:40,447 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-10 09:59:40,448 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:59:40" (1/1) ... [2018-11-10 09:59:40,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:59:40,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:59:40,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 21 states and 33 transitions. [2018-11-10 09:59:40,478 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 33 transitions. [2018-11-10 09:59:40,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-10 09:59:40,481 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:59:40,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:40,838 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 09:59:40,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:59:40,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 24 states and 37 transitions. [2018-11-10 09:59:40,927 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions. [2018-11-10 09:59:40,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-10 09:59:40,927 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:59:40,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:41,057 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 09:59:41,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:59:41,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 28 states and 45 transitions. [2018-11-10 09:59:41,244 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 45 transitions. [2018-11-10 09:59:41,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-10 09:59:41,244 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:59:41,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:41,363 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 09:59:41,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:59:41,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 33 states and 55 transitions. [2018-11-10 09:59:41,620 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 55 transitions. [2018-11-10 09:59:41,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-10 09:59:41,622 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:59:41,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:41,773 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 09:59:42,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:59:42,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 39 states and 67 transitions. [2018-11-10 09:59:42,217 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 67 transitions. [2018-11-10 09:59:42,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-10 09:59:42,218 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:59:42,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:42,368 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 09:59:42,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:59:42,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 47 states and 81 transitions. [2018-11-10 09:59:42,944 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 81 transitions. [2018-11-10 09:59:42,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 09:59:42,945 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:59:42,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:43,097 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 09:59:43,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:59:43,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 54 states and 94 transitions. [2018-11-10 09:59:43,727 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 94 transitions. [2018-11-10 09:59:43,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 09:59:43,728 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:59:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:43,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:59:43,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:59:43,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 55 states and 94 transitions. [2018-11-10 09:59:43,997 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 94 transitions. [2018-11-10 09:59:43,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 09:59:43,998 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:59:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:44,022 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 09:59:44,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:59:44,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 56 states and 95 transitions. [2018-11-10 09:59:44,032 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 95 transitions. [2018-11-10 09:59:44,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 09:59:44,033 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:59:44,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:44,175 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 09:59:45,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:59:45,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 67 states and 113 transitions. [2018-11-10 09:59:45,215 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 113 transitions. [2018-11-10 09:59:45,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 09:59:45,215 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:59:45,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:45,370 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 09:59:45,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:59:45,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 70 states and 118 transitions. [2018-11-10 09:59:45,562 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 118 transitions. [2018-11-10 09:59:45,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 09:59:45,563 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:59:45,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:45,938 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 09:59:48,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:59:48,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 88 states and 158 transitions. [2018-11-10 09:59:48,238 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 158 transitions. [2018-11-10 09:59:48,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 09:59:48,239 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:59:48,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:48,775 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-10 09:59:48,945 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 09:59:51,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:59:51,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 102 states and 180 transitions. [2018-11-10 09:59:51,348 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 180 transitions. [2018-11-10 09:59:51,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 09:59:51,349 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:59:51,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:51,480 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 09:59:52,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:59:52,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 105 states and 186 transitions. [2018-11-10 09:59:52,153 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 186 transitions. [2018-11-10 09:59:52,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 09:59:52,154 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:59:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:52,514 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 09:59:54,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:59:54,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 119 states and 211 transitions. [2018-11-10 09:59:54,954 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 211 transitions. [2018-11-10 09:59:54,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 09:59:54,955 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:59:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:55,030 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 09:59:55,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:59:55,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 123 states and 220 transitions. [2018-11-10 09:59:55,907 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 220 transitions. [2018-11-10 09:59:55,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 09:59:55,908 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:59:55,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:56,008 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 09:59:56,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:59:56,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 124 states and 221 transitions. [2018-11-10 09:59:56,265 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 221 transitions. [2018-11-10 09:59:56,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 09:59:56,266 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:59:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:56,361 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 09:59:56,728 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-11-10 09:59:56,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 09:59:56,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 126 states and 225 transitions. [2018-11-10 09:59:56,999 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 225 transitions. [2018-11-10 09:59:57,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 09:59:57,000 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 09:59:57,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:59:57,456 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 10:00:01,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:00:01,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 147 states and 270 transitions. [2018-11-10 10:00:01,881 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 270 transitions. [2018-11-10 10:00:01,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 10:00:01,881 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:00:01,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:01,964 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 10:00:02,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:00:02,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 151 states and 280 transitions. [2018-11-10 10:00:02,906 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 280 transitions. [2018-11-10 10:00:02,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 10:00:02,906 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:00:02,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:02,986 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 10:00:04,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:00:04,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 156 states and 290 transitions. [2018-11-10 10:00:04,156 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 290 transitions. [2018-11-10 10:00:04,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 10:00:04,157 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:00:04,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:04,237 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 10:00:04,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:00:04,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 158 states and 300 transitions. [2018-11-10 10:00:04,837 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 300 transitions. [2018-11-10 10:00:04,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 10:00:04,837 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:00:04,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:05,378 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 10:00:10,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:00:10,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 178 states and 343 transitions. [2018-11-10 10:00:10,756 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 343 transitions. [2018-11-10 10:00:10,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 10:00:10,757 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:00:10,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:10,868 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 10:00:11,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:00:11,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 179 states and 344 transitions. [2018-11-10 10:00:11,241 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 344 transitions. [2018-11-10 10:00:11,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 10:00:11,242 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:00:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:11,361 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 10:00:11,742 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2018-11-10 10:00:13,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:00:13,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 184 states and 360 transitions. [2018-11-10 10:00:13,226 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 360 transitions. [2018-11-10 10:00:13,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 10:00:13,226 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:00:13,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:13,329 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 10:00:13,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:00:13,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 185 states and 361 transitions. [2018-11-10 10:00:13,716 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 361 transitions. [2018-11-10 10:00:13,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 10:00:13,716 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:00:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:13,792 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 10:00:14,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:00:14,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 189 states and 372 transitions. [2018-11-10 10:00:14,971 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 372 transitions. [2018-11-10 10:00:14,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 10:00:14,971 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:00:15,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:15,088 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 10:00:15,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:00:15,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 191 states and 380 transitions. [2018-11-10 10:00:15,798 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 380 transitions. [2018-11-10 10:00:15,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 10:00:15,798 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:00:15,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:16,284 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 10:00:18,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:00:18,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 196 states and 394 transitions. [2018-11-10 10:00:18,001 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 394 transitions. [2018-11-10 10:00:18,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 10:00:18,001 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:00:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:18,066 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 10:00:19,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:00:19,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 202 states and 407 transitions. [2018-11-10 10:00:19,812 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 407 transitions. [2018-11-10 10:00:19,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 10:00:19,812 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:00:19,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:19,877 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 10:00:20,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:00:20,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 203 states and 408 transitions. [2018-11-10 10:00:20,110 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 408 transitions. [2018-11-10 10:00:20,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 10:00:20,110 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:00:20,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:20,194 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 10:00:20,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:00:20,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 204 states and 409 transitions. [2018-11-10 10:00:20,547 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 409 transitions. [2018-11-10 10:00:20,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 10:00:20,547 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:00:20,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:20,642 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 10:00:21,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:00:21,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 206 states and 417 transitions. [2018-11-10 10:00:21,460 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 417 transitions. [2018-11-10 10:00:21,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 10:00:21,461 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:00:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:21,540 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 10:00:22,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:00:22,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 209 states and 421 transitions. [2018-11-10 10:00:22,306 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 421 transitions. [2018-11-10 10:00:22,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 10:00:22,306 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:00:22,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:22,372 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 10:00:23,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:00:23,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 211 states and 425 transitions. [2018-11-10 10:00:23,044 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 425 transitions. [2018-11-10 10:00:23,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 10:00:23,044 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:00:23,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:24,051 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 10:00:30,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:00:30,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 230 states and 464 transitions. [2018-11-10 10:00:30,604 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 464 transitions. [2018-11-10 10:00:30,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 10:00:30,605 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:00:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:30,807 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 10:00:32,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:00:32,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 235 states and 475 transitions. [2018-11-10 10:00:32,437 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 475 transitions. [2018-11-10 10:00:32,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 10:00:32,437 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:00:32,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:32,581 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 10:00:33,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:00:33,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 238 states and 487 transitions. [2018-11-10 10:00:33,805 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 487 transitions. [2018-11-10 10:00:33,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 10:00:33,806 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:00:33,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:33,949 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 10:00:34,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:00:34,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 240 states and 498 transitions. [2018-11-10 10:00:34,543 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 498 transitions. [2018-11-10 10:00:34,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 10:00:34,544 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:00:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:35,943 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 10:00:57,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:00:57,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 272 states and 610 transitions. [2018-11-10 10:00:57,269 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 610 transitions. [2018-11-10 10:00:57,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 10:00:57,270 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:00:57,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:57,589 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 10:00:59,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:00:59,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 276 states and 618 transitions. [2018-11-10 10:00:59,336 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 618 transitions. [2018-11-10 10:00:59,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 10:00:59,337 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:00:59,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:00:59,586 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 10:01:00,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:01:00,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 277 states and 619 transitions. [2018-11-10 10:01:00,111 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 619 transitions. [2018-11-10 10:01:00,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 10:01:00,112 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:01:00,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:01:00,598 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 10:01:01,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:01:01,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 278 states and 620 transitions. [2018-11-10 10:01:01,164 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 620 transitions. [2018-11-10 10:01:01,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 10:01:01,164 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:01:01,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:01:01,439 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 10:01:02,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:01:02,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 281 states and 630 transitions. [2018-11-10 10:01:02,599 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 630 transitions. [2018-11-10 10:01:02,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 10:01:02,599 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:01:02,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:01:02,887 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 10:01:03,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:01:03,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 282 states and 631 transitions. [2018-11-10 10:01:03,412 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 631 transitions. [2018-11-10 10:01:03,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 10:01:03,413 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:01:03,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:01:03,699 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 10:01:04,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:01:04,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 284 states and 636 transitions. [2018-11-10 10:01:04,215 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 636 transitions. [2018-11-10 10:01:04,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 10:01:04,215 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:01:04,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:01:05,028 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:01:11,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:01:11,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 297 states and 676 transitions. [2018-11-10 10:01:11,709 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 676 transitions. [2018-11-10 10:01:11,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 10:01:11,710 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:01:11,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:01:11,796 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:01:23,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:01:23,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 301 states and 700 transitions. [2018-11-10 10:01:23,353 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 700 transitions. [2018-11-10 10:01:23,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 10:01:23,353 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:01:23,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:01:23,459 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:01:24,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:01:24,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 302 states and 701 transitions. [2018-11-10 10:01:24,182 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 701 transitions. [2018-11-10 10:01:24,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 10:01:24,182 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:01:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:01:24,260 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:01:25,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:01:25,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 304 states and 704 transitions. [2018-11-10 10:01:25,479 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 704 transitions. [2018-11-10 10:01:25,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 10:01:25,479 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:01:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:01:25,557 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:01:26,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:01:26,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 305 states and 706 transitions. [2018-11-10 10:01:26,197 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 706 transitions. [2018-11-10 10:01:26,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 10:01:26,197 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:01:26,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:01:26,275 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:01:27,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:01:27,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 309 states and 710 transitions. [2018-11-10 10:01:27,826 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 710 transitions. [2018-11-10 10:01:27,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 10:01:27,826 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:01:27,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:01:27,947 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:01:28,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:01:28,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 311 states and 712 transitions. [2018-11-10 10:01:28,582 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 712 transitions. [2018-11-10 10:01:28,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 10:01:28,583 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:01:28,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:01:29,901 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 10:01:31,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:01:31,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 311 states and 711 transitions. [2018-11-10 10:01:31,549 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 711 transitions. [2018-11-10 10:01:31,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 10:01:31,550 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:01:31,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:01:31,810 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 10:01:36,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:01:36,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 320 states and 725 transitions. [2018-11-10 10:01:36,614 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 725 transitions. [2018-11-10 10:01:36,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 10:01:36,615 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:01:36,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:01:36,875 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 10:01:37,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:01:37,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 322 states and 727 transitions. [2018-11-10 10:01:37,633 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 727 transitions. [2018-11-10 10:01:37,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 10:01:37,633 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:01:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:01:37,891 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 10:01:38,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:01:38,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 323 states and 728 transitions. [2018-11-10 10:01:38,517 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 728 transitions. [2018-11-10 10:01:38,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 10:01:38,517 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:01:38,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:01:38,773 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 10:01:39,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:01:39,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 322 states and 726 transitions. [2018-11-10 10:01:39,292 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 726 transitions. [2018-11-10 10:01:39,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 10:01:39,293 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:01:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:01:39,604 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 10:01:40,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:01:40,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 316 states and 719 transitions. [2018-11-10 10:01:40,212 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 719 transitions. [2018-11-10 10:01:40,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 10:01:40,213 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:01:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:01:41,540 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 10:01:47,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:01:47,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 324 states and 731 transitions. [2018-11-10 10:01:47,203 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 731 transitions. [2018-11-10 10:01:47,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 10:01:47,204 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:01:47,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:01:47,571 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:01:48,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:01:48,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 326 states and 733 transitions. [2018-11-10 10:01:48,267 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 733 transitions. [2018-11-10 10:01:48,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 10:01:48,267 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:01:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:01:48,522 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 10:01:49,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:01:49,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 321 states and 727 transitions. [2018-11-10 10:01:49,179 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 727 transitions. [2018-11-10 10:01:49,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 10:01:49,179 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:01:49,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:01:50,742 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 10:01:58,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:01:58,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 336 states and 764 transitions. [2018-11-10 10:01:58,196 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 764 transitions. [2018-11-10 10:01:58,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 10:01:58,197 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:01:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:01:58,537 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 10:02:03,330 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2018-11-10 10:02:04,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:02:04,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 346 states and 788 transitions. [2018-11-10 10:02:04,013 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 788 transitions. [2018-11-10 10:02:04,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 10:02:04,013 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:02:04,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:02:04,359 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 10:02:17,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:02:17,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 352 states and 803 transitions. [2018-11-10 10:02:17,272 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 803 transitions. [2018-11-10 10:02:17,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 10:02:17,272 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:02:17,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:02:17,651 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 10:02:18,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:02:18,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 353 states and 804 transitions. [2018-11-10 10:02:18,101 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 804 transitions. [2018-11-10 10:02:18,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 10:02:18,102 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:02:18,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:02:18,447 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 10:02:19,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:02:19,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 356 states and 813 transitions. [2018-11-10 10:02:19,810 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 813 transitions. [2018-11-10 10:02:19,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 10:02:19,811 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:02:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:02:20,157 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 10:02:20,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:02:20,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 357 states and 814 transitions. [2018-11-10 10:02:20,871 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 814 transitions. [2018-11-10 10:02:20,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 10:02:20,872 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:02:20,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:02:21,265 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 10:02:21,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:02:21,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 358 states and 815 transitions. [2018-11-10 10:02:21,970 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 815 transitions. [2018-11-10 10:02:21,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 10:02:21,970 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:02:22,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:02:23,782 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 10:02:26,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:02:26,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 361 states and 823 transitions. [2018-11-10 10:02:26,560 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 823 transitions. [2018-11-10 10:02:26,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 10:02:26,561 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:02:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:02:27,304 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 10:02:28,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:02:28,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 363 states and 828 transitions. [2018-11-10 10:02:28,014 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 828 transitions. [2018-11-10 10:02:28,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 10:02:28,015 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:02:28,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:02:28,629 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 10:02:29,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:02:29,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 365 states and 831 transitions. [2018-11-10 10:02:29,322 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 831 transitions. [2018-11-10 10:02:29,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 10:02:29,322 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:02:29,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:02:30,018 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 10:02:30,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:02:30,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 367 states and 834 transitions. [2018-11-10 10:02:30,689 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 834 transitions. [2018-11-10 10:02:30,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 10:02:30,689 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:02:30,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:02:31,285 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 10:02:32,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:02:32,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 369 states and 837 transitions. [2018-11-10 10:02:32,023 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 837 transitions. [2018-11-10 10:02:32,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 10:02:32,023 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:02:32,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:02:33,774 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 10:02:38,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:02:38,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 380 states and 861 transitions. [2018-11-10 10:02:38,993 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 861 transitions. [2018-11-10 10:02:38,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 10:02:38,994 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:02:39,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:02:39,387 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 10:02:42,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:02:42,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 384 states and 875 transitions. [2018-11-10 10:02:42,176 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 875 transitions. [2018-11-10 10:02:42,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 10:02:42,176 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:02:42,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:02:42,522 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 10:02:44,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:02:44,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 387 states and 883 transitions. [2018-11-10 10:02:44,400 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 883 transitions. [2018-11-10 10:02:44,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 10:02:44,400 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:02:44,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:02:44,803 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 10:02:47,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:02:47,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 391 states and 892 transitions. [2018-11-10 10:02:47,585 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 892 transitions. [2018-11-10 10:02:47,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 10:02:47,586 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:02:47,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:02:47,927 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 10:02:48,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:02:48,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 393 states and 898 transitions. [2018-11-10 10:02:48,904 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 898 transitions. [2018-11-10 10:02:48,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 10:02:48,905 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:02:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:02:49,287 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 10:02:50,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:02:50,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 395 states and 904 transitions. [2018-11-10 10:02:50,312 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 904 transitions. [2018-11-10 10:02:50,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 10:02:50,313 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:02:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:02:50,705 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 10:02:51,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:02:51,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 397 states and 907 transitions. [2018-11-10 10:02:51,517 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 907 transitions. [2018-11-10 10:02:51,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 10:02:51,518 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:02:51,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:02:51,856 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 10:02:52,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:02:52,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 398 states and 909 transitions. [2018-11-10 10:02:52,591 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 909 transitions. [2018-11-10 10:02:52,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 10:02:52,591 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:02:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:02:52,931 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 10:02:53,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 10:02:53,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 400 states and 912 transitions. [2018-11-10 10:02:53,800 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 912 transitions. [2018-11-10 10:02:53,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-10 10:02:53,801 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 10:02:54,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:02:54,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:02:55,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:02:55,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:02:55,794 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 83 iterations. [2018-11-10 10:02:55,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 10.11 10:02:55 ImpRootNode [2018-11-10 10:02:55,889 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-10 10:02:55,890 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 10:02:55,890 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 10:02:55,890 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 10:02:55,890 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:59:40" (3/4) ... [2018-11-10 10:02:55,892 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 10:02:55,997 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6a845e21-ba22-44c6-ba72-8c990861181b/bin-2019/ukojak/witness.graphml [2018-11-10 10:02:55,997 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 10:02:55,997 INFO L168 Benchmark]: Toolchain (without parser) took 197685.40 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 1.1 GB in the end (delta: -105.7 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2018-11-10 10:02:55,998 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 10:02:55,998 INFO L168 Benchmark]: CACSL2BoogieTranslator took 233.85 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.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2018-11-10 10:02:55,998 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 936.0 MB in the beginning and 1.1 GB in the end (delta: -173.8 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2018-11-10 10:02:55,998 INFO L168 Benchmark]: Boogie Preprocessor took 29.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 10:02:55,999 INFO L168 Benchmark]: RCFGBuilder took 1782.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 66.5 MB). Peak memory consumption was 265.9 MB. Max. memory is 11.5 GB. [2018-11-10 10:02:55,999 INFO L168 Benchmark]: CodeCheck took 195449.15 ms. Allocated memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -19.9 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-11-10 10:02:55,999 INFO L168 Benchmark]: Witness Printer took 107.11 ms. Allocated memory is still 2.6 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:02:56,000 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 130 locations, 1 error locations. UNSAFE Result, 195.3s OverallTime, 83 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 561020916 SDtfs, 1671491884 SDslu, -95524732 SDs, 0 SdLazy, 1498682116 SolverSat, 403477060 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 195.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 28368 GetRequests, 25342 SyntacticMatches, 1836 SemanticMatches, 1190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931718 ImplicationChecksByTransitivity, 180.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 5.3s SatisfiabilityAnalysisTime, 24.7s InterpolantComputationTime, 2706 NumberOfCodeBlocks, 2706 NumberOfCodeBlocksAsserted, 83 NumberOfCheckSat, 2572 ConstructedInterpolants, 0 QuantifiedInterpolants, 1080036 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 82 InterpolantComputations, 10 PerfectInterpolantSequences, 299/1679 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: 601]: 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}; [L522] int c1 ; [L523] int i2 ; [L526] c1 = 0 [L527] ep12 = __VERIFIER_nondet_bool() [L528] ep13 = __VERIFIER_nondet_bool() [L529] ep21 = __VERIFIER_nondet_bool() [L530] ep23 = __VERIFIER_nondet_bool() [L531] ep31 = __VERIFIER_nondet_bool() [L532] ep32 = __VERIFIER_nondet_bool() [L533] id1 = __VERIFIER_nondet_char() [L534] r1 = __VERIFIER_nondet_char() [L535] st1 = __VERIFIER_nondet_char() [L536] nl1 = __VERIFIER_nondet_char() [L537] m1 = __VERIFIER_nondet_char() [L538] max1 = __VERIFIER_nondet_char() [L539] mode1 = __VERIFIER_nondet_bool() [L540] id2 = __VERIFIER_nondet_char() [L541] r2 = __VERIFIER_nondet_char() [L542] st2 = __VERIFIER_nondet_char() [L543] nl2 = __VERIFIER_nondet_char() [L544] m2 = __VERIFIER_nondet_char() [L545] max2 = __VERIFIER_nondet_char() [L546] mode2 = __VERIFIER_nondet_bool() [L547] id3 = __VERIFIER_nondet_char() [L548] r3 = __VERIFIER_nondet_char() [L549] st3 = __VERIFIER_nondet_char() [L550] nl3 = __VERIFIER_nondet_char() [L551] m3 = __VERIFIER_nondet_char() [L552] max3 = __VERIFIER_nondet_char() [L553] mode3 = __VERIFIER_nondet_bool() [L554] 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 TRUE \read(r121) [L275] tmp = 1 [L286] r122 = (_Bool )tmp [L287] COND FALSE !(\read(r131)) [L290] COND TRUE \read(r121) [L291] COND TRUE \read(ep23) [L292] tmp___0 = 1 [L299] r132 = (_Bool )tmp___0 [L300] COND TRUE \read(r211) [L301] tmp___1 = 1 [L312] r212 = (_Bool )tmp___1 [L313] COND TRUE \read(r231) [L314] tmp___2 = 1 [L325] r232 = (_Bool )tmp___2 [L326] COND TRUE \read(r311) [L327] tmp___3 = 1 [L338] r312 = (_Bool )tmp___3 [L339] COND TRUE \read(r321) [L340] tmp___4 = 1 [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 \read(r122) [L362] COND TRUE \read(r132) [L363] COND TRUE \read(r212) [L364] COND TRUE \read(r232) [L365] COND TRUE \read(r312) [L366] COND TRUE \read(r322) [L367] COND TRUE (int )max1 == (int )id1 [L368] COND TRUE (int )max2 == (int )id2 [L369] COND TRUE (int )max3 == (int )id3 [L370] COND TRUE (int )st1 == 0 [L371] COND TRUE (int )st2 == 0 [L372] COND TRUE (int )st3 == 0 [L373] COND TRUE (int )nl1 == 0 [L374] COND TRUE (int )nl2 == 0 [L375] COND TRUE (int )nl3 == 0 [L376] COND TRUE (int )mode1 == 0 [L377] COND TRUE (int )mode2 == 0 [L378] COND TRUE (int )mode3 == 0 [L379] tmp___5 = 1 [L461] RET return (tmp___5); [L554] EXPR init() [L554] i2 = init() [L556] p12_old = nomsg [L557] p12_new = nomsg [L558] p13_old = nomsg [L559] p13_new = nomsg [L560] p21_old = nomsg [L561] p21_new = nomsg [L562] p23_old = nomsg [L563] p23_new = nomsg [L564] p31_old = nomsg [L565] p31_new = nomsg [L566] p32_old = nomsg [L567] p32_new = nomsg [L568] i2 = 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=4, id3=5, m1=-2, m2=1, m3=4, max1=2, max2=4, max3=5, 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] [L569] COND TRUE i2 < 6 [L571] CALL node1() [L120] COND FALSE !(\read(mode1)) [L145] COND TRUE (int )r1 < 2 [L146] COND TRUE \read(ep12) [L147] COND TRUE, EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L147] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L149] COND FALSE !(\read(ep13)) [L153] RET mode1 = (_Bool)1 [L571] node1() [L572] 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 TRUE \read(ep23) [L193] COND TRUE, EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L193] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L196] RET mode2 = (_Bool)1 [L572] node2() [L573] CALL node3() [L206] COND FALSE !(\read(mode3)) [L231] COND TRUE (int )r3 < 2 [L232] COND TRUE \read(ep31) [L233] COND TRUE, EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L233] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L235] COND TRUE \read(ep32) [L236] COND TRUE, EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L236] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L239] RET mode3 = (_Bool)1 [L573] node3() [L574] p12_old = p12_new [L575] p12_new = nomsg [L576] p13_old = p13_new [L577] p13_new = nomsg [L578] p21_old = p21_new [L579] p21_new = nomsg [L580] p23_old = p23_new [L581] p23_new = nomsg [L582] p31_old = p31_new [L583] p31_new = nomsg [L584] p32_old = p32_new [L585] p32_new = nomsg [L586] CALL, EXPR check() [L466] int tmp ; VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=4, id3=5, m1=-2, m2=1, m3=4, max1=2, max2=4, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L469] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=4, id3=5, m1=-2, m2=1, m3=4, max1=2, max2=4, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L470] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=4, id3=5, m1=-2, m2=1, m3=4, max1=2, max2=4, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L471] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=4, id3=5, m1=-2, m2=1, m3=4, max1=2, max2=4, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L472] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=4, id3=5, m1=-2, m2=1, m3=4, max1=2, max2=4, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L473] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=4, id3=5, m1=-2, m2=1, m3=4, max1=2, max2=4, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L476] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=4, id3=5, m1=-2, m2=1, m3=4, max1=2, max2=4, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L478] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=4, id3=5, m1=-2, m2=1, m3=4, max1=2, max2=4, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L483] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=4, id3=5, m1=-2, m2=1, m3=4, max1=2, max2=4, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L486] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=4, id3=5, m1=-2, m2=1, m3=4, max1=2, max2=4, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L488] COND TRUE (int )r1 < 2 [L489] tmp = 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=4, id3=5, m1=-2, m2=1, m3=4, max1=2, max2=4, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L517] RET return (tmp); [L586] EXPR check() [L586] c1 = check() [L587] CALL assert(c1) [L599] COND FALSE, RET !(! arg) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=4, id3=5, m1=-2, m2=1, m3=4, max1=2, max2=4, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L587] assert(c1) [L588] i2 ++ VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=4, id3=5, m1=-2, m2=1, m3=4, max1=2, max2=4, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=2, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=4, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L569] COND TRUE i2 < 6 [L571] 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 TRUE \read(ep31) [L130] m1 = p31_old [L131] p31_old = nomsg [L132] COND TRUE (int )m1 > (int )max1 [L133] max1 = m1 [L136] COND FALSE !((int )r1 == 2) [L143] RET mode1 = (_Bool)0 [L571] node1() [L572] CALL node2() [L163] COND TRUE \read(mode2) [L164] r2 = (char )((int )r2 + 1) [L165] COND TRUE \read(ep12) [L166] m2 = p12_old [L167] p12_old = nomsg [L168] COND FALSE !((int )m2 > (int )max2) [L172] COND TRUE \read(ep32) [L173] m2 = p32_old [L174] p32_old = nomsg [L175] COND TRUE (int )m2 > (int )max2 [L176] max2 = m2 [L179] COND FALSE !((int )r2 == 2) [L186] RET mode2 = (_Bool)0 [L572] node2() [L573] CALL node3() [L206] COND TRUE \read(mode3) [L207] r3 = (char )((int )r3 + 1) [L208] COND FALSE !(\read(ep13)) [L215] COND TRUE \read(ep23) [L216] m3 = p23_old [L217] p23_old = nomsg [L218] COND FALSE !((int )m3 > (int )max3) [L222] COND FALSE !((int )r3 == 2) [L229] RET mode3 = (_Bool)0 [L573] node3() [L574] p12_old = p12_new [L575] p12_new = nomsg [L576] p13_old = p13_new [L577] p13_new = nomsg [L578] p21_old = p21_new [L579] p21_new = nomsg [L580] p23_old = p23_new [L581] p23_new = nomsg [L582] p31_old = p31_new [L583] p31_new = nomsg [L584] p32_old = p32_new [L585] p32_new = nomsg [L586] CALL, EXPR check() [L466] int tmp ; VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=4, id3=5, m1=5, m2=5, m3=4, max1=5, max2=5, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L469] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=4, id3=5, m1=5, m2=5, m3=4, max1=5, max2=5, max3=5, 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] [L470] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=4, id3=5, m1=5, m2=5, m3=4, max1=5, max2=5, max3=5, 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] [L471] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=4, id3=5, m1=5, m2=5, m3=4, max1=5, max2=5, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L472] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=4, id3=5, m1=5, m2=5, m3=4, max1=5, max2=5, max3=5, 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] [L473] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=4, id3=5, m1=5, m2=5, m3=4, max1=5, max2=5, max3=5, 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] [L476] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=4, id3=5, m1=5, m2=5, m3=4, max1=5, max2=5, max3=5, 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] [L478] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=4, id3=5, m1=5, m2=5, m3=4, max1=5, max2=5, max3=5, 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] [L483] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=4, id3=5, m1=5, m2=5, m3=4, max1=5, max2=5, max3=5, 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] [L486] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=4, id3=5, m1=5, m2=5, m3=4, max1=5, max2=5, max3=5, 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] [L488] COND TRUE (int )r1 < 2 [L489] tmp = 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=4, id3=5, m1=5, m2=5, m3=4, max1=5, max2=5, max3=5, 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] [L517] RET return (tmp); [L586] EXPR check() [L586] c1 = check() [L587] CALL assert(c1) [L599] COND FALSE, RET !(! arg) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=4, id3=5, m1=5, m2=5, m3=4, max1=5, max2=5, max3=5, 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] [L587] assert(c1) [L588] i2 ++ VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=4, id3=5, m1=5, m2=5, m3=4, max1=5, max2=5, max3=5, 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] [L569] COND TRUE i2 < 6 [L571] CALL node1() [L120] COND FALSE !(\read(mode1)) [L145] COND TRUE (int )r1 < 2 [L146] COND TRUE \read(ep12) [L147] COND TRUE, EXPR max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L147] p12_new = max1 != nomsg && p12_new == nomsg ? max1 : p12_new [L149] COND FALSE !(\read(ep13)) [L153] RET mode1 = (_Bool)1 [L571] node1() [L572] 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 TRUE \read(ep23) [L193] COND TRUE, EXPR max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L193] p23_new = max2 != nomsg && p23_new == nomsg ? max2 : p23_new [L196] RET mode2 = (_Bool)1 [L572] node2() [L573] CALL node3() [L206] COND FALSE !(\read(mode3)) [L231] COND TRUE (int )r3 < 2 [L232] COND TRUE \read(ep31) [L233] COND TRUE, EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L233] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L235] COND TRUE \read(ep32) [L236] COND TRUE, EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L236] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L239] RET mode3 = (_Bool)1 [L573] node3() [L574] p12_old = p12_new [L575] p12_new = nomsg [L576] p13_old = p13_new [L577] p13_new = nomsg [L578] p21_old = p21_new [L579] p21_new = nomsg [L580] p23_old = p23_new [L581] p23_new = nomsg [L582] p31_old = p31_new [L583] p31_new = nomsg [L584] p32_old = p32_new [L585] p32_new = nomsg [L586] CALL, EXPR check() [L466] int tmp ; VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=4, id3=5, m1=5, m2=5, m3=4, max1=5, max2=5, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=5, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L469] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=4, id3=5, m1=5, m2=5, m3=4, max1=5, max2=5, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=5, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L470] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=4, id3=5, m1=5, m2=5, m3=4, max1=5, max2=5, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=5, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L471] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=4, id3=5, m1=5, m2=5, m3=4, max1=5, max2=5, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=5, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L472] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=4, id3=5, m1=5, m2=5, m3=4, max1=5, max2=5, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=5, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L473] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=4, id3=5, m1=5, m2=5, m3=4, max1=5, max2=5, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=5, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L476] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=4, id3=5, m1=5, m2=5, m3=4, max1=5, max2=5, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=5, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L478] COND TRUE (int )r1 < 2 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=4, id3=5, m1=5, m2=5, m3=4, max1=5, max2=5, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=5, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L483] COND FALSE !((int )r1 >= 2) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=4, id3=5, m1=5, m2=5, m3=4, max1=5, max2=5, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=5, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L486] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=4, id3=5, m1=5, m2=5, m3=4, max1=5, max2=5, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=5, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L488] COND TRUE (int )r1 < 2 [L489] tmp = 1 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=4, id3=5, m1=5, m2=5, m3=4, max1=5, max2=5, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=5, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L517] RET return (tmp); [L586] EXPR check() [L586] c1 = check() [L587] CALL assert(c1) [L599] COND FALSE, RET !(! arg) VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=4, id3=5, m1=5, m2=5, m3=4, max1=5, max2=5, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=5, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L587] assert(c1) [L588] i2 ++ VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=4, id3=5, m1=5, m2=5, m3=4, max1=5, max2=5, max3=5, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=5, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=5, p23=0, p23_new=-1, p23_old=5, p31=0, p31_new=-1, p31_old=5, p32=0, p32_new=-1, p32_old=5, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L569] COND TRUE i2 < 6 [L571] 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 TRUE \read(ep31) [L130] m1 = p31_old [L131] p31_old = nomsg [L132] COND FALSE !((int )m1 > (int )max1) [L136] COND TRUE (int )r1 == 2 [L137] COND FALSE !((int )max1 == (int )id1) [L140] st1 = (char)1 [L143] RET mode1 = (_Bool)0 [L571] node1() [L572] CALL node2() [L163] COND TRUE \read(mode2) [L164] r2 = (char )((int )r2 + 1) [L165] COND TRUE \read(ep12) [L166] m2 = p12_old [L167] p12_old = nomsg [L168] COND FALSE !((int )m2 > (int )max2) [L172] COND TRUE \read(ep32) [L173] m2 = p32_old [L174] p32_old = nomsg [L175] COND FALSE !((int )m2 > (int )max2) [L179] COND TRUE (int )r2 == 2 [L180] COND FALSE !((int )max2 == (int )id2) [L183] nl2 = (char)1 [L186] RET mode2 = (_Bool)0 [L572] node2() [L573] CALL node3() [L206] COND TRUE \read(mode3) [L207] r3 = (char )((int )r3 + 1) [L208] COND FALSE !(\read(ep13)) [L215] COND TRUE \read(ep23) [L216] m3 = p23_old [L217] p23_old = nomsg [L218] COND FALSE !((int )m3 > (int )max3) [L222] COND TRUE (int )r3 == 2 [L223] COND TRUE (int )max3 == (int )id3 [L224] st3 = (char)1 [L229] RET mode3 = (_Bool)0 [L573] node3() [L574] p12_old = p12_new [L575] p12_new = nomsg [L576] p13_old = p13_new [L577] p13_new = nomsg [L578] p21_old = p21_new [L579] p21_new = nomsg [L580] p23_old = p23_new [L581] p23_new = nomsg [L582] p31_old = p31_new [L583] p31_new = nomsg [L584] p32_old = p32_new [L585] p32_new = nomsg [L586] CALL, EXPR check() [L466] int tmp ; VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=4, id3=5, m1=5, m2=5, m3=5, max1=5, max2=5, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L469] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L515] tmp = 0 VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=4, id3=5, m1=5, m2=5, m3=5, max1=5, max2=5, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L517] RET return (tmp); [L586] EXPR check() [L586] c1 = check() [L587] CALL assert(c1) [L599] COND TRUE ! arg VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=4, id3=5, m1=5, m2=5, m3=5, max1=5, max2=5, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L601] __VERIFIER_error() VAL [ep12=1, ep13=0, ep21=1, ep23=1, ep31=1, ep32=1, id1=2, id2=4, id3=5, m1=5, m2=5, m3=5, max1=5, max2=5, max3=5, mode1=0, mode2=0, mode3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.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 233.85 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.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 80.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 936.0 MB in the beginning and 1.1 GB in the end (delta: -173.8 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1782.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 66.5 MB). Peak memory consumption was 265.9 MB. Max. memory is 11.5 GB. * CodeCheck took 195449.15 ms. Allocated memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -19.9 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 107.11 ms. Allocated memory is still 2.6 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...