./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f2993ccf-4c24-4a66-a670-5840d0033945/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f2993ccf-4c24-4a66-a670-5840d0033945/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f2993ccf-4c24-4a66-a670-5840d0033945/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f2993ccf-4c24-4a66-a670-5840d0033945/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f2993ccf-4c24-4a66-a670-5840d0033945/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f2993ccf-4c24-4a66-a670-5840d0033945/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 64424a1c8c8e4b1dfa6f86e97492679716532609 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 07:05:40,011 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:05:40,012 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:05:40,019 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:05:40,019 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:05:40,020 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:05:40,021 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:05:40,022 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:05:40,023 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:05:40,024 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:05:40,024 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:05:40,024 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:05:40,025 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:05:40,026 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:05:40,027 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:05:40,027 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:05:40,028 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:05:40,029 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:05:40,030 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:05:40,031 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:05:40,032 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:05:40,033 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:05:40,035 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:05:40,035 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:05:40,035 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:05:40,036 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:05:40,036 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:05:40,037 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:05:40,037 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:05:40,038 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:05:40,038 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:05:40,039 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:05:40,039 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:05:40,039 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:05:40,040 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:05:40,040 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:05:40,040 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f2993ccf-4c24-4a66-a670-5840d0033945/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-10 07:05:40,050 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:05:40,050 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:05:40,051 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 07:05:40,051 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 07:05:40,052 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 07:05:40,052 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 07:05:40,052 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:05:40,052 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 07:05:40,052 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:05:40,052 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 07:05:40,053 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:05:40,053 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 07:05:40,053 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 07:05:40,053 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 07:05:40,053 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 07:05:40,053 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:05:40,054 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 07:05:40,054 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-10 07:05:40,054 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-10 07:05:40,054 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:05:40,054 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 07:05:40,054 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 07:05:40,055 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:05:40,055 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 07:05:40,055 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 07:05:40,055 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-10 07:05:40,055 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 07:05:40,055 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 07:05:40,055 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_f2993ccf-4c24-4a66-a670-5840d0033945/bin-2019/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 64424a1c8c8e4b1dfa6f86e97492679716532609 [2018-11-10 07:05:40,076 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:05:40,084 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:05:40,087 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:05:40,088 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:05:40,088 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:05:40,088 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f2993ccf-4c24-4a66-a670-5840d0033945/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c [2018-11-10 07:05:40,127 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f2993ccf-4c24-4a66-a670-5840d0033945/bin-2019/ukojak/data/f6b535ece/6f724faafec24e3489de75f6632b59bd/FLAG77f06b53a [2018-11-10 07:05:40,552 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:05:40,552 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f2993ccf-4c24-4a66-a670-5840d0033945/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c [2018-11-10 07:05:40,558 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f2993ccf-4c24-4a66-a670-5840d0033945/bin-2019/ukojak/data/f6b535ece/6f724faafec24e3489de75f6632b59bd/FLAG77f06b53a [2018-11-10 07:05:40,567 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f2993ccf-4c24-4a66-a670-5840d0033945/bin-2019/ukojak/data/f6b535ece/6f724faafec24e3489de75f6632b59bd [2018-11-10 07:05:40,569 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:05:40,570 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 07:05:40,570 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:05:40,570 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:05:40,573 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:05:40,573 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:05:40" (1/1) ... [2018-11-10 07:05:40,575 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b52ac19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:40, skipping insertion in model container [2018-11-10 07:05:40,575 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:05:40" (1/1) ... [2018-11-10 07:05:40,581 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:05:40,609 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:05:40,748 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:05:40,754 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:05:40,791 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:05:40,804 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:05:40,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:40 WrapperNode [2018-11-10 07:05:40,805 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:05:40,805 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 07:05:40,805 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 07:05:40,806 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 07:05:40,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:40" (1/1) ... [2018-11-10 07:05:40,860 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:40" (1/1) ... [2018-11-10 07:05:40,884 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 07:05:40,885 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:05:40,885 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:05:40,885 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:05:40,893 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:40" (1/1) ... [2018-11-10 07:05:40,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:40" (1/1) ... [2018-11-10 07:05:40,896 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:40" (1/1) ... [2018-11-10 07:05:40,896 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:40" (1/1) ... [2018-11-10 07:05:40,902 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:40" (1/1) ... [2018-11-10 07:05:40,910 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:40" (1/1) ... [2018-11-10 07:05:40,912 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:40" (1/1) ... [2018-11-10 07:05:40,915 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:05:40,915 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:05:40,915 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:05:40,915 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:05:40,916 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f2993ccf-4c24-4a66-a670-5840d0033945/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 07:05:40,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:05:40,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:05:42,617 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:05:42,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:05:42 BoogieIcfgContainer [2018-11-10 07:05:42,618 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:05:42,618 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-10 07:05:42,618 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-10 07:05:42,625 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-10 07:05:42,625 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:05:42" (1/1) ... [2018-11-10 07:05:42,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:05:42,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:05:42,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 21 states and 33 transitions. [2018-11-10 07:05:42,657 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 33 transitions. [2018-11-10 07:05:42,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-10 07:05:42,676 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:05:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:05:43,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:05:43,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:05:43,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 24 states and 37 transitions. [2018-11-10 07:05:43,184 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions. [2018-11-10 07:05:43,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-10 07:05:43,185 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:05:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:05:43,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:05:43,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:05:43,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 28 states and 45 transitions. [2018-11-10 07:05:43,573 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 45 transitions. [2018-11-10 07:05:43,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-10 07:05:43,574 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:05:43,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:05:43,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:05:43,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:05:43,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 33 states and 55 transitions. [2018-11-10 07:05:43,939 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 55 transitions. [2018-11-10 07:05:43,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-10 07:05:43,942 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:05:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:05:44,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:05:44,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:05:44,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 39 states and 67 transitions. [2018-11-10 07:05:44,553 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 67 transitions. [2018-11-10 07:05:44,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-10 07:05:44,553 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:05:44,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:05:44,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:05:45,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:05:45,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 47 states and 81 transitions. [2018-11-10 07:05:45,338 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 81 transitions. [2018-11-10 07:05:45,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 07:05:45,339 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:05:45,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:05:45,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:05:46,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:05:46,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 54 states and 94 transitions. [2018-11-10 07:05:46,035 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 94 transitions. [2018-11-10 07:05:46,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 07:05:46,035 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:05:46,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:05:46,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:05:46,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:05:46,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 55 states and 94 transitions. [2018-11-10 07:05:46,237 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 94 transitions. [2018-11-10 07:05:46,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 07:05:46,237 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:05:46,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:05:46,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:05:46,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:05:46,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 56 states and 95 transitions. [2018-11-10 07:05:46,289 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 95 transitions. [2018-11-10 07:05:46,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 07:05:46,289 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:05:46,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:05:46,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:05:47,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:05:47,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 67 states and 114 transitions. [2018-11-10 07:05:47,573 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 114 transitions. [2018-11-10 07:05:47,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 07:05:47,574 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:05:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:05:47,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:05:47,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:05:47,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 70 states and 120 transitions. [2018-11-10 07:05:47,909 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 120 transitions. [2018-11-10 07:05:47,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 07:05:47,910 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:05:47,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:05:48,342 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:05:50,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:05:50,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 88 states and 152 transitions. [2018-11-10 07:05:50,578 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 152 transitions. [2018-11-10 07:05:50,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 07:05:50,579 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:05:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:05:50,931 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:05:52,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:05:52,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 102 states and 175 transitions. [2018-11-10 07:05:52,853 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 175 transitions. [2018-11-10 07:05:52,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 07:05:52,854 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:05:52,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:05:53,030 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:05:53,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:05:53,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 103 states and 176 transitions. [2018-11-10 07:05:53,232 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 176 transitions. [2018-11-10 07:05:53,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 07:05:53,233 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:05:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:05:53,550 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:05:55,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:05:55,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 117 states and 200 transitions. [2018-11-10 07:05:55,804 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 200 transitions. [2018-11-10 07:05:55,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 07:05:55,805 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:05:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:05:55,917 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:05:56,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:05:56,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 118 states and 202 transitions. [2018-11-10 07:05:56,318 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 202 transitions. [2018-11-10 07:05:56,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 07:05:56,319 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:05:56,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:05:56,479 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:05:56,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:05:56,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 119 states and 203 transitions. [2018-11-10 07:05:56,699 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 203 transitions. [2018-11-10 07:05:56,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 07:05:56,700 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:05:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:05:56,808 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:05:57,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:05:57,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 120 states and 205 transitions. [2018-11-10 07:05:57,136 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 205 transitions. [2018-11-10 07:05:57,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 07:05:57,137 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:05:57,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:05:57,498 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:06:01,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:06:01,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 141 states and 246 transitions. [2018-11-10 07:06:01,403 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 246 transitions. [2018-11-10 07:06:01,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 07:06:01,403 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:06:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:06:01,478 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:06:02,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:06:02,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 143 states and 250 transitions. [2018-11-10 07:06:02,345 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 250 transitions. [2018-11-10 07:06:02,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 07:06:02,345 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:06:02,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:06:02,427 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:06:03,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:06:03,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 145 states and 254 transitions. [2018-11-10 07:06:03,032 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 254 transitions. [2018-11-10 07:06:03,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 07:06:03,032 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:06:03,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:06:03,092 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:06:03,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:06:03,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 147 states and 258 transitions. [2018-11-10 07:06:03,665 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 258 transitions. [2018-11-10 07:06:03,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 07:06:03,666 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:06:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:06:04,445 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:06:07,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:06:07,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 158 states and 282 transitions. [2018-11-10 07:06:07,620 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 282 transitions. [2018-11-10 07:06:07,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 07:06:07,620 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:06:07,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:06:07,957 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:06:09,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:06:09,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 162 states and 292 transitions. [2018-11-10 07:06:09,310 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 292 transitions. [2018-11-10 07:06:09,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 07:06:09,310 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:06:09,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:06:09,639 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:06:10,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:06:10,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 165 states and 298 transitions. [2018-11-10 07:06:10,632 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 298 transitions. [2018-11-10 07:06:10,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 07:06:10,632 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:06:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:06:10,888 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:06:11,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:06:11,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 170 states and 307 transitions. [2018-11-10 07:06:11,920 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 307 transitions. [2018-11-10 07:06:11,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 07:06:11,921 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:06:11,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:06:12,047 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:06:13,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:06:13,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 174 states and 315 transitions. [2018-11-10 07:06:13,128 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 315 transitions. [2018-11-10 07:06:13,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 07:06:13,128 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:06:13,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:06:13,247 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:06:13,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:06:13,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 175 states and 316 transitions. [2018-11-10 07:06:13,571 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 316 transitions. [2018-11-10 07:06:13,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 07:06:13,571 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:06:13,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:06:13,718 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:06:14,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:06:14,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 177 states and 319 transitions. [2018-11-10 07:06:14,326 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 319 transitions. [2018-11-10 07:06:14,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 07:06:14,327 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:06:14,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:06:14,458 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:06:15,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:06:15,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 179 states and 322 transitions. [2018-11-10 07:06:15,015 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 322 transitions. [2018-11-10 07:06:15,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 07:06:15,016 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:06:15,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:06:16,042 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:06:19,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:06:19,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 189 states and 345 transitions. [2018-11-10 07:06:19,505 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 345 transitions. [2018-11-10 07:06:19,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 07:06:19,505 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:06:19,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:06:19,634 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:06:21,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:06:21,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 194 states and 353 transitions. [2018-11-10 07:06:21,061 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 353 transitions. [2018-11-10 07:06:21,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 07:06:21,061 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:06:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:06:21,246 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:06:22,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:06:22,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 197 states and 358 transitions. [2018-11-10 07:06:22,122 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 358 transitions. [2018-11-10 07:06:22,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 07:06:22,122 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:06:22,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:06:22,241 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:06:22,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:06:22,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 199 states and 362 transitions. [2018-11-10 07:06:22,728 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 362 transitions. [2018-11-10 07:06:22,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 07:06:22,728 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:06:22,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:06:23,739 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:06:28,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:06:28,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 214 states and 423 transitions. [2018-11-10 07:06:28,811 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 423 transitions. [2018-11-10 07:06:28,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 07:06:28,812 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:06:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:06:29,130 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:06:30,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:06:30,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 219 states and 433 transitions. [2018-11-10 07:06:30,806 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 433 transitions. [2018-11-10 07:06:30,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 07:06:30,807 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:06:30,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:06:31,096 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:06:32,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:06:32,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 221 states and 436 transitions. [2018-11-10 07:06:32,032 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 436 transitions. [2018-11-10 07:06:32,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 07:06:32,033 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:06:32,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:06:32,417 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:06:32,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:06:32,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 222 states and 437 transitions. [2018-11-10 07:06:32,841 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 437 transitions. [2018-11-10 07:06:32,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 07:06:32,841 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:06:32,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:06:33,111 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:06:33,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:06:33,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 224 states and 439 transitions. [2018-11-10 07:06:33,557 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 439 transitions. [2018-11-10 07:06:33,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 07:06:33,557 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:06:33,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:06:33,836 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:06:34,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:06:34,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 226 states and 441 transitions. [2018-11-10 07:06:34,290 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 441 transitions. [2018-11-10 07:06:34,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 07:06:34,291 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:06:34,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:06:35,197 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:06:39,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:06:39,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 237 states and 466 transitions. [2018-11-10 07:06:39,652 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 466 transitions. [2018-11-10 07:06:39,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 07:06:39,653 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:06:39,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:06:39,852 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:06:40,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:06:40,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 240 states and 469 transitions. [2018-11-10 07:06:40,813 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 469 transitions. [2018-11-10 07:06:40,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 07:06:40,813 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:06:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:06:41,039 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:06:41,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:06:41,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 241 states and 470 transitions. [2018-11-10 07:06:41,861 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 470 transitions. [2018-11-10 07:06:41,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 07:06:41,862 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:06:41,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:06:42,152 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:06:42,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:06:42,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 239 states and 467 transitions. [2018-11-10 07:06:42,603 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 467 transitions. [2018-11-10 07:06:42,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 07:06:42,604 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:06:42,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:06:42,815 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:06:43,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:06:43,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 240 states and 468 transitions. [2018-11-10 07:06:43,210 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 468 transitions. [2018-11-10 07:06:43,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-10 07:06:43,211 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:06:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:06:43,427 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:06:43,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:06:43,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 234 states and 461 transitions. [2018-11-10 07:06:43,810 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 461 transitions. [2018-11-10 07:06:43,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 07:06:43,811 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:06:43,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:06:45,086 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:06:50,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:06:50,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 245 states and 486 transitions. [2018-11-10 07:06:50,177 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 486 transitions. [2018-11-10 07:06:50,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 07:06:50,178 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:06:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:06:50,426 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:06:51,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:06:51,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 246 states and 486 transitions. [2018-11-10 07:06:51,469 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 486 transitions. [2018-11-10 07:06:51,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 07:06:51,470 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:06:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:06:51,716 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:06:53,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:06:53,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 244 states and 489 transitions. [2018-11-10 07:06:53,230 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 489 transitions. [2018-11-10 07:06:53,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 07:06:53,230 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:06:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:06:54,420 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:07:00,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:07:00,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 259 states and 526 transitions. [2018-11-10 07:07:00,581 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 526 transitions. [2018-11-10 07:07:00,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 07:07:00,582 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:07:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:07:00,836 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:07:01,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:07:01,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 261 states and 533 transitions. [2018-11-10 07:07:01,354 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 533 transitions. [2018-11-10 07:07:01,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 07:07:01,355 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:07:01,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:07:01,593 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:07:03,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:07:03,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 266 states and 541 transitions. [2018-11-10 07:07:03,565 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 541 transitions. [2018-11-10 07:07:03,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 07:07:03,566 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:07:03,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:07:03,812 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:07:04,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:07:04,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 269 states and 546 transitions. [2018-11-10 07:07:04,926 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 546 transitions. [2018-11-10 07:07:04,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 07:07:04,926 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:07:04,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:07:05,193 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:07:06,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:07:06,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 272 states and 554 transitions. [2018-11-10 07:07:06,315 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 554 transitions. [2018-11-10 07:07:06,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 07:07:06,316 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:07:06,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:07:06,573 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:07:07,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:07:07,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 274 states and 557 transitions. [2018-11-10 07:07:07,121 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 557 transitions. [2018-11-10 07:07:07,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 07:07:07,121 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:07:07,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:07:07,363 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:07:07,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:07:07,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 275 states and 558 transitions. [2018-11-10 07:07:07,822 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 558 transitions. [2018-11-10 07:07:07,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 07:07:07,822 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:07:07,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:07:09,148 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:07:13,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:07:13,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 281 states and 574 transitions. [2018-11-10 07:07:13,219 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 574 transitions. [2018-11-10 07:07:13,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 07:07:13,220 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:07:13,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:07:13,501 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:07:14,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:07:14,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 283 states and 580 transitions. [2018-11-10 07:07:14,056 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 580 transitions. [2018-11-10 07:07:14,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 07:07:14,056 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:07:14,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:07:14,355 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:07:15,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:07:15,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 285 states and 586 transitions. [2018-11-10 07:07:15,032 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 586 transitions. [2018-11-10 07:07:15,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 07:07:15,033 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:07:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:07:15,410 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:07:17,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:07:17,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 290 states and 597 transitions. [2018-11-10 07:07:17,400 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 597 transitions. [2018-11-10 07:07:17,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 07:07:17,401 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:07:17,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:07:17,658 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:07:18,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:07:18,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 292 states and 600 transitions. [2018-11-10 07:07:18,211 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 600 transitions. [2018-11-10 07:07:18,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 07:07:18,211 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:07:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:07:18,430 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:07:18,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:07:18,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 294 states and 603 transitions. [2018-11-10 07:07:18,949 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 603 transitions. [2018-11-10 07:07:18,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 07:07:18,949 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:07:19,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:07:19,187 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:07:19,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:07:19,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 296 states and 609 transitions. [2018-11-10 07:07:19,719 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 609 transitions. [2018-11-10 07:07:19,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 07:07:19,719 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:07:19,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:07:20,398 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:07:25,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:07:25,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 304 states and 625 transitions. [2018-11-10 07:07:25,572 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 625 transitions. [2018-11-10 07:07:25,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 07:07:25,573 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:07:25,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:07:25,852 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:07:27,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:07:27,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 308 states and 632 transitions. [2018-11-10 07:07:27,705 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 632 transitions. [2018-11-10 07:07:27,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 07:07:27,705 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:07:27,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:07:27,969 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:07:29,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:07:29,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 313 states and 647 transitions. [2018-11-10 07:07:29,894 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 647 transitions. [2018-11-10 07:07:29,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 07:07:29,894 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:07:29,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:07:30,156 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:07:30,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:07:30,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 314 states and 647 transitions. [2018-11-10 07:07:30,837 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 647 transitions. [2018-11-10 07:07:30,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 07:07:30,837 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:07:30,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:07:31,097 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:07:31,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:07:31,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 316 states and 650 transitions. [2018-11-10 07:07:31,667 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 650 transitions. [2018-11-10 07:07:31,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 07:07:31,667 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:07:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:07:31,932 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:07:33,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:07:33,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 320 states and 663 transitions. [2018-11-10 07:07:33,250 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 663 transitions. [2018-11-10 07:07:33,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-10 07:07:33,251 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:07:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:07:33,563 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 07:07:34,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:07:34,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 319 states and 647 transitions. [2018-11-10 07:07:34,428 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 647 transitions. [2018-11-10 07:07:34,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-10 07:07:34,428 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:07:34,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:07:34,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:07:35,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:07:35,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:07:35,298 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 70 iterations. [2018-11-10 07:07:35,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 10.11 07:07:35 ImpRootNode [2018-11-10 07:07:35,397 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-10 07:07:35,398 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:07:35,398 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:07:35,399 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:07:35,399 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:05:42" (3/4) ... [2018-11-10 07:07:35,401 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 07:07:35,507 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f2993ccf-4c24-4a66-a670-5840d0033945/bin-2019/ukojak/witness.graphml [2018-11-10 07:07:35,508 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:07:35,508 INFO L168 Benchmark]: Toolchain (without parser) took 114938.84 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.8 GB). Free memory was 960.3 MB in the beginning and 2.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 577.3 MB. Max. memory is 11.5 GB. [2018-11-10 07:07:35,509 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:07:35,509 INFO L168 Benchmark]: CACSL2BoogieTranslator took 234.79 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 940.5 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2018-11-10 07:07:35,510 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 940.5 MB in the beginning and 1.1 GB in the end (delta: -191.9 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2018-11-10 07:07:35,510 INFO L168 Benchmark]: Boogie Preprocessor took 30.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-10 07:07:35,510 INFO L168 Benchmark]: RCFGBuilder took 1702.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 800.4 MB in the end (delta: 328.5 MB). Peak memory consumption was 328.5 MB. Max. memory is 11.5 GB. [2018-11-10 07:07:35,510 INFO L168 Benchmark]: CodeCheck took 112779.71 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 800.4 MB in the beginning and 2.2 GB in the end (delta: -1.4 GB). Peak memory consumption was 278.9 MB. Max. memory is 11.5 GB. [2018-11-10 07:07:35,511 INFO L168 Benchmark]: Witness Printer took 109.89 ms. Allocated memory is still 2.8 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 8.2 kB). Peak memory consumption was 8.2 kB. Max. memory is 11.5 GB. [2018-11-10 07:07:35,512 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, 136 locations, 1 error locations. UNSAFE Result, 112.6s OverallTime, 70 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: -1008402728 SDtfs, -1971250090 SDslu, -570989408 SDs, 0 SdLazy, 384636192 SolverSat, -825449878 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 118.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22116 GetRequests, 19740 SyntacticMatches, 1338 SemanticMatches, 1038 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 683420 ImplicationChecksByTransitivity, 101.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 4.1s SatisfiabilityAnalysisTime, 17.3s InterpolantComputationTime, 2237 NumberOfCodeBlocks, 2237 NumberOfCodeBlocksAsserted, 70 NumberOfCheckSat, 2116 ConstructedInterpolants, 0 QuantifiedInterpolants, 727384 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 69 InterpolantComputations, 10 PerfectInterpolantSequences, 287/1359 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 619]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [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] _Bool newmax1 ; [L102] char id2 ; [L103] char r2 ; [L104] char st2 ; [L105] char nl2 ; [L106] char m2 ; [L107] char max2 ; [L108] _Bool mode2 ; [L109] _Bool newmax2 ; [L110] char id3 ; [L111] char r3 ; [L112] char st3 ; [L113] char nl3 ; [L114] char m3 ; [L115] char max3 ; [L116] _Bool mode3 ; [L117] _Bool newmax3 ; [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 ; [L271] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L537] int c1 ; [L538] int i2 ; [L541] c1 = 0 [L542] ep12 = __VERIFIER_nondet_bool() [L543] ep13 = __VERIFIER_nondet_bool() [L544] ep21 = __VERIFIER_nondet_bool() [L545] ep23 = __VERIFIER_nondet_bool() [L546] ep31 = __VERIFIER_nondet_bool() [L547] ep32 = __VERIFIER_nondet_bool() [L548] id1 = __VERIFIER_nondet_char() [L549] r1 = __VERIFIER_nondet_char() [L550] st1 = __VERIFIER_nondet_char() [L551] nl1 = __VERIFIER_nondet_char() [L552] m1 = __VERIFIER_nondet_char() [L553] max1 = __VERIFIER_nondet_char() [L554] mode1 = __VERIFIER_nondet_bool() [L555] newmax1 = __VERIFIER_nondet_bool() [L556] id2 = __VERIFIER_nondet_char() [L557] r2 = __VERIFIER_nondet_char() [L558] st2 = __VERIFIER_nondet_char() [L559] nl2 = __VERIFIER_nondet_char() [L560] m2 = __VERIFIER_nondet_char() [L561] max2 = __VERIFIER_nondet_char() [L562] mode2 = __VERIFIER_nondet_bool() [L563] newmax2 = __VERIFIER_nondet_bool() [L564] id3 = __VERIFIER_nondet_char() [L565] r3 = __VERIFIER_nondet_char() [L566] st3 = __VERIFIER_nondet_char() [L567] nl3 = __VERIFIER_nondet_char() [L568] m3 = __VERIFIER_nondet_char() [L569] max3 = __VERIFIER_nondet_char() [L570] mode3 = __VERIFIER_nondet_bool() [L571] newmax3 = __VERIFIER_nondet_bool() [L572] CALL, EXPR init() [L274] _Bool r121 ; [L275] _Bool r131 ; [L276] _Bool r211 ; [L277] _Bool r231 ; [L278] _Bool r311 ; [L279] _Bool r321 ; [L280] _Bool r122 ; [L281] int tmp ; [L282] _Bool r132 ; [L283] int tmp___0 ; [L284] _Bool r212 ; [L285] int tmp___1 ; [L286] _Bool r232 ; [L287] int tmp___2 ; [L288] _Bool r312 ; [L289] int tmp___3 ; [L290] _Bool r322 ; [L291] int tmp___4 ; [L292] int tmp___5 ; [L295] r121 = ep12 [L296] r131 = ep13 [L297] r211 = ep21 [L298] r231 = ep23 [L299] r311 = ep31 [L300] r321 = ep32 [L301] COND FALSE !(\read(r121)) [L304] COND TRUE \read(r131) [L305] COND FALSE !(\read(ep32)) [L308] tmp = 0 [L313] r122 = (_Bool )tmp [L314] COND TRUE \read(r131) [L315] tmp___0 = 1 [L326] r132 = (_Bool )tmp___0 [L327] COND FALSE !(\read(r211)) [L330] COND FALSE !(\read(r231)) [L337] tmp___1 = 0 [L339] r212 = (_Bool )tmp___1 [L340] COND FALSE !(\read(r231)) [L343] COND FALSE !(\read(r211)) [L350] tmp___2 = 0 [L352] r232 = (_Bool )tmp___2 [L353] COND TRUE \read(r311) [L354] tmp___3 = 1 [L365] r312 = (_Bool )tmp___3 [L366] COND FALSE !(\read(r321)) [L369] COND TRUE \read(r311) [L370] COND FALSE !(\read(ep12)) [L373] tmp___4 = 0 [L378] r322 = (_Bool )tmp___4 [L379] COND TRUE (int )id1 != (int )id2 [L380] COND TRUE (int )id1 != (int )id3 [L381] COND TRUE (int )id2 != (int )id3 [L382] COND TRUE (int )id1 >= 0 [L383] COND TRUE (int )id2 >= 0 [L384] COND TRUE (int )id3 >= 0 [L385] COND TRUE (int )r1 == 0 [L386] COND TRUE (int )r2 == 0 [L387] COND TRUE (int )r3 == 0 [L388] COND TRUE (int )max1 == (int )id1 [L389] COND TRUE (int )max2 == (int )id2 [L390] COND TRUE (int )max3 == (int )id3 [L391] COND TRUE (int )st1 == 0 [L392] COND TRUE (int )st2 == 0 [L393] COND TRUE (int )st3 == 0 [L394] COND TRUE (int )nl1 == 0 [L395] COND TRUE (int )nl2 == 0 [L396] COND TRUE (int )nl3 == 0 [L397] COND TRUE (int )mode1 == 0 [L398] COND TRUE (int )mode2 == 0 [L399] COND TRUE (int )mode3 == 0 [L400] COND TRUE \read(newmax1) [L401] COND TRUE \read(newmax2) [L402] COND TRUE \read(newmax3) [L403] tmp___5 = 1 [L476] RET return (tmp___5); [L572] EXPR init() [L572] i2 = init() [L574] p12_old = nomsg [L575] p12_new = nomsg [L576] p13_old = nomsg [L577] p13_new = nomsg [L578] p21_old = nomsg [L579] p21_new = nomsg [L580] p23_old = nomsg [L581] p23_new = nomsg [L582] p31_old = nomsg [L583] p31_new = nomsg [L584] p32_old = nomsg [L585] p32_new = nomsg [L586] i2 = 0 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=126, id3=1, m1=0, m2=127, m3=-2, max1=2, max2=126, max3=1, mode1=0, mode2=0, mode3=0, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L587] COND TRUE i2 < 6 [L589] CALL node1() [L120] _Bool newmax ; [L123] newmax = (_Bool)0 [L124] COND FALSE !(\read(mode1)) [L152] COND TRUE (int )r1 < 2 [L153] COND FALSE !(\read(ep12)) [L158] COND TRUE \read(ep13) [L159] COND TRUE \read(newmax1) [L160] COND TRUE, EXPR max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L160] p13_new = max1 != nomsg && p13_new == nomsg ? max1 : p13_new [L164] RET mode1 = (_Bool)1 [L589] node1() [L590] CALL node2() [L171] _Bool newmax ; [L174] newmax = (_Bool)0 [L175] COND FALSE !(\read(mode2)) [L203] COND TRUE (int )r2 < 2 [L204] COND FALSE !(\read(ep21)) [L209] COND FALSE !(\read(ep23)) [L215] RET mode2 = (_Bool)1 [L590] node2() [L591] CALL node3() [L222] _Bool newmax ; [L225] newmax = (_Bool)0 [L226] COND FALSE !(\read(mode3)) [L254] COND TRUE (int )r3 < 2 [L255] COND TRUE \read(ep31) [L256] COND TRUE \read(newmax3) [L257] COND TRUE, EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L257] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L260] COND FALSE !(\read(ep32)) [L266] RET mode3 = (_Bool)1 [L591] node3() [L592] p12_old = p12_new [L593] p12_new = nomsg [L594] p13_old = p13_new [L595] p13_new = nomsg [L596] p21_old = p21_new [L597] p21_new = nomsg [L598] p23_old = p23_new [L599] p23_new = nomsg [L600] p31_old = p31_new [L601] p31_new = nomsg [L602] p32_old = p32_new [L603] p32_new = nomsg [L604] CALL, EXPR check() [L481] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=126, id3=1, m1=0, m2=127, m3=-2, max1=2, max2=126, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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] [L484] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=126, id3=1, m1=0, m2=127, m3=-2, max1=2, max2=126, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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] [L485] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=126, id3=1, m1=0, m2=127, m3=-2, max1=2, max2=126, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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] [L486] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=126, id3=1, m1=0, m2=127, m3=-2, max1=2, max2=126, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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] [L487] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=126, id3=1, m1=0, m2=127, m3=-2, max1=2, max2=126, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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] [L488] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=126, id3=1, m1=0, m2=127, m3=-2, max1=2, max2=126, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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] [L491] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=126, id3=1, m1=0, m2=127, m3=-2, max1=2, max2=126, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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] [L493] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=126, id3=1, m1=0, m2=127, m3=-2, max1=2, max2=126, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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] [L498] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=126, id3=1, m1=0, m2=127, m3=-2, max1=2, max2=126, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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] [L501] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=126, id3=1, m1=0, m2=127, m3=-2, max1=2, max2=126, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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] [L503] COND TRUE (int )r1 < 2 [L504] tmp = 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=126, id3=1, m1=0, m2=127, m3=-2, max1=2, max2=126, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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] [L532] RET return (tmp); [L604] EXPR check() [L604] c1 = check() [L605] CALL assert(c1) [L617] COND FALSE, RET !(! arg) VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=126, id3=1, m1=0, m2=127, m3=-2, max1=2, max2=126, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, 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] [L605] assert(c1) [L606] i2 ++ VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=126, id3=1, m1=0, m2=127, m3=-2, max1=2, max2=126, max3=1, mode1=1, mode2=1, mode3=1, newmax1=1, newmax2=1, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=2, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L587] COND TRUE i2 < 6 [L589] CALL node1() [L120] _Bool newmax ; [L123] newmax = (_Bool)0 [L124] COND TRUE \read(mode1) [L125] r1 = (char )((int )r1 + 1) [L126] COND FALSE !(\read(ep21)) [L134] COND TRUE \read(ep31) [L135] m1 = p31_old [L136] p31_old = nomsg [L137] COND FALSE !((int )m1 > (int )max1) [L142] newmax1 = newmax [L143] COND FALSE !((int )r1 == 2) [L150] RET mode1 = (_Bool)0 [L589] node1() [L590] CALL node2() [L171] _Bool newmax ; [L174] newmax = (_Bool)0 [L175] COND TRUE \read(mode2) [L176] r2 = (char )((int )r2 + 1) [L177] COND FALSE !(\read(ep12)) [L185] COND FALSE !(\read(ep32)) [L193] newmax2 = newmax [L194] COND FALSE !((int )r2 == 2) [L201] RET mode2 = (_Bool)0 [L590] node2() [L591] CALL node3() [L222] _Bool newmax ; [L225] newmax = (_Bool)0 [L226] COND TRUE \read(mode3) [L227] r3 = (char )((int )r3 + 1) [L228] COND TRUE \read(ep13) [L229] m3 = p13_old [L230] p13_old = nomsg [L231] COND TRUE (int )m3 > (int )max3 [L232] max3 = m3 [L233] newmax = (_Bool)1 [L236] COND FALSE !(\read(ep23)) [L244] newmax3 = newmax [L245] COND FALSE !((int )r3 == 2) [L252] RET mode3 = (_Bool)0 [L591] node3() [L592] p12_old = p12_new [L593] p12_new = nomsg [L594] p13_old = p13_new [L595] p13_new = nomsg [L596] p21_old = p21_new [L597] p21_new = nomsg [L598] p23_old = p23_new [L599] p23_new = nomsg [L600] p31_old = p31_new [L601] p31_new = nomsg [L602] p32_old = p32_new [L603] p32_new = nomsg [L604] CALL, EXPR check() [L481] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=126, id3=1, m1=1, m2=127, m3=2, max1=2, max2=126, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L484] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=126, id3=1, m1=1, m2=127, m3=2, max1=2, max2=126, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L485] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=126, id3=1, m1=1, m2=127, m3=2, max1=2, max2=126, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L486] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=126, id3=1, m1=1, m2=127, m3=2, max1=2, max2=126, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L487] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=126, id3=1, m1=1, m2=127, m3=2, max1=2, max2=126, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L488] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=126, id3=1, m1=1, m2=127, m3=2, max1=2, max2=126, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L491] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=126, id3=1, m1=1, m2=127, m3=2, max1=2, max2=126, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L493] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=126, id3=1, m1=1, m2=127, m3=2, max1=2, max2=126, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L498] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=126, id3=1, m1=1, m2=127, m3=2, max1=2, max2=126, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L501] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=126, id3=1, m1=1, m2=127, m3=2, max1=2, max2=126, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L503] COND TRUE (int )r1 < 2 [L504] tmp = 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=126, id3=1, m1=1, m2=127, m3=2, max1=2, max2=126, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L532] RET return (tmp); [L604] EXPR check() [L604] c1 = check() [L605] CALL assert(c1) [L617] COND FALSE, RET !(! arg) VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=126, id3=1, m1=1, m2=127, m3=2, max1=2, max2=126, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L605] assert(c1) [L606] i2 ++ VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=126, id3=1, m1=1, m2=127, m3=2, max1=2, max2=126, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L587] COND TRUE i2 < 6 [L589] CALL node1() [L120] _Bool newmax ; [L123] newmax = (_Bool)0 [L124] COND FALSE !(\read(mode1)) [L152] COND TRUE (int )r1 < 2 [L153] COND FALSE !(\read(ep12)) [L158] COND TRUE \read(ep13) [L159] COND FALSE !(\read(newmax1)) [L164] RET mode1 = (_Bool)1 [L589] node1() [L590] CALL node2() [L171] _Bool newmax ; [L174] newmax = (_Bool)0 [L175] COND FALSE !(\read(mode2)) [L203] COND TRUE (int )r2 < 2 [L204] COND FALSE !(\read(ep21)) [L209] COND FALSE !(\read(ep23)) [L215] RET mode2 = (_Bool)1 [L590] node2() [L591] CALL node3() [L222] _Bool newmax ; [L225] newmax = (_Bool)0 [L226] COND FALSE !(\read(mode3)) [L254] COND TRUE (int )r3 < 2 [L255] COND TRUE \read(ep31) [L256] COND TRUE \read(newmax3) [L257] COND TRUE, EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L257] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L260] COND FALSE !(\read(ep32)) [L266] RET mode3 = (_Bool)1 [L591] node3() [L592] p12_old = p12_new [L593] p12_new = nomsg [L594] p13_old = p13_new [L595] p13_new = nomsg [L596] p21_old = p21_new [L597] p21_new = nomsg [L598] p23_old = p23_new [L599] p23_new = nomsg [L600] p31_old = p31_new [L601] p31_new = nomsg [L602] p32_old = p32_new [L603] p32_new = nomsg [L604] CALL, EXPR check() [L481] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=126, id3=1, m1=1, m2=127, m3=2, max1=2, max2=126, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L484] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=126, id3=1, m1=1, m2=127, m3=2, max1=2, max2=126, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L485] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=126, id3=1, m1=1, m2=127, m3=2, max1=2, max2=126, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L486] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=126, id3=1, m1=1, m2=127, m3=2, max1=2, max2=126, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L487] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=126, id3=1, m1=1, m2=127, m3=2, max1=2, max2=126, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L488] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=126, id3=1, m1=1, m2=127, m3=2, max1=2, max2=126, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L491] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=126, id3=1, m1=1, m2=127, m3=2, max1=2, max2=126, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L493] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=126, id3=1, m1=1, m2=127, m3=2, max1=2, max2=126, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L498] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=126, id3=1, m1=1, m2=127, m3=2, max1=2, max2=126, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L501] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=126, id3=1, m1=1, m2=127, m3=2, max1=2, max2=126, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L503] COND TRUE (int )r1 < 2 [L504] tmp = 1 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=126, id3=1, m1=1, m2=127, m3=2, max1=2, max2=126, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L532] RET return (tmp); [L604] EXPR check() [L604] c1 = check() [L605] CALL assert(c1) [L617] COND FALSE, RET !(! arg) VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=126, id3=1, m1=1, m2=127, m3=2, max1=2, max2=126, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L605] assert(c1) [L606] i2 ++ VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=126, id3=1, m1=1, m2=127, m3=2, max1=2, max2=126, max3=2, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=0, newmax3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=2, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L587] COND TRUE i2 < 6 [L589] CALL node1() [L120] _Bool newmax ; [L123] newmax = (_Bool)0 [L124] COND TRUE \read(mode1) [L125] r1 = (char )((int )r1 + 1) [L126] COND FALSE !(\read(ep21)) [L134] COND TRUE \read(ep31) [L135] m1 = p31_old [L136] p31_old = nomsg [L137] COND FALSE !((int )m1 > (int )max1) [L142] newmax1 = newmax [L143] COND TRUE (int )r1 == 2 [L144] COND TRUE (int )max1 == (int )id1 [L145] st1 = (char)1 [L150] RET mode1 = (_Bool)0 [L589] node1() [L590] CALL node2() [L171] _Bool newmax ; [L174] newmax = (_Bool)0 [L175] COND TRUE \read(mode2) [L176] r2 = (char )((int )r2 + 1) [L177] COND FALSE !(\read(ep12)) [L185] COND FALSE !(\read(ep32)) [L193] newmax2 = newmax [L194] COND TRUE (int )r2 == 2 [L195] COND TRUE (int )max2 == (int )id2 [L196] st2 = (char)1 [L201] RET mode2 = (_Bool)0 [L590] node2() [L591] CALL node3() [L222] _Bool newmax ; [L225] newmax = (_Bool)0 [L226] COND TRUE \read(mode3) [L227] r3 = (char )((int )r3 + 1) [L228] COND TRUE \read(ep13) [L229] m3 = p13_old [L230] p13_old = nomsg [L231] COND FALSE !((int )m3 > (int )max3) [L236] COND FALSE !(\read(ep23)) [L244] newmax3 = newmax [L245] COND TRUE (int )r3 == 2 [L246] COND FALSE !((int )max3 == (int )id3) [L249] nl3 = (char)1 [L252] RET mode3 = (_Bool)0 [L591] node3() [L592] p12_old = p12_new [L593] p12_new = nomsg [L594] p13_old = p13_new [L595] p13_new = nomsg [L596] p21_old = p21_new [L597] p21_new = nomsg [L598] p23_old = p23_new [L599] p23_new = nomsg [L600] p31_old = p31_new [L601] p31_new = nomsg [L602] p32_old = p32_new [L603] p32_new = nomsg [L604] CALL, EXPR check() [L481] int tmp ; VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=126, id3=1, m1=2, m2=127, m3=-1, max1=2, max2=126, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L484] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L530] tmp = 0 VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=126, id3=1, m1=2, m2=127, m3=-1, max1=2, max2=126, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L532] RET return (tmp); [L604] EXPR check() [L604] c1 = check() [L605] CALL assert(c1) [L617] COND TRUE ! arg VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=126, id3=1, m1=2, m2=127, m3=-1, max1=2, max2=126, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] [L619] __VERIFIER_error() VAL [ep12=0, ep13=1, ep21=0, ep23=0, ep31=1, ep32=0, id1=2, id2=126, id3=1, m1=2, m2=127, m3=-1, max1=2, max2=126, max3=2, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=0, nl3=1, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 234.79 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 940.5 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 79.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 940.5 MB in the beginning and 1.1 GB in the end (delta: -191.9 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1702.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 800.4 MB in the end (delta: 328.5 MB). Peak memory consumption was 328.5 MB. Max. memory is 11.5 GB. * CodeCheck took 112779.71 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 800.4 MB in the beginning and 2.2 GB in the end (delta: -1.4 GB). Peak memory consumption was 278.9 MB. Max. memory is 11.5 GB. * Witness Printer took 109.89 ms. Allocated memory is still 2.8 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 8.2 kB). Peak memory consumption was 8.2 kB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...