./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec5_product43_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_product43_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 77b70849cb3dcecd37b0edacca9651109dbc42ac ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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,585 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:55:31,587 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:55:31,599 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:55:31,600 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:55:31,601 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:55:31,603 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:55:31,605 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:55:31,607 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:55:31,608 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:55:31,609 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:55:31,609 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:55:31,610 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:55:31,611 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:55:31,613 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:55:31,614 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:55:31,615 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:55:31,617 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:55:31,619 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:55:31,621 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:55:31,622 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:55:31,624 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:55:31,627 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:55:31,627 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:55:31,627 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:55:31,628 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:55:31,630 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:55:31,631 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:55:31,632 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:55:31,633 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:55:31,633 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:55:31,635 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:55:31,635 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:55:31,635 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:55:31,636 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:55:31,637 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:55:31,638 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,658 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:55:31,658 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:55:31,660 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:55:31,660 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:55:31,661 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:55:31,661 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:55:31,661 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:55:31,661 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:55:31,661 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:55:31,662 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:55:31,662 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:55:31,662 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:55:31,662 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:55:31,663 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:55:31,663 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:55:31,663 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:55:31,663 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:55:31,663 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:55:31,664 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:55:31,664 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:55:31,664 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:55:31,664 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:55:31,664 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:55:31,664 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:55:31,665 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:55:31,666 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:55:31,666 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:55:31,666 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:55:31,666 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 -> 77b70849cb3dcecd37b0edacca9651109dbc42ac [2019-01-12 14:55:31,723 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:55:31,740 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:55:31,745 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:55:31,747 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:55:31,747 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:55:31,748 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec5_product43_true-unreach-call_false-termination.cil.c [2019-01-12 14:55:31,814 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de38b6c65/23cd5375b02948d3b53879b3da8973d3/FLAG61f35ca6f [2019-01-12 14:55:32,313 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:55:32,315 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec5_product43_true-unreach-call_false-termination.cil.c [2019-01-12 14:55:32,331 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de38b6c65/23cd5375b02948d3b53879b3da8973d3/FLAG61f35ca6f [2019-01-12 14:55:32,603 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de38b6c65/23cd5375b02948d3b53879b3da8973d3 [2019-01-12 14:55:32,608 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:55:32,609 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:55:32,610 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:55:32,611 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:55:32,615 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:55:32,616 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,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7741d457 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,621 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,629 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:55:32,680 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:55:33,158 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:55:33,186 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:55:33,398 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:55:33,436 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:55:33,437 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,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:55:33,438 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:55:33,438 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:55:33,438 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:55:33,448 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,475 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,521 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:55:33,521 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:55:33,521 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:55:33,522 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:55:33,530 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,530 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,535 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,535 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,547 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,556 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,560 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,564 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:55:33,565 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:55:33,572 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:55:33,572 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:55:33,573 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,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 14:55:33,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-12 14:55:33,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:55:33,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:55:34,993 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:55:34,993 INFO L286 CfgBuilder]: Removed 132 assue(true) statements. [2019-01-12 14:55:34,994 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,995 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:55:34,996 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:55:34,996 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:55:34,999 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:55:34,999 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:35,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e468040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:55:35, skipping insertion in model container [2019-01-12 14:55:35,000 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:35,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e468040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:55:35, skipping insertion in model container [2019-01-12 14:55:35,001 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:35,003 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec5_product43_true-unreach-call_false-termination.cil.c [2019-01-12 14:55:35,013 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:55:35,024 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 14:55:35,042 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 14:55:35,074 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:55:35,075 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:55:35,075 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:55:35,075 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:55:35,076 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:55:35,076 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:55:35,076 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:55:35,076 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:55:35,076 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:55:35,095 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2019-01-12 14:55:35,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-12 14:55:35,103 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:35,104 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:35,106 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:35,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:35,113 INFO L82 PathProgramCache]: Analyzing trace with hash -2684768, now seen corresponding path program 1 times [2019-01-12 14:55:35,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:35,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:35,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:35,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:35,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:35,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:35,373 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,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:55:35,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:55:35,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 14:55:35,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 14:55:35,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:55:35,401 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 2 states. [2019-01-12 14:55:35,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:35,434 INFO L93 Difference]: Finished difference Result 189 states and 280 transitions. [2019-01-12 14:55:35,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 14:55:35,436 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2019-01-12 14:55:35,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:35,448 INFO L225 Difference]: With dead ends: 189 [2019-01-12 14:55:35,448 INFO L226 Difference]: Without dead ends: 94 [2019-01-12 14:55:35,451 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,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-12 14:55:35,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-01-12 14:55:35,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-12 14:55:35,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 132 transitions. [2019-01-12 14:55:35,499 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 132 transitions. Word has length 19 [2019-01-12 14:55:35,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:35,500 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 132 transitions. [2019-01-12 14:55:35,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 14:55:35,500 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 132 transitions. [2019-01-12 14:55:35,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-12 14:55:35,501 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:35,501 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,502 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:35,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:35,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1024617476, now seen corresponding path program 1 times [2019-01-12 14:55:35,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:35,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:35,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:35,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:35,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:35,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:35,678 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,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:55:35,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:55:35,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:55:35,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:55:35,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:55:35,682 INFO L87 Difference]: Start difference. First operand 94 states and 132 transitions. Second operand 3 states. [2019-01-12 14:55:35,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:35,709 INFO L93 Difference]: Finished difference Result 94 states and 132 transitions. [2019-01-12 14:55:35,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:55:35,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-01-12 14:55:35,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:35,711 INFO L225 Difference]: With dead ends: 94 [2019-01-12 14:55:35,712 INFO L226 Difference]: Without dead ends: 43 [2019-01-12 14:55:35,714 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,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-12 14:55:35,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-12 14:55:35,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-12 14:55:35,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2019-01-12 14:55:35,721 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 20 [2019-01-12 14:55:35,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:35,722 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2019-01-12 14:55:35,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:55:35,722 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2019-01-12 14:55:35,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-12 14:55:35,724 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:35,725 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,725 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:35,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:35,726 INFO L82 PathProgramCache]: Analyzing trace with hash -322803839, now seen corresponding path program 1 times [2019-01-12 14:55:35,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:35,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:35,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:35,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:35,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:35,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:35,931 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,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:55:35,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:55:35,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:55:35,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:55:35,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:55:35,935 INFO L87 Difference]: Start difference. First operand 43 states and 60 transitions. Second operand 3 states. [2019-01-12 14:55:36,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:36,016 INFO L93 Difference]: Finished difference Result 115 states and 166 transitions. [2019-01-12 14:55:36,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:55:36,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-01-12 14:55:36,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:36,021 INFO L225 Difference]: With dead ends: 115 [2019-01-12 14:55:36,023 INFO L226 Difference]: Without dead ends: 79 [2019-01-12 14:55:36,024 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:36,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-12 14:55:36,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2019-01-12 14:55:36,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-12 14:55:36,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 108 transitions. [2019-01-12 14:55:36,043 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 108 transitions. Word has length 26 [2019-01-12 14:55:36,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:36,048 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 108 transitions. [2019-01-12 14:55:36,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:55:36,048 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 108 transitions. [2019-01-12 14:55:36,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-12 14:55:36,049 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:36,049 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:36,050 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:36,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:36,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1431450619, now seen corresponding path program 1 times [2019-01-12 14:55:36,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:36,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:36,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:36,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:36,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:36,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:36,199 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,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:55:36,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:55:36,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:55:36,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:55:36,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:55:36,201 INFO L87 Difference]: Start difference. First operand 75 states and 108 transitions. Second operand 3 states. [2019-01-12 14:55:36,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:36,316 INFO L93 Difference]: Finished difference Result 190 states and 279 transitions. [2019-01-12 14:55:36,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:55:36,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-01-12 14:55:36,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:36,323 INFO L225 Difference]: With dead ends: 190 [2019-01-12 14:55:36,324 INFO L226 Difference]: Without dead ends: 122 [2019-01-12 14:55:36,324 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:36,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-01-12 14:55:36,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2019-01-12 14:55:36,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-01-12 14:55:36,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 172 transitions. [2019-01-12 14:55:36,344 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 172 transitions. Word has length 27 [2019-01-12 14:55:36,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:36,344 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 172 transitions. [2019-01-12 14:55:36,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:55:36,345 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 172 transitions. [2019-01-12 14:55:36,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-12 14:55:36,351 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:36,351 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] [2019-01-12 14:55:36,351 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:36,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:36,353 INFO L82 PathProgramCache]: Analyzing trace with hash -591283254, now seen corresponding path program 1 times [2019-01-12 14:55:36,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:36,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:36,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:36,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:36,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:36,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:36,565 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,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:55:36,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:55:36,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:55:36,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:55:36,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:55:36,569 INFO L87 Difference]: Start difference. First operand 120 states and 172 transitions. Second operand 5 states. [2019-01-12 14:55:36,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:36,986 INFO L93 Difference]: Finished difference Result 435 states and 625 transitions. [2019-01-12 14:55:36,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:55:36,986 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-01-12 14:55:36,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:36,989 INFO L225 Difference]: With dead ends: 435 [2019-01-12 14:55:36,989 INFO L226 Difference]: Without dead ends: 322 [2019-01-12 14:55:36,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 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,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-01-12 14:55:37,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 118. [2019-01-12 14:55:37,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-01-12 14:55:37,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 166 transitions. [2019-01-12 14:55:37,015 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 166 transitions. Word has length 29 [2019-01-12 14:55:37,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:37,015 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 166 transitions. [2019-01-12 14:55:37,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:55:37,016 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 166 transitions. [2019-01-12 14:55:37,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-12 14:55:37,017 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:37,017 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,018 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:37,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:37,018 INFO L82 PathProgramCache]: Analyzing trace with hash 644254591, now seen corresponding path program 1 times [2019-01-12 14:55:37,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:37,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:37,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:37,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:37,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:37,278 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,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:55:37,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:55:37,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:55:37,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:55:37,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:55:37,281 INFO L87 Difference]: Start difference. First operand 118 states and 166 transitions. Second operand 5 states. [2019-01-12 14:55:37,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:37,440 INFO L93 Difference]: Finished difference Result 321 states and 449 transitions. [2019-01-12 14:55:37,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:55:37,441 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-01-12 14:55:37,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:37,443 INFO L225 Difference]: With dead ends: 321 [2019-01-12 14:55:37,443 INFO L226 Difference]: Without dead ends: 210 [2019-01-12 14:55:37,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:55:37,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-01-12 14:55:37,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 124. [2019-01-12 14:55:37,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-01-12 14:55:37,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 172 transitions. [2019-01-12 14:55:37,467 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 172 transitions. Word has length 36 [2019-01-12 14:55:37,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:37,467 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 172 transitions. [2019-01-12 14:55:37,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:55:37,467 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 172 transitions. [2019-01-12 14:55:37,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-12 14:55:37,469 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:37,469 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,469 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:37,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:37,470 INFO L82 PathProgramCache]: Analyzing trace with hash -366862659, now seen corresponding path program 1 times [2019-01-12 14:55:37,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:37,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:37,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:37,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:37,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:37,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:37,749 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,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:55:37,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:55:37,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:55:37,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:55:37,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:55:37,750 INFO L87 Difference]: Start difference. First operand 124 states and 172 transitions. Second operand 5 states. [2019-01-12 14:55:38,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:38,441 INFO L93 Difference]: Finished difference Result 348 states and 476 transitions. [2019-01-12 14:55:38,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:55:38,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-01-12 14:55:38,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:38,444 INFO L225 Difference]: With dead ends: 348 [2019-01-12 14:55:38,444 INFO L226 Difference]: Without dead ends: 231 [2019-01-12 14:55:38,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:55:38,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-01-12 14:55:38,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 128. [2019-01-12 14:55:38,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-01-12 14:55:38,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 176 transitions. [2019-01-12 14:55:38,467 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 176 transitions. Word has length 36 [2019-01-12 14:55:38,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:38,468 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 176 transitions. [2019-01-12 14:55:38,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:55:38,468 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 176 transitions. [2019-01-12 14:55:38,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-12 14:55:38,470 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:38,471 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:38,471 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:38,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:38,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1387931013, now seen corresponding path program 1 times [2019-01-12 14:55:38,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:38,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:38,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:38,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:38,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:38,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:38,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:38,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:55:38,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:55:38,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:55:38,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:55:38,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:55:38,604 INFO L87 Difference]: Start difference. First operand 128 states and 176 transitions. Second operand 3 states. [2019-01-12 14:55:38,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:38,781 INFO L93 Difference]: Finished difference Result 305 states and 418 transitions. [2019-01-12 14:55:38,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:55:38,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-01-12 14:55:38,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:38,784 INFO L225 Difference]: With dead ends: 305 [2019-01-12 14:55:38,784 INFO L226 Difference]: Without dead ends: 184 [2019-01-12 14:55:38,785 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:38,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-01-12 14:55:38,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-01-12 14:55:38,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-01-12 14:55:38,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 245 transitions. [2019-01-12 14:55:38,827 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 245 transitions. Word has length 36 [2019-01-12 14:55:38,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:38,828 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 245 transitions. [2019-01-12 14:55:38,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:55:38,828 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 245 transitions. [2019-01-12 14:55:38,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-12 14:55:38,831 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:38,831 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:38,831 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:38,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:38,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1432557499, now seen corresponding path program 1 times [2019-01-12 14:55:38,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:38,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:38,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:38,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:38,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:39,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:39,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:55:39,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 14:55:39,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:55:39,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:55:39,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:55:39,113 INFO L87 Difference]: Start difference. First operand 184 states and 245 transitions. Second operand 6 states. [2019-01-12 14:55:39,562 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-12 14:55:39,757 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-12 14:55:39,992 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-12 14:55:40,290 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-12 14:55:40,796 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-12 14:55:41,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:41,012 INFO L93 Difference]: Finished difference Result 689 states and 945 transitions. [2019-01-12 14:55:41,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:55:41,013 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-01-12 14:55:41,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:41,016 INFO L225 Difference]: With dead ends: 689 [2019-01-12 14:55:41,016 INFO L226 Difference]: Without dead ends: 568 [2019-01-12 14:55:41,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-12 14:55:41,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-01-12 14:55:41,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 269. [2019-01-12 14:55:41,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-01-12 14:55:41,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 354 transitions. [2019-01-12 14:55:41,067 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 354 transitions. Word has length 37 [2019-01-12 14:55:41,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:41,070 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 354 transitions. [2019-01-12 14:55:41,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:55:41,070 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 354 transitions. [2019-01-12 14:55:41,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-12 14:55:41,072 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:41,073 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:41,078 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:41,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:41,079 INFO L82 PathProgramCache]: Analyzing trace with hash 329840228, now seen corresponding path program 1 times [2019-01-12 14:55:41,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:41,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:41,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:41,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:41,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:41,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:41,449 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:55:41,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:55:41,450 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:41,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:41,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:55:42,083 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:42,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:55:42,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-01-12 14:55:42,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 14:55:42,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 14:55:42,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:55:42,139 INFO L87 Difference]: Start difference. First operand 269 states and 354 transitions. Second operand 9 states. [2019-01-12 14:55:43,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:43,180 INFO L93 Difference]: Finished difference Result 507 states and 677 transitions. [2019-01-12 14:55:43,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 14:55:43,180 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-01-12 14:55:43,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:43,181 INFO L225 Difference]: With dead ends: 507 [2019-01-12 14:55:43,181 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 14:55:43,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-01-12 14:55:43,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 14:55:43,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 14:55:43,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 14:55:43,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 14:55:43,186 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2019-01-12 14:55:43,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:43,186 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 14:55:43,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 14:55:43,187 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 14:55:43,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 14:55:43,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 14:55:43,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,345 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 70 [2019-01-12 14:55:43,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,640 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 55 [2019-01-12 14:55:43,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:43,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:44,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:44,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:44,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:44,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:44,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:44,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:44,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:44,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:44,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:45,587 WARN L181 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 68 DAG size of output: 19 [2019-01-12 14:55:45,832 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 15 [2019-01-12 14:55:46,027 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 23 [2019-01-12 14:55:46,205 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 20 [2019-01-12 14:55:46,351 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 20 [2019-01-12 14:55:46,875 WARN L181 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 26 [2019-01-12 14:55:46,999 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 20 [2019-01-12 14:55:47,198 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 10 [2019-01-12 14:55:47,417 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 20 [2019-01-12 14:55:47,654 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 10 [2019-01-12 14:55:47,671 INFO L448 ceAbstractionStarter]: For program point L861(lines 861 867) no Hoare annotation was computed. [2019-01-12 14:55:47,671 INFO L448 ceAbstractionStarter]: For program point L861-1(lines 861 867) no Hoare annotation was computed. [2019-01-12 14:55:47,671 INFO L448 ceAbstractionStarter]: For program point L861-2(lines 861 867) no Hoare annotation was computed. [2019-01-12 14:55:47,671 INFO L448 ceAbstractionStarter]: For program point L498(lines 498 505) no Hoare annotation was computed. [2019-01-12 14:55:47,671 INFO L451 ceAbstractionStarter]: At program point L498-1(lines 498 505) the Hoare annotation is: true [2019-01-12 14:55:47,671 INFO L444 ceAbstractionStarter]: At program point L944(lines 1 964) the Hoare annotation is: (and (= ~waterLevel~0 1) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2019-01-12 14:55:47,672 INFO L448 ceAbstractionStarter]: For program point L961(line 961) no Hoare annotation was computed. [2019-01-12 14:55:47,672 INFO L448 ceAbstractionStarter]: For program point L961-1(line 961) no Hoare annotation was computed. [2019-01-12 14:55:47,672 INFO L448 ceAbstractionStarter]: For program point L961-2(line 961) no Hoare annotation was computed. [2019-01-12 14:55:47,672 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 14:55:47,672 INFO L448 ceAbstractionStarter]: For program point L796(lines 796 800) no Hoare annotation was computed. [2019-01-12 14:55:47,672 INFO L448 ceAbstractionStarter]: For program point L631(lines 631 648) no Hoare annotation was computed. [2019-01-12 14:55:47,672 INFO L448 ceAbstractionStarter]: For program point L631-1(lines 631 648) no Hoare annotation was computed. [2019-01-12 14:55:47,672 INFO L448 ceAbstractionStarter]: For program point L631-2(lines 631 648) no Hoare annotation was computed. [2019-01-12 14:55:47,672 INFO L444 ceAbstractionStarter]: At program point L879(lines 874 881) the Hoare annotation is: (and (= ~waterLevel~0 1) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2019-01-12 14:55:47,672 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 961) no Hoare annotation was computed. [2019-01-12 14:55:47,673 INFO L444 ceAbstractionStarter]: At program point L599(lines 595 617) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (<= ~waterLevel~0 2))) (or (and (<= 1 ~switchedOnBeforeTS~0) (<= 1 ~pumpRunning~0) .cse0 .cse1 (<= 1 |ULTIMATE.start_isPumpRunning_#res|)) (and .cse0 .cse1 (= ~pumpRunning~0 0)))) [2019-01-12 14:55:47,673 INFO L444 ceAbstractionStarter]: At program point L599-1(lines 595 617) the Hoare annotation is: false [2019-01-12 14:55:47,673 INFO L448 ceAbstractionStarter]: For program point L533(lines 533 539) no Hoare annotation was computed. [2019-01-12 14:55:47,673 INFO L444 ceAbstractionStarter]: At program point L599-2(lines 595 617) the Hoare annotation is: false [2019-01-12 14:55:47,673 INFO L444 ceAbstractionStarter]: At program point L533-1(lines 533 539) the Hoare annotation is: (let ((.cse0 (<= 1 ~pumpRunning~0)) (.cse2 (<= ~waterLevel~0 2)) (.cse1 (= ULTIMATE.start_test_~splverifierCounter~0 0))) (or (and (<= 1 ~switchedOnBeforeTS~0) .cse0 .cse1 .cse2 (<= 1 |ULTIMATE.start_isPumpRunning_#res|)) (and .cse0 (<= 2 ~waterLevel~0) .cse1 .cse2) (and .cse2 (and .cse1 (= ~pumpRunning~0 0))))) [2019-01-12 14:55:47,673 INFO L444 ceAbstractionStarter]: At program point L418-2(lines 418 432) the Hoare annotation is: false [2019-01-12 14:55:47,673 INFO L448 ceAbstractionStarter]: For program point L765(lines 765 771) no Hoare annotation was computed. [2019-01-12 14:55:47,673 INFO L444 ceAbstractionStarter]: At program point L765-1(lines 765 771) the Hoare annotation is: (and (= ULTIMATE.start_test_~splverifierCounter~0 0) (<= ~waterLevel~0 2) (= ~pumpRunning~0 0)) [2019-01-12 14:55:47,674 INFO L448 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-01-12 14:55:47,674 INFO L444 ceAbstractionStarter]: At program point L469(lines 465 471) the Hoare annotation is: (and (= ~waterLevel~0 1) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2019-01-12 14:55:47,674 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 961) no Hoare annotation was computed. [2019-01-12 14:55:47,674 INFO L444 ceAbstractionStarter]: At program point L866(lines 857 870) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (<= ~waterLevel~0 2)) (.cse2 (= ~pumpRunning~0 0))) (or (and (<= 2 ~waterLevel~0) .cse0 .cse1 .cse2) (and (not (= 0 |ULTIMATE.start_isHighWaterSensorDry_#res|)) .cse0 .cse1 .cse2))) [2019-01-12 14:55:47,674 INFO L444 ceAbstractionStarter]: At program point L866-1(lines 857 870) the Hoare annotation is: false [2019-01-12 14:55:47,674 INFO L444 ceAbstractionStarter]: At program point L866-2(lines 857 870) the Hoare annotation is: false [2019-01-12 14:55:47,674 INFO L448 ceAbstractionStarter]: For program point L668(lines 668 674) no Hoare annotation was computed. [2019-01-12 14:55:47,674 INFO L448 ceAbstractionStarter]: For program point L635(lines 635 643) no Hoare annotation was computed. [2019-01-12 14:55:47,674 INFO L448 ceAbstractionStarter]: For program point L635-1(lines 635 643) no Hoare annotation was computed. [2019-01-12 14:55:47,675 INFO L448 ceAbstractionStarter]: For program point L668-2(lines 668 674) no Hoare annotation was computed. [2019-01-12 14:55:47,675 INFO L448 ceAbstractionStarter]: For program point L635-2(lines 635 643) no Hoare annotation was computed. [2019-01-12 14:55:47,675 INFO L448 ceAbstractionStarter]: For program point L668-4(lines 668 674) no Hoare annotation was computed. [2019-01-12 14:55:47,675 INFO L448 ceAbstractionStarter]: For program point L784(lines 784 788) no Hoare annotation was computed. [2019-01-12 14:55:47,675 INFO L448 ceAbstractionStarter]: For program point L751(lines 751 755) no Hoare annotation was computed. [2019-01-12 14:55:47,675 INFO L448 ceAbstractionStarter]: For program point L751-2(lines 751 755) no Hoare annotation was computed. [2019-01-12 14:55:47,675 INFO L448 ceAbstractionStarter]: For program point L784-3(lines 784 788) no Hoare annotation was computed. [2019-01-12 14:55:47,675 INFO L448 ceAbstractionStarter]: For program point L751-3(lines 751 755) no Hoare annotation was computed. [2019-01-12 14:55:47,675 INFO L448 ceAbstractionStarter]: For program point L751-5(lines 751 755) no Hoare annotation was computed. [2019-01-12 14:55:47,675 INFO L448 ceAbstractionStarter]: For program point L784-6(lines 784 788) no Hoare annotation was computed. [2019-01-12 14:55:47,676 INFO L448 ceAbstractionStarter]: For program point L553(lines 553 566) no Hoare annotation was computed. [2019-01-12 14:55:47,676 INFO L448 ceAbstractionStarter]: For program point L751-6(lines 751 755) no Hoare annotation was computed. [2019-01-12 14:55:47,676 INFO L448 ceAbstractionStarter]: For program point L751-8(lines 751 755) no Hoare annotation was computed. [2019-01-12 14:55:47,676 INFO L448 ceAbstractionStarter]: For program point L900(lines 900 917) no Hoare annotation was computed. [2019-01-12 14:55:47,676 INFO L444 ceAbstractionStarter]: At program point L900-1(lines 1 964) the Hoare annotation is: (let ((.cse0 (<= 1 ~pumpRunning~0)) (.cse1 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse2 (<= ~waterLevel~0 2))) (or (and (<= 1 ~switchedOnBeforeTS~0) .cse0 .cse1 .cse2 (<= 1 |ULTIMATE.start_isPumpRunning_#res|)) (and .cse2 (and .cse1 (= ~pumpRunning~0 0))) (and .cse0 (<= 2 ~waterLevel~0) (< 1 ULTIMATE.start___utac_acc__Specification5_spec__3_~tmp~8) .cse1 (<= ULTIMATE.start___utac_acc__Specification5_spec__3_~tmp~8 2) .cse2 (<= |ULTIMATE.start_getWaterLevel_#res| 2) (<= 2 |ULTIMATE.start_getWaterLevel_#res|)))) [2019-01-12 14:55:47,676 INFO L448 ceAbstractionStarter]: For program point L900-2(lines 900 917) no Hoare annotation was computed. [2019-01-12 14:55:47,676 INFO L444 ceAbstractionStarter]: At program point L900-3(lines 1 964) the Hoare annotation is: false [2019-01-12 14:55:47,676 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 14:55:47,677 INFO L448 ceAbstractionStarter]: For program point L900-4(lines 900 917) no Hoare annotation was computed. [2019-01-12 14:55:47,677 INFO L444 ceAbstractionStarter]: At program point L900-5(lines 1 964) the Hoare annotation is: false [2019-01-12 14:55:47,677 INFO L444 ceAbstractionStarter]: At program point L702(lines 697 705) the Hoare annotation is: (let ((.cse0 (<= 1 ~pumpRunning~0)) (.cse3 (<= 1 |ULTIMATE.start_isPumpRunning_#res|)) (.cse1 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse2 (<= ~waterLevel~0 2))) (or (and (<= 1 ~switchedOnBeforeTS~0) .cse0 .cse1 .cse2 .cse3) (and .cse0 (<= 2 ~waterLevel~0) .cse1 .cse2 .cse3) (and (= 0 |ULTIMATE.start_isPumpRunning_#res|) .cse1 .cse2 (= ~pumpRunning~0 0)))) [2019-01-12 14:55:47,677 INFO L444 ceAbstractionStarter]: At program point L702-1(lines 697 705) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (<= ~waterLevel~0 2))) (or (and (<= 1 ~switchedOnBeforeTS~0) (<= 1 ~pumpRunning~0) .cse0 .cse1 (<= 1 |ULTIMATE.start_isPumpRunning_#res|)) (and (= 0 |ULTIMATE.start_isPumpRunning_#res|) .cse0 .cse1 (= ~pumpRunning~0 0)))) [2019-01-12 14:55:47,677 INFO L444 ceAbstractionStarter]: At program point L702-2(lines 697 705) the Hoare annotation is: false [2019-01-12 14:55:47,677 INFO L444 ceAbstractionStarter]: At program point L702-3(lines 697 705) the Hoare annotation is: false [2019-01-12 14:55:47,677 INFO L444 ceAbstractionStarter]: At program point L702-4(lines 697 705) the Hoare annotation is: false [2019-01-12 14:55:47,677 INFO L444 ceAbstractionStarter]: At program point L702-5(lines 697 705) the Hoare annotation is: false [2019-01-12 14:55:47,678 INFO L448 ceAbstractionStarter]: For program point L422(lines 422 426) no Hoare annotation was computed. [2019-01-12 14:55:47,678 INFO L448 ceAbstractionStarter]: For program point L422-1(lines 422 426) no Hoare annotation was computed. [2019-01-12 14:55:47,678 INFO L444 ceAbstractionStarter]: At program point L571(lines 522 572) the Hoare annotation is: false [2019-01-12 14:55:47,678 INFO L444 ceAbstractionStarter]: At program point L952(lines 947 955) the Hoare annotation is: (and (= ~waterLevel~0 1) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2019-01-12 14:55:47,678 INFO L444 ceAbstractionStarter]: At program point L853(lines 848 856) the Hoare annotation is: (let ((.cse0 (<= 1 ~pumpRunning~0)) (.cse2 (<= ~waterLevel~0 2)) (.cse1 (= ULTIMATE.start_test_~splverifierCounter~0 0))) (or (and (<= 1 ~switchedOnBeforeTS~0) .cse0 .cse1 .cse2 (<= 1 |ULTIMATE.start_isPumpRunning_#res|)) (and .cse0 (<= 2 ~waterLevel~0) .cse1 .cse2 (<= |ULTIMATE.start_getWaterLevel_#res| 2) (<= 2 |ULTIMATE.start_getWaterLevel_#res|)) (and .cse2 (and .cse1 (= ~pumpRunning~0 0))))) [2019-01-12 14:55:47,678 INFO L444 ceAbstractionStarter]: At program point L853-1(lines 848 856) the Hoare annotation is: false [2019-01-12 14:55:47,678 INFO L444 ceAbstractionStarter]: At program point L853-2(lines 848 856) the Hoare annotation is: false [2019-01-12 14:55:47,678 INFO L444 ceAbstractionStarter]: At program point L606(lines 606 612) the Hoare annotation is: (let ((.cse0 (<= 1 ~pumpRunning~0)) (.cse1 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse2 (<= ~waterLevel~0 2))) (or (and (<= 1 ~switchedOnBeforeTS~0) .cse0 .cse1 .cse2 (<= 1 |ULTIMATE.start_isPumpRunning_#res|)) (and .cse0 (<= 2 ~waterLevel~0) .cse1 .cse2) (and .cse1 .cse2 (= ~pumpRunning~0 0)))) [2019-01-12 14:55:47,678 INFO L444 ceAbstractionStarter]: At program point L606-1(lines 606 612) the Hoare annotation is: false [2019-01-12 14:55:47,679 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 14:55:47,679 INFO L444 ceAbstractionStarter]: At program point L606-2(lines 606 612) the Hoare annotation is: false [2019-01-12 14:55:47,679 INFO L451 ceAbstractionStarter]: At program point L507(lines 488 510) the Hoare annotation is: true [2019-01-12 14:55:47,679 INFO L444 ceAbstractionStarter]: At program point L821(lines 816 824) the Hoare annotation is: (and (<= 2 ~waterLevel~0) (= ULTIMATE.start_test_~splverifierCounter~0 0) (<= ~waterLevel~0 2) (= ~pumpRunning~0 0)) [2019-01-12 14:55:47,679 INFO L444 ceAbstractionStarter]: At program point L821-1(lines 816 824) the Hoare annotation is: false [2019-01-12 14:55:47,679 INFO L444 ceAbstractionStarter]: At program point L821-2(lines 816 824) the Hoare annotation is: false [2019-01-12 14:55:47,679 INFO L448 ceAbstractionStarter]: For program point L524(lines 523 570) no Hoare annotation was computed. [2019-01-12 14:55:47,679 INFO L448 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-01-12 14:55:47,679 INFO L448 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-01-12 14:55:47,679 INFO L448 ceAbstractionStarter]: For program point L904-4(lines 904 914) no Hoare annotation was computed. [2019-01-12 14:55:47,680 INFO L448 ceAbstractionStarter]: For program point L525(lines 525 529) no Hoare annotation was computed. [2019-01-12 14:55:47,680 INFO L448 ceAbstractionStarter]: For program point L905(lines 905 911) no Hoare annotation was computed. [2019-01-12 14:55:47,680 INFO L448 ceAbstractionStarter]: For program point L905-2(lines 905 911) no Hoare annotation was computed. [2019-01-12 14:55:47,680 INFO L448 ceAbstractionStarter]: For program point L905-4(lines 905 911) no Hoare annotation was computed. [2019-01-12 14:55:47,680 INFO L444 ceAbstractionStarter]: At program point L889(lines 599 605) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (<= ~waterLevel~0 2))) (or (and (<= 1 ~switchedOnBeforeTS~0) (<= 1 ~pumpRunning~0) .cse0 .cse1 (<= 1 |ULTIMATE.start_isPumpRunning_#res|)) (and (= 0 |ULTIMATE.start_isPumpRunning_#res|) .cse0 .cse1 (= ~pumpRunning~0 0)))) [2019-01-12 14:55:47,680 INFO L444 ceAbstractionStarter]: At program point L889-1(lines 599 605) the Hoare annotation is: false [2019-01-12 14:55:47,680 INFO L444 ceAbstractionStarter]: At program point L889-2(lines 599 605) the Hoare annotation is: false [2019-01-12 14:55:47,680 INFO L444 ceAbstractionStarter]: At program point L757(lines 742 760) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse2 (= ~pumpRunning~0 0)) (.cse1 (<= ~waterLevel~0 2))) (or (and (<= 2 ~waterLevel~0) .cse0 .cse1 .cse2) (and (and (not (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~7)) (= 0 |ULTIMATE.start_isHighWaterLevel_#res|) (= 0 ULTIMATE.start_isHighWaterLevel_~tmp___0~1) .cse0 .cse2) .cse1))) [2019-01-12 14:55:47,680 INFO L444 ceAbstractionStarter]: At program point L757-1(lines 742 760) the Hoare annotation is: false [2019-01-12 14:55:47,680 INFO L444 ceAbstractionStarter]: At program point L757-2(lines 742 760) the Hoare annotation is: false [2019-01-12 14:55:47,681 INFO L448 ceAbstractionStarter]: For program point L559(lines 559 565) no Hoare annotation was computed. [2019-01-12 14:55:47,681 INFO L444 ceAbstractionStarter]: At program point L559-1(lines 559 565) the Hoare annotation is: (let ((.cse0 (<= 1 ~pumpRunning~0)) (.cse1 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse2 (<= ~waterLevel~0 2))) (or (and (<= 1 ~switchedOnBeforeTS~0) .cse0 .cse1 .cse2 (<= 1 |ULTIMATE.start_isPumpRunning_#res|)) (and .cse0 (<= 2 ~waterLevel~0) .cse1 .cse2) (and .cse1 .cse2 (= ~pumpRunning~0 0)))) [2019-01-12 14:55:47,681 INFO L448 ceAbstractionStarter]: For program point L543(lines 543 549) no Hoare annotation was computed. [2019-01-12 14:55:47,681 INFO L444 ceAbstractionStarter]: At program point L543-1(lines 543 549) the Hoare annotation is: (let ((.cse0 (<= 1 ~pumpRunning~0)) (.cse2 (<= ~waterLevel~0 2)) (.cse1 (= ULTIMATE.start_test_~splverifierCounter~0 0))) (or (and (<= 1 ~switchedOnBeforeTS~0) .cse0 .cse1 .cse2 (<= 1 |ULTIMATE.start_isPumpRunning_#res|)) (and .cse0 (<= 2 ~waterLevel~0) .cse1 .cse2) (and .cse2 (and .cse1 (= ~pumpRunning~0 0))))) [2019-01-12 14:55:47,681 INFO L448 ceAbstractionStarter]: For program point L808(lines 808 812) no Hoare annotation was computed. [2019-01-12 14:55:47,681 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 14:55:47,681 INFO L444 ceAbstractionStarter]: At program point L693(lines 686 696) the Hoare annotation is: (and (<= 2 ~waterLevel~0) (= ULTIMATE.start_test_~splverifierCounter~0 0) (<= ~waterLevel~0 2) (= ~pumpRunning~0 0)) [2019-01-12 14:55:47,681 INFO L444 ceAbstractionStarter]: At program point L693-1(lines 686 696) the Hoare annotation is: false [2019-01-12 14:55:47,681 INFO L444 ceAbstractionStarter]: At program point L693-2(lines 686 696) the Hoare annotation is: false [2019-01-12 14:55:47,682 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 961) no Hoare annotation was computed. [2019-01-12 14:55:47,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:55:47 BoogieIcfgContainer [2019-01-12 14:55:47,719 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:55:47,719 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:55:47,719 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:55:47,720 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:55:47,722 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:47,731 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 14:55:47,755 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2019-01-12 14:55:47,757 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2019-01-12 14:55:47,758 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-01-12 14:55:47,761 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 14:55:47,762 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 14:55:47,762 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-12 14:55:47,787 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) || (waterLevel <= 2 && splverifierCounter == 0 && pumpRunning == 0)) || (((((((1 <= pumpRunning && 2 <= waterLevel) && 1 < tmp) && splverifierCounter == 0) && tmp <= 2) && waterLevel <= 2) && \result <= 2) && 2 <= \result) [2019-01-12 14:55:47,787 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) || (((1 <= pumpRunning && 2 <= waterLevel) && splverifierCounter == 0) && waterLevel <= 2)) || (waterLevel <= 2 && splverifierCounter == 0 && pumpRunning == 0) [2019-01-12 14:55:47,787 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) || (((1 <= pumpRunning && 2 <= waterLevel) && splverifierCounter == 0) && waterLevel <= 2)) || (waterLevel <= 2 && splverifierCounter == 0 && pumpRunning == 0) [2019-01-12 14:55:47,788 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) || (((1 <= pumpRunning && 2 <= waterLevel) && splverifierCounter == 0) && waterLevel <= 2)) || ((splverifierCounter == 0 && waterLevel <= 2) && pumpRunning == 0) [2019-01-12 14:55:47,788 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) || ((((1 <= pumpRunning && 2 <= waterLevel) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result)) || (((0 == \result && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) [2019-01-12 14:55:47,789 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) || (((0 == \result && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) [2019-01-12 14:55:47,789 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) || ((splverifierCounter == 0 && waterLevel <= 2) && pumpRunning == 0) [2019-01-12 14:55:47,789 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) || (((1 <= pumpRunning && 2 <= waterLevel) && splverifierCounter == 0) && waterLevel <= 2)) || ((splverifierCounter == 0 && waterLevel <= 2) && pumpRunning == 0) [2019-01-12 14:55:47,790 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) || (((((1 <= pumpRunning && 2 <= waterLevel) && splverifierCounter == 0) && waterLevel <= 2) && \result <= 2) && 2 <= \result)) || (waterLevel <= 2 && splverifierCounter == 0 && pumpRunning == 0) [2019-01-12 14:55:47,791 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) || (((!(0 == \result) && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) [2019-01-12 14:55:47,791 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) || (((0 == \result && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) [2019-01-12 14:55:47,792 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) || (((((!(0 == tmp) && 0 == \result) && 0 == tmp___0) && splverifierCounter == 0) && pumpRunning == 0) && waterLevel <= 2) [2019-01-12 14:55:47,880 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:55:47,880 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:55:47,882 INFO L168 Benchmark]: Toolchain (without parser) took 15273.95 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 309.9 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -280.6 MB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. [2019-01-12 14:55:47,884 INFO L168 Benchmark]: CDTParser took 0.17 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:47,884 INFO L168 Benchmark]: CACSL2BoogieTranslator took 826.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -177.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. [2019-01-12 14:55:47,884 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.37 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:47,884 INFO L168 Benchmark]: Boogie Preprocessor took 43.44 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:47,885 INFO L168 Benchmark]: RCFGBuilder took 1429.57 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.7 MB). Peak memory consumption was 58.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:55:47,885 INFO L168 Benchmark]: TraceAbstraction took 12723.49 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 161.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -171.4 MB). Peak memory consumption was 337.1 MB. Max. memory is 11.5 GB. [2019-01-12 14:55:47,885 INFO L168 Benchmark]: Witness Printer took 160.85 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. [2019-01-12 14:55:47,890 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.17 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 826.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -177.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 83.37 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 43.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1429.57 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.7 MB). Peak memory consumption was 58.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12723.49 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 161.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -171.4 MB). Peak memory consumption was 337.1 MB. Max. memory is 11.5 GB. * Witness Printer took 160.85 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 961]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 961]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 961]: 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: 697]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 559]: Loop Invariant Derived loop invariant: (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) || (((1 <= pumpRunning && 2 <= waterLevel) && splverifierCounter == 0) && waterLevel <= 2)) || ((splverifierCounter == 0 && waterLevel <= 2) && pumpRunning == 0) - InvariantResult [Line: 947]: Loop Invariant Derived loop invariant: (waterLevel == 1 && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 857]: Loop Invariant Derived loop invariant: (((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) || (((!(0 == \result) && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) - InvariantResult [Line: 595]: Loop Invariant Derived loop invariant: ((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) || ((splverifierCounter == 0 && waterLevel <= 2) && pumpRunning == 0) - InvariantResult [Line: 857]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 595]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 857]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 418]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 465]: Loop Invariant Derived loop invariant: (waterLevel == 1 && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 848]: Loop Invariant Derived loop invariant: (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) || (((((1 <= pumpRunning && 2 <= waterLevel) && splverifierCounter == 0) && waterLevel <= 2) && \result <= 2) && 2 <= \result)) || (waterLevel <= 2 && splverifierCounter == 0 && pumpRunning == 0) - InvariantResult [Line: 595]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 742]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 816]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 686]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 543]: Loop Invariant Derived loop invariant: (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) || (((1 <= pumpRunning && 2 <= waterLevel) && splverifierCounter == 0) && waterLevel <= 2)) || (waterLevel <= 2 && splverifierCounter == 0 && pumpRunning == 0) - InvariantResult [Line: 697]: Loop Invariant Derived loop invariant: (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) || ((((1 <= pumpRunning && 2 <= waterLevel) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result)) || (((0 == \result && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) - InvariantResult [Line: 742]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 816]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 686]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 697]: Loop Invariant Derived loop invariant: ((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) || (((0 == \result && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) - InvariantResult [Line: 697]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 697]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 697]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: (waterLevel == 1 && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 599]: Loop Invariant Derived loop invariant: ((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) || (((0 == \result && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) || (waterLevel <= 2 && splverifierCounter == 0 && pumpRunning == 0)) || (((((((1 <= pumpRunning && 2 <= waterLevel) && 1 < tmp) && splverifierCounter == 0) && tmp <= 2) && waterLevel <= 2) && \result <= 2) && 2 <= \result) - InvariantResult [Line: 599]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 599]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 742]: Loop Invariant Derived loop invariant: (((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) || (((((!(0 == tmp) && 0 == \result) && 0 == tmp___0) && splverifierCounter == 0) && pumpRunning == 0) && waterLevel <= 2) - InvariantResult [Line: 816]: Loop Invariant Derived loop invariant: ((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0 - InvariantResult [Line: 686]: Loop Invariant Derived loop invariant: ((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 533]: Loop Invariant Derived loop invariant: (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) || (((1 <= pumpRunning && 2 <= waterLevel) && splverifierCounter == 0) && waterLevel <= 2)) || (waterLevel <= 2 && splverifierCounter == 0 && pumpRunning == 0) - InvariantResult [Line: 848]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) || (((1 <= pumpRunning && 2 <= waterLevel) && splverifierCounter == 0) && waterLevel <= 2)) || ((splverifierCounter == 0 && waterLevel <= 2) && pumpRunning == 0) - InvariantResult [Line: 848]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 765]: Loop Invariant Derived loop invariant: (splverifierCounter == 0 && waterLevel <= 2) && pumpRunning == 0 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 498]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 522]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (waterLevel == 1 && pumpRunning == 0) && systemActive == 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 98 locations, 3 error locations. SAFE Result, 12.6s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 4.7s AutomataDifference, 0.0s DeadEndRemovalTime, 4.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 902 SDtfs, 1222 SDslu, 1406 SDs, 0 SdLazy, 239 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=269occurred 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.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 698 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 45 PreInvPairs, 181 NumberOfFragments, 561 HoareAnnotationTreeSize, 45 FomulaSimplifications, 81729 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 45 FomulaSimplificationsInter, 10740 FormulaSimplificationTreeSizeReductionInter, 3.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 374 NumberOfCodeBlocks, 374 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 363 ConstructedInterpolants, 0 QuantifiedInterpolants, 31064 SizeOfPredicates, 4 NumberOfNonLiveVariables, 412 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 14/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...