./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3_false-unreach-call.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8452b81a-4c31-4383-990e-39801a40c6ba/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8452b81a-4c31-4383-990e-39801a40c6ba/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8452b81a-4c31-4383-990e-39801a40c6ba/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8452b81a-4c31-4383-990e-39801a40c6ba/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3_false-unreach-call.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/working_dir_8452b81a-4c31-4383-990e-39801a40c6ba/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8452b81a-4c31-4383-990e-39801a40c6ba/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 d554aa2ddd753c54eae3eaa938a78036ee261f5c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 04:17:59,250 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 04:17:59,251 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 04:17:59,259 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 04:17:59,260 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 04:17:59,261 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 04:17:59,261 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 04:17:59,263 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 04:17:59,264 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 04:17:59,265 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 04:17:59,266 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 04:17:59,266 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 04:17:59,267 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 04:17:59,267 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 04:17:59,268 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 04:17:59,268 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 04:17:59,269 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 04:17:59,270 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 04:17:59,271 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 04:17:59,272 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 04:17:59,273 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 04:17:59,274 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 04:17:59,277 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 04:17:59,277 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 04:17:59,277 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 04:17:59,278 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 04:17:59,279 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 04:17:59,280 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 04:17:59,280 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 04:17:59,281 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 04:17:59,281 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 04:17:59,282 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 04:17:59,282 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 04:17:59,282 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 04:17:59,283 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 04:17:59,284 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 04:17:59,284 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8452b81a-4c31-4383-990e-39801a40c6ba/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-10 04:17:59,293 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 04:17:59,294 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 04:17:59,294 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 04:17:59,294 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 04:17:59,295 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 04:17:59,295 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 04:17:59,295 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 04:17:59,295 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 04:17:59,296 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 04:17:59,296 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 04:17:59,296 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 04:17:59,296 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 04:17:59,296 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 04:17:59,296 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 04:17:59,297 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 04:17:59,297 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 04:17:59,297 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 04:17:59,297 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-10 04:17:59,297 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-10 04:17:59,297 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 04:17:59,298 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 04:17:59,298 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 04:17:59,298 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 04:17:59,298 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 04:17:59,298 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 04:17:59,298 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-10 04:17:59,298 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 04:17:59,299 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 04:17:59,299 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_8452b81a-4c31-4383-990e-39801a40c6ba/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 -> d554aa2ddd753c54eae3eaa938a78036ee261f5c [2018-11-10 04:17:59,327 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 04:17:59,338 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 04:17:59,341 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 04:17:59,342 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 04:17:59,342 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 04:17:59,343 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8452b81a-4c31-4383-990e-39801a40c6ba/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3_false-unreach-call.1.ufo.UNBOUNDED.pals.c [2018-11-10 04:17:59,391 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8452b81a-4c31-4383-990e-39801a40c6ba/bin-2019/ukojak/data/dd5f943d5/9c17f4e8f71d4255acc6f320c2359d7c/FLAG8ce780371 [2018-11-10 04:17:59,735 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 04:17:59,736 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8452b81a-4c31-4383-990e-39801a40c6ba/sv-benchmarks/c/seq-mthreaded/pals_lcr.3_false-unreach-call.1.ufo.UNBOUNDED.pals.c [2018-11-10 04:17:59,741 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8452b81a-4c31-4383-990e-39801a40c6ba/bin-2019/ukojak/data/dd5f943d5/9c17f4e8f71d4255acc6f320c2359d7c/FLAG8ce780371 [2018-11-10 04:17:59,753 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8452b81a-4c31-4383-990e-39801a40c6ba/bin-2019/ukojak/data/dd5f943d5/9c17f4e8f71d4255acc6f320c2359d7c [2018-11-10 04:17:59,755 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 04:17:59,756 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 04:17:59,756 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 04:17:59,756 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 04:17:59,758 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 04:17:59,759 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:17:59" (1/1) ... [2018-11-10 04:17:59,761 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@662aff13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:17:59, skipping insertion in model container [2018-11-10 04:17:59,761 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:17:59" (1/1) ... [2018-11-10 04:17:59,767 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 04:17:59,791 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 04:17:59,912 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:17:59,917 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 04:17:59,946 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:17:59,957 INFO L193 MainTranslator]: Completed translation [2018-11-10 04:17:59,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:17:59 WrapperNode [2018-11-10 04:17:59,958 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 04:17:59,958 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 04:17:59,959 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 04:17:59,959 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 04:17:59,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:17:59" (1/1) ... [2018-11-10 04:17:59,970 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:17:59" (1/1) ... [2018-11-10 04:17:59,988 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 04:17:59,988 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 04:17:59,988 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 04:17:59,988 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 04:18:00,036 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:17:59" (1/1) ... [2018-11-10 04:18:00,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:17:59" (1/1) ... [2018-11-10 04:18:00,038 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:17:59" (1/1) ... [2018-11-10 04:18:00,038 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:17:59" (1/1) ... [2018-11-10 04:18:00,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:17:59" (1/1) ... [2018-11-10 04:18:00,047 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:17:59" (1/1) ... [2018-11-10 04:18:00,049 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:17:59" (1/1) ... [2018-11-10 04:18:00,051 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 04:18:00,051 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 04:18:00,052 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 04:18:00,052 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 04:18:00,052 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:17:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8452b81a-4c31-4383-990e-39801a40c6ba/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 04:18:00,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 04:18:00,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 04:18:00,892 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 04:18:00,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:18:00 BoogieIcfgContainer [2018-11-10 04:18:00,893 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 04:18:00,893 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-10 04:18:00,893 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-10 04:18:00,903 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-10 04:18:00,903 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:18:00" (1/1) ... [2018-11-10 04:18:00,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:18:00,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:18:00,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 14 states and 19 transitions. [2018-11-10 04:18:00,948 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2018-11-10 04:18:00,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-10 04:18:00,951 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:18:01,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:18:01,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:18:01,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:18:01,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 15 states and 20 transitions. [2018-11-10 04:18:01,272 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2018-11-10 04:18:01,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-10 04:18:01,272 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:18:01,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:18:01,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:18:01,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:18:01,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 20 states and 28 transitions. [2018-11-10 04:18:01,551 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-11-10 04:18:01,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-10 04:18:01,552 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:18:01,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:18:01,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:18:07,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:18:07,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 26 states and 40 transitions. [2018-11-10 04:18:07,217 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 40 transitions. [2018-11-10 04:18:07,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-10 04:18:07,219 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:18:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:18:07,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:18:07,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:18:07,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 27 states and 41 transitions. [2018-11-10 04:18:07,480 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 41 transitions. [2018-11-10 04:18:07,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 04:18:07,480 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:18:07,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:18:07,846 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2018-11-10 04:18:09,801 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:18:13,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:18:13,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 39 states and 64 transitions. [2018-11-10 04:18:13,261 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 64 transitions. [2018-11-10 04:18:13,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 04:18:13,262 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:18:13,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:18:13,597 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 65 [2018-11-10 04:18:14,333 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:18:14,481 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 75 [2018-11-10 04:18:15,997 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2018-11-10 04:18:16,553 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 85 [2018-11-10 04:18:17,165 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 80 [2018-11-10 04:18:32,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:18:32,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 50 states and 84 transitions. [2018-11-10 04:18:32,071 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 84 transitions. [2018-11-10 04:18:32,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 04:18:32,072 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:18:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:18:33,834 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:18:34,208 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2018-11-10 04:18:37,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:18:37,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 59 states and 95 transitions. [2018-11-10 04:18:37,998 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 95 transitions. [2018-11-10 04:18:37,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 04:18:37,999 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:18:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:18:40,226 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:18:52,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:18:52,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 72 states and 123 transitions. [2018-11-10 04:18:52,360 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 123 transitions. [2018-11-10 04:18:52,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 04:18:52,360 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:18:52,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:18:54,418 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:19:02,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:19:02,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 83 states and 153 transitions. [2018-11-10 04:19:02,885 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 153 transitions. [2018-11-10 04:19:02,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 04:19:02,886 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:19:02,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:19:03,713 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:19:10,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:19:10,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 96 states and 182 transitions. [2018-11-10 04:19:10,988 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 182 transitions. [2018-11-10 04:19:10,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 04:19:10,989 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:19:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:19:11,272 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:19:13,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:19:13,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 98 states and 187 transitions. [2018-11-10 04:19:13,239 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 187 transitions. [2018-11-10 04:19:13,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 04:19:13,240 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:19:13,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:19:14,771 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:19:15,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:19:15,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 100 states and 193 transitions. [2018-11-10 04:19:15,175 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 193 transitions. [2018-11-10 04:19:15,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 04:19:15,175 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:19:15,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:19:16,640 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:19:17,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:19:17,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 102 states and 196 transitions. [2018-11-10 04:19:17,036 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 196 transitions. [2018-11-10 04:19:17,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 04:19:17,037 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:19:17,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:19:18,018 WARN L179 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 73 [2018-11-10 04:19:18,592 WARN L179 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 73 [2018-11-10 04:19:19,174 WARN L179 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 80 [2018-11-10 04:19:19,834 WARN L179 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 83 [2018-11-10 04:19:20,465 WARN L179 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 80 [2018-11-10 04:19:21,082 WARN L179 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 78 [2018-11-10 04:19:21,748 WARN L179 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 90 [2018-11-10 04:19:22,455 WARN L179 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 88 [2018-11-10 04:19:22,992 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 72 [2018-11-10 04:19:23,500 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 72 [2018-11-10 04:19:23,540 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:19:23,700 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 68 [2018-11-10 04:19:24,143 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 84 [2018-11-10 04:19:24,802 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 90 [2018-11-10 04:19:25,239 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 101 [2018-11-10 04:19:28,177 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 92 [2018-11-10 04:19:28,692 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 104 [2018-11-10 04:19:29,546 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 91 [2018-11-10 04:19:30,049 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 103 [2018-11-10 04:19:31,323 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 88 [2018-11-10 04:19:31,869 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 90 [2018-11-10 04:19:32,775 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 94 [2018-11-10 04:19:33,025 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 96 [2018-11-10 04:19:34,412 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 95 [2018-11-10 04:19:34,648 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 98 [2018-11-10 04:19:36,811 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 96 [2018-11-10 04:19:37,059 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 99 [2018-11-10 04:19:39,420 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 95 [2018-11-10 04:19:39,683 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 100 [2018-11-10 04:19:40,695 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 108 [2018-11-10 04:19:41,624 WARN L179 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2018-11-10 04:19:44,150 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 103 [2018-11-10 04:19:44,433 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 105 [2018-11-10 04:19:45,478 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 104 [2018-11-10 04:19:47,135 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 100 [2018-11-10 04:19:48,398 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 101 [2018-11-10 04:19:50,995 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 98 [2018-11-10 04:19:52,270 WARN L179 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 109 [2018-11-10 04:19:52,486 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2018-11-10 04:19:52,892 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2018-11-10 04:19:53,330 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2018-11-10 04:19:53,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:19:53,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 131 states and 280 transitions. [2018-11-10 04:19:53,417 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 280 transitions. [2018-11-10 04:19:53,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 04:19:53,418 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:19:53,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:19:53,783 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:19:54,116 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2018-11-10 04:19:54,382 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2018-11-10 04:19:55,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:19:55,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 133 states and 297 transitions. [2018-11-10 04:19:55,230 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 297 transitions. [2018-11-10 04:19:55,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 04:19:55,231 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:19:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:19:57,609 WARN L179 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 64 [2018-11-10 04:19:58,601 WARN L179 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 92 [2018-11-10 04:19:59,691 WARN L179 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 98 [2018-11-10 04:20:00,660 WARN L179 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 94 [2018-11-10 04:20:02,710 WARN L179 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 132 [2018-11-10 04:20:03,589 WARN L179 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 96 [2018-11-10 04:20:04,478 WARN L179 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 100 [2018-11-10 04:20:04,680 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:20:05,366 WARN L179 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 96 [2018-11-10 04:20:06,060 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 122 [2018-11-10 04:20:08,727 WARN L179 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 98 [2018-11-10 04:20:09,481 WARN L179 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 124 [2018-11-10 04:20:10,270 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-11-10 04:20:11,322 WARN L179 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 101 [2018-11-10 04:20:11,772 WARN L179 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 123 [2018-11-10 04:20:13,603 WARN L179 SmtUtils]: Spent 643.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 122 [2018-11-10 04:20:44,120 WARN L179 SmtUtils]: Spent 3.07 s on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2018-11-10 04:20:44,727 WARN L179 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 145 [2018-11-10 04:20:46,785 WARN L179 SmtUtils]: Spent 313.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2018-11-10 04:20:47,363 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2018-11-10 04:20:48,410 WARN L179 SmtUtils]: Spent 704.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 127 [2018-11-10 04:20:49,030 WARN L179 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 150 [2018-11-10 04:20:49,643 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2018-11-10 04:20:50,256 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 150 [2018-11-10 04:20:51,190 WARN L179 SmtUtils]: Spent 741.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 128 [2018-11-10 04:20:51,903 WARN L179 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 151 [2018-11-10 04:20:52,433 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2018-11-10 04:20:53,026 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2018-11-10 04:20:53,963 WARN L179 SmtUtils]: Spent 765.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 129 [2018-11-10 04:20:54,636 WARN L179 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 152 [2018-11-10 04:20:55,270 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2018-11-10 04:20:55,825 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2018-11-10 04:20:56,621 WARN L179 SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 148 [2018-11-10 04:20:57,331 WARN L179 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 160 [2018-11-10 04:20:57,931 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2018-11-10 04:20:58,567 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2018-11-10 04:20:59,023 WARN L179 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 129 [2018-11-10 04:20:59,912 WARN L179 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 132 [2018-11-10 04:21:00,386 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-11-10 04:21:00,862 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2018-11-10 04:21:01,361 WARN L179 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 124 [2018-11-10 04:21:01,723 WARN L179 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 127 [2018-11-10 04:21:02,192 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-11-10 04:21:02,653 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2018-11-10 04:21:03,647 WARN L179 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 127 [2018-11-10 04:21:05,477 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2018-11-10 04:21:05,842 WARN L179 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 121 [2018-11-10 04:21:06,191 WARN L179 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 123 [2018-11-10 04:21:06,663 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2018-11-10 04:21:07,193 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2018-11-10 04:21:07,563 WARN L179 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 124 [2018-11-10 04:21:07,933 WARN L179 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 127 [2018-11-10 04:21:08,443 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-11-10 04:21:08,963 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2018-11-10 04:21:09,342 WARN L179 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 121 [2018-11-10 04:21:09,729 WARN L179 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 124 [2018-11-10 04:21:10,238 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2018-11-10 04:21:10,769 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-11-10 04:21:11,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:21:11,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 160 states and 365 transitions. [2018-11-10 04:21:11,092 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 365 transitions. [2018-11-10 04:21:11,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 04:21:11,092 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:21:11,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:21:12,103 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:21:12,871 WARN L179 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 140 [2018-11-10 04:21:13,428 WARN L179 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 154 [2018-11-10 04:21:14,165 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2018-11-10 04:21:14,837 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 155 [2018-11-10 04:21:15,477 WARN L179 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 135 [2018-11-10 04:21:16,022 WARN L179 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 149 [2018-11-10 04:21:16,696 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2018-11-10 04:21:17,350 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 150 [2018-11-10 04:21:18,707 WARN L179 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 150 [2018-11-10 04:21:19,423 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2018-11-10 04:21:19,881 WARN L179 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 130 [2018-11-10 04:21:20,393 WARN L179 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 146 [2018-11-10 04:21:20,967 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-11-10 04:21:21,697 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 147 [2018-11-10 04:21:22,160 WARN L179 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 132 [2018-11-10 04:21:23,973 WARN L179 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 147 [2018-11-10 04:21:24,575 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2018-11-10 04:21:25,336 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2018-11-10 04:21:25,805 WARN L179 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 129 [2018-11-10 04:21:26,400 WARN L179 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 144 [2018-11-10 04:21:28,343 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2018-11-10 04:21:29,019 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2018-11-10 04:21:29,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:21:29,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 167 states and 388 transitions. [2018-11-10 04:21:29,042 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 388 transitions. [2018-11-10 04:21:29,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 04:21:29,042 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:21:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:21:30,224 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:21:31,227 WARN L179 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 155 [2018-11-10 04:21:31,924 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2018-11-10 04:21:32,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:21:32,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 169 states and 398 transitions. [2018-11-10 04:21:32,277 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 398 transitions. [2018-11-10 04:21:32,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 04:21:32,277 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:21:32,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:21:34,908 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:21:35,659 WARN L179 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2018-11-10 04:21:37,645 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2018-11-10 04:21:38,278 WARN L179 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 121 [2018-11-10 04:21:40,210 WARN L179 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 129 DAG size of output: 127 [2018-11-10 04:21:40,809 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2018-11-10 04:21:41,536 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2018-11-10 04:21:41,921 WARN L179 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 122 [2018-11-10 04:21:42,593 WARN L179 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 128 [2018-11-10 04:21:43,341 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2018-11-10 04:21:44,110 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2018-11-10 04:21:44,870 WARN L179 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 143 [2018-11-10 04:21:45,529 WARN L179 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 149 [2018-11-10 04:21:46,253 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2018-11-10 04:21:46,986 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2018-11-10 04:21:47,479 WARN L179 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 130 [2018-11-10 04:21:48,424 WARN L179 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 143 [2018-11-10 04:21:49,040 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2018-11-10 04:21:49,773 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2018-11-10 04:21:50,483 WARN L179 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 138 [2018-11-10 04:21:51,142 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-11-10 04:21:51,618 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2018-11-10 04:21:52,028 WARN L179 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 133 [2018-11-10 04:21:53,959 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2018-11-10 04:21:54,620 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2018-11-10 04:21:54,922 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2018-11-10 04:21:55,343 WARN L179 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 135 [2018-11-10 04:21:55,985 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2018-11-10 04:21:56,633 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2018-11-10 04:21:57,265 WARN L179 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 132 [2018-11-10 04:21:57,980 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2018-11-10 04:21:58,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:21:58,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 185 states and 425 transitions. [2018-11-10 04:21:58,382 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 425 transitions. [2018-11-10 04:21:58,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 04:21:58,383 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:21:58,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:21:59,548 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:22:05,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:22:05,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 194 states and 440 transitions. [2018-11-10 04:22:05,931 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 440 transitions. [2018-11-10 04:22:05,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 04:22:05,931 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:22:05,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:22:07,153 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:22:07,545 WARN L179 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 120 [2018-11-10 04:22:07,903 WARN L179 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 132 [2018-11-10 04:22:08,467 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2018-11-10 04:22:09,071 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2018-11-10 04:22:09,627 WARN L179 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 127 [2018-11-10 04:22:11,471 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2018-11-10 04:22:11,851 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2018-11-10 04:22:12,188 WARN L179 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 125 [2018-11-10 04:22:12,754 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-11-10 04:22:14,619 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2018-11-10 04:22:14,865 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2018-11-10 04:22:15,217 WARN L179 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 128 [2018-11-10 04:22:15,828 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2018-11-10 04:22:19,068 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-11-10 04:22:19,583 WARN L179 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 125 [2018-11-10 04:22:20,168 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2018-11-10 04:22:20,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:22:20,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 203 states and 457 transitions. [2018-11-10 04:22:20,513 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 457 transitions. [2018-11-10 04:22:20,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 04:22:20,513 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:22:20,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:22:26,609 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 16 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:22:31,094 WARN L179 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 134 [2018-11-10 04:22:31,823 WARN L179 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 137 [2018-11-10 04:22:32,502 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2018-11-10 04:22:33,171 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2018-11-10 04:22:33,725 WARN L179 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 136 [2018-11-10 04:22:34,147 WARN L179 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 139 [2018-11-10 04:22:34,837 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2018-11-10 04:22:35,717 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2018-11-10 04:22:36,175 WARN L179 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 137 [2018-11-10 04:22:36,612 WARN L179 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 139 [2018-11-10 04:22:37,349 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2018-11-10 04:22:38,735 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2018-11-10 04:22:43,781 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-11-10 04:22:47,670 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2018-11-10 04:22:48,542 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2018-11-10 04:22:51,555 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-11-10 04:22:53,748 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-11-10 04:22:53,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:22:53,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 221 states and 513 transitions. [2018-11-10 04:22:53,902 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 513 transitions. [2018-11-10 04:22:53,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 04:22:53,903 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:22:53,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:22:54,295 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 16 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:22:58,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:22:58,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 225 states and 519 transitions. [2018-11-10 04:22:58,748 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 519 transitions. [2018-11-10 04:22:58,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 04:22:58,749 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:22:58,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:22:59,438 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 16 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:22:59,830 WARN L179 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 125 [2018-11-10 04:23:00,148 WARN L179 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 126 [2018-11-10 04:23:00,760 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2018-11-10 04:23:01,385 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2018-11-10 04:23:01,861 WARN L179 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 128 [2018-11-10 04:23:02,207 WARN L179 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 129 [2018-11-10 04:23:02,881 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-11-10 04:23:03,534 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2018-11-10 04:23:03,794 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2018-11-10 04:23:04,159 WARN L179 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 132 [2018-11-10 04:23:04,866 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2018-11-10 04:23:05,557 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2018-11-10 04:23:05,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:23:05,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 229 states and 525 transitions. [2018-11-10 04:23:05,628 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 525 transitions. [2018-11-10 04:23:05,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 04:23:05,629 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:23:05,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:23:08,750 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 8 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:23:10,538 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 70 [2018-11-10 04:23:24,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:23:24,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 240 states and 553 transitions. [2018-11-10 04:23:24,008 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 553 transitions. [2018-11-10 04:23:24,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 04:23:24,009 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:23:24,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:23:25,312 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 8 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:23:30,613 WARN L179 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2018-11-10 04:23:32,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:23:32,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 247 states and 567 transitions. [2018-11-10 04:23:32,087 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 567 transitions. [2018-11-10 04:23:32,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 04:23:32,088 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:23:32,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:23:33,279 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 8 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:23:33,962 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2018-11-10 04:23:37,166 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2018-11-10 04:23:37,904 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2018-11-10 04:23:39,277 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2018-11-10 04:23:40,003 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2018-11-10 04:23:41,468 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2018-11-10 04:23:42,190 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2018-11-10 04:23:44,090 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2018-11-10 04:23:44,794 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2018-11-10 04:23:45,737 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 155 [2018-11-10 04:23:45,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:23:45,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 252 states and 579 transitions. [2018-11-10 04:23:45,760 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 579 transitions. [2018-11-10 04:23:45,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 04:23:45,761 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:23:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:23:47,154 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 8 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:23:48,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:23:48,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 254 states and 581 transitions. [2018-11-10 04:23:48,354 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 581 transitions. [2018-11-10 04:23:48,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 04:23:48,354 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:23:48,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:23:53,687 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 16 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:24:10,536 WARN L179 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 89 [2018-11-10 04:24:11,165 WARN L179 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 160 [2018-11-10 04:24:12,831 WARN L179 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 161 [2018-11-10 04:24:13,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:24:13,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 267 states and 631 transitions. [2018-11-10 04:24:13,023 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 631 transitions. [2018-11-10 04:24:13,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 04:24:13,024 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:24:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:24:13,585 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 16 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:24:14,035 WARN L179 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 127 [2018-11-10 04:24:14,398 WARN L179 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 132 [2018-11-10 04:24:15,098 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2018-11-10 04:24:15,820 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2018-11-10 04:24:16,341 WARN L179 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 130 [2018-11-10 04:24:16,735 WARN L179 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 135 [2018-11-10 04:24:17,512 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2018-11-10 04:24:19,574 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2018-11-10 04:24:19,999 WARN L179 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 131 [2018-11-10 04:24:20,397 WARN L179 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 135 [2018-11-10 04:24:21,164 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2018-11-10 04:24:21,951 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2018-11-10 04:24:28,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:24:28,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 285 states and 676 transitions. [2018-11-10 04:24:28,972 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 676 transitions. [2018-11-10 04:24:28,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 04:24:28,973 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:24:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:24:31,827 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 8 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:24:36,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:24:36,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 287 states and 678 transitions. [2018-11-10 04:24:36,535 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 678 transitions. [2018-11-10 04:24:36,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 04:24:36,536 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:24:36,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:24:37,103 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 16 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:24:37,599 WARN L179 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 138 [2018-11-10 04:24:38,052 WARN L179 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 142 [2018-11-10 04:24:38,959 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-11-10 04:24:39,844 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2018-11-10 04:24:40,443 WARN L179 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 140 [2018-11-10 04:24:40,894 WARN L179 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 144 [2018-11-10 04:24:41,796 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 141 [2018-11-10 04:24:42,727 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2018-11-10 04:24:43,209 WARN L179 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 141 [2018-11-10 04:24:43,666 WARN L179 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 145 [2018-11-10 04:24:44,630 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 142 [2018-11-10 04:24:45,587 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 146 [2018-11-10 04:24:45,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:24:45,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 296 states and 696 transitions. [2018-11-10 04:24:45,664 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 696 transitions. [2018-11-10 04:24:45,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-10 04:24:45,673 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:24:45,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:24:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:24:46,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:24:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:24:46,245 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 33 iterations. [2018-11-10 04:24:46,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 10.11 04:24:46 ImpRootNode [2018-11-10 04:24:46,318 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-10 04:24:46,318 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 04:24:46,318 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 04:24:46,318 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 04:24:46,319 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:18:00" (3/4) ... [2018-11-10 04:24:46,321 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 04:24:46,428 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8452b81a-4c31-4383-990e-39801a40c6ba/bin-2019/ukojak/witness.graphml [2018-11-10 04:24:46,428 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 04:24:46,429 INFO L168 Benchmark]: Toolchain (without parser) took 406673.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 959.3 MB in the beginning and 840.0 MB in the end (delta: 119.3 MB). Peak memory consumption was 267.6 MB. Max. memory is 11.5 GB. [2018-11-10 04:24:46,429 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:24:46,429 INFO L168 Benchmark]: CACSL2BoogieTranslator took 201.97 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 943.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 04:24:46,430 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.51 ms. Allocated memory is still 1.0 GB. Free memory is still 943.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:24:46,430 INFO L168 Benchmark]: Boogie Preprocessor took 63.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 943.1 MB in the beginning and 1.2 GB in the end (delta: -211.9 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2018-11-10 04:24:46,430 INFO L168 Benchmark]: RCFGBuilder took 841.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 119.5 MB). Peak memory consumption was 119.5 MB. Max. memory is 11.5 GB. [2018-11-10 04:24:46,430 INFO L168 Benchmark]: CodeCheck took 405424.37 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -12.6 MB). Free memory was 1.0 GB in the beginning and 852.8 MB in the end (delta: 182.8 MB). Peak memory consumption was 170.2 MB. Max. memory is 11.5 GB. [2018-11-10 04:24:46,430 INFO L168 Benchmark]: Witness Printer took 110.28 ms. Allocated memory is still 1.2 GB. Free memory was 852.8 MB in the beginning and 840.0 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2018-11-10 04:24:46,435 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, 63 locations, 1 error locations. UNSAFE Result, 405.3s OverallTime, 33 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 0 SDtfs, 2135061576 SDslu, -2042668576 SDs, 0 SdLazy, 1878982978 SolverSat, -1854657454 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 91.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12495 GetRequests, 10949 SyntacticMatches, 750 SemanticMatches, 796 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413911 ImplicationChecksByTransitivity, 392.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 59.6s InterpolantComputationTime, 1072 NumberOfCodeBlocks, 1072 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 988 ConstructedInterpolants, 0 QuantifiedInterpolants, 1419229 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 4 PerfectInterpolantSequences, 230/1403 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: 330]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L71] unsigned char r1 ; [L73] char p1_old ; [L74] char p1_new ; [L75] char id1 ; [L76] char st1 ; [L78] _Bool mode1 ; [L80] char p2_old ; [L81] char p2_new ; [L82] char id2 ; [L83] char st2 ; [L85] _Bool mode2 ; [L87] char p3_old ; [L88] char p3_new ; [L89] char id3 ; [L90] char st3 ; [L92] _Bool mode3 ; [L70] msg_t nomsg = (msg_t )-1; [L72] port_t p1 ; [L77] msg_t send1 ; [L79] port_t p2 ; [L84] msg_t send2 ; [L86] port_t p3 ; [L91] msg_t send3 ; [L174] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L278] int c1 ; [L279] int i2 ; [L282] c1 = 0 [L283] r1 = __VERIFIER_nondet_uchar() [L284] id1 = __VERIFIER_nondet_char() [L285] st1 = __VERIFIER_nondet_char() [L286] send1 = __VERIFIER_nondet_char() [L287] mode1 = __VERIFIER_nondet_bool() [L288] id2 = __VERIFIER_nondet_char() [L289] st2 = __VERIFIER_nondet_char() [L290] send2 = __VERIFIER_nondet_char() [L291] mode2 = __VERIFIER_nondet_bool() [L292] id3 = __VERIFIER_nondet_char() [L293] st3 = __VERIFIER_nondet_char() [L294] send3 = __VERIFIER_nondet_char() [L295] mode3 = __VERIFIER_nondet_bool() [L296] CALL, EXPR init() [L177] int tmp ; [L180] COND TRUE (int )r1 == 0 [L181] COND TRUE (int )id1 >= 0 [L182] COND TRUE (int )st1 == 0 [L183] COND TRUE (int )send1 == (int )id1 [L184] COND TRUE (int )mode1 == 0 [L185] COND TRUE (int )id2 >= 0 [L186] COND TRUE (int )st2 == 0 [L187] COND TRUE (int )send2 == (int )id2 [L188] COND TRUE (int )mode2 == 0 [L189] COND TRUE (int )id3 >= 0 [L190] COND TRUE (int )st3 == 0 [L191] COND TRUE (int )send3 == (int )id3 [L192] COND TRUE (int )mode3 == 0 [L193] COND TRUE (int )id1 != (int )id2 [L194] COND TRUE (int )id1 != (int )id3 [L195] COND TRUE (int )id2 != (int )id3 [L196] tmp = 1 [L245] RET return (tmp); [L296] EXPR init() [L296] i2 = init() [L298] p1_old = nomsg [L299] p1_new = nomsg [L300] p2_old = nomsg [L301] p2_new = nomsg [L302] p3_old = nomsg [L303] p3_new = nomsg [L304] i2 = 0 VAL [id1=66, id2=65, id3=64, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=66, send2=65, send3=64, st1=0, st2=0, st3=0] [L305] COND TRUE 1 [L307] CALL node1() [L95] msg_t m1 ; [L98] m1 = nomsg [L99] COND FALSE !(\read(mode1)) [L118] COND TRUE, EXPR send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L118] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L119] RET mode1 = (_Bool)1 [L307] node1() [L308] CALL node2() [L126] msg_t m2 ; [L129] m2 = nomsg [L130] COND FALSE !(\read(mode2)) [L143] COND TRUE, EXPR send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L143] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L144] RET mode2 = (_Bool)1 [L308] node2() [L309] CALL node3() [L151] msg_t m3 ; [L154] m3 = nomsg [L155] COND FALSE !(\read(mode3)) [L168] COND TRUE, EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L168] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L169] RET mode3 = (_Bool)1 [L309] node3() [L310] p1_old = p1_new [L311] p1_new = nomsg [L312] p2_old = p2_new [L313] p2_new = nomsg [L314] p3_old = p3_new [L315] p3_new = nomsg [L316] CALL, EXPR check() [L250] int tmp ; VAL [id1=66, id2=65, id3=64, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=66, p2=0, p2_new=-1, p2_old=65, p3=0, p3_new=-1, p3_old=64, r1=0, send1=66, send2=65, send3=64, st1=0, st2=0, st3=0] [L253] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=66, id2=65, id3=64, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=66, p2=0, p2_new=-1, p2_old=65, p3=0, p3_new=-1, p3_old=64, r1=0, send1=66, send2=65, send3=64, st1=0, st2=0, st3=0] [L254] COND FALSE !((int )r1 >= 3) VAL [id1=66, id2=65, id3=64, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=66, p2=0, p2_new=-1, p2_old=65, p3=0, p3_new=-1, p3_old=64, r1=0, send1=66, send2=65, send3=64, st1=0, st2=0, st3=0] [L257] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=66, id2=65, id3=64, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=66, p2=0, p2_new=-1, p2_old=65, p3=0, p3_new=-1, p3_old=64, r1=0, send1=66, send2=65, send3=64, st1=0, st2=0, st3=0] [L259] COND TRUE (int )r1 < 3 [L260] tmp = 1 VAL [id1=66, id2=65, id3=64, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=66, p2=0, p2_new=-1, p2_old=65, p3=0, p3_new=-1, p3_old=64, r1=0, send1=66, send2=65, send3=64, st1=0, st2=0, st3=0] [L273] RET return (tmp); [L316] EXPR check() [L316] c1 = check() [L317] CALL assert(c1) [L328] COND FALSE, RET !(! arg) VAL [id1=66, id2=65, id3=64, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=66, p2=0, p2_new=-1, p2_old=65, p3=0, p3_new=-1, p3_old=64, r1=0, send1=66, send2=65, send3=64, st1=0, st2=0, st3=0] [L317] assert(c1) [L305] COND TRUE 1 [L307] CALL node1() [L95] msg_t m1 ; [L98] m1 = nomsg [L99] COND TRUE \read(mode1) [L100] COND FALSE !(r1 == 255) [L103] r1 = r1 + 1 [L104] m1 = p3_old [L105] p3_old = nomsg [L106] COND TRUE (int )m1 != (int )nomsg [L107] COND FALSE !((int )m1 > (int )id1) [L110] COND FALSE !((int )m1 == (int )id1) [L113] send1 = m1 [L116] RET mode1 = (_Bool)0 [L307] node1() [L308] CALL node2() [L126] msg_t m2 ; [L129] m2 = nomsg [L130] COND TRUE \read(mode2) [L131] m2 = p1_old [L132] p1_old = nomsg [L133] COND TRUE (int )m2 != (int )nomsg [L134] COND TRUE (int )m2 > (int )id2 [L135] send2 = m2 [L141] RET mode2 = (_Bool)0 [L308] node2() [L309] CALL node3() [L151] msg_t m3 ; [L154] m3 = nomsg [L155] COND TRUE \read(mode3) [L156] m3 = p2_old [L157] p2_old = nomsg [L158] COND TRUE (int )m3 != (int )nomsg [L159] COND TRUE (int )m3 > (int )id3 [L160] send3 = m3 [L166] RET mode3 = (_Bool)0 [L309] node3() [L310] p1_old = p1_new [L311] p1_new = nomsg [L312] p2_old = p2_new [L313] p2_new = nomsg [L314] p3_old = p3_new [L315] p3_new = nomsg [L316] CALL, EXPR check() [L250] int tmp ; VAL [id1=66, id2=65, id3=64, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=66, send3=65, st1=0, st2=0, st3=0] [L253] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=66, id2=65, id3=64, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=66, send3=65, st1=0, st2=0, st3=0] [L254] COND FALSE !((int )r1 >= 3) VAL [id1=66, id2=65, id3=64, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=66, send3=65, st1=0, st2=0, st3=0] [L257] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=66, id2=65, id3=64, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=66, send3=65, st1=0, st2=0, st3=0] [L259] COND TRUE (int )r1 < 3 [L260] tmp = 1 VAL [id1=66, id2=65, id3=64, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=66, send3=65, st1=0, st2=0, st3=0] [L273] RET return (tmp); [L316] EXPR check() [L316] c1 = check() [L317] CALL assert(c1) [L328] COND FALSE, RET !(! arg) VAL [id1=66, id2=65, id3=64, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=64, send2=66, send3=65, st1=0, st2=0, st3=0] [L317] assert(c1) [L305] COND TRUE 1 [L307] CALL node1() [L95] msg_t m1 ; [L98] m1 = nomsg [L99] COND FALSE !(\read(mode1)) [L118] COND TRUE, EXPR send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L118] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L119] RET mode1 = (_Bool)1 [L307] node1() [L308] CALL node2() [L126] msg_t m2 ; [L129] m2 = nomsg [L130] COND FALSE !(\read(mode2)) [L143] COND TRUE, EXPR send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L143] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L144] RET mode2 = (_Bool)1 [L308] node2() [L309] CALL node3() [L151] msg_t m3 ; [L154] m3 = nomsg [L155] COND FALSE !(\read(mode3)) [L168] COND TRUE, EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L168] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L169] RET mode3 = (_Bool)1 [L309] node3() [L310] p1_old = p1_new [L311] p1_new = nomsg [L312] p2_old = p2_new [L313] p2_new = nomsg [L314] p3_old = p3_new [L315] p3_new = nomsg [L316] CALL, EXPR check() [L250] int tmp ; VAL [id1=66, id2=65, id3=64, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=66, p3=0, p3_new=-1, p3_old=65, r1=1, send1=64, send2=66, send3=65, st1=0, st2=0, st3=0] [L253] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=66, id2=65, id3=64, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=66, p3=0, p3_new=-1, p3_old=65, r1=1, send1=64, send2=66, send3=65, st1=0, st2=0, st3=0] [L254] COND FALSE !((int )r1 >= 3) VAL [id1=66, id2=65, id3=64, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=66, p3=0, p3_new=-1, p3_old=65, r1=1, send1=64, send2=66, send3=65, st1=0, st2=0, st3=0] [L257] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=66, id2=65, id3=64, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=66, p3=0, p3_new=-1, p3_old=65, r1=1, send1=64, send2=66, send3=65, st1=0, st2=0, st3=0] [L259] COND TRUE (int )r1 < 3 [L260] tmp = 1 VAL [id1=66, id2=65, id3=64, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=66, p3=0, p3_new=-1, p3_old=65, r1=1, send1=64, send2=66, send3=65, st1=0, st2=0, st3=0] [L273] RET return (tmp); [L316] EXPR check() [L316] c1 = check() [L317] CALL assert(c1) [L328] COND FALSE, RET !(! arg) VAL [id1=66, id2=65, id3=64, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=64, p2=0, p2_new=-1, p2_old=66, p3=0, p3_new=-1, p3_old=65, r1=1, send1=64, send2=66, send3=65, st1=0, st2=0, st3=0] [L317] assert(c1) [L305] COND TRUE 1 [L307] CALL node1() [L95] msg_t m1 ; [L98] m1 = nomsg [L99] COND TRUE \read(mode1) [L100] COND FALSE !(r1 == 255) [L103] r1 = r1 + 1 [L104] m1 = p3_old [L105] p3_old = nomsg [L106] COND TRUE (int )m1 != (int )nomsg [L107] COND FALSE !((int )m1 > (int )id1) [L110] COND FALSE !((int )m1 == (int )id1) [L113] send1 = m1 [L116] RET mode1 = (_Bool)0 [L307] node1() [L308] CALL node2() [L126] msg_t m2 ; [L129] m2 = nomsg [L130] COND TRUE \read(mode2) [L131] m2 = p1_old [L132] p1_old = nomsg [L133] COND TRUE (int )m2 != (int )nomsg [L134] COND FALSE !((int )m2 > (int )id2) [L137] COND FALSE !((int )m2 == (int )id2) [L141] RET mode2 = (_Bool)0 [L308] node2() [L309] CALL node3() [L151] msg_t m3 ; [L154] m3 = nomsg [L155] COND TRUE \read(mode3) [L156] m3 = p2_old [L157] p2_old = nomsg [L158] COND TRUE (int )m3 != (int )nomsg [L159] COND TRUE (int )m3 > (int )id3 [L160] send3 = m3 [L166] RET mode3 = (_Bool)0 [L309] node3() [L310] p1_old = p1_new [L311] p1_new = nomsg [L312] p2_old = p2_new [L313] p2_new = nomsg [L314] p3_old = p3_new [L315] p3_new = nomsg [L316] CALL, EXPR check() [L250] int tmp ; VAL [id1=66, id2=65, id3=64, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=65, send2=66, send3=66, st1=0, st2=0, st3=0] [L253] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=66, id2=65, id3=64, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=65, send2=66, send3=66, st1=0, st2=0, st3=0] [L254] COND FALSE !((int )r1 >= 3) VAL [id1=66, id2=65, id3=64, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=65, send2=66, send3=66, st1=0, st2=0, st3=0] [L257] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=66, id2=65, id3=64, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=65, send2=66, send3=66, st1=0, st2=0, st3=0] [L259] COND TRUE (int )r1 < 3 [L260] tmp = 1 VAL [id1=66, id2=65, id3=64, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=65, send2=66, send3=66, st1=0, st2=0, st3=0] [L273] RET return (tmp); [L316] EXPR check() [L316] c1 = check() [L317] CALL assert(c1) [L328] COND FALSE, RET !(! arg) VAL [id1=66, id2=65, id3=64, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=65, send2=66, send3=66, st1=0, st2=0, st3=0] [L317] assert(c1) [L305] COND TRUE 1 [L307] CALL node1() [L95] msg_t m1 ; [L98] m1 = nomsg [L99] COND FALSE !(\read(mode1)) [L118] COND TRUE, EXPR send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L118] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L119] RET mode1 = (_Bool)1 [L307] node1() [L308] CALL node2() [L126] msg_t m2 ; [L129] m2 = nomsg [L130] COND FALSE !(\read(mode2)) [L143] COND TRUE, EXPR send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L143] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L144] RET mode2 = (_Bool)1 [L308] node2() [L309] CALL node3() [L151] msg_t m3 ; [L154] m3 = nomsg [L155] COND FALSE !(\read(mode3)) [L168] COND TRUE, EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L168] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L169] RET mode3 = (_Bool)1 [L309] node3() [L310] p1_old = p1_new [L311] p1_new = nomsg [L312] p2_old = p2_new [L313] p2_new = nomsg [L314] p3_old = p3_new [L315] p3_new = nomsg [L316] CALL, EXPR check() [L250] int tmp ; VAL [id1=66, id2=65, id3=64, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=65, p2=0, p2_new=-1, p2_old=66, p3=0, p3_new=-1, p3_old=66, r1=2, send1=65, send2=66, send3=66, st1=0, st2=0, st3=0] [L253] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=66, id2=65, id3=64, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=65, p2=0, p2_new=-1, p2_old=66, p3=0, p3_new=-1, p3_old=66, r1=2, send1=65, send2=66, send3=66, st1=0, st2=0, st3=0] [L254] COND FALSE !((int )r1 >= 3) VAL [id1=66, id2=65, id3=64, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=65, p2=0, p2_new=-1, p2_old=66, p3=0, p3_new=-1, p3_old=66, r1=2, send1=65, send2=66, send3=66, st1=0, st2=0, st3=0] [L257] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=66, id2=65, id3=64, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=65, p2=0, p2_new=-1, p2_old=66, p3=0, p3_new=-1, p3_old=66, r1=2, send1=65, send2=66, send3=66, st1=0, st2=0, st3=0] [L259] COND TRUE (int )r1 < 3 [L260] tmp = 1 VAL [id1=66, id2=65, id3=64, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=65, p2=0, p2_new=-1, p2_old=66, p3=0, p3_new=-1, p3_old=66, r1=2, send1=65, send2=66, send3=66, st1=0, st2=0, st3=0] [L273] RET return (tmp); [L316] EXPR check() [L316] c1 = check() [L317] CALL assert(c1) [L328] COND FALSE, RET !(! arg) VAL [id1=66, id2=65, id3=64, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=65, p2=0, p2_new=-1, p2_old=66, p3=0, p3_new=-1, p3_old=66, r1=2, send1=65, send2=66, send3=66, st1=0, st2=0, st3=0] [L317] assert(c1) [L305] COND TRUE 1 [L307] CALL node1() [L95] msg_t m1 ; [L98] m1 = nomsg [L99] COND TRUE \read(mode1) [L100] COND FALSE !(r1 == 255) [L103] r1 = r1 + 1 [L104] m1 = p3_old [L105] p3_old = nomsg [L106] COND TRUE (int )m1 != (int )nomsg [L107] COND FALSE !((int )m1 > (int )id1) [L110] COND TRUE (int )m1 == (int )id1 [L111] st1 = (char)1 [L116] RET mode1 = (_Bool)0 [L307] node1() [L308] CALL node2() [L126] msg_t m2 ; [L129] m2 = nomsg [L130] COND TRUE \read(mode2) [L131] m2 = p1_old [L132] p1_old = nomsg [L133] COND TRUE (int )m2 != (int )nomsg [L134] COND FALSE !((int )m2 > (int )id2) [L137] COND TRUE (int )m2 == (int )id2 [L138] st2 = (char)1 [L141] RET mode2 = (_Bool)0 [L308] node2() [L309] CALL node3() [L151] msg_t m3 ; [L154] m3 = nomsg [L155] COND TRUE \read(mode3) [L156] m3 = p2_old [L157] p2_old = nomsg [L158] COND TRUE (int )m3 != (int )nomsg [L159] COND TRUE (int )m3 > (int )id3 [L160] send3 = m3 [L166] RET mode3 = (_Bool)0 [L309] node3() [L310] p1_old = p1_new [L311] p1_new = nomsg [L312] p2_old = p2_new [L313] p2_new = nomsg [L314] p3_old = p3_new [L315] p3_new = nomsg [L316] CALL, EXPR check() [L250] int tmp ; VAL [id1=66, id2=65, id3=64, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=65, send2=66, send3=66, st1=1, st2=1, st3=0] [L253] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L271] tmp = 0 VAL [id1=66, id2=65, id3=64, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=65, send2=66, send3=66, st1=1, st2=1, st3=0] [L273] RET return (tmp); [L316] EXPR check() [L316] c1 = check() [L317] CALL assert(c1) [L328] COND TRUE ! arg VAL [id1=66, id2=65, id3=64, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=65, send2=66, send3=66, st1=1, st2=1, st3=0] [L330] __VERIFIER_error() VAL [id1=66, id2=65, id3=64, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=65, send2=66, send3=66, st1=1, st2=1, st3=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 201.97 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 943.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.51 ms. Allocated memory is still 1.0 GB. Free memory is still 943.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 63.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 943.1 MB in the beginning and 1.2 GB in the end (delta: -211.9 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 841.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 119.5 MB). Peak memory consumption was 119.5 MB. Max. memory is 11.5 GB. * CodeCheck took 405424.37 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -12.6 MB). Free memory was 1.0 GB in the beginning and 852.8 MB in the end (delta: 182.8 MB). Peak memory consumption was 170.2 MB. Max. memory is 11.5 GB. * Witness Printer took 110.28 ms. Allocated memory is still 1.2 GB. Free memory was 852.8 MB in the beginning and 840.0 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...