./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9ddd7533-78d0-413c-af65-450cb6b28282/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9ddd7533-78d0-413c-af65-450cb6b28282/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9ddd7533-78d0-413c-af65-450cb6b28282/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9ddd7533-78d0-413c-af65-450cb6b28282/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9ddd7533-78d0-413c-af65-450cb6b28282/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9ddd7533-78d0-413c-af65-450cb6b28282/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 597d75969acc1d8bcee1b027bc47b6559ce75136 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 17:28:40,230 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 17:28:40,231 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 17:28:40,237 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 17:28:40,237 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 17:28:40,238 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 17:28:40,239 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 17:28:40,239 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 17:28:40,240 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 17:28:40,240 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 17:28:40,241 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 17:28:40,241 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 17:28:40,242 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 17:28:40,242 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 17:28:40,243 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 17:28:40,243 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 17:28:40,243 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 17:28:40,244 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 17:28:40,245 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 17:28:40,246 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 17:28:40,246 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 17:28:40,247 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 17:28:40,248 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 17:28:40,248 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 17:28:40,248 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 17:28:40,249 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 17:28:40,249 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 17:28:40,250 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 17:28:40,250 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 17:28:40,250 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 17:28:40,251 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 17:28:40,251 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 17:28:40,251 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 17:28:40,251 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 17:28:40,252 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 17:28:40,252 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 17:28:40,252 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9ddd7533-78d0-413c-af65-450cb6b28282/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-08 17:28:40,259 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 17:28:40,259 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 17:28:40,260 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 17:28:40,260 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-08 17:28:40,260 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 17:28:40,261 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 17:28:40,261 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 17:28:40,261 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 17:28:40,261 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 17:28:40,261 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 17:28:40,261 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 17:28:40,261 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 17:28:40,261 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 17:28:40,261 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 17:28:40,261 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 17:28:40,261 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 17:28:40,262 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 17:28:40,262 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 17:28:40,262 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-08 17:28:40,262 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-08 17:28:40,262 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 17:28:40,262 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 17:28:40,262 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-08 17:28:40,262 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 17:28:40,262 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 17:28:40,262 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 17:28:40,262 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-08 17:28:40,262 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 17:28:40,263 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 17:28:40,263 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_9ddd7533-78d0-413c-af65-450cb6b28282/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 -> 597d75969acc1d8bcee1b027bc47b6559ce75136 [2018-12-08 17:28:40,280 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 17:28:40,288 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 17:28:40,290 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 17:28:40,291 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 17:28:40,291 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 17:28:40,292 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9ddd7533-78d0-413c-af65-450cb6b28282/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.1.ufo.UNBOUNDED.pals.c [2018-12-08 17:28:40,329 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9ddd7533-78d0-413c-af65-450cb6b28282/bin-2019/ukojak/data/a36c48a5d/ad4f6b2d037d4975b53e2b038ed83c43/FLAG60184df16 [2018-12-08 17:28:40,772 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 17:28:40,772 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9ddd7533-78d0-413c-af65-450cb6b28282/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.1.ufo.UNBOUNDED.pals.c [2018-12-08 17:28:40,778 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9ddd7533-78d0-413c-af65-450cb6b28282/bin-2019/ukojak/data/a36c48a5d/ad4f6b2d037d4975b53e2b038ed83c43/FLAG60184df16 [2018-12-08 17:28:40,786 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9ddd7533-78d0-413c-af65-450cb6b28282/bin-2019/ukojak/data/a36c48a5d/ad4f6b2d037d4975b53e2b038ed83c43 [2018-12-08 17:28:40,787 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 17:28:40,788 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 17:28:40,789 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 17:28:40,789 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 17:28:40,790 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 17:28:40,791 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 05:28:40" (1/1) ... [2018-12-08 17:28:40,792 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2648fef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:28:40, skipping insertion in model container [2018-12-08 17:28:40,792 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 05:28:40" (1/1) ... [2018-12-08 17:28:40,796 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 17:28:40,814 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 17:28:40,936 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 17:28:40,942 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 17:28:41,010 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 17:28:41,024 INFO L195 MainTranslator]: Completed translation [2018-12-08 17:28:41,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:28:41 WrapperNode [2018-12-08 17:28:41,024 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 17:28:41,024 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 17:28:41,024 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 17:28:41,025 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 17:28:41,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:28:41" (1/1) ... [2018-12-08 17:28:41,037 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:28:41" (1/1) ... [2018-12-08 17:28:41,056 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 17:28:41,056 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 17:28:41,056 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 17:28:41,056 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 17:28:41,062 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:28:41" (1/1) ... [2018-12-08 17:28:41,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:28:41" (1/1) ... [2018-12-08 17:28:41,064 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:28:41" (1/1) ... [2018-12-08 17:28:41,064 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:28:41" (1/1) ... [2018-12-08 17:28:41,068 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:28:41" (1/1) ... [2018-12-08 17:28:41,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:28:41" (1/1) ... [2018-12-08 17:28:41,075 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:28:41" (1/1) ... [2018-12-08 17:28:41,077 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 17:28:41,077 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 17:28:41,077 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 17:28:41,077 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 17:28:41,078 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:28:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9ddd7533-78d0-413c-af65-450cb6b28282/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-08 17:28:41,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 17:28:41,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 17:28:42,412 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 17:28:42,412 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-12-08 17:28:42,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:28:42 BoogieIcfgContainer [2018-12-08 17:28:42,413 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 17:28:42,413 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-08 17:28:42,413 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-08 17:28:42,419 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-08 17:28:42,420 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:28:42" (1/1) ... [2018-12-08 17:28:42,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:28:42,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:28:42,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 18 states and 29 transitions. [2018-12-08 17:28:42,447 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 29 transitions. [2018-12-08 17:28:42,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-08 17:28:42,449 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:28:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:28:42,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:28:42,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:28:42,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 19 states and 31 transitions. [2018-12-08 17:28:42,755 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 31 transitions. [2018-12-08 17:28:42,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-08 17:28:42,755 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:28:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:28:42,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:28:43,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:28:43,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 22 states and 37 transitions. [2018-12-08 17:28:43,032 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 37 transitions. [2018-12-08 17:28:43,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-08 17:28:43,034 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:28:43,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:28:43,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:28:43,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:28:43,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 26 states and 45 transitions. [2018-12-08 17:28:43,370 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 45 transitions. [2018-12-08 17:28:43,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-08 17:28:43,370 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:28:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:28:43,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:28:43,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:28:43,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 31 states and 56 transitions. [2018-12-08 17:28:43,972 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 56 transitions. [2018-12-08 17:28:43,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-08 17:28:43,972 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:28:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:28:44,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:28:44,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:28:44,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 36 states and 65 transitions. [2018-12-08 17:28:44,406 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 65 transitions. [2018-12-08 17:28:44,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-08 17:28:44,406 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:28:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:28:44,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:28:45,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:28:45,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 42 states and 76 transitions. [2018-12-08 17:28:45,222 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 76 transitions. [2018-12-08 17:28:45,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 17:28:45,222 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:28:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:28:45,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:28:45,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:28:45,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 43 states and 77 transitions. [2018-12-08 17:28:45,437 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 77 transitions. [2018-12-08 17:28:45,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-08 17:28:45,438 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:28:45,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:28:45,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:28:45,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:28:45,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 44 states and 78 transitions. [2018-12-08 17:28:45,475 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 78 transitions. [2018-12-08 17:28:45,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-08 17:28:45,476 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:28:45,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:28:45,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:28:46,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:28:46,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 51 states and 88 transitions. [2018-12-08 17:28:46,210 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 88 transitions. [2018-12-08 17:28:46,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-08 17:28:46,211 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:28:46,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:28:46,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:28:46,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:28:46,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 54 states and 99 transitions. [2018-12-08 17:28:46,487 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 99 transitions. [2018-12-08 17:28:46,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-08 17:28:46,488 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:28:46,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:28:47,058 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:28:49,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:28:49,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 69 states and 129 transitions. [2018-12-08 17:28:49,617 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 129 transitions. [2018-12-08 17:28:49,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-08 17:28:49,618 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:28:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:28:50,098 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:28:51,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:28:51,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 75 states and 144 transitions. [2018-12-08 17:28:51,726 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 144 transitions. [2018-12-08 17:28:51,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-08 17:28:51,727 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:28:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:28:51,912 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:28:52,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:28:52,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 76 states and 146 transitions. [2018-12-08 17:28:52,100 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 146 transitions. [2018-12-08 17:28:52,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-08 17:28:52,101 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:28:52,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:28:52,876 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:28:54,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:28:54,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 79 states and 154 transitions. [2018-12-08 17:28:54,456 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 154 transitions. [2018-12-08 17:28:54,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-08 17:28:54,457 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:28:54,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:28:54,523 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:28:54,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:28:54,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 81 states and 159 transitions. [2018-12-08 17:28:54,938 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 159 transitions. [2018-12-08 17:28:54,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 17:28:54,938 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:28:54,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:28:55,447 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:28:57,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:28:57,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 85 states and 170 transitions. [2018-12-08 17:28:57,168 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 170 transitions. [2018-12-08 17:28:57,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 17:28:57,169 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:28:57,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:28:57,317 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:28:57,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:28:57,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 86 states and 171 transitions. [2018-12-08 17:28:57,539 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 171 transitions. [2018-12-08 17:28:57,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 17:28:57,539 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:28:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:28:57,637 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:28:58,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:28:58,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 88 states and 176 transitions. [2018-12-08 17:28:58,110 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 176 transitions. [2018-12-08 17:28:58,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 17:28:58,110 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:28:58,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:28:58,218 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:28:58,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:28:58,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 90 states and 181 transitions. [2018-12-08 17:28:58,666 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 181 transitions. [2018-12-08 17:28:58,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-08 17:28:58,666 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:28:58,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:28:59,496 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:29:03,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:29:03,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 98 states and 201 transitions. [2018-12-08 17:29:03,965 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 201 transitions. [2018-12-08 17:29:03,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-08 17:29:03,965 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:29:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:29:04,039 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:29:05,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:29:05,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 102 states and 211 transitions. [2018-12-08 17:29:05,310 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 211 transitions. [2018-12-08 17:29:05,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-08 17:29:05,311 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:29:05,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:29:05,391 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:29:06,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:29:06,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 104 states and 214 transitions. [2018-12-08 17:29:06,031 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 214 transitions. [2018-12-08 17:29:06,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-08 17:29:06,031 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:29:06,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:29:06,094 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:29:06,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:29:06,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 105 states and 217 transitions. [2018-12-08 17:29:06,466 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 217 transitions. [2018-12-08 17:29:06,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 17:29:06,466 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:29:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:29:07,094 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:29:11,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:29:11,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 118 states and 248 transitions. [2018-12-08 17:29:11,458 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 248 transitions. [2018-12-08 17:29:11,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 17:29:11,459 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:29:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:29:11,655 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:29:12,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:29:12,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 120 states and 252 transitions. [2018-12-08 17:29:12,226 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 252 transitions. [2018-12-08 17:29:12,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-08 17:29:12,227 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:29:12,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:29:13,344 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:29:14,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:29:14,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 123 states and 254 transitions. [2018-12-08 17:29:14,830 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 254 transitions. [2018-12-08 17:29:14,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-08 17:29:14,830 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:29:14,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:29:16,776 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:29:23,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:29:23,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 137 states and 301 transitions. [2018-12-08 17:29:23,789 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 301 transitions. [2018-12-08 17:29:23,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-08 17:29:23,789 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:29:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:29:24,847 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:29:28,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:29:28,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 142 states and 311 transitions. [2018-12-08 17:29:28,021 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 311 transitions. [2018-12-08 17:29:28,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-08 17:29:28,021 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:29:28,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:29:28,071 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:29:28,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:29:28,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 143 states and 318 transitions. [2018-12-08 17:29:28,529 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 318 transitions. [2018-12-08 17:29:28,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-08 17:29:28,530 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:29:28,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:29:29,386 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:29:33,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:29:33,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 151 states and 337 transitions. [2018-12-08 17:29:33,714 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 337 transitions. [2018-12-08 17:29:33,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-08 17:29:33,714 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:29:33,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:29:33,757 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:29:34,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:29:34,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 152 states and 342 transitions. [2018-12-08 17:29:34,243 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 342 transitions. [2018-12-08 17:29:34,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-08 17:29:34,244 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:29:34,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:29:34,289 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:29:35,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:29:35,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 154 states and 345 transitions. [2018-12-08 17:29:35,237 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 345 transitions. [2018-12-08 17:29:35,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-08 17:29:35,237 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:29:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:29:36,195 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:29:44,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:29:44,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 168 states and 378 transitions. [2018-12-08 17:29:44,243 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 378 transitions. [2018-12-08 17:29:44,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-08 17:29:44,243 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:29:44,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:29:44,287 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:29:44,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:29:44,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 169 states and 382 transitions. [2018-12-08 17:29:44,802 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 382 transitions. [2018-12-08 17:29:44,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-08 17:29:44,802 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:29:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:29:44,850 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:29:45,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:29:45,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 170 states and 386 transitions. [2018-12-08 17:29:45,698 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 386 transitions. [2018-12-08 17:29:45,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-08 17:29:45,699 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:29:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:29:45,754 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:29:46,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:29:46,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 171 states and 390 transitions. [2018-12-08 17:29:46,388 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 390 transitions. [2018-12-08 17:29:46,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-08 17:29:46,389 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:29:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:29:46,440 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:29:46,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:29:46,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 172 states and 392 transitions. [2018-12-08 17:29:46,877 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 392 transitions. [2018-12-08 17:29:46,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-08 17:29:46,877 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:29:46,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:29:48,154 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:29:54,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:29:54,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 177 states and 410 transitions. [2018-12-08 17:29:54,266 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 410 transitions. [2018-12-08 17:29:54,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-08 17:29:54,266 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:29:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:29:54,485 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:29:55,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:29:55,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 178 states and 413 transitions. [2018-12-08 17:29:55,173 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 413 transitions. [2018-12-08 17:29:55,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-08 17:29:55,173 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:29:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:29:55,392 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:29:55,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:29:55,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 179 states and 415 transitions. [2018-12-08 17:29:55,897 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 415 transitions. [2018-12-08 17:29:55,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-08 17:29:55,897 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:29:55,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:29:56,119 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:29:57,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:29:57,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 181 states and 419 transitions. [2018-12-08 17:29:57,206 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 419 transitions. [2018-12-08 17:29:57,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-08 17:29:57,206 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:29:57,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:29:57,430 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:29:58,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:29:58,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 182 states and 422 transitions. [2018-12-08 17:29:58,034 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 422 transitions. [2018-12-08 17:29:58,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-08 17:29:58,034 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:29:58,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:29:58,791 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:30:05,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:30:05,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 193 states and 448 transitions. [2018-12-08 17:30:05,912 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 448 transitions. [2018-12-08 17:30:05,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-08 17:30:05,912 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:30:06,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:30:06,507 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:30:08,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:30:08,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 197 states and 459 transitions. [2018-12-08 17:30:08,822 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 459 transitions. [2018-12-08 17:30:08,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-08 17:30:08,822 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:30:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:30:09,408 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:30:12,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:30:12,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 202 states and 472 transitions. [2018-12-08 17:30:12,534 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 472 transitions. [2018-12-08 17:30:12,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-08 17:30:12,534 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:30:12,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:30:13,095 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:30:17,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:30:17,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 207 states and 485 transitions. [2018-12-08 17:30:17,971 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 485 transitions. [2018-12-08 17:30:17,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-08 17:30:17,972 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:30:18,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:30:18,568 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:30:20,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:30:20,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 209 states and 490 transitions. [2018-12-08 17:30:20,214 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 490 transitions. [2018-12-08 17:30:20,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-08 17:30:20,215 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:30:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:30:20,842 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:30:21,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:30:21,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 210 states and 490 transitions. [2018-12-08 17:30:21,673 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 490 transitions. [2018-12-08 17:30:21,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-08 17:30:21,673 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:30:21,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:30:22,247 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:30:22,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:30:22,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 211 states and 497 transitions. [2018-12-08 17:30:22,974 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 497 transitions. [2018-12-08 17:30:22,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-08 17:30:22,975 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:30:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:30:23,535 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:30:24,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:30:24,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 214 states and 507 transitions. [2018-12-08 17:30:24,806 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 507 transitions. [2018-12-08 17:30:24,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-08 17:30:24,806 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:30:24,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:30:24,835 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-08 17:30:25,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:30:25,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 214 states and 506 transitions. [2018-12-08 17:30:25,136 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 506 transitions. [2018-12-08 17:30:25,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-08 17:30:25,136 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:30:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:30:30,111 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:30:49,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:30:49,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 226 states and 545 transitions. [2018-12-08 17:30:49,543 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 545 transitions. [2018-12-08 17:30:49,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-08 17:30:49,544 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:30:49,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:30:49,649 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:30:53,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:30:53,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 231 states and 558 transitions. [2018-12-08 17:30:53,490 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 558 transitions. [2018-12-08 17:30:53,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-08 17:30:53,490 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:30:53,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:30:53,573 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:30:56,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:30:56,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 235 states and 564 transitions. [2018-12-08 17:30:56,061 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 564 transitions. [2018-12-08 17:30:56,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-08 17:30:56,061 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:30:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:30:56,154 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:31:01,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:31:01,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 240 states and 576 transitions. [2018-12-08 17:31:01,356 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 576 transitions. [2018-12-08 17:31:01,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-08 17:31:01,356 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:31:01,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:31:01,449 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:31:02,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:31:02,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 241 states and 580 transitions. [2018-12-08 17:31:02,308 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 580 transitions. [2018-12-08 17:31:02,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-08 17:31:02,309 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:31:02,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:31:02,409 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:31:03,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:31:03,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 242 states and 580 transitions. [2018-12-08 17:31:03,271 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 580 transitions. [2018-12-08 17:31:03,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-08 17:31:03,271 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:31:03,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:31:03,351 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 17:31:04,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:31:04,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 243 states and 580 transitions. [2018-12-08 17:31:04,153 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 580 transitions. [2018-12-08 17:31:04,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-08 17:31:04,153 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:31:04,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:31:04,399 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-08 17:31:05,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 17:31:05,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 243 states and 567 transitions. [2018-12-08 17:31:05,311 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 567 transitions. [2018-12-08 17:31:05,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-08 17:31:05,311 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 17:31:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:31:05,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:31:05,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:31:06,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:31:06,169 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 60 iterations. [2018-12-08 17:31:06,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.12 05:31:06 ImpRootNode [2018-12-08 17:31:06,253 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-08 17:31:06,253 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 17:31:06,253 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 17:31:06,253 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 17:31:06,253 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:28:42" (3/4) ... [2018-12-08 17:31:06,255 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 17:31:06,341 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9ddd7533-78d0-413c-af65-450cb6b28282/bin-2019/ukojak/witness.graphml [2018-12-08 17:31:06,341 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 17:31:06,342 INFO L168 Benchmark]: Toolchain (without parser) took 145553.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 188.2 MB). Free memory was 956.0 MB in the beginning and 1.0 GB in the end (delta: -69.2 MB). Peak memory consumption was 475.6 MB. Max. memory is 11.5 GB. [2018-12-08 17:31:06,342 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 17:31:06,342 INFO L168 Benchmark]: CACSL2BoogieTranslator took 235.63 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 84.9 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -129.3 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. [2018-12-08 17:31:06,343 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-08 17:31:06,343 INFO L168 Benchmark]: Boogie Preprocessor took 21.32 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 17:31:06,343 INFO L168 Benchmark]: RCFGBuilder took 1335.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 990.1 MB in the end (delta: 84.4 MB). Peak memory consumption was 261.5 MB. Max. memory is 11.5 GB. [2018-12-08 17:31:06,343 INFO L168 Benchmark]: CodeCheck took 143839.67 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 94.4 MB). Free memory was 990.1 MB in the beginning and 666.8 MB in the end (delta: 323.4 MB). Peak memory consumption was 417.7 MB. Max. memory is 11.5 GB. [2018-12-08 17:31:06,343 INFO L168 Benchmark]: Witness Printer took 88.17 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.9 MB). Free memory was 666.8 MB in the beginning and 1.0 GB in the end (delta: -358.4 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2018-12-08 17:31:06,345 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, 140 locations, 1 error locations. UNSAFE Result, 143.7s OverallTime, 60 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 0 SDtfs, -2125593440 SDslu, 512 SDs, 0 SdLazy, 869043370 SolverSat, 1007855754 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 94.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18050 GetRequests, 16038 SyntacticMatches, 1086 SemanticMatches, 926 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536322 ImplicationChecksByTransitivity, 134.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 22.4s InterpolantComputationTime, 1740 NumberOfCodeBlocks, 1740 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 1636 ConstructedInterpolants, 0 QuantifiedInterpolants, 704287 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 59 InterpolantComputations, 11 PerfectInterpolantSequences, 254/1131 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: 628]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L70] msg_t nomsg = (msg_t )-1; [L71] port_t p12 ; [L72] char p12_old ; [L73] char p12_new ; [L74] _Bool ep12 ; [L75] port_t p13 ; [L76] char p13_old ; [L77] char p13_new ; [L78] _Bool ep13 ; [L79] port_t p21 ; [L80] char p21_old ; [L81] char p21_new ; [L82] _Bool ep21 ; [L83] port_t p23 ; [L84] char p23_old ; [L85] char p23_new ; [L86] _Bool ep23 ; [L87] port_t p31 ; [L88] char p31_old ; [L89] char p31_new ; [L90] _Bool ep31 ; [L91] port_t p32 ; [L92] char p32_old ; [L93] char p32_new ; [L94] _Bool ep32 ; [L95] char id1 ; [L96] unsigned char r1 ; [L97] char st1 ; [L98] char nl1 ; [L99] char m1 ; [L100] char max1 ; [L101] _Bool mode1 ; [L102] _Bool newmax1 ; [L103] char id2 ; [L104] unsigned char r2 ; [L105] char st2 ; [L106] char nl2 ; [L107] char m2 ; [L108] char max2 ; [L109] _Bool mode2 ; [L110] _Bool newmax2 ; [L111] char id3 ; [L112] unsigned char r3 ; [L113] char st3 ; [L114] char nl3 ; [L115] char m3 ; [L116] char max3 ; [L117] _Bool mode3 ; [L118] _Bool newmax3 ; [L281] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L547] int c1 ; [L548] int i2 ; [L551] c1 = 0 [L552] ep12 = __VERIFIER_nondet_bool() [L553] ep13 = __VERIFIER_nondet_bool() [L554] ep21 = __VERIFIER_nondet_bool() [L555] ep23 = __VERIFIER_nondet_bool() [L556] ep31 = __VERIFIER_nondet_bool() [L557] ep32 = __VERIFIER_nondet_bool() [L558] id1 = __VERIFIER_nondet_char() [L559] r1 = __VERIFIER_nondet_uchar() [L560] st1 = __VERIFIER_nondet_char() [L561] nl1 = __VERIFIER_nondet_char() [L562] m1 = __VERIFIER_nondet_char() [L563] max1 = __VERIFIER_nondet_char() [L564] mode1 = __VERIFIER_nondet_bool() [L565] newmax1 = __VERIFIER_nondet_bool() [L566] id2 = __VERIFIER_nondet_char() [L567] r2 = __VERIFIER_nondet_uchar() [L568] st2 = __VERIFIER_nondet_char() [L569] nl2 = __VERIFIER_nondet_char() [L570] m2 = __VERIFIER_nondet_char() [L571] max2 = __VERIFIER_nondet_char() [L572] mode2 = __VERIFIER_nondet_bool() [L573] newmax2 = __VERIFIER_nondet_bool() [L574] id3 = __VERIFIER_nondet_char() [L575] r3 = __VERIFIER_nondet_uchar() [L576] st3 = __VERIFIER_nondet_char() [L577] nl3 = __VERIFIER_nondet_char() [L578] m3 = __VERIFIER_nondet_char() [L579] max3 = __VERIFIER_nondet_char() [L580] mode3 = __VERIFIER_nondet_bool() [L581] newmax3 = __VERIFIER_nondet_bool() [L284] _Bool r121 ; [L285] _Bool r131 ; [L286] _Bool r211 ; [L287] _Bool r231 ; [L288] _Bool r311 ; [L289] _Bool r321 ; [L290] _Bool r122 ; [L291] int tmp ; [L292] _Bool r132 ; [L293] int tmp___0 ; [L294] _Bool r212 ; [L295] int tmp___1 ; [L296] _Bool r232 ; [L297] int tmp___2 ; [L298] _Bool r312 ; [L299] int tmp___3 ; [L300] _Bool r322 ; [L301] int tmp___4 ; [L302] int tmp___5 ; [L305] r121 = ep12 [L306] r131 = ep13 [L307] r211 = ep21 [L308] r231 = ep23 [L309] r311 = ep31 [L310] r321 = ep32 [L311] COND FALSE !(\read(r121)) [L314] COND FALSE !(\read(r131)) [L321] tmp = 0 [L323] r122 = (_Bool )tmp [L324] COND FALSE !(\read(r131)) [L327] COND FALSE !(\read(r121)) [L334] tmp___0 = 0 [L336] r132 = (_Bool )tmp___0 [L337] COND FALSE !(\read(r211)) [L340] COND FALSE !(\read(r231)) [L347] tmp___1 = 0 [L349] r212 = (_Bool )tmp___1 [L350] COND FALSE !(\read(r231)) [L353] COND FALSE !(\read(r211)) [L360] tmp___2 = 0 [L362] r232 = (_Bool )tmp___2 [L363] COND TRUE \read(r311) [L364] tmp___3 = 1 [L375] r312 = (_Bool )tmp___3 [L376] COND TRUE \read(r321) [L377] tmp___4 = 1 [L388] r322 = (_Bool )tmp___4 [L389] COND TRUE (int )id1 != (int )id2 [L390] COND TRUE (int )id1 != (int )id3 [L391] COND TRUE (int )id2 != (int )id3 [L392] COND TRUE (int )id1 >= 0 [L393] COND TRUE (int )id2 >= 0 [L394] COND TRUE (int )id3 >= 0 [L395] COND TRUE (int )r1 == 0 [L396] COND TRUE (int )r2 == 0 [L397] COND TRUE (int )r3 == 0 [L398] COND TRUE (int )max1 == (int )id1 [L399] COND TRUE (int )max2 == (int )id2 [L400] COND TRUE (int )max3 == (int )id3 [L401] COND TRUE (int )st1 == 0 [L402] COND TRUE (int )st2 == 0 [L403] COND TRUE (int )st3 == 0 [L404] COND TRUE (int )nl1 == 0 [L405] COND TRUE (int )nl2 == 0 [L406] COND TRUE (int )nl3 == 0 [L407] COND TRUE (int )mode1 == 0 [L408] COND TRUE (int )mode2 == 0 [L409] COND TRUE (int )mode3 == 0 [L410] COND TRUE \read(newmax1) [L411] COND TRUE \read(newmax2) [L412] COND TRUE \read(newmax3) [L413] tmp___5 = 1 [L486] return (tmp___5); [L582] i2 = init() [L584] p12_old = nomsg [L585] p12_new = nomsg [L586] p13_old = nomsg [L587] p13_new = nomsg [L588] p21_old = nomsg [L589] p21_new = nomsg [L590] p23_old = nomsg [L591] p23_new = nomsg [L592] p31_old = nomsg [L593] p31_new = nomsg [L594] p32_old = nomsg [L595] p32_new = nomsg [L596] i2 = 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=126, id2=0, id3=1, m1=127, m2=-2, m3=2, max1=126, max2=0, 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] [L597] COND TRUE 1 [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND FALSE !(\read(mode1)) [L156] COND TRUE (int )r1 < 2 [L157] COND FALSE !(\read(ep12)) [L162] COND FALSE !(\read(ep13)) [L168] mode1 = (_Bool)1 [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND FALSE !(\read(mode2)) [L210] COND TRUE (int )r2 < 2 [L211] COND FALSE !(\read(ep21)) [L216] COND FALSE !(\read(ep23)) [L222] mode2 = (_Bool)1 [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND FALSE !(\read(mode3)) [L264] COND TRUE (int )r3 < 2 [L265] COND TRUE \read(ep31) [L266] COND TRUE \read(newmax3) [L267] EXPR max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L267] p31_new = max3 != nomsg && p31_new == nomsg ? max3 : p31_new [L270] COND TRUE \read(ep32) [L271] COND TRUE \read(newmax3) [L272] EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L272] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L276] mode3 = (_Bool)1 [L602] p12_old = p12_new [L603] p12_new = nomsg [L604] p13_old = p13_new [L605] p13_new = nomsg [L606] p21_old = p21_new [L607] p21_new = nomsg [L608] p23_old = p23_new [L609] p23_new = nomsg [L610] p31_old = p31_new [L611] p31_new = nomsg [L612] p32_old = p32_new [L613] p32_new = nomsg [L491] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=126, id2=0, id3=1, m1=127, m2=-2, m3=2, max1=126, max2=0, 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=-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] [L494] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=126, id2=0, id3=1, m1=127, m2=-2, m3=2, max1=126, max2=0, 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=-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] [L495] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=126, id2=0, id3=1, m1=127, m2=-2, m3=2, max1=126, max2=0, 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=-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] [L496] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=126, id2=0, id3=1, m1=127, m2=-2, m3=2, max1=126, max2=0, 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=-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] [L497] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=126, id2=0, id3=1, m1=127, m2=-2, m3=2, max1=126, max2=0, 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=-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] [L498] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=126, id2=0, id3=1, m1=127, m2=-2, m3=2, max1=126, max2=0, 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=-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] [L501] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=126, id2=0, id3=1, m1=127, m2=-2, m3=2, max1=126, max2=0, 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=-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] [L503] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=126, id2=0, id3=1, m1=127, m2=-2, m3=2, max1=126, max2=0, 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=-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] [L508] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=126, id2=0, id3=1, m1=127, m2=-2, m3=2, max1=126, max2=0, 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=-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] [L511] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=126, id2=0, id3=1, m1=127, m2=-2, m3=2, max1=126, max2=0, 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=-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] [L513] COND TRUE (int )r1 < 2 [L514] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=126, id2=0, id3=1, m1=127, m2=-2, m3=2, max1=126, max2=0, 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=-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] [L542] return (tmp); [L614] c1 = check() [L626] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=126, id2=0, id3=1, m1=127, m2=-2, m3=2, max1=126, max2=0, 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=-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] [L597] COND TRUE 1 [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND TRUE \read(mode1) [L126] COND FALSE !(r1 == 255) [L129] r1 = r1 + 1 [L130] COND FALSE !(\read(ep21)) [L138] COND TRUE \read(ep31) [L139] m1 = p31_old [L140] p31_old = nomsg [L141] COND FALSE !((int )m1 > (int )max1) [L146] newmax1 = newmax [L147] COND FALSE !((int )r1 == 2) [L154] mode1 = (_Bool)0 [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND TRUE \read(mode2) [L180] COND FALSE !(r2 == 255) [L183] r2 = r2 + 1 [L184] COND FALSE !(\read(ep12)) [L192] COND TRUE \read(ep32) [L193] m2 = p32_old [L194] p32_old = nomsg [L195] COND TRUE (int )m2 > (int )max2 [L196] max2 = m2 [L197] newmax = (_Bool)1 [L200] newmax2 = newmax [L201] COND FALSE !((int )r2 == 2) [L208] mode2 = (_Bool)0 [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND TRUE \read(mode3) [L234] COND FALSE !(r3 == 255) [L237] r3 = r3 + 1 [L238] COND FALSE !(\read(ep13)) [L246] COND FALSE !(\read(ep23)) [L254] newmax3 = newmax [L255] COND FALSE !((int )r3 == 2) [L262] mode3 = (_Bool)0 [L602] p12_old = p12_new [L603] p12_new = nomsg [L604] p13_old = p13_new [L605] p13_new = nomsg [L606] p21_old = p21_new [L607] p21_new = nomsg [L608] p23_old = p23_new [L609] p23_new = nomsg [L610] p31_old = p31_new [L611] p31_new = nomsg [L612] p32_old = p32_new [L613] p32_new = nomsg [L491] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=126, id2=0, id3=1, m1=1, m2=1, m3=2, max1=126, max2=1, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L494] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=126, id2=0, id3=1, m1=1, m2=1, m3=2, max1=126, max2=1, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L495] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=126, id2=0, id3=1, m1=1, m2=1, m3=2, max1=126, max2=1, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L496] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=126, id2=0, id3=1, m1=1, m2=1, m3=2, max1=126, max2=1, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L497] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=126, id2=0, id3=1, m1=1, m2=1, m3=2, max1=126, max2=1, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L498] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=126, id2=0, id3=1, m1=1, m2=1, m3=2, max1=126, max2=1, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L501] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=126, id2=0, id3=1, m1=1, m2=1, m3=2, max1=126, max2=1, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L503] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=126, id2=0, id3=1, m1=1, m2=1, m3=2, max1=126, max2=1, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L508] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=126, id2=0, id3=1, m1=1, m2=1, m3=2, max1=126, max2=1, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L511] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=126, id2=0, id3=1, m1=1, m2=1, m3=2, max1=126, max2=1, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L513] COND TRUE (int )r1 < 2 [L514] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=126, id2=0, id3=1, m1=1, m2=1, m3=2, max1=126, max2=1, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L542] return (tmp); [L614] c1 = check() [L626] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=126, id2=0, id3=1, m1=1, m2=1, m3=2, max1=126, max2=1, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L597] COND TRUE 1 [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND FALSE !(\read(mode1)) [L156] COND TRUE (int )r1 < 2 [L157] COND FALSE !(\read(ep12)) [L162] COND FALSE !(\read(ep13)) [L168] mode1 = (_Bool)1 [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND FALSE !(\read(mode2)) [L210] COND TRUE (int )r2 < 2 [L211] COND FALSE !(\read(ep21)) [L216] COND FALSE !(\read(ep23)) [L222] mode2 = (_Bool)1 [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND FALSE !(\read(mode3)) [L264] COND TRUE (int )r3 < 2 [L265] COND TRUE \read(ep31) [L266] COND FALSE !(\read(newmax3)) [L270] COND TRUE \read(ep32) [L271] COND FALSE !(\read(newmax3)) [L276] mode3 = (_Bool)1 [L602] p12_old = p12_new [L603] p12_new = nomsg [L604] p13_old = p13_new [L605] p13_new = nomsg [L606] p21_old = p21_new [L607] p21_new = nomsg [L608] p23_old = p23_new [L609] p23_new = nomsg [L610] p31_old = p31_new [L611] p31_new = nomsg [L612] p32_old = p32_new [L613] p32_new = nomsg [L491] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=126, id2=0, id3=1, m1=1, m2=1, m3=2, max1=126, max2=1, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L494] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=126, id2=0, id3=1, m1=1, m2=1, m3=2, max1=126, max2=1, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L495] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=126, id2=0, id3=1, m1=1, m2=1, m3=2, max1=126, max2=1, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L496] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=126, id2=0, id3=1, m1=1, m2=1, m3=2, max1=126, max2=1, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L497] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=126, id2=0, id3=1, m1=1, m2=1, m3=2, max1=126, max2=1, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L498] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=126, id2=0, id3=1, m1=1, m2=1, m3=2, max1=126, max2=1, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L501] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=126, id2=0, id3=1, m1=1, m2=1, m3=2, max1=126, max2=1, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L503] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=126, id2=0, id3=1, m1=1, m2=1, m3=2, max1=126, max2=1, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L508] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=126, id2=0, id3=1, m1=1, m2=1, m3=2, max1=126, max2=1, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L511] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=126, id2=0, id3=1, m1=1, m2=1, m3=2, max1=126, max2=1, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L513] COND TRUE (int )r1 < 2 [L514] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=126, id2=0, id3=1, m1=1, m2=1, m3=2, max1=126, max2=1, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L542] return (tmp); [L614] c1 = check() [L626] COND FALSE !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=126, id2=0, id3=1, m1=1, m2=1, m3=2, max1=126, max2=1, max3=1, mode1=1, mode2=1, mode3=1, newmax1=0, newmax2=1, newmax3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L597] COND TRUE 1 [L121] _Bool newmax ; [L124] newmax = (_Bool)0 [L125] COND TRUE \read(mode1) [L126] COND FALSE !(r1 == 255) [L129] r1 = r1 + 1 [L130] COND FALSE !(\read(ep21)) [L138] COND TRUE \read(ep31) [L139] m1 = p31_old [L140] p31_old = nomsg [L141] COND FALSE !((int )m1 > (int )max1) [L146] newmax1 = newmax [L147] COND TRUE (int )r1 == 2 [L148] COND TRUE (int )max1 == (int )id1 [L149] st1 = (char)1 [L154] mode1 = (_Bool)0 [L175] _Bool newmax ; [L178] newmax = (_Bool)0 [L179] COND TRUE \read(mode2) [L180] COND FALSE !(r2 == 255) [L183] r2 = r2 + 1 [L184] COND FALSE !(\read(ep12)) [L192] COND TRUE \read(ep32) [L193] m2 = p32_old [L194] p32_old = nomsg [L195] COND FALSE !((int )m2 > (int )max2) [L200] newmax2 = newmax [L201] COND TRUE (int )r2 == 2 [L202] COND FALSE !((int )max2 == (int )id2) [L205] nl2 = (char)1 [L208] mode2 = (_Bool)0 [L229] _Bool newmax ; [L232] newmax = (_Bool)0 [L233] COND TRUE \read(mode3) [L234] COND FALSE !(r3 == 255) [L237] r3 = r3 + 1 [L238] COND FALSE !(\read(ep13)) [L246] COND FALSE !(\read(ep23)) [L254] newmax3 = newmax [L255] COND TRUE (int )r3 == 2 [L256] COND TRUE (int )max3 == (int )id3 [L257] st3 = (char)1 [L262] mode3 = (_Bool)0 [L602] p12_old = p12_new [L603] p12_new = nomsg [L604] p13_old = p13_new [L605] p13_new = nomsg [L606] p21_old = p21_new [L607] p21_new = nomsg [L608] p23_old = p23_new [L609] p23_new = nomsg [L610] p31_old = p31_new [L611] p31_new = nomsg [L612] p32_old = p32_new [L613] p32_new = nomsg [L491] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=126, id2=0, id3=1, m1=-1, m2=-1, m3=2, max1=126, max2=1, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L494] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L540] tmp = 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=126, id2=0, id3=1, m1=-1, m2=-1, m3=2, max1=126, max2=1, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L542] return (tmp); [L614] c1 = check() [L626] COND TRUE ! arg VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=126, id2=0, id3=1, m1=-1, m2=-1, m3=2, max1=126, max2=1, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] [L628] __VERIFIER_error() VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=1, ep32=1, id1=126, id2=0, id3=1, m1=-1, m2=-1, m3=2, max1=126, max2=1, max3=1, mode1=0, mode2=0, mode3=0, newmax1=0, newmax2=0, newmax3=0, nl1=0, nl2=1, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=0, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 235.63 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 84.9 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -129.3 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.32 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1335.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 990.1 MB in the end (delta: 84.4 MB). Peak memory consumption was 261.5 MB. Max. memory is 11.5 GB. * CodeCheck took 143839.67 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 94.4 MB). Free memory was 990.1 MB in the beginning and 666.8 MB in the end (delta: 323.4 MB). Peak memory consumption was 417.7 MB. Max. memory is 11.5 GB. * Witness Printer took 88.17 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.9 MB). Free memory was 666.8 MB in the beginning and 1.0 GB in the end (delta: -358.4 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...