./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b108a717-8571-4ecf-97b4-7795d8cf8174/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b108a717-8571-4ecf-97b4-7795d8cf8174/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b108a717-8571-4ecf-97b4-7795d8cf8174/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b108a717-8571-4ecf-97b4-7795d8cf8174/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b108a717-8571-4ecf-97b4-7795d8cf8174/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b108a717-8571-4ecf-97b4-7795d8cf8174/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 21f67d0148e6a362a7411b86d83b7f3dc8bc3a6e ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 07:44:50,521 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:44:50,522 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:44:50,529 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:44:50,529 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:44:50,529 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:44:50,530 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:44:50,531 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:44:50,532 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:44:50,532 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:44:50,533 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:44:50,533 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:44:50,534 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:44:50,535 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:44:50,536 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:44:50,536 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:44:50,537 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:44:50,538 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:44:50,539 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:44:50,540 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:44:50,541 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:44:50,542 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:44:50,544 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:44:50,544 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:44:50,544 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:44:50,545 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:44:50,545 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:44:50,546 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:44:50,546 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:44:50,547 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:44:50,547 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:44:50,548 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:44:50,548 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:44:50,548 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:44:50,549 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:44:50,549 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:44:50,549 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b108a717-8571-4ecf-97b4-7795d8cf8174/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-10 07:44:50,557 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:44:50,557 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:44:50,557 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 07:44:50,558 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 07:44:50,558 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 07:44:50,558 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 07:44:50,558 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:44:50,558 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 07:44:50,558 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:44:50,559 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 07:44:50,559 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:44:50,559 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 07:44:50,559 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 07:44:50,559 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 07:44:50,559 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 07:44:50,559 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:44:50,559 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 07:44:50,560 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-10 07:44:50,560 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-10 07:44:50,560 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:44:50,560 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 07:44:50,560 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 07:44:50,560 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:44:50,561 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 07:44:50,561 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 07:44:50,561 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-10 07:44:50,561 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 07:44:50,561 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 07:44:50,561 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_b108a717-8571-4ecf-97b4-7795d8cf8174/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 -> 21f67d0148e6a362a7411b86d83b7f3dc8bc3a6e [2018-11-10 07:44:50,584 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:44:50,593 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:44:50,596 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:44:50,597 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:44:50,598 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:44:50,598 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b108a717-8571-4ecf-97b4-7795d8cf8174/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c [2018-11-10 07:44:50,645 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b108a717-8571-4ecf-97b4-7795d8cf8174/bin-2019/ukojak/data/89c755b74/168c463e733347e88612bed080388c1e/FLAGd28910705 [2018-11-10 07:44:50,996 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:44:50,996 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b108a717-8571-4ecf-97b4-7795d8cf8174/sv-benchmarks/c/seq-mthreaded/pals_lcr.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c [2018-11-10 07:44:51,003 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b108a717-8571-4ecf-97b4-7795d8cf8174/bin-2019/ukojak/data/89c755b74/168c463e733347e88612bed080388c1e/FLAGd28910705 [2018-11-10 07:44:51,014 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b108a717-8571-4ecf-97b4-7795d8cf8174/bin-2019/ukojak/data/89c755b74/168c463e733347e88612bed080388c1e [2018-11-10 07:44:51,017 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:44:51,018 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 07:44:51,018 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:44:51,019 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:44:51,021 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:44:51,022 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:44:51" (1/1) ... [2018-11-10 07:44:51,024 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@597bda04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:51, skipping insertion in model container [2018-11-10 07:44:51,024 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:44:51" (1/1) ... [2018-11-10 07:44:51,031 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:44:51,056 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:44:51,206 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:44:51,213 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:44:51,244 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:44:51,257 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:44:51,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:51 WrapperNode [2018-11-10 07:44:51,258 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:44:51,258 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 07:44:51,258 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 07:44:51,258 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 07:44:51,265 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:51" (1/1) ... [2018-11-10 07:44:51,271 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:51" (1/1) ... [2018-11-10 07:44:51,287 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 07:44:51,287 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:44:51,287 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:44:51,287 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:44:51,336 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:51" (1/1) ... [2018-11-10 07:44:51,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:51" (1/1) ... [2018-11-10 07:44:51,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:51" (1/1) ... [2018-11-10 07:44:51,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:51" (1/1) ... [2018-11-10 07:44:51,341 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:51" (1/1) ... [2018-11-10 07:44:51,344 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:51" (1/1) ... [2018-11-10 07:44:51,346 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:51" (1/1) ... [2018-11-10 07:44:51,347 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:44:51,348 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:44:51,348 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:44:51,348 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:44:51,349 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:44:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b108a717-8571-4ecf-97b4-7795d8cf8174/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 07:44:51,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:44:51,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:44:52,144 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:44:52,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:44:52 BoogieIcfgContainer [2018-11-10 07:44:52,145 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:44:52,145 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-10 07:44:52,145 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-10 07:44:52,151 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-10 07:44:52,152 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:44:52" (1/1) ... [2018-11-10 07:44:52,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:44:52,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:44:52,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 14 states and 19 transitions. [2018-11-10 07:44:52,182 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2018-11-10 07:44:52,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-10 07:44:52,184 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:44:52,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:44:52,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:44:52,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:44:52,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 17 states and 23 transitions. [2018-11-10 07:44:52,516 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2018-11-10 07:44:52,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-10 07:44:52,516 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:44:52,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:44:52,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:44:52,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:44:52,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 21 states and 31 transitions. [2018-11-10 07:44:52,805 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 31 transitions. [2018-11-10 07:44:52,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-10 07:44:52,805 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:44:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:44:52,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:44:53,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:44:53,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 26 states and 39 transitions. [2018-11-10 07:44:53,274 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 39 transitions. [2018-11-10 07:44:53,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-10 07:44:53,276 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:44:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:44:53,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:44:53,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:44:53,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 29 states and 44 transitions. [2018-11-10 07:44:53,507 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 44 transitions. [2018-11-10 07:44:53,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 07:44:53,508 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:44:53,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:44:53,853 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 60 [2018-11-10 07:44:54,351 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:44:56,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:44:56,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 41 states and 67 transitions. [2018-11-10 07:44:56,090 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 67 transitions. [2018-11-10 07:44:56,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 07:44:56,090 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:44:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:44:56,429 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 67 [2018-11-10 07:44:56,714 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:44:57,074 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2018-11-10 07:44:59,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:44:59,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 52 states and 88 transitions. [2018-11-10 07:44:59,419 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 88 transitions. [2018-11-10 07:44:59,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 07:44:59,419 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:44:59,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:44:59,670 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:45:02,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:45:02,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 65 states and 113 transitions. [2018-11-10 07:45:02,121 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 113 transitions. [2018-11-10 07:45:02,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-10 07:45:02,121 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:45:02,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:45:02,229 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:45:02,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:45:02,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 67 states and 117 transitions. [2018-11-10 07:45:02,638 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 117 transitions. [2018-11-10 07:45:02,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 07:45:02,639 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:45:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:45:03,278 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:45:06,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:45:06,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 85 states and 161 transitions. [2018-11-10 07:45:06,901 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 161 transitions. [2018-11-10 07:45:06,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 07:45:06,902 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:45:06,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:45:07,743 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:45:09,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:45:09,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 92 states and 180 transitions. [2018-11-10 07:45:09,654 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 180 transitions. [2018-11-10 07:45:09,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 07:45:09,656 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:45:09,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:45:09,820 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:45:10,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:45:10,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 94 states and 188 transitions. [2018-11-10 07:45:10,219 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 188 transitions. [2018-11-10 07:45:10,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 07:45:10,220 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:45:10,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:45:10,892 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:45:12,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:45:12,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 98 states and 195 transitions. [2018-11-10 07:45:12,248 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 195 transitions. [2018-11-10 07:45:12,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 07:45:12,248 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:45:12,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:45:12,399 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:45:12,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:45:12,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 100 states and 201 transitions. [2018-11-10 07:45:12,723 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 201 transitions. [2018-11-10 07:45:12,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 07:45:12,724 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:45:12,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:45:12,893 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:45:13,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:45:13,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 102 states and 205 transitions. [2018-11-10 07:45:13,216 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 205 transitions. [2018-11-10 07:45:13,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 07:45:13,217 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:45:13,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:45:13,752 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 60 [2018-11-10 07:45:14,088 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 61 [2018-11-10 07:45:14,425 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 64 [2018-11-10 07:45:14,810 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 63 [2018-11-10 07:45:15,395 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 75 [2018-11-10 07:45:15,768 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 77 [2018-11-10 07:45:16,298 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:45:16,808 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 72 [2018-11-10 07:45:17,357 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2018-11-10 07:45:17,706 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 93 [2018-11-10 07:45:18,727 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2018-11-10 07:45:19,109 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 95 [2018-11-10 07:45:19,799 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 82 [2018-11-10 07:45:19,995 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 96 [2018-11-10 07:45:21,015 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2018-11-10 07:45:23,719 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 91 [2018-11-10 07:45:24,659 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 94 [2018-11-10 07:45:29,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:45:29,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 131 states and 284 transitions. [2018-11-10 07:45:29,871 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 284 transitions. [2018-11-10 07:45:29,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 07:45:29,872 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:45:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:45:30,330 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:45:30,762 WARN L179 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 108 [2018-11-10 07:45:31,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:45:31,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 133 states and 292 transitions. [2018-11-10 07:45:31,649 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 292 transitions. [2018-11-10 07:45:31,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 07:45:31,650 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:45:31,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:45:32,221 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:45:32,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:45:32,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 135 states and 304 transitions. [2018-11-10 07:45:32,819 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 304 transitions. [2018-11-10 07:45:32,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 07:45:32,820 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:45:32,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:45:33,196 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:45:33,514 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 92 [2018-11-10 07:45:34,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:45:34,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 137 states and 308 transitions. [2018-11-10 07:45:34,049 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 308 transitions. [2018-11-10 07:45:34,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 07:45:34,049 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:45:34,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:45:35,202 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:45:35,632 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 86 [2018-11-10 07:45:35,959 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 88 [2018-11-10 07:45:36,791 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 90 [2018-11-10 07:45:37,525 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 92 [2018-11-10 07:45:38,318 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2018-11-10 07:45:38,498 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 93 [2018-11-10 07:45:41,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:45:41,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 151 states and 338 transitions. [2018-11-10 07:45:41,398 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 338 transitions. [2018-11-10 07:45:41,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 07:45:41,399 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:45:41,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:45:42,004 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:45:42,207 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 92 [2018-11-10 07:45:42,375 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 96 [2018-11-10 07:45:42,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:45:42,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 153 states and 341 transitions. [2018-11-10 07:45:42,976 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 341 transitions. [2018-11-10 07:45:42,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 07:45:42,976 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:45:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:45:44,221 WARN L179 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 64 [2018-11-10 07:45:45,097 WARN L179 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 84 [2018-11-10 07:45:45,954 WARN L179 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 87 [2018-11-10 07:45:46,840 WARN L179 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 87 [2018-11-10 07:45:48,300 WARN L179 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 88 [2018-11-10 07:45:48,998 WARN L179 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 78 [2018-11-10 07:45:49,757 WARN L179 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 85 [2018-11-10 07:45:49,782 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:45:49,966 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2018-11-10 07:45:50,467 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 61 [2018-11-10 07:45:51,302 WARN L179 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 92 [2018-11-10 07:45:52,000 WARN L179 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 105 [2018-11-10 07:45:53,793 WARN L179 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 96 [2018-11-10 07:45:54,544 WARN L179 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 107 [2018-11-10 07:45:55,601 WARN L179 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 95 [2018-11-10 07:45:55,972 WARN L179 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 108 [2018-11-10 07:45:57,057 WARN L179 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 104 [2018-11-10 07:45:57,773 WARN L179 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 124 [2018-11-10 07:45:58,589 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2018-11-10 07:45:58,957 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 106 [2018-11-10 07:45:59,292 WARN L179 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 126 [2018-11-10 07:46:00,124 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2018-11-10 07:46:00,425 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 107 [2018-11-10 07:46:00,745 WARN L179 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 127 [2018-11-10 07:46:01,636 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2018-11-10 07:46:01,966 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 103 [2018-11-10 07:46:02,348 WARN L179 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 127 [2018-11-10 07:46:03,200 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2018-11-10 07:46:03,417 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2018-11-10 07:46:03,983 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 97 [2018-11-10 07:46:05,028 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 98 [2018-11-10 07:46:05,274 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 115 [2018-11-10 07:46:06,746 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2018-11-10 07:46:07,410 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 96 [2018-11-10 07:46:07,680 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 113 [2018-11-10 07:46:08,717 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 97 [2018-11-10 07:46:08,984 WARN L179 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 113 [2018-11-10 07:46:10,036 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 94 [2018-11-10 07:46:10,310 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2018-11-10 07:46:11,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:46:11,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 182 states and 414 transitions. [2018-11-10 07:46:11,141 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 414 transitions. [2018-11-10 07:46:11,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 07:46:11,142 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:46:11,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:46:11,835 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:46:12,120 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 102 [2018-11-10 07:46:12,452 WARN L179 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 104 [2018-11-10 07:46:13,470 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 82 [2018-11-10 07:46:13,711 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 84 [2018-11-10 07:46:14,703 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 98 [2018-11-10 07:46:18,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:46:18,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 193 states and 440 transitions. [2018-11-10 07:46:18,812 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 440 transitions. [2018-11-10 07:46:18,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 07:46:18,812 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:46:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:46:19,513 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:46:19,854 WARN L179 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 92 [2018-11-10 07:46:20,075 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 105 [2018-11-10 07:46:20,510 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 92 [2018-11-10 07:46:21,226 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 105 [2018-11-10 07:46:21,943 WARN L179 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 92 [2018-11-10 07:46:22,183 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 104 [2018-11-10 07:46:22,617 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 92 [2018-11-10 07:46:23,349 WARN L179 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 93 [2018-11-10 07:46:23,606 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 106 [2018-11-10 07:46:24,060 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 93 [2018-11-10 07:46:24,797 WARN L179 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 90 [2018-11-10 07:46:25,050 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 103 [2018-11-10 07:46:25,498 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 90 [2018-11-10 07:46:26,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:46:26,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 200 states and 457 transitions. [2018-11-10 07:46:26,013 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 457 transitions. [2018-11-10 07:46:26,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 07:46:26,013 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:46:26,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:46:26,650 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:46:26,873 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2018-11-10 07:46:27,066 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 95 [2018-11-10 07:46:28,079 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 94 [2018-11-10 07:46:28,274 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 96 [2018-11-10 07:46:29,289 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 95 [2018-11-10 07:46:29,489 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 97 [2018-11-10 07:46:30,585 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 94 [2018-11-10 07:46:31,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:46:31,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 207 states and 469 transitions. [2018-11-10 07:46:31,170 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 469 transitions. [2018-11-10 07:46:31,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 07:46:31,171 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:46:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:46:33,340 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:46:35,025 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 91 [2018-11-10 07:46:36,967 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 95 [2018-11-10 07:46:38,179 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 94 [2018-11-10 07:46:39,741 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 106 [2018-11-10 07:46:41,174 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 108 [2018-11-10 07:46:42,564 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 109 [2018-11-10 07:46:43,979 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 104 [2018-11-10 07:46:45,173 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 84 [2018-11-10 07:46:45,651 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2018-11-10 07:46:57,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:46:57,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 243 states and 578 transitions. [2018-11-10 07:46:57,132 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 578 transitions. [2018-11-10 07:46:57,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 07:46:57,132 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:46:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:46:57,472 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:46:57,779 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 100 [2018-11-10 07:46:58,010 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 101 [2018-11-10 07:46:59,276 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 101 [2018-11-10 07:46:59,517 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 102 [2018-11-10 07:47:00,763 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 102 [2018-11-10 07:47:01,007 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 103 [2018-11-10 07:47:02,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:47:02,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 247 states and 584 transitions. [2018-11-10 07:47:02,116 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 584 transitions. [2018-11-10 07:47:02,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 07:47:02,117 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:47:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:47:02,458 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:47:02,693 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 93 [2018-11-10 07:47:02,894 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 94 [2018-11-10 07:47:04,073 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 96 [2018-11-10 07:47:04,288 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 97 [2018-11-10 07:47:05,481 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 97 [2018-11-10 07:47:05,698 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 98 [2018-11-10 07:47:06,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:47:06,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 251 states and 590 transitions. [2018-11-10 07:47:06,763 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 590 transitions. [2018-11-10 07:47:06,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 07:47:06,763 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:47:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:47:08,547 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 16 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:47:09,910 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 85 [2018-11-10 07:47:10,153 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 87 [2018-11-10 07:47:15,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:47:15,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 260 states and 608 transitions. [2018-11-10 07:47:15,276 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 608 transitions. [2018-11-10 07:47:15,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 07:47:15,277 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:47:15,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:47:15,579 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 23 proven. 51 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 07:47:16,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:47:16,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 262 states and 612 transitions. [2018-11-10 07:47:16,391 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 612 transitions. [2018-11-10 07:47:16,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 07:47:16,392 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:47:16,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:47:16,785 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 16 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:47:17,017 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 95 [2018-11-10 07:47:17,229 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 96 [2018-11-10 07:47:18,417 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 97 [2018-11-10 07:47:18,633 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 99 [2018-11-10 07:47:19,891 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 98 [2018-11-10 07:47:20,115 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 100 [2018-11-10 07:47:21,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:47:21,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 266 states and 618 transitions. [2018-11-10 07:47:21,240 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 618 transitions. [2018-11-10 07:47:21,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 07:47:21,241 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:47:21,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:47:21,654 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 16 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:47:21,915 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 101 [2018-11-10 07:47:22,147 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 103 [2018-11-10 07:47:23,421 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 102 [2018-11-10 07:47:23,661 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 104 [2018-11-10 07:47:24,953 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 103 [2018-11-10 07:47:25,201 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 105 [2018-11-10 07:47:26,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:47:26,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 270 states and 624 transitions. [2018-11-10 07:47:26,353 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 624 transitions. [2018-11-10 07:47:26,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-10 07:47:26,354 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:47:26,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:47:26,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:47:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:47:26,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:47:27,031 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 32 iterations. [2018-11-10 07:47:27,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 10.11 07:47:27 ImpRootNode [2018-11-10 07:47:27,117 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-10 07:47:27,118 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:47:27,118 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:47:27,118 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:47:27,118 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:44:52" (3/4) ... [2018-11-10 07:47:27,120 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 07:47:27,226 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b108a717-8571-4ecf-97b4-7795d8cf8174/bin-2019/ukojak/witness.graphml [2018-11-10 07:47:27,226 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:47:27,227 INFO L168 Benchmark]: Toolchain (without parser) took 156209.68 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 238.6 MB). Free memory was 961.9 MB in the beginning and 1.1 GB in the end (delta: -117.4 MB). Peak memory consumption was 121.1 MB. Max. memory is 11.5 GB. [2018-11-10 07:47:27,227 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:47:27,227 INFO L168 Benchmark]: CACSL2BoogieTranslator took 239.57 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 945.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 07:47:27,228 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.70 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:47:27,228 INFO L168 Benchmark]: Boogie Preprocessor took 60.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -202.1 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. [2018-11-10 07:47:27,228 INFO L168 Benchmark]: RCFGBuilder took 797.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 114.1 MB). Peak memory consumption was 114.1 MB. Max. memory is 11.5 GB. [2018-11-10 07:47:27,228 INFO L168 Benchmark]: CodeCheck took 154972.46 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 84.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -60.8 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2018-11-10 07:47:27,229 INFO L168 Benchmark]: Witness Printer took 108.61 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2018-11-10 07:47:27,230 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, 61 locations, 1 error locations. UNSAFE Result, 154.8s OverallTime, 32 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: -1165280244 SDtfs, -683117060 SDslu, 936198320 SDs, 0 SdLazy, 1459630782 SolverSat, 866656850 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 39.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11145 GetRequests, 9863 SyntacticMatches, 586 SemanticMatches, 696 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296403 ImplicationChecksByTransitivity, 147.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 24.7s InterpolantComputationTime, 978 NumberOfCodeBlocks, 978 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 895 ConstructedInterpolants, 0 QuantifiedInterpolants, 988209 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 4 PerfectInterpolantSequences, 222/1166 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: 328]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L71] char r1 ; [L73] char p1_old ; [L74] char p1_new ; [L75] char id1 ; [L76] char st1 ; [L78] _Bool mode1 ; [L80] char p2_old ; [L81] char p2_new ; [L82] char id2 ; [L83] char st2 ; [L85] _Bool mode2 ; [L87] char p3_old ; [L88] char p3_new ; [L89] char id3 ; [L90] char st3 ; [L92] _Bool mode3 ; [L70] msg_t nomsg = (msg_t )-1; [L72] port_t p1 ; [L77] msg_t send1 ; [L79] port_t p2 ; [L84] msg_t send2 ; [L86] port_t p3 ; [L91] msg_t send3 ; [L171] void (*nodes[3])(void) = { & node1, & node2, & node3}; [L275] int c1 ; [L276] int i2 ; [L279] c1 = 0 [L280] r1 = __VERIFIER_nondet_char() [L281] id1 = __VERIFIER_nondet_char() [L282] st1 = __VERIFIER_nondet_char() [L283] send1 = __VERIFIER_nondet_char() [L284] mode1 = __VERIFIER_nondet_bool() [L285] id2 = __VERIFIER_nondet_char() [L286] st2 = __VERIFIER_nondet_char() [L287] send2 = __VERIFIER_nondet_char() [L288] mode2 = __VERIFIER_nondet_bool() [L289] id3 = __VERIFIER_nondet_char() [L290] st3 = __VERIFIER_nondet_char() [L291] send3 = __VERIFIER_nondet_char() [L292] mode3 = __VERIFIER_nondet_bool() [L293] CALL, EXPR init() [L174] int tmp ; [L177] COND TRUE (int )r1 == 0 [L178] COND TRUE (int )id1 >= 0 [L179] COND TRUE (int )st1 == 0 [L180] COND TRUE (int )send1 == (int )id1 [L181] COND TRUE (int )mode1 == 0 [L182] COND TRUE (int )id2 >= 0 [L183] COND TRUE (int )st2 == 0 [L184] COND TRUE (int )send2 == (int )id2 [L185] COND TRUE (int )mode2 == 0 [L186] COND TRUE (int )id3 >= 0 [L187] COND TRUE (int )st3 == 0 [L188] COND TRUE (int )send3 == (int )id3 [L189] COND TRUE (int )mode3 == 0 [L190] COND TRUE (int )id1 != (int )id2 [L191] COND TRUE (int )id1 != (int )id3 [L192] COND TRUE (int )id2 != (int )id3 [L193] tmp = 1 [L242] RET return (tmp); [L293] EXPR init() [L293] i2 = init() [L295] p1_old = nomsg [L296] p1_new = nomsg [L297] p2_old = nomsg [L298] p2_new = nomsg [L299] p3_old = nomsg [L300] p3_new = nomsg [L301] i2 = 0 VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L302] COND TRUE i2 < 6 [L304] CALL node1() [L95] msg_t m1 ; [L98] m1 = nomsg [L99] COND FALSE !(\read(mode1)) [L115] COND TRUE, EXPR send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L115] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L116] RET mode1 = (_Bool)1 [L304] node1() [L305] CALL node2() [L123] msg_t m2 ; [L126] m2 = nomsg [L127] COND FALSE !(\read(mode2)) [L140] COND TRUE, EXPR send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L140] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L141] RET mode2 = (_Bool)1 [L305] node2() [L306] CALL node3() [L148] msg_t m3 ; [L151] m3 = nomsg [L152] COND FALSE !(\read(mode3)) [L165] COND TRUE, EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L165] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L166] RET mode3 = (_Bool)1 [L306] node3() [L307] p1_old = p1_new [L308] p1_new = nomsg [L309] p2_old = p2_new [L310] p2_new = nomsg [L311] p3_old = p3_new [L312] p3_new = nomsg [L313] CALL, EXPR check() [L247] int tmp ; VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=1, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L250] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=1, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L251] COND FALSE !((int )r1 >= 3) VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=1, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L254] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=1, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L256] COND TRUE (int )r1 < 3 [L257] tmp = 1 VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=1, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L270] RET return (tmp); [L313] EXPR check() [L313] c1 = check() [L314] CALL assert(c1) [L326] COND FALSE, RET !(! arg) VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=1, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L314] assert(c1) [L315] i2 ++ VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=2, p2=0, p2_new=-1, p2_old=0, p3=0, p3_new=-1, p3_old=1, r1=0, send1=2, send2=0, send3=1, st1=0, st2=0, st3=0] [L302] COND TRUE i2 < 6 [L304] CALL node1() [L95] msg_t m1 ; [L98] m1 = nomsg [L99] COND TRUE \read(mode1) [L100] r1 = (char )((int )r1 + 1) [L101] m1 = p3_old [L102] p3_old = nomsg [L103] COND TRUE (int )m1 != (int )nomsg [L104] COND FALSE !((int )m1 > (int )id1) [L107] COND FALSE !((int )m1 == (int )id1) [L110] send1 = m1 [L113] RET mode1 = (_Bool)0 [L304] node1() [L305] CALL node2() [L123] msg_t m2 ; [L126] m2 = nomsg [L127] COND TRUE \read(mode2) [L128] m2 = p1_old [L129] p1_old = nomsg [L130] COND TRUE (int )m2 != (int )nomsg [L131] COND TRUE (int )m2 > (int )id2 [L132] send2 = m2 [L138] RET mode2 = (_Bool)0 [L305] node2() [L306] CALL node3() [L148] msg_t m3 ; [L151] m3 = nomsg [L152] COND TRUE \read(mode3) [L153] m3 = p2_old [L154] p2_old = nomsg [L155] COND TRUE (int )m3 != (int )nomsg [L156] COND FALSE !((int )m3 > (int )id3) [L159] COND FALSE !((int )m3 == (int )id3) [L163] RET mode3 = (_Bool)0 [L306] node3() [L307] p1_old = p1_new [L308] p1_new = nomsg [L309] p2_old = p2_new [L310] p2_new = nomsg [L311] p3_old = p3_new [L312] p3_new = nomsg [L313] CALL, EXPR check() [L247] int tmp ; VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L250] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L251] COND FALSE !((int )r1 >= 3) VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L254] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L256] COND TRUE (int )r1 < 3 [L257] tmp = 1 VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L270] RET return (tmp); [L313] EXPR check() [L313] c1 = check() [L314] CALL assert(c1) [L326] COND FALSE, RET !(! arg) VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L314] assert(c1) [L315] i2 ++ VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L302] COND TRUE i2 < 6 [L304] CALL node1() [L95] msg_t m1 ; [L98] m1 = nomsg [L99] COND FALSE !(\read(mode1)) [L115] COND TRUE, EXPR send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L115] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L116] RET mode1 = (_Bool)1 [L304] node1() [L305] CALL node2() [L123] msg_t m2 ; [L126] m2 = nomsg [L127] COND FALSE !(\read(mode2)) [L140] COND TRUE, EXPR send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L140] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L141] RET mode2 = (_Bool)1 [L305] node2() [L306] CALL node3() [L148] msg_t m3 ; [L151] m3 = nomsg [L152] COND FALSE !(\read(mode3)) [L165] COND TRUE, EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L165] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L166] RET mode3 = (_Bool)1 [L306] node3() [L307] p1_old = p1_new [L308] p1_new = nomsg [L309] p2_old = p2_new [L310] p2_new = nomsg [L311] p3_old = p3_new [L312] p3_new = nomsg [L313] CALL, EXPR check() [L247] int tmp ; VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L250] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L251] COND FALSE !((int )r1 >= 3) VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L254] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L256] COND TRUE (int )r1 < 3 [L257] tmp = 1 VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L270] RET return (tmp); [L313] EXPR check() [L313] c1 = check() [L314] CALL assert(c1) [L326] COND FALSE, RET !(! arg) VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L314] assert(c1) [L315] i2 ++ VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=2, p3=0, p3_new=-1, p3_old=1, r1=1, send1=1, send2=2, send3=1, st1=0, st2=0, st3=0] [L302] COND TRUE i2 < 6 [L304] CALL node1() [L95] msg_t m1 ; [L98] m1 = nomsg [L99] COND TRUE \read(mode1) [L100] r1 = (char )((int )r1 + 1) [L101] m1 = p3_old [L102] p3_old = nomsg [L103] COND TRUE (int )m1 != (int )nomsg [L104] COND FALSE !((int )m1 > (int )id1) [L107] COND FALSE !((int )m1 == (int )id1) [L110] send1 = m1 [L113] RET mode1 = (_Bool)0 [L304] node1() [L305] CALL node2() [L123] msg_t m2 ; [L126] m2 = nomsg [L127] COND TRUE \read(mode2) [L128] m2 = p1_old [L129] p1_old = nomsg [L130] COND TRUE (int )m2 != (int )nomsg [L131] COND TRUE (int )m2 > (int )id2 [L132] send2 = m2 [L138] RET mode2 = (_Bool)0 [L305] node2() [L306] CALL node3() [L148] msg_t m3 ; [L151] m3 = nomsg [L152] COND TRUE \read(mode3) [L153] m3 = p2_old [L154] p2_old = nomsg [L155] COND TRUE (int )m3 != (int )nomsg [L156] COND TRUE (int )m3 > (int )id3 [L157] send3 = m3 [L163] RET mode3 = (_Bool)0 [L306] node3() [L307] p1_old = p1_new [L308] p1_new = nomsg [L309] p2_old = p2_new [L310] p2_new = nomsg [L311] p3_old = p3_new [L312] p3_new = nomsg [L313] CALL, EXPR check() [L247] int tmp ; VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L250] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L251] COND FALSE !((int )r1 >= 3) VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L254] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L256] COND TRUE (int )r1 < 3 [L257] tmp = 1 VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L270] RET return (tmp); [L313] EXPR check() [L313] c1 = check() [L314] CALL assert(c1) [L326] COND FALSE, RET !(! arg) VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L314] assert(c1) [L315] i2 ++ VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L302] COND TRUE i2 < 6 [L304] CALL node1() [L95] msg_t m1 ; [L98] m1 = nomsg [L99] COND FALSE !(\read(mode1)) [L115] COND TRUE, EXPR send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L115] p1_new = send1 != nomsg && p1_new == nomsg ? send1 : p1_new [L116] RET mode1 = (_Bool)1 [L304] node1() [L305] CALL node2() [L123] msg_t m2 ; [L126] m2 = nomsg [L127] COND FALSE !(\read(mode2)) [L140] COND TRUE, EXPR send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L140] p2_new = send2 != nomsg && p2_new == nomsg ? send2 : p2_new [L141] RET mode2 = (_Bool)1 [L305] node2() [L306] CALL node3() [L148] msg_t m3 ; [L151] m3 = nomsg [L152] COND FALSE !(\read(mode3)) [L165] COND TRUE, EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L165] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L166] RET mode3 = (_Bool)1 [L306] node3() [L307] p1_old = p1_new [L308] p1_new = nomsg [L309] p2_old = p2_new [L310] p2_new = nomsg [L311] p3_old = p3_new [L312] p3_new = nomsg [L313] CALL, EXPR check() [L247] int tmp ; VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=2, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L250] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=2, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L251] COND FALSE !((int )r1 >= 3) VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=2, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L254] COND TRUE ((int )st1 + (int )st2) + (int )st3 == 0 VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=2, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L256] COND TRUE (int )r1 < 3 [L257] tmp = 1 VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=2, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L270] RET return (tmp); [L313] EXPR check() [L313] c1 = check() [L314] CALL assert(c1) [L326] COND FALSE, RET !(! arg) VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=2, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L314] assert(c1) [L315] i2 ++ VAL [id1=2, id2=0, id3=1, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=1, p2=0, p2_new=-1, p2_old=1, p3=0, p3_new=-1, p3_old=2, r1=2, send1=1, send2=1, send3=2, st1=0, st2=0, st3=0] [L302] COND TRUE i2 < 6 [L304] CALL node1() [L95] msg_t m1 ; [L98] m1 = nomsg [L99] COND TRUE \read(mode1) [L100] r1 = (char )((int )r1 + 1) [L101] m1 = p3_old [L102] p3_old = nomsg [L103] COND TRUE (int )m1 != (int )nomsg [L104] COND FALSE !((int )m1 > (int )id1) [L107] COND TRUE (int )m1 == (int )id1 [L108] st1 = (char)1 [L113] RET mode1 = (_Bool)0 [L304] node1() [L305] CALL node2() [L123] msg_t m2 ; [L126] m2 = nomsg [L127] COND TRUE \read(mode2) [L128] m2 = p1_old [L129] p1_old = nomsg [L130] COND TRUE (int )m2 != (int )nomsg [L131] COND TRUE (int )m2 > (int )id2 [L132] send2 = m2 [L138] RET mode2 = (_Bool)0 [L305] node2() [L306] CALL node3() [L148] msg_t m3 ; [L151] m3 = nomsg [L152] COND TRUE \read(mode3) [L153] m3 = p2_old [L154] p2_old = nomsg [L155] COND TRUE (int )m3 != (int )nomsg [L156] COND FALSE !((int )m3 > (int )id3) [L159] COND TRUE (int )m3 == (int )id3 [L160] st3 = (char)1 [L163] RET mode3 = (_Bool)0 [L306] node3() [L307] p1_old = p1_new [L308] p1_new = nomsg [L309] p2_old = p2_new [L310] p2_new = nomsg [L311] p3_old = p3_new [L312] p3_new = nomsg [L313] CALL, EXPR check() [L247] int tmp ; VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=1, send3=2, st1=1, st2=0, st3=1] [L250] COND FALSE !(((int )st1 + (int )st2) + (int )st3 <= 1) [L268] tmp = 0 VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=1, send3=2, st1=1, st2=0, st3=1] [L270] RET return (tmp); [L313] EXPR check() [L313] c1 = check() [L314] CALL assert(c1) [L326] COND TRUE ! arg VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=1, send3=2, st1=1, st2=0, st3=1] [L328] __VERIFIER_error() VAL [id1=2, id2=0, id3=1, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=1, send2=1, send3=2, st1=1, st2=0, st3=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 239.57 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 945.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.70 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -202.1 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 797.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 114.1 MB). Peak memory consumption was 114.1 MB. Max. memory is 11.5 GB. * CodeCheck took 154972.46 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 84.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -60.8 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Witness Printer took 108.61 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...