./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec5_product42_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/product-lines/minepump_spec5_product42_true-unreach-call_false-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 532810884b5d2bf06b0b91e69513de04a1b641b8 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 14:55:31,365 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:55:31,367 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:55:31,380 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:55:31,381 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:55:31,383 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:55:31,385 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:55:31,387 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:55:31,390 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:55:31,391 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:55:31,394 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:55:31,394 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:55:31,395 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:55:31,396 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:55:31,400 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:55:31,401 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:55:31,402 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:55:31,406 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:55:31,415 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:55:31,419 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:55:31,422 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:55:31,423 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:55:31,427 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:55:31,429 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:55:31,430 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:55:31,431 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:55:31,432 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:55:31,436 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:55:31,437 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:55:31,438 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:55:31,440 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:55:31,440 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:55:31,441 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:55:31,442 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:55:31,443 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:55:31,445 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:55:31,447 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 14:55:31,479 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:55:31,481 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:55:31,482 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:55:31,484 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:55:31,484 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:55:31,484 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:55:31,484 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:55:31,485 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:55:31,485 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:55:31,485 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:55:31,486 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:55:31,486 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:55:31,486 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:55:31,486 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:55:31,486 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:55:31,487 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:55:31,487 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:55:31,489 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:55:31,489 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:55:31,490 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:55:31,490 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:55:31,490 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:55:31,490 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:55:31,490 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:55:31,490 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:55:31,491 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:55:31,491 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:55:31,491 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:55:31,491 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> Automizer 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 -> 532810884b5d2bf06b0b91e69513de04a1b641b8 [2019-01-12 14:55:31,548 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:55:31,567 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:55:31,570 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:55:31,572 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:55:31,573 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:55:31,574 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec5_product42_true-unreach-call_false-termination.cil.c [2019-01-12 14:55:31,624 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e9918bc9/83053c3ca0f8472aa353a8a9cc46e05e/FLAG9bcb07704 [2019-01-12 14:55:32,119 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:55:32,119 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec5_product42_true-unreach-call_false-termination.cil.c [2019-01-12 14:55:32,133 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e9918bc9/83053c3ca0f8472aa353a8a9cc46e05e/FLAG9bcb07704 [2019-01-12 14:55:32,429 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e9918bc9/83053c3ca0f8472aa353a8a9cc46e05e [2019-01-12 14:55:32,432 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:55:32,434 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:55:32,435 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:55:32,435 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:55:32,438 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:55:32,439 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:55:32" (1/1) ... [2019-01-12 14:55:32,443 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a077fcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:32, skipping insertion in model container [2019-01-12 14:55:32,443 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:55:32" (1/1) ... [2019-01-12 14:55:32,453 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:55:32,520 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:55:32,924 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:55:32,947 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:55:33,120 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:55:33,158 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:55:33,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:33 WrapperNode [2019-01-12 14:55:33,158 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:55:33,159 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:55:33,159 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:55:33,160 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:55:33,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:33" (1/1) ... [2019-01-12 14:55:33,193 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:33" (1/1) ... [2019-01-12 14:55:33,240 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:55:33,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:55:33,241 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:55:33,241 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:55:33,249 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:33" (1/1) ... [2019-01-12 14:55:33,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:33" (1/1) ... [2019-01-12 14:55:33,254 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:33" (1/1) ... [2019-01-12 14:55:33,255 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:33" (1/1) ... [2019-01-12 14:55:33,267 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:33" (1/1) ... [2019-01-12 14:55:33,281 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:33" (1/1) ... [2019-01-12 14:55:33,284 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:33" (1/1) ... [2019-01-12 14:55:33,289 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:55:33,289 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:55:33,289 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:55:33,290 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:55:33,291 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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:2000 [2019-01-12 14:55:33,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 14:55:33,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-12 14:55:33,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:55:33,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:55:34,570 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:55:34,570 INFO L286 CfgBuilder]: Removed 130 assue(true) statements. [2019-01-12 14:55:34,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:55:34 BoogieIcfgContainer [2019-01-12 14:55:34,572 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:55:34,573 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:55:34,573 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:55:34,576 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:55:34,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:55:32" (1/3) ... [2019-01-12 14:55:34,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@774cb34f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:55:34, skipping insertion in model container [2019-01-12 14:55:34,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:33" (2/3) ... [2019-01-12 14:55:34,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@774cb34f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:55:34, skipping insertion in model container [2019-01-12 14:55:34,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:55:34" (3/3) ... [2019-01-12 14:55:34,580 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec5_product42_true-unreach-call_false-termination.cil.c [2019-01-12 14:55:34,590 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:55:34,599 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 14:55:34,617 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 14:55:34,652 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:55:34,652 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:55:34,652 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:55:34,653 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:55:34,653 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:55:34,653 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:55:34,653 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:55:34,653 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:55:34,654 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:55:34,670 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states. [2019-01-12 14:55:34,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-12 14:55:34,678 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:34,679 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:55:34,681 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:34,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:34,687 INFO L82 PathProgramCache]: Analyzing trace with hash 2002570515, now seen corresponding path program 1 times [2019-01-12 14:55:34,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:34,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:34,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:34,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:34,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:34,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:55:34,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:55:34,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:55:34,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 14:55:34,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 14:55:34,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:55:34,970 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 2 states. [2019-01-12 14:55:35,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:35,000 INFO L93 Difference]: Finished difference Result 185 states and 274 transitions. [2019-01-12 14:55:35,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 14:55:35,002 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2019-01-12 14:55:35,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:35,014 INFO L225 Difference]: With dead ends: 185 [2019-01-12 14:55:35,014 INFO L226 Difference]: Without dead ends: 92 [2019-01-12 14:55:35,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:55:35,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-12 14:55:35,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-01-12 14:55:35,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-12 14:55:35,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 129 transitions. [2019-01-12 14:55:35,063 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 129 transitions. Word has length 19 [2019-01-12 14:55:35,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:35,063 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 129 transitions. [2019-01-12 14:55:35,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 14:55:35,064 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 129 transitions. [2019-01-12 14:55:35,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-12 14:55:35,065 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:35,065 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:55:35,065 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:35,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:35,066 INFO L82 PathProgramCache]: Analyzing trace with hash -486377228, now seen corresponding path program 1 times [2019-01-12 14:55:35,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:35,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:35,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:35,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:35,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:35,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:55:35,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:55:35,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:55:35,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:55:35,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:55:35,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:55:35,293 INFO L87 Difference]: Start difference. First operand 92 states and 129 transitions. Second operand 3 states. [2019-01-12 14:55:35,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:35,330 INFO L93 Difference]: Finished difference Result 92 states and 129 transitions. [2019-01-12 14:55:35,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:55:35,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-01-12 14:55:35,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:35,336 INFO L225 Difference]: With dead ends: 92 [2019-01-12 14:55:35,337 INFO L226 Difference]: Without dead ends: 41 [2019-01-12 14:55:35,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:55:35,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-12 14:55:35,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-12 14:55:35,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-12 14:55:35,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 57 transitions. [2019-01-12 14:55:35,354 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 57 transitions. Word has length 20 [2019-01-12 14:55:35,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:35,354 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 57 transitions. [2019-01-12 14:55:35,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:55:35,354 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 57 transitions. [2019-01-12 14:55:35,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-12 14:55:35,355 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:35,357 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:55:35,357 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:35,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:35,357 INFO L82 PathProgramCache]: Analyzing trace with hash 215436409, now seen corresponding path program 1 times [2019-01-12 14:55:35,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:35,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:35,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:35,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:35,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:35,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:35,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:55:35,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:55:35,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:55:35,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:55:35,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:55:35,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:55:35,539 INFO L87 Difference]: Start difference. First operand 41 states and 57 transitions. Second operand 3 states. [2019-01-12 14:55:35,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:35,604 INFO L93 Difference]: Finished difference Result 75 states and 107 transitions. [2019-01-12 14:55:35,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:55:35,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-01-12 14:55:35,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:35,609 INFO L225 Difference]: With dead ends: 75 [2019-01-12 14:55:35,609 INFO L226 Difference]: Without dead ends: 41 [2019-01-12 14:55:35,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:55:35,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-12 14:55:35,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-12 14:55:35,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-12 14:55:35,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 56 transitions. [2019-01-12 14:55:35,620 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 56 transitions. Word has length 26 [2019-01-12 14:55:35,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:35,624 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 56 transitions. [2019-01-12 14:55:35,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:55:35,625 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 56 transitions. [2019-01-12 14:55:35,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-12 14:55:35,626 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:35,627 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:55:35,627 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:35,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:35,628 INFO L82 PathProgramCache]: Analyzing trace with hash 937029115, now seen corresponding path program 1 times [2019-01-12 14:55:35,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:35,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:35,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:35,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:35,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:35,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:35,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:55:35,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:55:35,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:55:35,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:55:35,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:55:35,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:55:35,765 INFO L87 Difference]: Start difference. First operand 41 states and 56 transitions. Second operand 3 states. [2019-01-12 14:55:35,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:35,843 INFO L93 Difference]: Finished difference Result 99 states and 139 transitions. [2019-01-12 14:55:35,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:55:35,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-01-12 14:55:35,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:35,846 INFO L225 Difference]: With dead ends: 99 [2019-01-12 14:55:35,846 INFO L226 Difference]: Without dead ends: 65 [2019-01-12 14:55:35,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:55:35,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-12 14:55:35,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2019-01-12 14:55:35,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-12 14:55:35,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 87 transitions. [2019-01-12 14:55:35,857 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 87 transitions. Word has length 27 [2019-01-12 14:55:35,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:35,857 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 87 transitions. [2019-01-12 14:55:35,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:55:35,858 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 87 transitions. [2019-01-12 14:55:35,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 14:55:35,859 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:35,859 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:55:35,860 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:35,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:35,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1349052711, now seen corresponding path program 1 times [2019-01-12 14:55:35,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:35,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:35,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:35,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:35,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:35,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:36,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:55:36,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:55:36,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:55:36,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:55:36,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:55:36,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:55:36,112 INFO L87 Difference]: Start difference. First operand 63 states and 87 transitions. Second operand 5 states. [2019-01-12 14:55:36,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:36,518 INFO L93 Difference]: Finished difference Result 216 states and 304 transitions. [2019-01-12 14:55:36,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:55:36,518 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-01-12 14:55:36,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:36,521 INFO L225 Difference]: With dead ends: 216 [2019-01-12 14:55:36,521 INFO L226 Difference]: Without dead ends: 160 [2019-01-12 14:55:36,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:55:36,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-01-12 14:55:36,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 62. [2019-01-12 14:55:36,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-12 14:55:36,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 84 transitions. [2019-01-12 14:55:36,543 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 84 transitions. Word has length 33 [2019-01-12 14:55:36,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:36,543 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 84 transitions. [2019-01-12 14:55:36,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:55:36,544 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 84 transitions. [2019-01-12 14:55:36,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-12 14:55:36,545 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:36,548 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:55:36,548 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:36,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:36,549 INFO L82 PathProgramCache]: Analyzing trace with hash -243919497, now seen corresponding path program 1 times [2019-01-12 14:55:36,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:36,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:36,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:36,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:36,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:36,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:36,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:55:36,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:55:36,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:55:36,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:55:36,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:55:36,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:55:36,691 INFO L87 Difference]: Start difference. First operand 62 states and 84 transitions. Second operand 5 states. [2019-01-12 14:55:36,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:36,786 INFO L93 Difference]: Finished difference Result 161 states and 220 transitions. [2019-01-12 14:55:36,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:55:36,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-01-12 14:55:36,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:36,789 INFO L225 Difference]: With dead ends: 161 [2019-01-12 14:55:36,789 INFO L226 Difference]: Without dead ends: 106 [2019-01-12 14:55:36,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:55:36,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-12 14:55:36,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 65. [2019-01-12 14:55:36,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-12 14:55:36,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 87 transitions. [2019-01-12 14:55:36,801 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 87 transitions. Word has length 36 [2019-01-12 14:55:36,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:36,802 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 87 transitions. [2019-01-12 14:55:36,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:55:36,802 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2019-01-12 14:55:36,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-12 14:55:36,803 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:36,803 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:55:36,806 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:36,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:36,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1255036747, now seen corresponding path program 1 times [2019-01-12 14:55:36,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:36,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:36,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:36,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:36,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:36,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:37,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:55:37,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:55:37,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:55:37,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:55:37,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:55:37,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:55:37,059 INFO L87 Difference]: Start difference. First operand 65 states and 87 transitions. Second operand 5 states. [2019-01-12 14:55:37,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:37,458 INFO L93 Difference]: Finished difference Result 170 states and 229 transitions. [2019-01-12 14:55:37,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:55:37,459 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-01-12 14:55:37,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:37,460 INFO L225 Difference]: With dead ends: 170 [2019-01-12 14:55:37,461 INFO L226 Difference]: Without dead ends: 112 [2019-01-12 14:55:37,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:55:37,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-12 14:55:37,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 67. [2019-01-12 14:55:37,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-12 14:55:37,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 89 transitions. [2019-01-12 14:55:37,494 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 89 transitions. Word has length 36 [2019-01-12 14:55:37,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:37,495 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 89 transitions. [2019-01-12 14:55:37,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:55:37,495 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 89 transitions. [2019-01-12 14:55:37,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-12 14:55:37,497 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:37,497 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:55:37,497 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:37,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:37,497 INFO L82 PathProgramCache]: Analyzing trace with hash 2018862195, now seen corresponding path program 1 times [2019-01-12 14:55:37,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:37,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:37,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:37,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:37,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:37,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:37,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:55:37,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:55:37,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:55:37,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:55:37,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:55:37,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:55:37,603 INFO L87 Difference]: Start difference. First operand 67 states and 89 transitions. Second operand 3 states. [2019-01-12 14:55:37,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:37,714 INFO L93 Difference]: Finished difference Result 154 states and 206 transitions. [2019-01-12 14:55:37,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:55:37,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-01-12 14:55:37,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:37,716 INFO L225 Difference]: With dead ends: 154 [2019-01-12 14:55:37,716 INFO L226 Difference]: Without dead ends: 94 [2019-01-12 14:55:37,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:55:37,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-12 14:55:37,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-01-12 14:55:37,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-12 14:55:37,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 122 transitions. [2019-01-12 14:55:37,738 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 122 transitions. Word has length 36 [2019-01-12 14:55:37,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:37,738 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 122 transitions. [2019-01-12 14:55:37,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:55:37,738 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 122 transitions. [2019-01-12 14:55:37,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-12 14:55:37,741 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:37,742 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:55:37,742 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:37,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:37,742 INFO L82 PathProgramCache]: Analyzing trace with hash 544383411, now seen corresponding path program 1 times [2019-01-12 14:55:37,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:37,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:37,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:37,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:37,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:38,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:55:38,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:55:38,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 14:55:38,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:55:38,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:55:38,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:55:38,236 INFO L87 Difference]: Start difference. First operand 94 states and 122 transitions. Second operand 6 states. [2019-01-12 14:55:38,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:38,947 INFO L93 Difference]: Finished difference Result 339 states and 457 transitions. [2019-01-12 14:55:38,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:55:38,949 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-01-12 14:55:38,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:38,951 INFO L225 Difference]: With dead ends: 339 [2019-01-12 14:55:38,951 INFO L226 Difference]: Without dead ends: 279 [2019-01-12 14:55:38,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-12 14:55:38,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-12 14:55:38,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 135. [2019-01-12 14:55:38,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-01-12 14:55:38,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 174 transitions. [2019-01-12 14:55:38,978 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 174 transitions. Word has length 37 [2019-01-12 14:55:38,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:38,979 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 174 transitions. [2019-01-12 14:55:38,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:55:38,979 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 174 transitions. [2019-01-12 14:55:38,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-12 14:55:38,981 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:38,982 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:55:38,982 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:38,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:38,982 INFO L82 PathProgramCache]: Analyzing trace with hash 167223140, now seen corresponding path program 1 times [2019-01-12 14:55:38,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:38,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:38,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:38,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:38,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:39,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:39,259 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:55:39,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:55:39,259 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:55:39,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:39,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:39,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:55:39,831 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:55:39,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:55:39,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-01-12 14:55:39,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 14:55:39,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 14:55:39,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:55:39,867 INFO L87 Difference]: Start difference. First operand 135 states and 174 transitions. Second operand 8 states. [2019-01-12 14:55:40,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:40,254 INFO L93 Difference]: Finished difference Result 242 states and 319 transitions. [2019-01-12 14:55:40,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 14:55:40,254 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-01-12 14:55:40,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:40,256 INFO L225 Difference]: With dead ends: 242 [2019-01-12 14:55:40,256 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 14:55:40,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-01-12 14:55:40,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 14:55:40,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 14:55:40,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 14:55:40,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 14:55:40,259 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2019-01-12 14:55:40,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:40,259 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 14:55:40,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 14:55:40,259 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 14:55:40,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 14:55:40,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 14:55:40,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:40,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:40,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:40,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:40,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:40,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:40,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:40,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:40,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:40,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:40,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:40,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:40,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:40,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:40,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:40,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:40,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:40,984 WARN L181 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2019-01-12 14:55:41,618 WARN L181 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 22 [2019-01-12 14:55:42,145 WARN L181 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 23 [2019-01-12 14:55:42,452 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 29 [2019-01-12 14:55:42,588 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 26 [2019-01-12 14:55:42,816 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 20 [2019-01-12 14:55:42,932 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 22 [2019-01-12 14:55:43,049 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 23 [2019-01-12 14:55:43,349 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 23 [2019-01-12 14:55:43,411 INFO L448 ceAbstractionStarter]: For program point L746(lines 746 759) no Hoare annotation was computed. [2019-01-12 14:55:43,411 INFO L448 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-01-12 14:55:43,411 INFO L448 ceAbstractionStarter]: For program point L201-1(line 201) no Hoare annotation was computed. [2019-01-12 14:55:43,411 INFO L448 ceAbstractionStarter]: For program point L201-2(line 201) no Hoare annotation was computed. [2019-01-12 14:55:43,411 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 14:55:43,412 INFO L444 ceAbstractionStarter]: At program point L879(lines 872 882) the Hoare annotation is: (and (<= 2 ~waterLevel~0) (= ULTIMATE.start_test_~splverifierCounter~0 0) (<= ~waterLevel~0 2) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2019-01-12 14:55:43,412 INFO L444 ceAbstractionStarter]: At program point L879-1(lines 872 882) the Hoare annotation is: false [2019-01-12 14:55:43,412 INFO L444 ceAbstractionStarter]: At program point L879-2(lines 872 882) the Hoare annotation is: false [2019-01-12 14:55:43,412 INFO L448 ceAbstractionStarter]: For program point L70(lines 70 87) no Hoare annotation was computed. [2019-01-12 14:55:43,412 INFO L444 ceAbstractionStarter]: At program point L70-1(lines 1 954) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (<= ~waterLevel~0 2)) (.cse2 (= 1 ~pumpRunning~0)) (.cse3 (= ~systemActive~0 1))) (or (and (<= 2 ~waterLevel~0) .cse0 .cse1 (< 1 ULTIMATE.start___utac_acc__Specification5_spec__3_~tmp~0) (<= ULTIMATE.start___utac_acc__Specification5_spec__3_~tmp~0 2) .cse2 (<= |ULTIMATE.start_getWaterLevel_#res| 2) (<= 2 |ULTIMATE.start_getWaterLevel_#res|) .cse3) (and .cse1 (and (and .cse0 (= ~pumpRunning~0 0)) .cse3)) (and .cse0 (= ~switchedOnBeforeTS~0 1) .cse1 .cse2 (= 1 |ULTIMATE.start_isPumpRunning_#res|) .cse3))) [2019-01-12 14:55:43,413 INFO L448 ceAbstractionStarter]: For program point L70-2(lines 70 87) no Hoare annotation was computed. [2019-01-12 14:55:43,413 INFO L444 ceAbstractionStarter]: At program point L70-3(lines 1 954) the Hoare annotation is: false [2019-01-12 14:55:43,413 INFO L448 ceAbstractionStarter]: For program point L70-4(lines 70 87) no Hoare annotation was computed. [2019-01-12 14:55:43,413 INFO L444 ceAbstractionStarter]: At program point L70-5(lines 1 954) the Hoare annotation is: false [2019-01-12 14:55:43,413 INFO L444 ceAbstractionStarter]: At program point L764(lines 715 765) the Hoare annotation is: false [2019-01-12 14:55:43,413 INFO L444 ceAbstractionStarter]: At program point L236(lines 231 239) the Hoare annotation is: (and (= ~waterLevel~0 1) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2019-01-12 14:55:43,413 INFO L444 ceAbstractionStarter]: At program point L104-2(lines 104 118) the Hoare annotation is: false [2019-01-12 14:55:43,413 INFO L444 ceAbstractionStarter]: At program point L699(lines 690 703) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (<= ~waterLevel~0 2)) (.cse2 (= ~pumpRunning~0 0)) (.cse3 (= ~systemActive~0 1))) (or (and (not (= 0 |ULTIMATE.start_isHighWaterSensorDry_#res|)) .cse0 .cse1 .cse2 .cse3) (and (<= 2 ~waterLevel~0) .cse0 .cse1 .cse2 .cse3))) [2019-01-12 14:55:43,413 INFO L444 ceAbstractionStarter]: At program point L699-1(lines 690 703) the Hoare annotation is: false [2019-01-12 14:55:43,414 INFO L444 ceAbstractionStarter]: At program point L699-2(lines 690 703) the Hoare annotation is: false [2019-01-12 14:55:43,414 INFO L448 ceAbstractionStarter]: For program point L617(lines 617 621) no Hoare annotation was computed. [2019-01-12 14:55:43,414 INFO L448 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-01-12 14:55:43,414 INFO L448 ceAbstractionStarter]: For program point L617-3(lines 617 621) no Hoare annotation was computed. [2019-01-12 14:55:43,414 INFO L448 ceAbstractionStarter]: For program point L617-6(lines 617 621) no Hoare annotation was computed. [2019-01-12 14:55:43,414 INFO L444 ceAbstractionStarter]: At program point L155(lines 151 157) the Hoare annotation is: (and (= ~waterLevel~0 1) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2019-01-12 14:55:43,414 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 201) no Hoare annotation was computed. [2019-01-12 14:55:43,414 INFO L448 ceAbstractionStarter]: For program point L717(lines 716 763) no Hoare annotation was computed. [2019-01-12 14:55:43,414 INFO L448 ceAbstractionStarter]: For program point L817(lines 817 834) no Hoare annotation was computed. [2019-01-12 14:55:43,415 INFO L448 ceAbstractionStarter]: For program point L817-1(lines 817 834) no Hoare annotation was computed. [2019-01-12 14:55:43,415 INFO L448 ceAbstractionStarter]: For program point L817-2(lines 817 834) no Hoare annotation was computed. [2019-01-12 14:55:43,415 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 722) no Hoare annotation was computed. [2019-01-12 14:55:43,415 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 84) no Hoare annotation was computed. [2019-01-12 14:55:43,415 INFO L448 ceAbstractionStarter]: For program point L74-2(lines 74 84) no Hoare annotation was computed. [2019-01-12 14:55:43,415 INFO L448 ceAbstractionStarter]: For program point L74-4(lines 74 84) no Hoare annotation was computed. [2019-01-12 14:55:43,415 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 14:55:43,415 INFO L444 ceAbstractionStarter]: At program point L785(lines 781 803) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (<= ~waterLevel~0 2)) (.cse2 (= ~systemActive~0 1))) (or (and (and .cse0 (= ~pumpRunning~0 0)) .cse1 .cse2) (and .cse0 (= ~switchedOnBeforeTS~0 1) .cse1 (= 1 ~pumpRunning~0) (= 1 |ULTIMATE.start_isPumpRunning_#res|) .cse2))) [2019-01-12 14:55:43,416 INFO L444 ceAbstractionStarter]: At program point L785-1(lines 781 803) the Hoare annotation is: false [2019-01-12 14:55:43,416 INFO L444 ceAbstractionStarter]: At program point L785-2(lines 781 803) the Hoare annotation is: false [2019-01-12 14:55:43,421 INFO L444 ceAbstractionStarter]: At program point L686(lines 681 689) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse0 (<= ~waterLevel~0 2)) (.cse3 (= 1 ~pumpRunning~0)) (.cse2 (= ~systemActive~0 1))) (or (and .cse0 (and (and .cse1 (= ~pumpRunning~0 0)) .cse2)) (and (<= 2 ~waterLevel~0) .cse1 .cse0 .cse3 (<= |ULTIMATE.start_getWaterLevel_#res| 2) (<= 2 |ULTIMATE.start_getWaterLevel_#res|) .cse2) (and .cse1 (= ~switchedOnBeforeTS~0 1) .cse0 .cse3 (= 1 |ULTIMATE.start_isPumpRunning_#res|) .cse2))) [2019-01-12 14:55:43,421 INFO L444 ceAbstractionStarter]: At program point L686-1(lines 681 689) the Hoare annotation is: false [2019-01-12 14:55:43,421 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 112) no Hoare annotation was computed. [2019-01-12 14:55:43,421 INFO L444 ceAbstractionStarter]: At program point L686-2(lines 681 689) the Hoare annotation is: false [2019-01-12 14:55:43,422 INFO L448 ceAbstractionStarter]: For program point L75(lines 75 81) no Hoare annotation was computed. [2019-01-12 14:55:43,422 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 108 112) no Hoare annotation was computed. [2019-01-12 14:55:43,422 INFO L448 ceAbstractionStarter]: For program point L75-2(lines 75 81) no Hoare annotation was computed. [2019-01-12 14:55:43,422 INFO L448 ceAbstractionStarter]: For program point L75-4(lines 75 81) no Hoare annotation was computed. [2019-01-12 14:55:43,422 INFO L448 ceAbstractionStarter]: For program point L736(lines 736 742) no Hoare annotation was computed. [2019-01-12 14:55:43,422 INFO L444 ceAbstractionStarter]: At program point L736-1(lines 736 742) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (<= ~waterLevel~0 2)) (.cse2 (= 1 ~pumpRunning~0)) (.cse3 (= ~systemActive~0 1))) (or (and (<= 2 ~waterLevel~0) .cse0 .cse1 .cse2 .cse3) (and .cse1 (and (and .cse0 (= ~pumpRunning~0 0)) .cse3)) (and .cse0 (= ~switchedOnBeforeTS~0 1) .cse1 .cse2 (= 1 |ULTIMATE.start_isPumpRunning_#res|) .cse3))) [2019-01-12 14:55:43,422 INFO L444 ceAbstractionStarter]: At program point L59(lines 785 791) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (<= ~waterLevel~0 2)) (.cse2 (= ~systemActive~0 1))) (or (and .cse0 .cse1 (= ~switchedOnBeforeTS~0 1) (= 1 ~pumpRunning~0) (= 1 |ULTIMATE.start_isPumpRunning_#res|) .cse2) (and (= 0 |ULTIMATE.start_isPumpRunning_#res|) .cse0 .cse1 (= ~pumpRunning~0 0) .cse2))) [2019-01-12 14:55:43,422 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 201) no Hoare annotation was computed. [2019-01-12 14:55:43,423 INFO L444 ceAbstractionStarter]: At program point L59-1(lines 785 791) the Hoare annotation is: false [2019-01-12 14:55:43,423 INFO L444 ceAbstractionStarter]: At program point L59-2(lines 785 791) the Hoare annotation is: false [2019-01-12 14:55:43,423 INFO L444 ceAbstractionStarter]: At program point L654(lines 649 657) the Hoare annotation is: (and (<= 2 ~waterLevel~0) (= ULTIMATE.start_test_~splverifierCounter~0 0) (<= ~waterLevel~0 2) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2019-01-12 14:55:43,423 INFO L444 ceAbstractionStarter]: At program point L654-1(lines 649 657) the Hoare annotation is: false [2019-01-12 14:55:43,423 INFO L444 ceAbstractionStarter]: At program point L654-2(lines 649 657) the Hoare annotation is: false [2019-01-12 14:55:43,423 INFO L451 ceAbstractionStarter]: At program point L192(lines 173 195) the Hoare annotation is: true [2019-01-12 14:55:43,423 INFO L448 ceAbstractionStarter]: For program point L754(lines 754 758) no Hoare annotation was computed. [2019-01-12 14:55:43,423 INFO L444 ceAbstractionStarter]: At program point L754-2(lines 754 758) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (<= ~waterLevel~0 2)) (.cse2 (= 1 ~pumpRunning~0)) (.cse3 (= ~systemActive~0 1))) (or (and (<= 2 ~waterLevel~0) .cse0 .cse1 .cse2 .cse3) (and .cse1 (and (and .cse0 (= ~pumpRunning~0 0)) .cse3)) (and .cse0 (= ~switchedOnBeforeTS~0 1) .cse1 .cse2 (= 1 |ULTIMATE.start_isPumpRunning_#res|) .cse3))) [2019-01-12 14:55:43,424 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 201) no Hoare annotation was computed. [2019-01-12 14:55:43,427 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 14:55:43,427 INFO L448 ceAbstractionStarter]: For program point L854(lines 854 860) no Hoare annotation was computed. [2019-01-12 14:55:43,427 INFO L448 ceAbstractionStarter]: For program point L821(lines 821 829) no Hoare annotation was computed. [2019-01-12 14:55:43,427 INFO L448 ceAbstractionStarter]: For program point L821-1(lines 821 829) no Hoare annotation was computed. [2019-01-12 14:55:43,427 INFO L448 ceAbstractionStarter]: For program point L854-2(lines 854 860) no Hoare annotation was computed. [2019-01-12 14:55:43,427 INFO L448 ceAbstractionStarter]: For program point L821-2(lines 821 829) no Hoare annotation was computed. [2019-01-12 14:55:43,427 INFO L448 ceAbstractionStarter]: For program point L854-4(lines 854 860) no Hoare annotation was computed. [2019-01-12 14:55:43,428 INFO L448 ceAbstractionStarter]: For program point L937(lines 937 941) no Hoare annotation was computed. [2019-01-12 14:55:43,428 INFO L448 ceAbstractionStarter]: For program point L937-2(lines 937 941) no Hoare annotation was computed. [2019-01-12 14:55:43,428 INFO L448 ceAbstractionStarter]: For program point L937-3(lines 937 941) no Hoare annotation was computed. [2019-01-12 14:55:43,428 INFO L448 ceAbstractionStarter]: For program point L937-5(lines 937 941) no Hoare annotation was computed. [2019-01-12 14:55:43,428 INFO L448 ceAbstractionStarter]: For program point L937-6(lines 937 941) no Hoare annotation was computed. [2019-01-12 14:55:43,428 INFO L448 ceAbstractionStarter]: For program point L937-8(lines 937 941) no Hoare annotation was computed. [2019-01-12 14:55:43,428 INFO L444 ceAbstractionStarter]: At program point L888(lines 883 891) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (<= ~waterLevel~0 2)) (.cse2 (= 1 ~pumpRunning~0)) (.cse3 (= 1 |ULTIMATE.start_isPumpRunning_#res|)) (.cse4 (= ~systemActive~0 1))) (or (and .cse0 .cse1 (= ~switchedOnBeforeTS~0 1) .cse2 .cse3 .cse4) (and (= 0 |ULTIMATE.start_isPumpRunning_#res|) .cse0 .cse1 (= ~pumpRunning~0 0) .cse4) (and (<= 2 ~waterLevel~0) .cse0 .cse1 .cse2 .cse3 .cse4))) [2019-01-12 14:55:43,428 INFO L444 ceAbstractionStarter]: At program point L888-1(lines 883 891) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (<= ~waterLevel~0 2)) (.cse2 (= ~systemActive~0 1))) (or (and .cse0 (= ~switchedOnBeforeTS~0 1) .cse1 (= 1 ~pumpRunning~0) (= 1 |ULTIMATE.start_isPumpRunning_#res|) .cse2) (and (= 0 |ULTIMATE.start_isPumpRunning_#res|) .cse0 .cse1 (= ~pumpRunning~0 0) .cse2))) [2019-01-12 14:55:43,428 INFO L444 ceAbstractionStarter]: At program point L888-2(lines 883 891) the Hoare annotation is: false [2019-01-12 14:55:43,429 INFO L444 ceAbstractionStarter]: At program point L888-3(lines 883 891) the Hoare annotation is: false [2019-01-12 14:55:43,429 INFO L444 ceAbstractionStarter]: At program point L888-4(lines 883 891) the Hoare annotation is: false [2019-01-12 14:55:43,429 INFO L444 ceAbstractionStarter]: At program point L888-5(lines 883 891) the Hoare annotation is: false [2019-01-12 14:55:43,429 INFO L444 ceAbstractionStarter]: At program point L228(lines 1 954) the Hoare annotation is: (and (= ~waterLevel~0 1) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2019-01-12 14:55:43,429 INFO L448 ceAbstractionStarter]: For program point L641(lines 641 645) no Hoare annotation was computed. [2019-01-12 14:55:43,429 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 14:55:43,429 INFO L444 ceAbstractionStarter]: At program point L792(lines 792 798) the Hoare annotation is: (let ((.cse2 (= 1 ~pumpRunning~0)) (.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (<= ~waterLevel~0 2)) (.cse3 (= ~systemActive~0 1))) (or (and (<= 2 ~waterLevel~0) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (= ~switchedOnBeforeTS~0 1) .cse2 (= 1 |ULTIMATE.start_isPumpRunning_#res|) .cse3) (and (and .cse0 (= ~pumpRunning~0 0)) .cse1 .cse3))) [2019-01-12 14:55:43,429 INFO L444 ceAbstractionStarter]: At program point L792-1(lines 792 798) the Hoare annotation is: false [2019-01-12 14:55:43,429 INFO L448 ceAbstractionStarter]: For program point L726(lines 726 732) no Hoare annotation was computed. [2019-01-12 14:55:43,430 INFO L444 ceAbstractionStarter]: At program point L792-2(lines 792 798) the Hoare annotation is: false [2019-01-12 14:55:43,430 INFO L444 ceAbstractionStarter]: At program point L726-1(lines 726 732) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (<= ~waterLevel~0 2)) (.cse2 (= 1 ~pumpRunning~0)) (.cse3 (= ~systemActive~0 1))) (or (and (<= 2 ~waterLevel~0) .cse0 .cse1 .cse2 .cse3) (and .cse1 (and (and .cse0 (= ~pumpRunning~0 0)) .cse3)) (and .cse0 (= ~switchedOnBeforeTS~0 1) .cse1 .cse2 (= 1 |ULTIMATE.start_isPumpRunning_#res|) .cse3))) [2019-01-12 14:55:43,430 INFO L444 ceAbstractionStarter]: At program point L49(lines 44 51) the Hoare annotation is: (and (= ~waterLevel~0 1) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2019-01-12 14:55:43,430 INFO L448 ceAbstractionStarter]: For program point L694(lines 694 700) no Hoare annotation was computed. [2019-01-12 14:55:43,430 INFO L448 ceAbstractionStarter]: For program point L694-1(lines 694 700) no Hoare annotation was computed. [2019-01-12 14:55:43,430 INFO L448 ceAbstractionStarter]: For program point L694-2(lines 694 700) no Hoare annotation was computed. [2019-01-12 14:55:43,430 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 190) no Hoare annotation was computed. [2019-01-12 14:55:43,430 INFO L451 ceAbstractionStarter]: At program point L183-1(lines 183 190) the Hoare annotation is: true [2019-01-12 14:55:43,431 INFO L448 ceAbstractionStarter]: For program point L629(lines 629 633) no Hoare annotation was computed. [2019-01-12 14:55:43,434 INFO L444 ceAbstractionStarter]: At program point L943(lines 928 946) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (<= ~waterLevel~0 2)) (.cse2 (= ~pumpRunning~0 0)) (.cse3 (= ~systemActive~0 1))) (or (and (= 0 |ULTIMATE.start_isHighWaterLevel_#res|) (not (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~8)) (= 0 ULTIMATE.start_isHighWaterLevel_~tmp___0~2) .cse0 .cse1 .cse2 .cse3) (and (<= 2 ~waterLevel~0) .cse0 .cse1 .cse2 .cse3))) [2019-01-12 14:55:43,434 INFO L444 ceAbstractionStarter]: At program point L943-1(lines 928 946) the Hoare annotation is: false [2019-01-12 14:55:43,434 INFO L444 ceAbstractionStarter]: At program point L943-2(lines 928 946) the Hoare annotation is: false [2019-01-12 14:55:43,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:55:43 BoogieIcfgContainer [2019-01-12 14:55:43,481 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:55:43,481 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:55:43,481 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:55:43,481 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:55:43,482 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:55:34" (3/4) ... [2019-01-12 14:55:43,491 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 14:55:43,523 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2019-01-12 14:55:43,530 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2019-01-12 14:55:43,531 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-01-12 14:55:43,531 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 14:55:43,532 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 14:55:43,533 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-12 14:55:43,571 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && 1 < tmp) && tmp <= 2) && 1 == pumpRunning) && \result <= 2) && 2 <= \result) && systemActive == 1) || (waterLevel <= 2 && (splverifierCounter == 0 && pumpRunning == 0) && systemActive == 1)) || (((((splverifierCounter == 0 && switchedOnBeforeTS == 1) && waterLevel <= 2) && 1 == pumpRunning) && 1 == \result) && systemActive == 1) [2019-01-12 14:55:43,572 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && 1 == pumpRunning) && systemActive == 1) || (waterLevel <= 2 && (splverifierCounter == 0 && pumpRunning == 0) && systemActive == 1)) || (((((splverifierCounter == 0 && switchedOnBeforeTS == 1) && waterLevel <= 2) && 1 == pumpRunning) && 1 == \result) && systemActive == 1) [2019-01-12 14:55:43,572 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && 1 == pumpRunning) && systemActive == 1) || (waterLevel <= 2 && (splverifierCounter == 0 && pumpRunning == 0) && systemActive == 1)) || (((((splverifierCounter == 0 && switchedOnBeforeTS == 1) && waterLevel <= 2) && 1 == pumpRunning) && 1 == \result) && systemActive == 1) [2019-01-12 14:55:43,573 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && 1 == pumpRunning) && systemActive == 1) || (waterLevel <= 2 && (splverifierCounter == 0 && pumpRunning == 0) && systemActive == 1)) || (((((splverifierCounter == 0 && switchedOnBeforeTS == 1) && waterLevel <= 2) && 1 == pumpRunning) && 1 == \result) && systemActive == 1) [2019-01-12 14:55:43,573 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((splverifierCounter == 0 && waterLevel <= 2) && switchedOnBeforeTS == 1) && 1 == pumpRunning) && 1 == \result) && systemActive == 1) || ((((0 == \result && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) && systemActive == 1)) || (((((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && 1 == pumpRunning) && 1 == \result) && systemActive == 1) [2019-01-12 14:55:43,575 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((splverifierCounter == 0 && waterLevel <= 2) && switchedOnBeforeTS == 1) && 1 == pumpRunning) && 1 == \result) && systemActive == 1) || ((((0 == \result && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) && systemActive == 1) [2019-01-12 14:55:43,575 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((splverifierCounter == 0 && pumpRunning == 0) && waterLevel <= 2) && systemActive == 1) || (((((splverifierCounter == 0 && switchedOnBeforeTS == 1) && waterLevel <= 2) && 1 == pumpRunning) && 1 == \result) && systemActive == 1) [2019-01-12 14:55:43,575 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && 1 == pumpRunning) && systemActive == 1) || (((((splverifierCounter == 0 && waterLevel <= 2) && switchedOnBeforeTS == 1) && 1 == pumpRunning) && 1 == \result) && systemActive == 1)) || (((splverifierCounter == 0 && pumpRunning == 0) && waterLevel <= 2) && systemActive == 1) [2019-01-12 14:55:43,576 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((waterLevel <= 2 && (splverifierCounter == 0 && pumpRunning == 0) && systemActive == 1) || ((((((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && 1 == pumpRunning) && \result <= 2) && 2 <= \result) && systemActive == 1)) || (((((splverifierCounter == 0 && switchedOnBeforeTS == 1) && waterLevel <= 2) && 1 == pumpRunning) && 1 == \result) && systemActive == 1) [2019-01-12 14:55:43,577 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(0 == \result) && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) && systemActive == 1) || ((((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) && systemActive == 1) [2019-01-12 14:55:43,578 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((splverifierCounter == 0 && switchedOnBeforeTS == 1) && waterLevel <= 2) && 1 == pumpRunning) && 1 == \result) && systemActive == 1) || ((((0 == \result && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) && systemActive == 1) [2019-01-12 14:55:43,579 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 == \result && !(0 == tmp)) && 0 == tmp___0) && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) && systemActive == 1) || ((((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) && systemActive == 1) [2019-01-12 14:55:43,675 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:55:43,677 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:55:43,678 INFO L168 Benchmark]: Toolchain (without parser) took 11245.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 217.6 MB). Free memory was 951.4 MB in the beginning and 908.9 MB in the end (delta: 42.5 MB). Peak memory consumption was 260.0 MB. Max. memory is 11.5 GB. [2019-01-12 14:55:43,680 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:55:43,680 INFO L168 Benchmark]: CACSL2BoogieTranslator took 724.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -174.7 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2019-01-12 14:55:43,682 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:55:43,682 INFO L168 Benchmark]: Boogie Preprocessor took 48.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:55:43,682 INFO L168 Benchmark]: RCFGBuilder took 1282.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.8 MB). Peak memory consumption was 58.8 MB. Max. memory is 11.5 GB. [2019-01-12 14:55:43,683 INFO L168 Benchmark]: TraceAbstraction took 8908.30 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 924.4 MB in the end (delta: 136.2 MB). Peak memory consumption was 207.5 MB. Max. memory is 11.5 GB. [2019-01-12 14:55:43,683 INFO L168 Benchmark]: Witness Printer took 196.11 ms. Allocated memory is still 1.2 GB. Free memory was 924.4 MB in the beginning and 908.9 MB in the end (delta: 15.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. [2019-01-12 14:55:43,687 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 724.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -174.7 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 81.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1282.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.8 MB). Peak memory consumption was 58.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8908.30 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 924.4 MB in the end (delta: 136.2 MB). Peak memory consumption was 207.5 MB. Max. memory is 11.5 GB. * Witness Printer took 196.11 ms. Allocated memory is still 1.2 GB. Free memory was 924.4 MB in the beginning and 908.9 MB in the end (delta: 15.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 201]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 201]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 201]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 928]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 872]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 649]: Loop Invariant Derived loop invariant: (((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 151]: Loop Invariant Derived loop invariant: (waterLevel == 1 && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 883]: Loop Invariant Derived loop invariant: ((((((splverifierCounter == 0 && waterLevel <= 2) && switchedOnBeforeTS == 1) && 1 == pumpRunning) && 1 == \result) && systemActive == 1) || ((((0 == \result && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) && systemActive == 1)) || (((((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && 1 == pumpRunning) && 1 == \result) && systemActive == 1) - InvariantResult [Line: 649]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 928]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 872]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: (waterLevel == 1 && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 883]: Loop Invariant Derived loop invariant: (((((splverifierCounter == 0 && switchedOnBeforeTS == 1) && waterLevel <= 2) && 1 == pumpRunning) && 1 == \result) && systemActive == 1) || ((((0 == \result && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) && systemActive == 1) - InvariantResult [Line: 649]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 883]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 883]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 736]: Loop Invariant Derived loop invariant: (((((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && 1 == pumpRunning) && systemActive == 1) || (waterLevel <= 2 && (splverifierCounter == 0 && pumpRunning == 0) && systemActive == 1)) || (((((splverifierCounter == 0 && switchedOnBeforeTS == 1) && waterLevel <= 2) && 1 == pumpRunning) && 1 == \result) && systemActive == 1) - InvariantResult [Line: 715]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (waterLevel == 1 && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 928]: Loop Invariant Derived loop invariant: ((((((0 == \result && !(0 == tmp)) && 0 == tmp___0) && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) && systemActive == 1) || ((((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) && systemActive == 1) - InvariantResult [Line: 872]: Loop Invariant Derived loop invariant: (((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 785]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 690]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 681]: Loop Invariant Derived loop invariant: ((waterLevel <= 2 && (splverifierCounter == 0 && pumpRunning == 0) && systemActive == 1) || ((((((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && 1 == pumpRunning) && \result <= 2) && 2 <= \result) && systemActive == 1)) || (((((splverifierCounter == 0 && switchedOnBeforeTS == 1) && waterLevel <= 2) && 1 == pumpRunning) && 1 == \result) && systemActive == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && 1 < tmp) && tmp <= 2) && 1 == pumpRunning) && \result <= 2) && 2 <= \result) && systemActive == 1) || (waterLevel <= 2 && (splverifierCounter == 0 && pumpRunning == 0) && systemActive == 1)) || (((((splverifierCounter == 0 && switchedOnBeforeTS == 1) && waterLevel <= 2) && 1 == pumpRunning) && 1 == \result) && systemActive == 1) - InvariantResult [Line: 785]: Loop Invariant Derived loop invariant: (((((splverifierCounter == 0 && waterLevel <= 2) && switchedOnBeforeTS == 1) && 1 == pumpRunning) && 1 == \result) && systemActive == 1) || ((((0 == \result && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) && systemActive == 1) - InvariantResult [Line: 792]: Loop Invariant Derived loop invariant: (((((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && 1 == pumpRunning) && systemActive == 1) || (((((splverifierCounter == 0 && waterLevel <= 2) && switchedOnBeforeTS == 1) && 1 == pumpRunning) && 1 == \result) && systemActive == 1)) || (((splverifierCounter == 0 && pumpRunning == 0) && waterLevel <= 2) && systemActive == 1) - InvariantResult [Line: 681]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 792]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 681]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 792]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 726]: Loop Invariant Derived loop invariant: (((((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && 1 == pumpRunning) && systemActive == 1) || (waterLevel <= 2 && (splverifierCounter == 0 && pumpRunning == 0) && systemActive == 1)) || (((((splverifierCounter == 0 && switchedOnBeforeTS == 1) && waterLevel <= 2) && 1 == pumpRunning) && 1 == \result) && systemActive == 1) - InvariantResult [Line: 883]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 883]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 231]: Loop Invariant Derived loop invariant: (waterLevel == 1 && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 781]: Loop Invariant Derived loop invariant: (((splverifierCounter == 0 && pumpRunning == 0) && waterLevel <= 2) && systemActive == 1) || (((((splverifierCounter == 0 && switchedOnBeforeTS == 1) && waterLevel <= 2) && 1 == pumpRunning) && 1 == \result) && systemActive == 1) - InvariantResult [Line: 690]: Loop Invariant Derived loop invariant: ((((!(0 == \result) && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) && systemActive == 1) || ((((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) && systemActive == 1) - InvariantResult [Line: 781]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 754]: Loop Invariant Derived loop invariant: (((((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && 1 == pumpRunning) && systemActive == 1) || (waterLevel <= 2 && (splverifierCounter == 0 && pumpRunning == 0) && systemActive == 1)) || (((((splverifierCounter == 0 && switchedOnBeforeTS == 1) && waterLevel <= 2) && 1 == pumpRunning) && 1 == \result) && systemActive == 1) - InvariantResult [Line: 690]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 785]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 781]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 96 locations, 3 error locations. SAFE Result, 8.7s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 2.4s AutomataDifference, 0.0s DeadEndRemovalTime, 3.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 815 SDtfs, 873 SDslu, 1150 SDs, 0 SdLazy, 180 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=135occurred in iteration=9, traceCheckStatistics: No data available, 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: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 330 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 44 LocationsWithAnnotation, 44 PreInvPairs, 106 NumberOfFragments, 656 HoareAnnotationTreeSize, 44 FomulaSimplifications, 30344 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 44 FomulaSimplificationsInter, 4452 FormulaSimplificationTreeSizeReductionInter, 2.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 378 NumberOfCodeBlocks, 378 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 367 ConstructedInterpolants, 0 QuantifiedInterpolants, 26855 SizeOfPredicates, 4 NumberOfNonLiveVariables, 416 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 26/32 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...