./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_74bd0c8b-1b7a-4463-91ec-46f8e5958173/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_74bd0c8b-1b7a-4463-91ec-46f8e5958173/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_74bd0c8b-1b7a-4463-91ec-46f8e5958173/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_74bd0c8b-1b7a-4463-91ec-46f8e5958173/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/working_dir_74bd0c8b-1b7a-4463-91ec-46f8e5958173/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_74bd0c8b-1b7a-4463-91ec-46f8e5958173/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 adc229f0a7bc8afe44d4e19612f0edd5de4d255f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-5842f4b [2018-11-18 12:13:40,254 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 12:13:40,255 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 12:13:40,263 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 12:13:40,264 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 12:13:40,264 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 12:13:40,265 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 12:13:40,266 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 12:13:40,267 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 12:13:40,268 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 12:13:40,268 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 12:13:40,269 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 12:13:40,269 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 12:13:40,270 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 12:13:40,271 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 12:13:40,271 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 12:13:40,272 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 12:13:40,273 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 12:13:40,274 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 12:13:40,275 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 12:13:40,276 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 12:13:40,277 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 12:13:40,278 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 12:13:40,278 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 12:13:40,278 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 12:13:40,279 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 12:13:40,280 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 12:13:40,280 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 12:13:40,281 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 12:13:40,282 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 12:13:40,282 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 12:13:40,282 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 12:13:40,282 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 12:13:40,282 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 12:13:40,283 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 12:13:40,284 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 12:13:40,284 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_74bd0c8b-1b7a-4463-91ec-46f8e5958173/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-18 12:13:40,293 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 12:13:40,294 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 12:13:40,294 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 12:13:40,294 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 12:13:40,295 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 12:13:40,295 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 12:13:40,295 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 12:13:40,295 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 12:13:40,295 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 12:13:40,295 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 12:13:40,296 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 12:13:40,296 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 12:13:40,296 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 12:13:40,296 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 12:13:40,296 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 12:13:40,296 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 12:13:40,296 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 12:13:40,296 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 12:13:40,296 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-18 12:13:40,297 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-18 12:13:40,297 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 12:13:40,297 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 12:13:40,297 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-18 12:13:40,297 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 12:13:40,297 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 12:13:40,297 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 12:13:40,297 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-18 12:13:40,298 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 12:13:40,298 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 12:13:40,298 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_74bd0c8b-1b7a-4463-91ec-46f8e5958173/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 -> adc229f0a7bc8afe44d4e19612f0edd5de4d255f [2018-11-18 12:13:40,321 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 12:13:40,330 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 12:13:40,333 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 12:13:40,334 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 12:13:40,335 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 12:13:40,335 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_74bd0c8b-1b7a-4463-91ec-46f8e5958173/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.1.ufo.UNBOUNDED.pals.c [2018-11-18 12:13:40,377 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_74bd0c8b-1b7a-4463-91ec-46f8e5958173/bin-2019/ukojak/data/3dfdafa3d/b7c4819e77c1441fb27b3897c6d8afd8/FLAG578be4028 [2018-11-18 12:13:40,734 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 12:13:40,735 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_74bd0c8b-1b7a-4463-91ec-46f8e5958173/sv-benchmarks/c/seq-mthreaded/pals_floodmax.3_false-unreach-call.1.ufo.UNBOUNDED.pals.c [2018-11-18 12:13:40,743 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_74bd0c8b-1b7a-4463-91ec-46f8e5958173/bin-2019/ukojak/data/3dfdafa3d/b7c4819e77c1441fb27b3897c6d8afd8/FLAG578be4028 [2018-11-18 12:13:41,137 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_74bd0c8b-1b7a-4463-91ec-46f8e5958173/bin-2019/ukojak/data/3dfdafa3d/b7c4819e77c1441fb27b3897c6d8afd8 [2018-11-18 12:13:41,140 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 12:13:41,141 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 12:13:41,141 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 12:13:41,142 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 12:13:41,144 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 12:13:41,144 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:13:41" (1/1) ... [2018-11-18 12:13:41,146 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72de6083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:13:41, skipping insertion in model container [2018-11-18 12:13:41,146 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:13:41" (1/1) ... [2018-11-18 12:13:41,154 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 12:13:41,185 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 12:13:41,372 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:13:41,382 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 12:13:41,426 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:13:41,488 INFO L195 MainTranslator]: Completed translation [2018-11-18 12:13:41,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:13:41 WrapperNode [2018-11-18 12:13:41,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 12:13:41,490 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 12:13:41,490 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 12:13:41,490 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 12:13:41,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:13:41" (1/1) ... [2018-11-18 12:13:41,506 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:13:41" (1/1) ... [2018-11-18 12:13:41,526 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 12:13:41,526 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 12:13:41,526 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 12:13:41,526 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 12:13:41,533 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:13:41" (1/1) ... [2018-11-18 12:13:41,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:13:41" (1/1) ... [2018-11-18 12:13:41,535 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:13:41" (1/1) ... [2018-11-18 12:13:41,535 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:13:41" (1/1) ... [2018-11-18 12:13:41,539 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:13:41" (1/1) ... [2018-11-18 12:13:41,544 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:13:41" (1/1) ... [2018-11-18 12:13:41,546 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:13:41" (1/1) ... [2018-11-18 12:13:41,548 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 12:13:41,548 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 12:13:41,548 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 12:13:41,548 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 12:13:41,549 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:13:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_74bd0c8b-1b7a-4463-91ec-46f8e5958173/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-18 12:13:41,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 12:13:41,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 12:13:43,088 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 12:13:43,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:13:43 BoogieIcfgContainer [2018-11-18 12:13:43,089 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 12:13:43,089 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-18 12:13:43,089 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-18 12:13:43,096 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-18 12:13:43,096 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:13:43" (1/1) ... [2018-11-18 12:13:43,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:13:43,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:13:43,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 21 states and 33 transitions. [2018-11-18 12:13:43,129 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 33 transitions. [2018-11-18 12:13:43,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-18 12:13:43,131 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:13:43,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:43,528 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-18 12:13:43,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:13:43,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 22 states and 34 transitions. [2018-11-18 12:13:43,616 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 34 transitions. [2018-11-18 12:13:43,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-18 12:13:43,616 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:13:43,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:43,735 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-18 12:13:43,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:13:43,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 26 states and 41 transitions. [2018-11-18 12:13:43,972 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 41 transitions. [2018-11-18 12:13:43,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-18 12:13:43,972 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:13:44,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:44,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:13:44,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:13:44,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 31 states and 50 transitions. [2018-11-18 12:13:44,381 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 50 transitions. [2018-11-18 12:13:44,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-18 12:13:44,383 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:13:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:44,518 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-18 12:13:44,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:13:44,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 37 states and 61 transitions. [2018-11-18 12:13:44,980 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 61 transitions. [2018-11-18 12:13:44,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-18 12:13:44,980 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:13:45,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:45,111 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-18 12:13:45,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:13:45,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 45 states and 74 transitions. [2018-11-18 12:13:45,756 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 74 transitions. [2018-11-18 12:13:45,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 12:13:45,756 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:13:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:45,980 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-18 12:13:46,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:13:46,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 52 states and 86 transitions. [2018-11-18 12:13:46,809 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 86 transitions. [2018-11-18 12:13:46,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 12:13:46,809 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:13:46,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:46,902 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-18 12:13:47,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:13:47,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 53 states and 86 transitions. [2018-11-18 12:13:47,054 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 86 transitions. [2018-11-18 12:13:47,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 12:13:47,054 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:13:47,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:47,078 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-18 12:13:47,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:13:47,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 54 states and 87 transitions. [2018-11-18 12:13:47,094 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 87 transitions. [2018-11-18 12:13:47,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 12:13:47,094 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:13:47,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:47,227 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-18 12:13:48,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:13:48,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 65 states and 104 transitions. [2018-11-18 12:13:48,692 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 104 transitions. [2018-11-18 12:13:48,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 12:13:48,692 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:13:48,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:48,826 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-18 12:13:48,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:13:48,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 68 states and 109 transitions. [2018-11-18 12:13:48,996 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 109 transitions. [2018-11-18 12:13:48,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 12:13:48,996 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:13:49,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:49,785 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-18 12:13:52,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:13:52,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 86 states and 139 transitions. [2018-11-18 12:13:52,594 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 139 transitions. [2018-11-18 12:13:52,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 12:13:52,595 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:13:52,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:53,313 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:13:55,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:13:55,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 99 states and 158 transitions. [2018-11-18 12:13:55,933 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 158 transitions. [2018-11-18 12:13:55,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 12:13:55,934 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:13:55,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:56,063 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:13:56,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:13:56,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 100 states and 160 transitions. [2018-11-18 12:13:56,344 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 160 transitions. [2018-11-18 12:13:56,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 12:13:56,344 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:13:56,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:13:56,865 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-18 12:14:01,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:14:01,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 119 states and 192 transitions. [2018-11-18 12:14:01,011 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 192 transitions. [2018-11-18 12:14:01,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 12:14:01,011 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:14:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:14:01,164 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-18 12:14:01,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:14:01,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 120 states and 195 transitions. [2018-11-18 12:14:01,479 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 195 transitions. [2018-11-18 12:14:01,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 12:14:01,480 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:14:01,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:14:02,252 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:14:07,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:14:07,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 141 states and 230 transitions. [2018-11-18 12:14:07,172 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 230 transitions. [2018-11-18 12:14:07,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 12:14:07,173 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:14:07,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:14:07,298 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:14:07,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:14:07,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 142 states and 234 transitions. [2018-11-18 12:14:07,629 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 234 transitions. [2018-11-18 12:14:07,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 12:14:07,629 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:14:07,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:14:07,729 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:14:08,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:14:08,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 144 states and 240 transitions. [2018-11-18 12:14:08,356 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 240 transitions. [2018-11-18 12:14:08,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 12:14:08,356 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:14:08,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:14:09,413 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:14:13,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:14:13,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 153 states and 259 transitions. [2018-11-18 12:14:13,846 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 259 transitions. [2018-11-18 12:14:13,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 12:14:13,847 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:14:13,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:14:14,004 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:14:15,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:14:15,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 157 states and 268 transitions. [2018-11-18 12:14:15,451 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 268 transitions. [2018-11-18 12:14:15,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 12:14:15,451 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:14:15,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:14:16,002 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:14:17,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:14:17,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 162 states and 277 transitions. [2018-11-18 12:14:17,659 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 277 transitions. [2018-11-18 12:14:17,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 12:14:17,659 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:14:17,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:14:17,885 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:14:19,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:14:19,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 166 states and 283 transitions. [2018-11-18 12:14:19,103 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 283 transitions. [2018-11-18 12:14:19,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 12:14:19,103 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:14:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:14:20,175 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:14:24,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:14:24,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 175 states and 302 transitions. [2018-11-18 12:14:24,747 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 302 transitions. [2018-11-18 12:14:24,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 12:14:24,747 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:14:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:14:24,924 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:14:25,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:14:25,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 177 states and 308 transitions. [2018-11-18 12:14:25,475 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 308 transitions. [2018-11-18 12:14:25,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 12:14:25,475 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:14:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:14:25,661 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:14:26,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:14:26,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 179 states and 310 transitions. [2018-11-18 12:14:26,591 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 310 transitions. [2018-11-18 12:14:26,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 12:14:26,592 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:14:26,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:14:27,906 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:14:38,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:14:38,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 211 states and 386 transitions. [2018-11-18 12:14:38,222 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 386 transitions. [2018-11-18 12:14:38,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 12:14:38,223 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:14:38,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:14:38,359 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:14:39,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:14:39,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 215 states and 395 transitions. [2018-11-18 12:14:39,934 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 395 transitions. [2018-11-18 12:14:39,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 12:14:39,935 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:14:40,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:14:40,174 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:14:41,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:14:41,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 218 states and 398 transitions. [2018-11-18 12:14:41,704 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 398 transitions. [2018-11-18 12:14:41,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 12:14:41,704 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:14:41,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:14:42,767 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:14:48,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:14:48,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 233 states and 436 transitions. [2018-11-18 12:14:48,939 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 436 transitions. [2018-11-18 12:14:48,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 12:14:48,940 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:14:48,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:14:49,030 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:14:50,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:14:50,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 238 states and 444 transitions. [2018-11-18 12:14:50,966 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 444 transitions. [2018-11-18 12:14:50,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 12:14:50,967 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:14:51,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:14:51,050 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:14:51,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:14:51,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 240 states and 446 transitions. [2018-11-18 12:14:51,994 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 446 transitions. [2018-11-18 12:14:51,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 12:14:51,994 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:14:52,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:14:53,243 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:14:57,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:14:57,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 251 states and 468 transitions. [2018-11-18 12:14:57,988 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 468 transitions. [2018-11-18 12:14:57,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 12:14:57,988 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:14:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:14:58,135 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:14:59,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:14:59,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 254 states and 475 transitions. [2018-11-18 12:14:59,349 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 475 transitions. [2018-11-18 12:14:59,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 12:14:59,349 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:14:59,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:14:59,466 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:14:59,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:14:59,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 247 states and 466 transitions. [2018-11-18 12:14:59,878 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 466 transitions. [2018-11-18 12:14:59,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 12:14:59,879 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:14:59,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:01,083 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:05,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:15:05,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 257 states and 486 transitions. [2018-11-18 12:15:05,980 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 486 transitions. [2018-11-18 12:15:05,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 12:15:05,980 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:15:06,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:06,123 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:07,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:15:07,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 254 states and 485 transitions. [2018-11-18 12:15:07,224 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 485 transitions. [2018-11-18 12:15:07,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 12:15:07,224 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:15:07,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:07,385 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:08,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:15:08,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 256 states and 489 transitions. [2018-11-18 12:15:08,026 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 489 transitions. [2018-11-18 12:15:08,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 12:15:08,027 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:15:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:10,598 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:17,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:15:17,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 268 states and 517 transitions. [2018-11-18 12:15:17,898 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 517 transitions. [2018-11-18 12:15:17,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 12:15:17,899 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:15:17,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:18,176 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:21,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:15:21,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 274 states and 525 transitions. [2018-11-18 12:15:21,139 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 525 transitions. [2018-11-18 12:15:21,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 12:15:21,139 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:15:21,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:21,429 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:23,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:15:23,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 280 states and 539 transitions. [2018-11-18 12:15:23,847 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 539 transitions. [2018-11-18 12:15:23,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 12:15:23,847 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:15:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:24,154 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:24,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:15:24,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 282 states and 543 transitions. [2018-11-18 12:15:24,923 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 543 transitions. [2018-11-18 12:15:24,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 12:15:24,924 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:15:24,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:25,841 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:31,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:15:31,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 294 states and 563 transitions. [2018-11-18 12:15:31,093 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 563 transitions. [2018-11-18 12:15:31,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 12:15:31,094 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:15:31,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:31,204 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:35,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:15:35,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 302 states and 582 transitions. [2018-11-18 12:15:35,616 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 582 transitions. [2018-11-18 12:15:35,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 12:15:35,617 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:15:35,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:35,724 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:37,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:15:37,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 305 states and 597 transitions. [2018-11-18 12:15:37,255 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 597 transitions. [2018-11-18 12:15:37,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 12:15:37,256 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:15:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:38,933 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:42,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:15:42,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 309 states and 607 transitions. [2018-11-18 12:15:42,998 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 607 transitions. [2018-11-18 12:15:42,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 12:15:42,998 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:15:43,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:43,204 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:43,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:15:43,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 311 states and 610 transitions. [2018-11-18 12:15:43,937 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 610 transitions. [2018-11-18 12:15:43,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 12:15:43,937 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:15:44,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:44,111 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:46,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:15:46,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 315 states and 622 transitions. [2018-11-18 12:15:46,386 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 622 transitions. [2018-11-18 12:15:46,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 12:15:46,387 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:15:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:15:46,588 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:15:48,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-18 12:15:48,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 318 states and 632 transitions. [2018-11-18 12:15:48,110 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 632 transitions. [2018-11-18 12:15:48,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-18 12:15:48,110 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-18 12:15:48,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:15:48,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:15:48,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:15:49,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:15:49,156 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 49 iterations. [2018-11-18 12:15:49,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 18.11 12:15:49 ImpRootNode [2018-11-18 12:15:49,252 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-18 12:15:49,252 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 12:15:49,252 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 12:15:49,253 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 12:15:49,253 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:13:43" (3/4) ... [2018-11-18 12:15:49,255 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 12:15:49,342 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_74bd0c8b-1b7a-4463-91ec-46f8e5958173/bin-2019/ukojak/witness.graphml [2018-11-18 12:15:49,342 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 12:15:49,342 INFO L168 Benchmark]: Toolchain (without parser) took 128202.25 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.7 GB). Free memory was 958.1 MB in the beginning and 2.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 241.7 MB. Max. memory is 11.5 GB. [2018-11-18 12:15:49,343 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:15:49,343 INFO L168 Benchmark]: CACSL2BoogieTranslator took 347.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 955.4 MB in the beginning and 1.1 GB in the end (delta: -187.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. [2018-11-18 12:15:49,343 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-11-18 12:15:49,344 INFO L168 Benchmark]: Boogie Preprocessor took 21.45 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:15:49,344 INFO L168 Benchmark]: RCFGBuilder took 1540.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 844.7 MB in the end (delta: 291.4 MB). Peak memory consumption was 291.4 MB. Max. memory is 11.5 GB. [2018-11-18 12:15:49,344 INFO L168 Benchmark]: CodeCheck took 126162.72 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 844.7 MB in the beginning and 2.4 GB in the end (delta: -1.5 GB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:15:49,344 INFO L168 Benchmark]: Witness Printer took 89.86 ms. Allocated memory is still 2.7 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-11-18 12:15:49,345 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 130 locations, 1 error locations. UNSAFE Result, 126.0s OverallTime, 49 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 0 SDtfs, -1037865048 SDslu, 931792496 SDs, 0 SdLazy, 8397028 SolverSat, -1696872524 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 73.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14522 GetRequests, 12613 SyntacticMatches, 829 SemanticMatches, 1080 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 727628 ImplicationChecksByTransitivity, 115.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 3.4s SatisfiabilityAnalysisTime, 17.3s InterpolantComputationTime, 1501 NumberOfCodeBlocks, 1501 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 1401 ConstructedInterpolants, 0 QuantifiedInterpolants, 746091 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 48 InterpolantComputations, 10 PerfectInterpolantSequences, 170/879 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: 586]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L72] char p12_old ; [L73] char p12_new ; [L74] _Bool ep12 ; [L76] char p13_old ; [L77] char p13_new ; [L78] _Bool ep13 ; [L80] char p21_old ; [L81] char p21_new ; [L82] _Bool ep21 ; [L84] char p23_old ; [L85] char p23_new ; [L86] _Bool ep23 ; [L88] char p31_old ; [L89] char p31_new ; [L90] _Bool ep31 ; [L92] char p32_old ; [L93] char p32_new ; [L94] _Bool ep32 ; [L95] char id1 ; [L96] unsigned char r1 ; [L97] char st1 ; [L98] char nl1 ; [L99] char m1 ; [L100] char max1 ; [L101] _Bool mode1 ; [L102] char id2 ; [L103] unsigned char r2 ; [L104] char st2 ; [L105] char nl2 ; [L106] char m2 ; [L107] char max2 ; [L108] _Bool mode2 ; [L109] char id3 ; [L110] unsigned char r3 ; [L111] char st3 ; [L112] char nl3 ; [L113] char m3 ; [L114] char max3 ; [L115] _Bool mode3 ; [L70] msg_t nomsg = (msg_t )-1; [L71] port_t p12 ; [L75] port_t p13 ; [L79] port_t p21 ; [L83] port_t p23 ; [L87] port_t p31 ; [L91] port_t p32 ; [L254] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L508] int c1 ; [L509] int i2 ; [L512] c1 = 0 [L513] ep12 = __VERIFIER_nondet_bool() [L514] ep13 = __VERIFIER_nondet_bool() [L515] ep21 = __VERIFIER_nondet_bool() [L516] ep23 = __VERIFIER_nondet_bool() [L517] ep31 = __VERIFIER_nondet_bool() [L518] ep32 = __VERIFIER_nondet_bool() [L519] id1 = __VERIFIER_nondet_char() [L520] r1 = __VERIFIER_nondet_uchar() [L521] st1 = __VERIFIER_nondet_char() [L522] nl1 = __VERIFIER_nondet_char() [L523] m1 = __VERIFIER_nondet_char() [L524] max1 = __VERIFIER_nondet_char() [L525] mode1 = __VERIFIER_nondet_bool() [L526] id2 = __VERIFIER_nondet_char() [L527] r2 = __VERIFIER_nondet_uchar() [L528] st2 = __VERIFIER_nondet_char() [L529] nl2 = __VERIFIER_nondet_char() [L530] m2 = __VERIFIER_nondet_char() [L531] max2 = __VERIFIER_nondet_char() [L532] mode2 = __VERIFIER_nondet_bool() [L533] id3 = __VERIFIER_nondet_char() [L534] r3 = __VERIFIER_nondet_uchar() [L535] st3 = __VERIFIER_nondet_char() [L536] nl3 = __VERIFIER_nondet_char() [L537] m3 = __VERIFIER_nondet_char() [L538] max3 = __VERIFIER_nondet_char() [L539] mode3 = __VERIFIER_nondet_bool() [L540] CALL, EXPR init() [L257] _Bool r121 ; [L258] _Bool r131 ; [L259] _Bool r211 ; [L260] _Bool r231 ; [L261] _Bool r311 ; [L262] _Bool r321 ; [L263] _Bool r122 ; [L264] int tmp ; [L265] _Bool r132 ; [L266] int tmp___0 ; [L267] _Bool r212 ; [L268] int tmp___1 ; [L269] _Bool r232 ; [L270] int tmp___2 ; [L271] _Bool r312 ; [L272] int tmp___3 ; [L273] _Bool r322 ; [L274] int tmp___4 ; [L275] int tmp___5 ; [L278] r121 = ep12 [L279] r131 = ep13 [L280] r211 = ep21 [L281] r231 = ep23 [L282] r311 = ep31 [L283] r321 = ep32 [L284] COND FALSE !(\read(r121)) [L287] COND FALSE !(\read(r131)) [L294] tmp = 0 [L296] r122 = (_Bool )tmp [L297] COND FALSE !(\read(r131)) [L300] COND FALSE !(\read(r121)) [L307] tmp___0 = 0 [L309] r132 = (_Bool )tmp___0 [L310] COND FALSE !(\read(r211)) [L313] COND FALSE !(\read(r231)) [L320] tmp___1 = 0 [L322] r212 = (_Bool )tmp___1 [L323] COND FALSE !(\read(r231)) [L326] COND FALSE !(\read(r211)) [L333] tmp___2 = 0 [L335] r232 = (_Bool )tmp___2 [L336] COND FALSE !(\read(r311)) [L339] COND TRUE \read(r321) [L340] COND FALSE !(\read(ep21)) [L343] tmp___3 = 0 [L348] r312 = (_Bool )tmp___3 [L349] COND TRUE \read(r321) [L350] tmp___4 = 1 [L361] r322 = (_Bool )tmp___4 [L362] COND TRUE (int )id1 != (int )id2 [L363] COND TRUE (int )id1 != (int )id3 [L364] COND TRUE (int )id2 != (int )id3 [L365] COND TRUE (int )id1 >= 0 [L366] COND TRUE (int )id2 >= 0 [L367] COND TRUE (int )id3 >= 0 [L368] COND TRUE (int )r1 == 0 [L369] COND TRUE (int )r2 == 0 [L370] COND TRUE (int )r3 == 0 [L371] COND TRUE (int )max1 == (int )id1 [L372] COND TRUE (int )max2 == (int )id2 [L373] COND TRUE (int )max3 == (int )id3 [L374] COND TRUE (int )st1 == 0 [L375] COND TRUE (int )st2 == 0 [L376] COND TRUE (int )st3 == 0 [L377] COND TRUE (int )nl1 == 0 [L378] COND TRUE (int )nl2 == 0 [L379] COND TRUE (int )nl3 == 0 [L380] COND TRUE (int )mode1 == 0 [L381] COND TRUE (int )mode2 == 0 [L382] COND TRUE (int )mode3 == 0 [L383] tmp___5 = 1 [L447] RET return (tmp___5); [L540] EXPR init() [L540] i2 = init() [L542] p12_old = nomsg [L543] p12_new = nomsg [L544] p13_old = nomsg [L545] p13_new = nomsg [L546] p21_old = nomsg [L547] p21_new = nomsg [L548] p23_old = nomsg [L549] p23_new = nomsg [L550] p31_old = nomsg [L551] p31_new = nomsg [L552] p32_old = nomsg [L553] p32_new = nomsg [L554] i2 = 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=2, id3=1, m1=4, m2=3, m3=0, max1=3, max2=2, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L555] COND TRUE 1 [L557] CALL node1() [L121] COND FALSE !(\read(mode1)) [L149] COND TRUE (int )r1 < 2 [L150] COND FALSE !(\read(ep12)) [L153] COND FALSE !(\read(ep13)) [L157] RET mode1 = (_Bool)1 [L557] node1() [L558] CALL node2() [L167] COND FALSE !(\read(mode2)) [L195] COND TRUE (int )r2 < 2 [L196] COND FALSE !(\read(ep21)) [L199] COND FALSE !(\read(ep23)) [L203] RET mode2 = (_Bool)1 [L558] node2() [L559] CALL node3() [L213] COND FALSE !(\read(mode3)) [L241] COND TRUE (int )r3 < 2 [L242] COND FALSE !(\read(ep31)) [L245] COND TRUE \read(ep32) [L246] COND TRUE, EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L246] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L249] RET mode3 = (_Bool)1 [L559] node3() [L560] p12_old = p12_new [L561] p12_new = nomsg [L562] p13_old = p13_new [L563] p13_new = nomsg [L564] p21_old = p21_new [L565] p21_new = nomsg [L566] p23_old = p23_new [L567] p23_new = nomsg [L568] p31_old = p31_new [L569] p31_new = nomsg [L570] p32_old = p32_new [L571] p32_new = nomsg [L572] CALL, EXPR check() [L452] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=2, id3=1, m1=4, m2=3, m3=0, max1=3, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L455] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=2, id3=1, m1=4, m2=3, m3=0, max1=3, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L456] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=2, id3=1, m1=4, m2=3, m3=0, max1=3, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L457] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=2, id3=1, m1=4, m2=3, m3=0, max1=3, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L458] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=2, id3=1, m1=4, m2=3, m3=0, max1=3, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L459] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=2, id3=1, m1=4, m2=3, m3=0, max1=3, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L462] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=2, id3=1, m1=4, m2=3, m3=0, max1=3, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L464] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=2, id3=1, m1=4, m2=3, m3=0, max1=3, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=2, id3=1, m1=4, m2=3, m3=0, max1=3, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L472] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=2, id3=1, m1=4, m2=3, m3=0, max1=3, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L474] COND TRUE (int )r1 < 2 [L475] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=2, id3=1, m1=4, m2=3, m3=0, max1=3, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L503] RET return (tmp); [L572] EXPR check() [L572] c1 = check() [L573] CALL assert(c1) [L584] COND FALSE, RET !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=2, id3=1, m1=4, m2=3, m3=0, max1=3, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L573] assert(c1) [L555] COND TRUE 1 [L557] CALL node1() [L121] COND TRUE \read(mode1) [L122] COND FALSE !(r1 == 255) [L125] r1 = r1 + 1 [L126] COND FALSE !(\read(ep21)) [L133] COND FALSE !(\read(ep31)) [L140] COND FALSE !((int )r1 == 2) [L147] RET mode1 = (_Bool)0 [L557] node1() [L558] CALL node2() [L167] COND TRUE \read(mode2) [L168] COND FALSE !(r2 == 255) [L171] r2 = r2 + 1 [L172] COND FALSE !(\read(ep12)) [L179] COND TRUE \read(ep32) [L180] m2 = p32_old [L181] p32_old = nomsg [L182] COND FALSE !((int )m2 > (int )max2) [L186] COND FALSE !((int )r2 == 2) [L193] RET mode2 = (_Bool)0 [L558] node2() [L559] CALL node3() [L213] COND TRUE \read(mode3) [L214] COND FALSE !(r3 == 255) [L217] r3 = r3 + 1 [L218] COND FALSE !(\read(ep13)) [L225] COND FALSE !(\read(ep23)) [L232] COND FALSE !((int )r3 == 2) [L239] RET mode3 = (_Bool)0 [L559] node3() [L560] p12_old = p12_new [L561] p12_new = nomsg [L562] p13_old = p13_new [L563] p13_new = nomsg [L564] p21_old = p21_new [L565] p21_new = nomsg [L566] p23_old = p23_new [L567] p23_new = nomsg [L568] p31_old = p31_new [L569] p31_new = nomsg [L570] p32_old = p32_new [L571] p32_new = nomsg [L572] CALL, EXPR check() [L452] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=2, id3=1, m1=4, m2=1, m3=0, max1=3, max2=2, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L455] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=2, id3=1, m1=4, m2=1, m3=0, max1=3, max2=2, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L456] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=2, id3=1, m1=4, m2=1, m3=0, max1=3, max2=2, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L457] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=2, id3=1, m1=4, m2=1, m3=0, max1=3, max2=2, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L458] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=2, id3=1, m1=4, m2=1, m3=0, max1=3, max2=2, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L459] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=2, id3=1, m1=4, m2=1, m3=0, max1=3, max2=2, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L462] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=2, id3=1, m1=4, m2=1, m3=0, max1=3, max2=2, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L464] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=2, id3=1, m1=4, m2=1, m3=0, max1=3, max2=2, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=2, id3=1, m1=4, m2=1, m3=0, max1=3, max2=2, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L472] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=2, id3=1, m1=4, m2=1, m3=0, max1=3, max2=2, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L474] COND TRUE (int )r1 < 2 [L475] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=2, id3=1, m1=4, m2=1, m3=0, max1=3, max2=2, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L503] RET return (tmp); [L572] EXPR check() [L572] c1 = check() [L573] CALL assert(c1) [L584] COND FALSE, RET !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=2, id3=1, m1=4, m2=1, m3=0, max1=3, max2=2, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L573] assert(c1) [L555] COND TRUE 1 [L557] CALL node1() [L121] COND FALSE !(\read(mode1)) [L149] COND TRUE (int )r1 < 2 [L150] COND FALSE !(\read(ep12)) [L153] COND FALSE !(\read(ep13)) [L157] RET mode1 = (_Bool)1 [L557] node1() [L558] CALL node2() [L167] COND FALSE !(\read(mode2)) [L195] COND TRUE (int )r2 < 2 [L196] COND FALSE !(\read(ep21)) [L199] COND FALSE !(\read(ep23)) [L203] RET mode2 = (_Bool)1 [L558] node2() [L559] CALL node3() [L213] COND FALSE !(\read(mode3)) [L241] COND TRUE (int )r3 < 2 [L242] COND FALSE !(\read(ep31)) [L245] COND TRUE \read(ep32) [L246] COND TRUE, EXPR max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L246] p32_new = max3 != nomsg && p32_new == nomsg ? max3 : p32_new [L249] RET mode3 = (_Bool)1 [L559] node3() [L560] p12_old = p12_new [L561] p12_new = nomsg [L562] p13_old = p13_new [L563] p13_new = nomsg [L564] p21_old = p21_new [L565] p21_new = nomsg [L566] p23_old = p23_new [L567] p23_new = nomsg [L568] p31_old = p31_new [L569] p31_new = nomsg [L570] p32_old = p32_new [L571] p32_new = nomsg [L572] CALL, EXPR check() [L452] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=2, id3=1, m1=4, m2=1, m3=0, max1=3, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L455] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=2, id3=1, m1=4, m2=1, m3=0, max1=3, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L456] COND TRUE (int )st1 + (int )nl1 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=2, id3=1, m1=4, m2=1, m3=0, max1=3, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L457] COND TRUE (int )st2 + (int )nl2 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=2, id3=1, m1=4, m2=1, m3=0, max1=3, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L458] COND TRUE (int )st3 + (int )nl3 <= 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=2, id3=1, m1=4, m2=1, m3=0, max1=3, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L459] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=2, id3=1, m1=4, m2=1, m3=0, max1=3, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L462] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=2, id3=1, m1=4, m2=1, m3=0, max1=3, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L464] COND TRUE (int )r1 < 2 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=2, id3=1, m1=4, m2=1, m3=0, max1=3, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L469] COND FALSE !((int )r1 >= 2) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=2, id3=1, m1=4, m2=1, m3=0, max1=3, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L472] COND TRUE ((int )nl1 + (int )nl2) + (int )nl3 == 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=2, id3=1, m1=4, m2=1, m3=0, max1=3, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L474] COND TRUE (int )r1 < 2 [L475] tmp = 1 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=2, id3=1, m1=4, m2=1, m3=0, max1=3, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L503] RET return (tmp); [L572] EXPR check() [L572] c1 = check() [L573] CALL assert(c1) [L584] COND FALSE, RET !(! arg) VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=2, id3=1, m1=4, m2=1, m3=0, max1=3, max2=2, max3=1, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=1, r1=1, r2=1, r3=1, st1=0, st2=0, st3=0] [L573] assert(c1) [L555] COND TRUE 1 [L557] CALL node1() [L121] COND TRUE \read(mode1) [L122] COND FALSE !(r1 == 255) [L125] r1 = r1 + 1 [L126] COND FALSE !(\read(ep21)) [L133] COND FALSE !(\read(ep31)) [L140] COND TRUE (int )r1 == 2 [L141] COND TRUE (int )max1 == (int )id1 [L142] st1 = (char)1 [L147] RET mode1 = (_Bool)0 [L557] node1() [L558] CALL node2() [L167] COND TRUE \read(mode2) [L168] COND FALSE !(r2 == 255) [L171] r2 = r2 + 1 [L172] COND FALSE !(\read(ep12)) [L179] COND TRUE \read(ep32) [L180] m2 = p32_old [L181] p32_old = nomsg [L182] COND FALSE !((int )m2 > (int )max2) [L186] COND TRUE (int )r2 == 2 [L187] COND TRUE (int )max2 == (int )id2 [L188] st2 = (char)1 [L193] RET mode2 = (_Bool)0 [L558] node2() [L559] CALL node3() [L213] COND TRUE \read(mode3) [L214] COND FALSE !(r3 == 255) [L217] r3 = r3 + 1 [L218] COND FALSE !(\read(ep13)) [L225] COND FALSE !(\read(ep23)) [L232] COND TRUE (int )r3 == 2 [L233] COND TRUE (int )max3 == (int )id3 [L234] st3 = (char)1 [L239] RET mode3 = (_Bool)0 [L559] node3() [L560] p12_old = p12_new [L561] p12_new = nomsg [L562] p13_old = p13_new [L563] p13_new = nomsg [L564] p21_old = p21_new [L565] p21_new = nomsg [L566] p23_old = p23_new [L567] p23_new = nomsg [L568] p31_old = p31_new [L569] p31_new = nomsg [L570] p32_old = p32_new [L571] p32_new = nomsg [L572] CALL, EXPR check() [L452] int tmp ; VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=2, id3=1, m1=4, m2=1, m3=0, max1=3, max2=2, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1] [L455] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L501] tmp = 0 VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=2, id3=1, m1=4, m2=1, m3=0, max1=3, max2=2, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1] [L503] RET return (tmp); [L572] EXPR check() [L572] c1 = check() [L573] CALL assert(c1) [L584] COND TRUE ! arg VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=2, id3=1, m1=4, m2=1, m3=0, max1=3, max2=2, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1] [L586] __VERIFIER_error() VAL [ep12=0, ep13=0, ep21=0, ep23=0, ep31=0, ep32=1, id1=3, id2=2, id3=1, m1=4, m2=1, m3=0, max1=3, max2=2, max3=1, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=2, r2=2, r3=2, st1=1, st2=1, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 347.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 955.4 MB in the beginning and 1.1 GB in the end (delta: -187.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.45 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1540.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 844.7 MB in the end (delta: 291.4 MB). Peak memory consumption was 291.4 MB. Max. memory is 11.5 GB. * CodeCheck took 126162.72 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 844.7 MB in the beginning and 2.4 GB in the end (delta: -1.5 GB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 89.86 ms. Allocated memory is still 2.7 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...