./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_cbdf6bd9-405a-4a51-80d7-0bc7083e8825/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cbdf6bd9-405a-4a51-80d7-0bc7083e8825/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cbdf6bd9-405a-4a51-80d7-0bc7083e8825/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cbdf6bd9-405a-4a51-80d7-0bc7083e8825/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_cbdf6bd9-405a-4a51-80d7-0bc7083e8825/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cbdf6bd9-405a-4a51-80d7-0bc7083e8825/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-10-26 22:20:13,525 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 22:20:13,527 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 22:20:13,538 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 22:20:13,538 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 22:20:13,539 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 22:20:13,540 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 22:20:13,543 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 22:20:13,544 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 22:20:13,545 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 22:20:13,546 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 22:20:13,547 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 22:20:13,548 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 22:20:13,548 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 22:20:13,549 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 22:20:13,551 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 22:20:13,552 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 22:20:13,553 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 22:20:13,555 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 22:20:13,557 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 22:20:13,558 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 22:20:13,559 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 22:20:13,561 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 22:20:13,561 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 22:20:13,562 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 22:20:13,563 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 22:20:13,564 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 22:20:13,565 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 22:20:13,565 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 22:20:13,567 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 22:20:13,567 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 22:20:13,568 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 22:20:13,568 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 22:20:13,568 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 22:20:13,569 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 22:20:13,571 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 22:20:13,571 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cbdf6bd9-405a-4a51-80d7-0bc7083e8825/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-10-26 22:20:13,584 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 22:20:13,584 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 22:20:13,585 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 22:20:13,585 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 22:20:13,586 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 22:20:13,586 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 22:20:13,587 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 22:20:13,587 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 22:20:13,587 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 22:20:13,587 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 22:20:13,587 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 22:20:13,587 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 22:20:13,588 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 22:20:13,588 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 22:20:13,588 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 22:20:13,588 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 22:20:13,588 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 22:20:13,589 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-10-26 22:20:13,589 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-10-26 22:20:13,589 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 22:20:13,589 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 22:20:13,589 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-26 22:20:13,589 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 22:20:13,590 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 22:20:13,592 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 22:20:13,592 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-10-26 22:20:13,592 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 22:20:13,593 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 22:20:13,593 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_cbdf6bd9-405a-4a51-80d7-0bc7083e8825/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-10-26 22:20:13,625 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 22:20:13,637 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 22:20:13,640 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 22:20:13,641 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 22:20:13,642 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 22:20:13,643 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cbdf6bd9-405a-4a51-80d7-0bc7083e8825/bin-2019/ukojak/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c [2018-10-26 22:20:13,696 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cbdf6bd9-405a-4a51-80d7-0bc7083e8825/bin-2019/ukojak/data/285e240dd/10a601f7b0b64d6093519b8e0dbb033b/FLAG12062dafa [2018-10-26 22:20:14,122 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 22:20:14,122 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cbdf6bd9-405a-4a51-80d7-0bc7083e8825/sv-benchmarks/c/seq-mthreaded/pals_lcr.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c [2018-10-26 22:20:14,131 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cbdf6bd9-405a-4a51-80d7-0bc7083e8825/bin-2019/ukojak/data/285e240dd/10a601f7b0b64d6093519b8e0dbb033b/FLAG12062dafa [2018-10-26 22:20:14,146 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cbdf6bd9-405a-4a51-80d7-0bc7083e8825/bin-2019/ukojak/data/285e240dd/10a601f7b0b64d6093519b8e0dbb033b [2018-10-26 22:20:14,150 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 22:20:14,151 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 22:20:14,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 22:20:14,152 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 22:20:14,157 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 22:20:14,158 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:20:14" (1/1) ... [2018-10-26 22:20:14,161 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46d0f8ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:20:14, skipping insertion in model container [2018-10-26 22:20:14,161 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:20:14" (1/1) ... [2018-10-26 22:20:14,171 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 22:20:14,204 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 22:20:14,389 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:20:14,398 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 22:20:14,448 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:20:14,464 INFO L193 MainTranslator]: Completed translation [2018-10-26 22:20:14,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:20:14 WrapperNode [2018-10-26 22:20:14,465 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 22:20:14,466 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 22:20:14,466 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 22:20:14,466 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 22:20:14,475 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:20:14" (1/1) ... [2018-10-26 22:20:14,485 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:20:14" (1/1) ... [2018-10-26 22:20:14,522 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 22:20:14,522 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 22:20:14,522 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 22:20:14,522 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 22:20:14,603 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:20:14" (1/1) ... [2018-10-26 22:20:14,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:20:14" (1/1) ... [2018-10-26 22:20:14,610 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:20:14" (1/1) ... [2018-10-26 22:20:14,610 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:20:14" (1/1) ... [2018-10-26 22:20:14,615 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:20:14" (1/1) ... [2018-10-26 22:20:14,621 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:20:14" (1/1) ... [2018-10-26 22:20:14,623 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:20:14" (1/1) ... [2018-10-26 22:20:14,626 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 22:20:14,627 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 22:20:14,627 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 22:20:14,627 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 22:20:14,628 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:20:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cbdf6bd9-405a-4a51-80d7-0bc7083e8825/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-10-26 22:20:14,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 22:20:14,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 22:20:17,182 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 22:20:17,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:20:17 BoogieIcfgContainer [2018-10-26 22:20:17,183 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 22:20:17,183 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-10-26 22:20:17,183 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-10-26 22:20:17,195 INFO L276 PluginConnector]: CodeCheck initialized [2018-10-26 22:20:17,195 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:20:17" (1/1) ... [2018-10-26 22:20:17,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:20:17,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:20:17,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 14 states and 19 transitions. [2018-10-26 22:20:17,245 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2018-10-26 22:20:17,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-26 22:20:17,249 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:20:17,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:20:17,705 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-26 22:20:17,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:20:17,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:20:17,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 17 states and 23 transitions. [2018-10-26 22:20:17,934 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2018-10-26 22:20:17,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-26 22:20:17,935 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:20:17,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:20:18,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:20:18,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:20:18,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 21 states and 31 transitions. [2018-10-26 22:20:18,720 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 31 transitions. [2018-10-26 22:20:18,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-26 22:20:18,720 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:20:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:20:19,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:20:19,304 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-10-26 22:20:19,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:20:19,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 26 states and 39 transitions. [2018-10-26 22:20:19,555 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 39 transitions. [2018-10-26 22:20:19,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-26 22:20:19,559 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:20:19,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:20:19,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:20:20,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:20:20,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 29 states and 44 transitions. [2018-10-26 22:20:20,006 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 44 transitions. [2018-10-26 22:20:20,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-26 22:20:20,007 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:20:20,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:20:20,751 WARN L179 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 60 [2018-10-26 22:20:21,763 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:20:22,109 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 68 [2018-10-26 22:20:24,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:20:24,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 41 states and 67 transitions. [2018-10-26 22:20:24,309 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 67 transitions. [2018-10-26 22:20:24,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-26 22:20:24,309 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:20:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:20:24,844 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 67 [2018-10-26 22:20:25,260 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:20:25,439 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2018-10-26 22:20:25,751 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2018-10-26 22:20:27,371 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2018-10-26 22:20:28,232 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2018-10-26 22:20:28,514 WARN L179 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2018-10-26 22:20:28,994 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2018-10-26 22:20:29,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:20:29,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 52 states and 88 transitions. [2018-10-26 22:20:29,419 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 88 transitions. [2018-10-26 22:20:29,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-26 22:20:29,420 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:20:29,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:20:30,205 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:20:30,507 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2018-10-26 22:20:32,242 WARN L179 SmtUtils]: Spent 586.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-10-26 22:20:33,687 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-10-26 22:20:35,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:20:35,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 65 states and 113 transitions. [2018-10-26 22:20:35,618 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 113 transitions. [2018-10-26 22:20:35,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-26 22:20:35,619 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:20:35,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:20:35,991 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:20:36,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:20:36,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 67 states and 117 transitions. [2018-10-26 22:20:36,468 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 117 transitions. [2018-10-26 22:20:36,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 22:20:36,469 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:20:36,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:20:38,149 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:20:39,747 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-10-26 22:20:43,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:20:43,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 85 states and 161 transitions. [2018-10-26 22:20:43,491 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 161 transitions. [2018-10-26 22:20:43,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 22:20:43,492 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:20:43,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:20:45,783 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:20:48,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:20:48,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 94 states and 188 transitions. [2018-10-26 22:20:48,830 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 188 transitions. [2018-10-26 22:20:48,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 22:20:48,831 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:20:48,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:20:50,248 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:20:52,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:20:52,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 98 states and 195 transitions. [2018-10-26 22:20:52,319 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 195 transitions. [2018-10-26 22:20:52,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 22:20:52,320 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:20:52,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:20:52,675 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:20:53,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:20:53,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 100 states and 201 transitions. [2018-10-26 22:20:53,192 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 201 transitions. [2018-10-26 22:20:53,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 22:20:53,194 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:20:53,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:20:53,746 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:20:54,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:20:54,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 102 states and 205 transitions. [2018-10-26 22:20:54,216 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 205 transitions. [2018-10-26 22:20:54,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-26 22:20:54,217 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:20:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:20:55,069 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 60 [2018-10-26 22:20:55,503 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 61 [2018-10-26 22:20:56,281 WARN L179 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 64 [2018-10-26 22:20:56,770 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 63 [2018-10-26 22:20:57,531 WARN L179 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 75 [2018-10-26 22:20:58,060 WARN L179 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 77 [2018-10-26 22:20:58,773 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:20:58,993 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 66 [2018-10-26 22:20:59,492 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 72 [2018-10-26 22:21:00,220 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2018-10-26 22:21:00,730 WARN L179 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 93 [2018-10-26 22:21:01,351 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2018-10-26 22:21:02,230 WARN L179 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2018-10-26 22:21:02,723 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 95 [2018-10-26 22:21:03,567 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 82 [2018-10-26 22:21:03,844 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 96 [2018-10-26 22:21:05,340 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 89 [2018-10-26 22:21:06,394 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 88 [2018-10-26 22:21:07,829 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 90 [2018-10-26 22:21:08,861 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 91 [2018-10-26 22:21:09,996 WARN L179 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 108 [2018-10-26 22:21:10,412 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2018-10-26 22:21:10,787 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-10-26 22:21:11,240 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-10-26 22:21:12,497 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2018-10-26 22:21:16,027 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2018-10-26 22:21:17,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:21:17,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 131 states and 285 transitions. [2018-10-26 22:21:17,480 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 285 transitions. [2018-10-26 22:21:17,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-26 22:21:17,481 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:21:17,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:21:18,329 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:21:18,871 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 92 [2018-10-26 22:21:20,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:21:20,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 135 states and 301 transitions. [2018-10-26 22:21:20,289 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 301 transitions. [2018-10-26 22:21:20,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-26 22:21:20,290 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:21:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:21:21,574 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:21:21,964 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 94 [2018-10-26 22:21:22,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:21:22,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 137 states and 308 transitions. [2018-10-26 22:21:22,700 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 308 transitions. [2018-10-26 22:21:22,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-26 22:21:22,701 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:21:22,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:21:24,360 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:21:24,920 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 86 [2018-10-26 22:21:25,372 WARN L179 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 88 [2018-10-26 22:21:26,410 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 90 [2018-10-26 22:21:27,103 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2018-10-26 22:21:27,339 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 92 [2018-10-26 22:21:28,356 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2018-10-26 22:21:28,602 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 93 [2018-10-26 22:21:32,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:21:32,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 151 states and 338 transitions. [2018-10-26 22:21:32,555 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 338 transitions. [2018-10-26 22:21:32,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-26 22:21:32,555 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:21:32,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:21:34,222 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:21:34,496 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 89 [2018-10-26 22:21:34,806 WARN L179 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 91 [2018-10-26 22:21:40,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:21:40,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 162 states and 368 transitions. [2018-10-26 22:21:40,586 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 368 transitions. [2018-10-26 22:21:40,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-26 22:21:40,587 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:21:40,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:21:42,241 WARN L179 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 64 [2018-10-26 22:21:43,455 WARN L179 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 84 [2018-10-26 22:21:44,653 WARN L179 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 87 [2018-10-26 22:21:45,929 WARN L179 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 87 [2018-10-26 22:21:47,945 WARN L179 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 88 [2018-10-26 22:21:48,898 WARN L179 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 78 [2018-10-26 22:21:49,978 WARN L179 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 85 [2018-10-26 22:21:50,013 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:21:50,245 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2018-10-26 22:21:50,928 WARN L179 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 61 [2018-10-26 22:21:52,041 WARN L179 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 92 [2018-10-26 22:21:53,071 WARN L179 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 105 [2018-10-26 22:21:53,525 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2018-10-26 22:21:53,978 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-10-26 22:21:55,495 WARN L179 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 96 [2018-10-26 22:21:55,998 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2018-10-26 22:21:56,546 WARN L179 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 107 [2018-10-26 22:21:56,994 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2018-10-26 22:21:57,479 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2018-10-26 22:21:58,001 WARN L179 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 95 [2018-10-26 22:21:58,503 WARN L179 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 108 [2018-10-26 22:21:58,962 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2018-10-26 22:21:59,471 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2018-10-26 22:21:59,898 WARN L179 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 104 [2018-10-26 22:22:00,805 WARN L179 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 124 [2018-10-26 22:22:01,301 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2018-10-26 22:22:01,882 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2018-10-26 22:22:02,387 WARN L179 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 106 [2018-10-26 22:22:02,905 WARN L179 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 126 [2018-10-26 22:22:03,421 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2018-10-26 22:22:04,018 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2018-10-26 22:22:04,418 WARN L179 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 107 [2018-10-26 22:22:04,852 WARN L179 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 127 [2018-10-26 22:22:05,374 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2018-10-26 22:22:05,998 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2018-10-26 22:22:06,301 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2018-10-26 22:22:07,070 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 96 [2018-10-26 22:22:08,463 WARN L179 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 92 [2018-10-26 22:22:08,753 WARN L179 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 105 [2018-10-26 22:22:09,235 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 92 [2018-10-26 22:22:09,703 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2018-10-26 22:22:10,638 WARN L179 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 105 [2018-10-26 22:22:11,125 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2018-10-26 22:22:11,545 WARN L179 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 92 [2018-10-26 22:22:11,863 WARN L179 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 104 [2018-10-26 22:22:12,391 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 92 [2018-10-26 22:22:12,922 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2018-10-26 22:22:13,330 WARN L179 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 93 [2018-10-26 22:22:13,677 WARN L179 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 106 [2018-10-26 22:22:14,218 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 93 [2018-10-26 22:22:14,735 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2018-10-26 22:22:15,144 WARN L179 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 90 [2018-10-26 22:22:15,496 WARN L179 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 103 [2018-10-26 22:22:16,026 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 90 [2018-10-26 22:22:16,565 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-10-26 22:22:16,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:22:16,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 189 states and 435 transitions. [2018-10-26 22:22:16,683 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 435 transitions. [2018-10-26 22:22:16,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-26 22:22:16,684 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:22:16,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:22:17,736 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:22:18,184 WARN L179 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 102 [2018-10-26 22:22:18,655 WARN L179 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 126 [2018-10-26 22:22:19,196 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-10-26 22:22:19,858 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2018-10-26 22:22:20,220 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 98 [2018-10-26 22:22:20,550 WARN L179 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 115 [2018-10-26 22:22:21,083 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-10-26 22:22:21,629 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2018-10-26 22:22:22,126 WARN L179 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2018-10-26 22:22:23,247 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-10-26 22:22:23,606 WARN L179 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 99 [2018-10-26 22:22:23,967 WARN L179 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2018-10-26 22:22:25,040 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2018-10-26 22:22:25,406 WARN L179 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 100 [2018-10-26 22:22:25,781 WARN L179 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2018-10-26 22:22:26,903 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2018-10-26 22:22:27,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:22:27,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 198 states and 451 transitions. [2018-10-26 22:22:27,374 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 451 transitions. [2018-10-26 22:22:27,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-26 22:22:27,374 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:22:27,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:22:28,457 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:22:28,750 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2018-10-26 22:22:28,998 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 95 [2018-10-26 22:22:30,226 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 94 [2018-10-26 22:22:30,496 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 96 [2018-10-26 22:22:31,813 WARN L179 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 95 [2018-10-26 22:22:32,109 WARN L179 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 97 [2018-10-26 22:22:33,520 WARN L179 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 94 [2018-10-26 22:22:34,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:22:34,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 205 states and 463 transitions. [2018-10-26 22:22:34,300 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 463 transitions. [2018-10-26 22:22:34,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-26 22:22:34,301 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:22:34,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:22:37,690 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:22:38,374 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2018-10-26 22:22:39,390 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2018-10-26 22:22:39,987 WARN L179 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 91 [2018-10-26 22:22:40,502 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2018-10-26 22:22:41,037 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2018-10-26 22:22:41,947 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2018-10-26 22:22:42,573 WARN L179 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 95 [2018-10-26 22:22:43,186 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2018-10-26 22:22:43,759 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2018-10-26 22:22:44,000 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2018-10-26 22:22:44,303 WARN L179 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 94 [2018-10-26 22:22:44,863 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2018-10-26 22:22:45,428 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2018-10-26 22:22:45,682 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2018-10-26 22:22:46,342 WARN L179 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 106 [2018-10-26 22:22:46,945 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2018-10-26 22:22:47,557 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2018-10-26 22:22:47,894 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2018-10-26 22:22:48,234 WARN L179 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 108 [2018-10-26 22:22:48,888 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2018-10-26 22:22:49,525 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2018-10-26 22:22:49,765 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2018-10-26 22:22:50,112 WARN L179 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 109 [2018-10-26 22:22:50,739 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-10-26 22:22:51,373 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-10-26 22:22:51,650 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-10-26 22:22:52,002 WARN L179 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 104 [2018-10-26 22:22:52,613 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-10-26 22:22:53,229 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-10-26 22:22:53,533 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 84 [2018-10-26 22:22:54,219 WARN L179 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2018-10-26 22:23:08,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:23:08,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 241 states and 571 transitions. [2018-10-26 22:23:08,987 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 571 transitions. [2018-10-26 22:23:08,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-26 22:23:08,988 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:23:09,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:23:09,887 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:23:10,272 WARN L179 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 100 [2018-10-26 22:23:10,578 WARN L179 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 101 [2018-10-26 22:23:12,111 WARN L179 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 101 [2018-10-26 22:23:12,425 WARN L179 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 102 [2018-10-26 22:23:14,356 WARN L179 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 102 [2018-10-26 22:23:14,705 WARN L179 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 103 [2018-10-26 22:23:15,382 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-10-26 22:23:16,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:23:16,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 245 states and 577 transitions. [2018-10-26 22:23:16,195 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 577 transitions. [2018-10-26 22:23:16,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-26 22:23:16,197 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:23:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:23:17,844 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:23:18,144 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 93 [2018-10-26 22:23:18,408 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 94 [2018-10-26 22:23:19,881 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 96 [2018-10-26 22:23:20,158 WARN L179 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 97 [2018-10-26 22:23:21,643 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 97 [2018-10-26 22:23:21,926 WARN L179 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 98 [2018-10-26 22:23:23,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:23:23,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 249 states and 583 transitions. [2018-10-26 22:23:23,393 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 583 transitions. [2018-10-26 22:23:23,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 22:23:23,394 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:23:23,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:23:24,040 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 23 proven. 51 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-26 22:23:25,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:23:25,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 251 states and 588 transitions. [2018-10-26 22:23:25,041 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 588 transitions. [2018-10-26 22:23:25,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 22:23:25,043 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:23:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:23:27,498 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 16 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:23:29,253 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 85 [2018-10-26 22:23:29,563 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 87 [2018-10-26 22:23:31,207 WARN L179 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 101 [2018-10-26 22:23:31,517 WARN L179 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 103 [2018-10-26 22:23:33,137 WARN L179 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 102 [2018-10-26 22:23:33,460 WARN L179 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 104 [2018-10-26 22:23:35,164 WARN L179 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 103 [2018-10-26 22:23:35,549 WARN L179 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 105 [2018-10-26 22:23:36,901 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2018-10-26 22:23:38,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:23:38,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 257 states and 601 transitions. [2018-10-26 22:23:38,300 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 601 transitions. [2018-10-26 22:23:38,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 22:23:38,301 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:23:38,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:23:39,104 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 16 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:23:39,424 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 95 [2018-10-26 22:23:39,706 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 96 [2018-10-26 22:23:41,340 WARN L179 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 97 [2018-10-26 22:23:41,634 WARN L179 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 99 [2018-10-26 22:23:43,251 WARN L179 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 98 [2018-10-26 22:23:43,549 WARN L179 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 100 [2018-10-26 22:23:44,900 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2018-10-26 22:23:44,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:23:44,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 261 states and 607 transitions. [2018-10-26 22:23:44,963 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 607 transitions. [2018-10-26 22:23:44,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 22:23:44,963 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:23:44,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:23:45,929 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 16 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:23:50,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 22:23:50,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 268 states and 618 transitions. [2018-10-26 22:23:50,013 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 618 transitions. [2018-10-26 22:23:50,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-26 22:23:50,014 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 22:23:50,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 22:23:50,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 22:23:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 22:23:51,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 22:23:51,134 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 29 iterations. [2018-10-26 22:23:51,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 26.10 10:23:51 ImpRootNode [2018-10-26 22:23:51,239 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-10-26 22:23:51,239 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 22:23:51,239 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 22:23:51,239 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 22:23:51,240 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:20:17" (3/4) ... [2018-10-26 22:23:51,247 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-26 22:23:51,471 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_cbdf6bd9-405a-4a51-80d7-0bc7083e8825/bin-2019/ukojak/witness.graphml [2018-10-26 22:23:51,471 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 22:23:51,472 INFO L168 Benchmark]: Toolchain (without parser) took 217321.90 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 679.0 MB). Free memory was 952.7 MB in the beginning and 1.4 GB in the end (delta: -474.9 MB). Peak memory consumption was 204.1 MB. Max. memory is 11.5 GB. [2018-10-26 22:23:51,473 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 22:23:51,473 INFO L168 Benchmark]: CACSL2BoogieTranslator took 312.88 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-10-26 22:23:51,474 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.38 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 22:23:51,476 INFO L168 Benchmark]: Boogie Preprocessor took 104.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 936.6 MB in the beginning and 1.2 GB in the end (delta: -220.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2018-10-26 22:23:51,476 INFO L168 Benchmark]: RCFGBuilder took 2555.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 113.3 MB). Peak memory consumption was 113.3 MB. Max. memory is 11.5 GB. [2018-10-26 22:23:51,476 INFO L168 Benchmark]: CodeCheck took 214055.86 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 519.0 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -400.2 MB). Peak memory consumption was 118.9 MB. Max. memory is 11.5 GB. [2018-10-26 22:23:51,477 INFO L168 Benchmark]: Witness Printer took 232.25 ms. Allocated memory is still 1.7 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2018-10-26 22:23:51,483 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, 213.9s OverallTime, 29 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2002986988 SDtfs, 2066598276 SDslu, -2024892368 SDs, 0 SdLazy, -1417596266 SolverSat, 1720901658 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 55.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10072 GetRequests, 8887 SyntacticMatches, 493 SemanticMatches, 692 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289968 ImplicationChecksByTransitivity, 203.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 42.0s InterpolantComputationTime, 881 NumberOfCodeBlocks, 881 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 801 ConstructedInterpolants, 0 QuantifiedInterpolants, 874964 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 4 PerfectInterpolantSequences, 201/1053 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 312.88 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 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 56.38 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 104.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 936.6 MB in the beginning and 1.2 GB in the end (delta: -220.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2555.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 113.3 MB). Peak memory consumption was 113.3 MB. Max. memory is 11.5 GB. * CodeCheck took 214055.86 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 519.0 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -400.2 MB). Peak memory consumption was 118.9 MB. Max. memory is 11.5 GB. * Witness Printer took 232.25 ms. Allocated memory is still 1.7 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...