./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec4_product52_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_spec4_product52_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 ac98b61700c421642ba0cea32b1043bdcac0ece8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:54:25,745 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:54:25,746 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:54:25,759 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:54:25,759 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:54:25,760 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:54:25,762 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:54:25,764 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:54:25,766 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:54:25,766 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:54:25,767 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:54:25,768 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:54:25,769 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:54:25,770 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:54:25,771 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:54:25,772 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:54:25,773 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:54:25,774 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:54:25,777 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:54:25,779 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:54:25,780 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:54:25,781 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:54:25,784 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:54:25,784 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:54:25,784 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:54:25,786 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:54:25,787 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:54:25,788 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:54:25,788 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:54:25,790 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:54:25,790 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:54:25,791 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:54:25,791 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:54:25,791 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:54:25,792 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:54:25,793 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:54:25,794 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:54:25,820 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:54:25,820 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:54:25,822 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:54:25,823 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:54:25,823 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:54:25,823 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:54:25,823 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:54:25,823 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:54:25,824 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:54:25,824 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:54:25,825 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:54:25,825 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:54:25,825 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:54:25,825 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:54:25,825 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:54:25,826 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:54:25,827 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:54:25,827 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:54:25,827 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:54:25,828 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:54:25,829 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:54:25,829 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:54:25,829 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:54:25,829 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:54:25,829 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:54:25,830 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:54:25,831 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:54:25,831 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:54:25,831 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 -> ac98b61700c421642ba0cea32b1043bdcac0ece8 [2019-01-12 14:54:25,887 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:54:25,904 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:54:25,910 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:54:25,912 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:54:25,913 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:54:25,915 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec4_product52_true-unreach-call_false-termination.cil.c [2019-01-12 14:54:25,980 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02986365a/44779474d15541a0a5671dd74e3f0883/FLAGf30210248 [2019-01-12 14:54:26,507 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:54:26,510 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec4_product52_true-unreach-call_false-termination.cil.c [2019-01-12 14:54:26,522 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02986365a/44779474d15541a0a5671dd74e3f0883/FLAGf30210248 [2019-01-12 14:54:26,779 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02986365a/44779474d15541a0a5671dd74e3f0883 [2019-01-12 14:54:26,782 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:54:26,783 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:54:26,785 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:54:26,785 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:54:26,789 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:54:26,790 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:54:26" (1/1) ... [2019-01-12 14:54:26,793 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3662ed3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:26, skipping insertion in model container [2019-01-12 14:54:26,793 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:54:26" (1/1) ... [2019-01-12 14:54:26,801 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:54:26,848 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:54:27,209 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:54:27,240 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:54:27,332 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:54:27,450 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:54:27,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:27 WrapperNode [2019-01-12 14:54:27,451 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:54:27,452 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:54:27,452 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:54:27,452 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:54:27,463 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:54:27" (1/1) ... [2019-01-12 14:54:27,481 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:54:27" (1/1) ... [2019-01-12 14:54:27,535 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:54:27,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:54:27,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:54:27,537 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:54:27,547 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:27" (1/1) ... [2019-01-12 14:54:27,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:27" (1/1) ... [2019-01-12 14:54:27,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:27" (1/1) ... [2019-01-12 14:54:27,554 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:27" (1/1) ... [2019-01-12 14:54:27,569 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:27" (1/1) ... [2019-01-12 14:54:27,580 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:27" (1/1) ... [2019-01-12 14:54:27,584 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:27" (1/1) ... [2019-01-12 14:54:27,593 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:54:27,596 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:54:27,597 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:54:27,597 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:54:27,599 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:27" (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:54:27,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 14:54:27,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-12 14:54:27,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:54:27,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:54:29,161 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:54:29,161 INFO L286 CfgBuilder]: Removed 162 assue(true) statements. [2019-01-12 14:54:29,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:54:29 BoogieIcfgContainer [2019-01-12 14:54:29,162 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:54:29,164 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:54:29,164 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:54:29,167 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:54:29,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:54:26" (1/3) ... [2019-01-12 14:54:29,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68ba29d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:54:29, skipping insertion in model container [2019-01-12 14:54:29,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:27" (2/3) ... [2019-01-12 14:54:29,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68ba29d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:54:29, skipping insertion in model container [2019-01-12 14:54:29,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:54:29" (3/3) ... [2019-01-12 14:54:29,173 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product52_true-unreach-call_false-termination.cil.c [2019-01-12 14:54:29,184 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:54:29,193 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 14:54:29,213 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 14:54:29,253 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:54:29,254 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:54:29,254 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:54:29,254 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:54:29,255 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:54:29,255 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:54:29,255 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:54:29,255 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:54:29,256 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:54:29,275 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states. [2019-01-12 14:54:29,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 14:54:29,282 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:54:29,283 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:54:29,285 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:54:29,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:54:29,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1794729554, now seen corresponding path program 1 times [2019-01-12 14:54:29,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:54:29,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:54:29,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:29,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:29,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:29,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:29,507 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:54:29,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:54:29,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:54:29,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 14:54:29,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 14:54:29,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:54:29,534 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 2 states. [2019-01-12 14:54:29,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:54:29,568 INFO L93 Difference]: Finished difference Result 232 states and 353 transitions. [2019-01-12 14:54:29,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 14:54:29,570 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-01-12 14:54:29,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:54:29,586 INFO L225 Difference]: With dead ends: 232 [2019-01-12 14:54:29,586 INFO L226 Difference]: Without dead ends: 115 [2019-01-12 14:54:29,590 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:54:29,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-12 14:54:29,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-01-12 14:54:29,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-12 14:54:29,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 168 transitions. [2019-01-12 14:54:29,636 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 168 transitions. Word has length 16 [2019-01-12 14:54:29,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:54:29,637 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 168 transitions. [2019-01-12 14:54:29,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 14:54:29,637 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 168 transitions. [2019-01-12 14:54:29,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 14:54:29,638 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:54:29,639 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:54:29,639 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:54:29,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:54:29,640 INFO L82 PathProgramCache]: Analyzing trace with hash 529368141, now seen corresponding path program 1 times [2019-01-12 14:54:29,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:54:29,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:54:29,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:29,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:29,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:29,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:29,801 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:54:29,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:54:29,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:54:29,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:54:29,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:54:29,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:54:29,804 INFO L87 Difference]: Start difference. First operand 115 states and 168 transitions. Second operand 3 states. [2019-01-12 14:54:29,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:54:29,831 INFO L93 Difference]: Finished difference Result 115 states and 168 transitions. [2019-01-12 14:54:29,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:54:29,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-12 14:54:29,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:54:29,838 INFO L225 Difference]: With dead ends: 115 [2019-01-12 14:54:29,838 INFO L226 Difference]: Without dead ends: 49 [2019-01-12 14:54:29,840 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:54:29,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-12 14:54:29,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-12 14:54:29,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-12 14:54:29,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2019-01-12 14:54:29,853 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 17 [2019-01-12 14:54:29,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:54:29,853 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 71 transitions. [2019-01-12 14:54:29,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:54:29,853 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 71 transitions. [2019-01-12 14:54:29,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 14:54:29,859 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:54:29,859 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:54:29,860 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:54:29,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:54:29,860 INFO L82 PathProgramCache]: Analyzing trace with hash -2061312917, now seen corresponding path program 1 times [2019-01-12 14:54:29,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:54:29,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:54:29,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:29,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:29,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:29,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:30,058 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:54:30,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:54:30,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:54:30,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:54:30,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:54:30,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:54:30,061 INFO L87 Difference]: Start difference. First operand 49 states and 71 transitions. Second operand 3 states. [2019-01-12 14:54:30,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:54:30,168 INFO L93 Difference]: Finished difference Result 135 states and 201 transitions. [2019-01-12 14:54:30,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:54:30,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-01-12 14:54:30,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:54:30,173 INFO L225 Difference]: With dead ends: 135 [2019-01-12 14:54:30,173 INFO L226 Difference]: Without dead ends: 92 [2019-01-12 14:54:30,174 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:54:30,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-12 14:54:30,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2019-01-12 14:54:30,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-12 14:54:30,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 131 transitions. [2019-01-12 14:54:30,193 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 131 transitions. Word has length 22 [2019-01-12 14:54:30,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:54:30,194 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 131 transitions. [2019-01-12 14:54:30,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:54:30,194 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 131 transitions. [2019-01-12 14:54:30,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-12 14:54:30,195 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:54:30,197 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] [2019-01-12 14:54:30,197 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:54:30,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:54:30,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1499976397, now seen corresponding path program 1 times [2019-01-12 14:54:30,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:54:30,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:54:30,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:30,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:30,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:30,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:30,316 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:54:30,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:54:30,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:54:30,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:54:30,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:54:30,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:54:30,319 INFO L87 Difference]: Start difference. First operand 88 states and 131 transitions. Second operand 3 states. [2019-01-12 14:54:30,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:54:30,444 INFO L93 Difference]: Finished difference Result 211 states and 318 transitions. [2019-01-12 14:54:30,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:54:30,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-12 14:54:30,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:54:30,447 INFO L225 Difference]: With dead ends: 211 [2019-01-12 14:54:30,447 INFO L226 Difference]: Without dead ends: 129 [2019-01-12 14:54:30,448 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:54:30,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-12 14:54:30,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2019-01-12 14:54:30,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-12 14:54:30,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 185 transitions. [2019-01-12 14:54:30,464 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 185 transitions. Word has length 24 [2019-01-12 14:54:30,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:54:30,465 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 185 transitions. [2019-01-12 14:54:30,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:54:30,465 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 185 transitions. [2019-01-12 14:54:30,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-12 14:54:30,467 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:54:30,467 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] [2019-01-12 14:54:30,468 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:54:30,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:54:30,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1678878848, now seen corresponding path program 1 times [2019-01-12 14:54:30,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:54:30,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:54:30,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:30,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:30,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:30,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:30,648 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:54:30,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:54:30,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:54:30,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:54:30,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:54:30,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:54:30,650 INFO L87 Difference]: Start difference. First operand 127 states and 185 transitions. Second operand 5 states. [2019-01-12 14:54:31,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:54:31,111 INFO L93 Difference]: Finished difference Result 451 states and 663 transitions. [2019-01-12 14:54:31,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:54:31,113 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-01-12 14:54:31,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:54:31,116 INFO L225 Difference]: With dead ends: 451 [2019-01-12 14:54:31,119 INFO L226 Difference]: Without dead ends: 330 [2019-01-12 14:54:31,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:54:31,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-01-12 14:54:31,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 210. [2019-01-12 14:54:31,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-01-12 14:54:31,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 296 transitions. [2019-01-12 14:54:31,187 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 296 transitions. Word has length 25 [2019-01-12 14:54:31,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:54:31,187 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 296 transitions. [2019-01-12 14:54:31,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:54:31,187 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 296 transitions. [2019-01-12 14:54:31,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-12 14:54:31,192 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:54:31,192 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:54:31,193 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:54:31,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:54:31,193 INFO L82 PathProgramCache]: Analyzing trace with hash -280430142, now seen corresponding path program 1 times [2019-01-12 14:54:31,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:54:31,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:54:31,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:31,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:31,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:31,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:31,325 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:54:31,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:54:31,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:54:31,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:54:31,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:54:31,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:54:31,327 INFO L87 Difference]: Start difference. First operand 210 states and 296 transitions. Second operand 5 states. [2019-01-12 14:54:32,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:54:32,077 INFO L93 Difference]: Finished difference Result 450 states and 648 transitions. [2019-01-12 14:54:32,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:54:32,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-01-12 14:54:32,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:54:32,082 INFO L225 Difference]: With dead ends: 450 [2019-01-12 14:54:32,083 INFO L226 Difference]: Without dead ends: 448 [2019-01-12 14:54:32,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:54:32,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2019-01-12 14:54:32,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 210. [2019-01-12 14:54:32,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-01-12 14:54:32,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 294 transitions. [2019-01-12 14:54:32,122 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 294 transitions. Word has length 26 [2019-01-12 14:54:32,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:54:32,123 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 294 transitions. [2019-01-12 14:54:32,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:54:32,123 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 294 transitions. [2019-01-12 14:54:32,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-12 14:54:32,129 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:54:32,129 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] [2019-01-12 14:54:32,130 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:54:32,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:54:32,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1932951004, now seen corresponding path program 1 times [2019-01-12 14:54:32,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:54:32,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:54:32,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:32,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:32,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:32,414 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:54:32,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:54:32,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:54:32,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:54:32,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:54:32,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:54:32,416 INFO L87 Difference]: Start difference. First operand 210 states and 294 transitions. Second operand 5 states. [2019-01-12 14:54:32,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:54:32,898 INFO L93 Difference]: Finished difference Result 585 states and 811 transitions. [2019-01-12 14:54:32,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:54:32,899 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-01-12 14:54:32,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:54:32,903 INFO L225 Difference]: With dead ends: 585 [2019-01-12 14:54:32,903 INFO L226 Difference]: Without dead ends: 381 [2019-01-12 14:54:32,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:54:32,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-01-12 14:54:32,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 228. [2019-01-12 14:54:32,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-01-12 14:54:32,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 312 transitions. [2019-01-12 14:54:32,935 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 312 transitions. Word has length 31 [2019-01-12 14:54:32,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:54:32,935 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 312 transitions. [2019-01-12 14:54:32,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:54:32,936 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 312 transitions. [2019-01-12 14:54:32,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-12 14:54:32,937 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:54:32,937 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] [2019-01-12 14:54:32,938 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:54:32,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:54:32,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1539923994, now seen corresponding path program 1 times [2019-01-12 14:54:32,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:54:32,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:54:32,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:32,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:32,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:33,101 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:54:33,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:54:33,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:54:33,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 14:54:33,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 14:54:33,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 14:54:33,103 INFO L87 Difference]: Start difference. First operand 228 states and 312 transitions. Second operand 4 states. [2019-01-12 14:54:33,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:54:33,259 INFO L93 Difference]: Finished difference Result 508 states and 691 transitions. [2019-01-12 14:54:33,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 14:54:33,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-01-12 14:54:33,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:54:33,263 INFO L225 Difference]: With dead ends: 508 [2019-01-12 14:54:33,263 INFO L226 Difference]: Without dead ends: 286 [2019-01-12 14:54:33,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:54:33,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-01-12 14:54:33,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 197. [2019-01-12 14:54:33,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-01-12 14:54:33,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 264 transitions. [2019-01-12 14:54:33,284 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 264 transitions. Word has length 31 [2019-01-12 14:54:33,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:54:33,284 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 264 transitions. [2019-01-12 14:54:33,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 14:54:33,285 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 264 transitions. [2019-01-12 14:54:33,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-12 14:54:33,286 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:54:33,286 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] [2019-01-12 14:54:33,286 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:54:33,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:54:33,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1798089432, now seen corresponding path program 1 times [2019-01-12 14:54:33,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:54:33,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:54:33,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:33,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:33,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:33,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:33,416 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:54:33,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:54:33,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:54:33,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:54:33,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:54:33,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:54:33,418 INFO L87 Difference]: Start difference. First operand 197 states and 264 transitions. Second operand 5 states. [2019-01-12 14:54:34,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:54:34,113 INFO L93 Difference]: Finished difference Result 761 states and 1046 transitions. [2019-01-12 14:54:34,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 14:54:34,114 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-01-12 14:54:34,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:54:34,118 INFO L225 Difference]: With dead ends: 761 [2019-01-12 14:54:34,118 INFO L226 Difference]: Without dead ends: 620 [2019-01-12 14:54:34,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:54:34,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-01-12 14:54:34,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 282. [2019-01-12 14:54:34,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-01-12 14:54:34,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 373 transitions. [2019-01-12 14:54:34,165 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 373 transitions. Word has length 31 [2019-01-12 14:54:34,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:54:34,166 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 373 transitions. [2019-01-12 14:54:34,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:54:34,166 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 373 transitions. [2019-01-12 14:54:34,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-12 14:54:34,192 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:54:34,195 INFO L402 BasicCegarLoop]: trace histogram [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, 1] [2019-01-12 14:54:34,196 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:54:34,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:54:34,198 INFO L82 PathProgramCache]: Analyzing trace with hash -860512174, now seen corresponding path program 1 times [2019-01-12 14:54:34,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:54:34,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:54:34,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:34,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:34,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:34,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:34,298 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-12 14:54:34,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:54:34,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:54:34,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:54:34,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:54:34,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:54:34,300 INFO L87 Difference]: Start difference. First operand 282 states and 373 transitions. Second operand 3 states. [2019-01-12 14:54:34,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:54:34,416 INFO L93 Difference]: Finished difference Result 481 states and 636 transitions. [2019-01-12 14:54:34,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:54:34,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-01-12 14:54:34,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:54:34,418 INFO L225 Difference]: With dead ends: 481 [2019-01-12 14:54:34,418 INFO L226 Difference]: Without dead ends: 205 [2019-01-12 14:54:34,418 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:54:34,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-01-12 14:54:34,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 199. [2019-01-12 14:54:34,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-01-12 14:54:34,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 260 transitions. [2019-01-12 14:54:34,446 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 260 transitions. Word has length 49 [2019-01-12 14:54:34,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:54:34,446 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 260 transitions. [2019-01-12 14:54:34,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:54:34,446 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 260 transitions. [2019-01-12 14:54:34,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-12 14:54:34,447 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:54:34,449 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1] [2019-01-12 14:54:34,449 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:54:34,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:54:34,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1573662553, now seen corresponding path program 1 times [2019-01-12 14:54:34,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:54:34,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:54:34,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:34,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:34,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:34,810 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:54:34,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:54:34,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 14:54:34,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:54:34,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:54:34,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:54:34,812 INFO L87 Difference]: Start difference. First operand 199 states and 260 transitions. Second operand 6 states. [2019-01-12 14:54:35,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:54:35,548 INFO L93 Difference]: Finished difference Result 896 states and 1200 transitions. [2019-01-12 14:54:35,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 14:54:35,549 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-01-12 14:54:35,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:54:35,555 INFO L225 Difference]: With dead ends: 896 [2019-01-12 14:54:35,555 INFO L226 Difference]: Without dead ends: 745 [2019-01-12 14:54:35,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-01-12 14:54:35,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2019-01-12 14:54:35,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 310. [2019-01-12 14:54:35,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-01-12 14:54:35,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 415 transitions. [2019-01-12 14:54:35,616 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 415 transitions. Word has length 52 [2019-01-12 14:54:35,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:54:35,617 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 415 transitions. [2019-01-12 14:54:35,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:54:35,618 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 415 transitions. [2019-01-12 14:54:35,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-12 14:54:35,620 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:54:35,620 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1] [2019-01-12 14:54:35,622 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:54:35,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:54:35,623 INFO L82 PathProgramCache]: Analyzing trace with hash -872597975, now seen corresponding path program 1 times [2019-01-12 14:54:35,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:54:35,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:54:35,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:35,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:35,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:35,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:36,021 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-12 14:54:36,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:54:36,023 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:54:36,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:36,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:36,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:54:36,676 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-12 14:54:36,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 14:54:36,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-01-12 14:54:36,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 14:54:36,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 14:54:36,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:54:36,707 INFO L87 Difference]: Start difference. First operand 310 states and 415 transitions. Second operand 9 states. [2019-01-12 14:54:37,148 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-12 14:54:37,331 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-12 14:54:37,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:54:37,738 INFO L93 Difference]: Finished difference Result 694 states and 923 transitions. [2019-01-12 14:54:37,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 14:54:37,740 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-01-12 14:54:37,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:54:37,741 INFO L225 Difference]: With dead ends: 694 [2019-01-12 14:54:37,741 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 14:54:37,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-01-12 14:54:37,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 14:54:37,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 14:54:37,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 14:54:37,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 14:54:37,745 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2019-01-12 14:54:37,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:54:37,745 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 14:54:37,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 14:54:37,745 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 14:54:37,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 14:54:37,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 14:54:37,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:37,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:38,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:38,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:38,107 WARN L181 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 125 [2019-01-12 14:54:38,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:38,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:38,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:38,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:38,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:38,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:38,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:38,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:38,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:38,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:38,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:38,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:38,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:38,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:38,472 WARN L181 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 120 [2019-01-12 14:54:38,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:38,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:38,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:38,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:38,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:38,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:38,713 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 115 [2019-01-12 14:54:38,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:38,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:38,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:38,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:38,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:38,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:38,938 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 115 [2019-01-12 14:54:38,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:39,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:39,063 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 79 [2019-01-12 14:54:39,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:39,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:39,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:39,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:39,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:39,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:39,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:39,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:39,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:39,409 WARN L181 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 122 [2019-01-12 14:54:39,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:39,567 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 104 [2019-01-12 14:54:39,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:39,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:39,687 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 99 [2019-01-12 14:54:41,746 WARN L181 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 118 DAG size of output: 16 [2019-01-12 14:54:41,902 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 22 [2019-01-12 14:54:42,041 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 17 [2019-01-12 14:54:42,235 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2019-01-12 14:54:43,293 WARN L181 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 105 DAG size of output: 19 [2019-01-12 14:54:44,043 WARN L181 SmtUtils]: Spent 744.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 19 [2019-01-12 14:54:44,492 WARN L181 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 19 [2019-01-12 14:54:44,874 WARN L181 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 22 [2019-01-12 14:54:45,375 WARN L181 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 19 [2019-01-12 14:54:45,759 WARN L181 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 10 [2019-01-12 14:54:46,213 WARN L181 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 25 [2019-01-12 14:54:46,219 INFO L448 ceAbstractionStarter]: For program point L400(lines 400 406) no Hoare annotation was computed. [2019-01-12 14:54:46,219 INFO L444 ceAbstractionStarter]: At program point L400-1(lines 400 406) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0))) (let ((.cse2 (and .cse0 (= ~pumpRunning~0 0))) (.cse3 (<= 1 ~waterLevel~0)) (.cse1 (= ~systemActive~0 1))) (or (and (<= 2 ~waterLevel~0) .cse0 .cse1) (and (= ~systemActive~0 0) .cse2 .cse3) (and (and .cse2 .cse3) .cse1)))) [2019-01-12 14:54:46,220 INFO L448 ceAbstractionStarter]: For program point L202(lines 202 210) no Hoare annotation was computed. [2019-01-12 14:54:46,220 INFO L448 ceAbstractionStarter]: For program point L202-1(lines 202 210) no Hoare annotation was computed. [2019-01-12 14:54:46,220 INFO L444 ceAbstractionStarter]: At program point L136(lines 127 140) the Hoare annotation is: false [2019-01-12 14:54:46,220 INFO L448 ceAbstractionStarter]: For program point L202-2(lines 202 210) no Hoare annotation was computed. [2019-01-12 14:54:46,220 INFO L444 ceAbstractionStarter]: At program point L136-1(lines 127 140) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (= ~pumpRunning~0 0)) (.cse2 (= ~systemActive~0 1))) (or (and .cse0 (= 1 |ULTIMATE.start_isHighWaterSensorDry_#res|) (<= 1 ~waterLevel~0) .cse1 .cse2) (and (and (<= 2 ~waterLevel~0) .cse0 .cse1) .cse2))) [2019-01-12 14:54:46,220 INFO L448 ceAbstractionStarter]: For program point L202-3(lines 202 210) no Hoare annotation was computed. [2019-01-12 14:54:46,220 INFO L444 ceAbstractionStarter]: At program point L136-2(lines 127 140) the Hoare annotation is: false [2019-01-12 14:54:46,220 INFO L448 ceAbstractionStarter]: For program point L202-4(lines 202 210) no Hoare annotation was computed. [2019-01-12 14:54:46,220 INFO L444 ceAbstractionStarter]: At program point L136-3(lines 127 140) the Hoare annotation is: false [2019-01-12 14:54:46,221 INFO L448 ceAbstractionStarter]: For program point L202-5(lines 202 210) no Hoare annotation was computed. [2019-01-12 14:54:46,221 INFO L444 ceAbstractionStarter]: At program point L136-4(lines 127 140) the Hoare annotation is: false [2019-01-12 14:54:46,221 INFO L444 ceAbstractionStarter]: At program point L136-5(lines 127 140) the Hoare annotation is: false [2019-01-12 14:54:46,221 INFO L448 ceAbstractionStarter]: For program point L830(lines 830 834) no Hoare annotation was computed. [2019-01-12 14:54:46,221 INFO L448 ceAbstractionStarter]: For program point L830-1(lines 166 172) no Hoare annotation was computed. [2019-01-12 14:54:46,221 INFO L444 ceAbstractionStarter]: At program point L173(lines 173 179) the Hoare annotation is: (let ((.cse1 (= ~systemActive~0 1)) (.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse3 (<= 1 ~waterLevel~0)) (.cse2 (= ~pumpRunning~0 0))) (or (and (<= 2 ~waterLevel~0) .cse0 .cse1) (and (and (and .cse0 .cse2) .cse3) .cse1) (and (= ~systemActive~0 0) .cse0 .cse3 .cse2))) [2019-01-12 14:54:46,221 INFO L444 ceAbstractionStarter]: At program point L173-1(lines 173 179) the Hoare annotation is: false [2019-01-12 14:54:46,221 INFO L444 ceAbstractionStarter]: At program point L173-2(lines 173 179) the Hoare annotation is: false [2019-01-12 14:54:46,221 INFO L448 ceAbstractionStarter]: For program point L966(lines 966 979) no Hoare annotation was computed. [2019-01-12 14:54:46,222 INFO L444 ceAbstractionStarter]: At program point L966-1(lines 1 982) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_test_~splverifierCounter~0 0))) (let ((.cse1 (and .cse2 (= ~pumpRunning~0 0))) (.cse0 (<= 1 ~waterLevel~0)) (.cse3 (= ~systemActive~0 1))) (or (and (= ~systemActive~0 0) .cse0 .cse1) (and (not (= |ULTIMATE.start_getWaterLevel_#res| 0)) (<= 2 ~waterLevel~0) .cse2 (not (= ULTIMATE.start___utac_acc__Specification4_spec__1_~tmp~9 0)) .cse3) (and (and .cse1 .cse0) .cse3)))) [2019-01-12 14:54:46,222 INFO L448 ceAbstractionStarter]: For program point L900(lines 900 907) no Hoare annotation was computed. [2019-01-12 14:54:46,222 INFO L448 ceAbstractionStarter]: For program point L966-2(lines 966 979) no Hoare annotation was computed. [2019-01-12 14:54:46,222 INFO L444 ceAbstractionStarter]: At program point L966-3(lines 1 982) the Hoare annotation is: false [2019-01-12 14:54:46,222 INFO L451 ceAbstractionStarter]: At program point L900-1(lines 900 907) the Hoare annotation is: true [2019-01-12 14:54:46,222 INFO L448 ceAbstractionStarter]: For program point L966-4(lines 966 979) no Hoare annotation was computed. [2019-01-12 14:54:46,222 INFO L444 ceAbstractionStarter]: At program point L966-5(lines 1 982) the Hoare annotation is: false [2019-01-12 14:54:46,222 INFO L444 ceAbstractionStarter]: At program point L440(lines 389 441) the Hoare annotation is: false [2019-01-12 14:54:46,222 INFO L444 ceAbstractionStarter]: At program point L936(lines 1 982) the Hoare annotation is: (and (= ~waterLevel~0 1) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2019-01-12 14:54:46,223 INFO L448 ceAbstractionStarter]: For program point L78(lines 78 82) no Hoare annotation was computed. [2019-01-12 14:54:46,223 INFO L448 ceAbstractionStarter]: For program point L970(lines 970 976) no Hoare annotation was computed. [2019-01-12 14:54:46,223 INFO L448 ceAbstractionStarter]: For program point L970-2(lines 970 976) no Hoare annotation was computed. [2019-01-12 14:54:46,223 INFO L448 ceAbstractionStarter]: For program point L970-4(lines 970 976) no Hoare annotation was computed. [2019-01-12 14:54:46,223 INFO L444 ceAbstractionStarter]: At program point L277(lines 272 280) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_isPumpRunning_#res|)) (.cse1 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse2 (<= 1 ~waterLevel~0)) (.cse3 (= ~pumpRunning~0 0))) (or (and .cse0 (= ~systemActive~0 0) .cse1 .cse2 .cse3) (and (and .cse0 .cse1 .cse2 .cse3) (= ~systemActive~0 1)))) [2019-01-12 14:54:46,223 INFO L444 ceAbstractionStarter]: At program point L277-1(lines 272 280) the Hoare annotation is: false [2019-01-12 14:54:46,223 INFO L444 ceAbstractionStarter]: At program point L277-2(lines 272 280) the Hoare annotation is: false [2019-01-12 14:54:46,223 INFO L448 ceAbstractionStarter]: For program point L410(lines 410 416) no Hoare annotation was computed. [2019-01-12 14:54:46,223 INFO L444 ceAbstractionStarter]: At program point L410-1(lines 410 416) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0))) (let ((.cse2 (and .cse0 (= ~pumpRunning~0 0))) (.cse3 (<= 1 ~waterLevel~0)) (.cse1 (= ~systemActive~0 1))) (or (and (<= 2 ~waterLevel~0) .cse0 .cse1) (and (= ~systemActive~0 0) .cse2 .cse3) (and (and .cse2 .cse3) .cse1)))) [2019-01-12 14:54:46,224 INFO L444 ceAbstractionStarter]: At program point L146(lines 141 149) the Hoare annotation is: (and (= 0 |ULTIMATE.start_isLowWaterSensorDry_#res|) (= ULTIMATE.start_test_~splverifierCounter~0 0) (<= 1 ~waterLevel~0) (= ~systemActive~0 1)) [2019-01-12 14:54:46,224 INFO L444 ceAbstractionStarter]: At program point L146-1(lines 141 149) the Hoare annotation is: false [2019-01-12 14:54:46,224 INFO L444 ceAbstractionStarter]: At program point L146-2(lines 141 149) the Hoare annotation is: false [2019-01-12 14:54:46,224 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 349) no Hoare annotation was computed. [2019-01-12 14:54:46,224 INFO L448 ceAbstractionStarter]: For program point L345-2(lines 345 349) no Hoare annotation was computed. [2019-01-12 14:54:46,224 INFO L448 ceAbstractionStarter]: For program point L345-3(lines 345 349) no Hoare annotation was computed. [2019-01-12 14:54:46,224 INFO L448 ceAbstractionStarter]: For program point L345-5(lines 345 349) no Hoare annotation was computed. [2019-01-12 14:54:46,224 INFO L448 ceAbstractionStarter]: For program point L345-6(lines 345 349) no Hoare annotation was computed. [2019-01-12 14:54:46,225 INFO L448 ceAbstractionStarter]: For program point L345-8(lines 345 349) no Hoare annotation was computed. [2019-01-12 14:54:46,225 INFO L444 ceAbstractionStarter]: At program point L874(lines 870 876) the Hoare annotation is: (and (= ~waterLevel~0 1) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2019-01-12 14:54:46,225 INFO L451 ceAbstractionStarter]: At program point L909(lines 890 912) the Hoare annotation is: true [2019-01-12 14:54:46,225 INFO L444 ceAbstractionStarter]: At program point L944(lines 939 947) the Hoare annotation is: (and (= ~waterLevel~0 1) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2019-01-12 14:54:46,225 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 14:54:46,225 INFO L444 ceAbstractionStarter]: At program point L351(lines 336 354) the Hoare annotation is: (and (<= 1 ULTIMATE.start_isLowWaterLevel_~tmp___0~1) (= 0 ULTIMATE.start_isLowWaterLevel_~tmp~3) (= 0 |ULTIMATE.start_isLowWaterSensorDry_#res|) (= ULTIMATE.start_test_~splverifierCounter~0 0) (<= 1 |ULTIMATE.start_isLowWaterLevel_#res|) (<= 1 ~waterLevel~0) (= ~systemActive~0 1)) [2019-01-12 14:54:46,225 INFO L444 ceAbstractionStarter]: At program point L351-1(lines 336 354) the Hoare annotation is: false [2019-01-12 14:54:46,225 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 953) no Hoare annotation was computed. [2019-01-12 14:54:46,226 INFO L444 ceAbstractionStarter]: At program point L351-2(lines 336 354) the Hoare annotation is: false [2019-01-12 14:54:46,226 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 58) no Hoare annotation was computed. [2019-01-12 14:54:46,226 INFO L448 ceAbstractionStarter]: For program point L54-3(lines 54 58) no Hoare annotation was computed. [2019-01-12 14:54:46,226 INFO L448 ceAbstractionStarter]: For program point L54-6(lines 54 58) no Hoare annotation was computed. [2019-01-12 14:54:46,226 INFO L448 ceAbstractionStarter]: For program point L420(lines 420 435) no Hoare annotation was computed. [2019-01-12 14:54:46,226 INFO L444 ceAbstractionStarter]: At program point L123(lines 118 126) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse3 (= ~pumpRunning~0 0)) (.cse1 (= ~systemActive~0 1)) (.cse2 (<= 1 ~waterLevel~0))) (or (and (not (= |ULTIMATE.start_getWaterLevel_#res| 0)) (<= 2 ~waterLevel~0) .cse0 .cse1) (and (= ~systemActive~0 0) .cse2 (and .cse0 .cse3)) (and (and .cse0 .cse3 .cse1) .cse2))) [2019-01-12 14:54:46,226 INFO L444 ceAbstractionStarter]: At program point L123-1(lines 118 126) the Hoare annotation is: false [2019-01-12 14:54:46,226 INFO L444 ceAbstractionStarter]: At program point L123-2(lines 118 126) the Hoare annotation is: false [2019-01-12 14:54:46,226 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 14:54:46,226 INFO L448 ceAbstractionStarter]: For program point L224(lines 224 241) no Hoare annotation was computed. [2019-01-12 14:54:46,227 INFO L448 ceAbstractionStarter]: For program point L224-1(lines 224 241) no Hoare annotation was computed. [2019-01-12 14:54:46,227 INFO L448 ceAbstractionStarter]: For program point L224-2(lines 224 241) no Hoare annotation was computed. [2019-01-12 14:54:46,227 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 953) no Hoare annotation was computed. [2019-01-12 14:54:46,227 INFO L448 ceAbstractionStarter]: For program point L391(lines 390 439) no Hoare annotation was computed. [2019-01-12 14:54:46,227 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 14:54:46,227 INFO L448 ceAbstractionStarter]: For program point L953(line 953) no Hoare annotation was computed. [2019-01-12 14:54:46,227 INFO L448 ceAbstractionStarter]: For program point L953-1(line 953) no Hoare annotation was computed. [2019-01-12 14:54:46,227 INFO L448 ceAbstractionStarter]: For program point L953-2(line 953) no Hoare annotation was computed. [2019-01-12 14:54:46,227 INFO L448 ceAbstractionStarter]: For program point L392(lines 392 396) no Hoare annotation was computed. [2019-01-12 14:54:46,227 INFO L448 ceAbstractionStarter]: For program point L359(lines 359 365) no Hoare annotation was computed. [2019-01-12 14:54:46,228 INFO L444 ceAbstractionStarter]: At program point L359-1(lines 359 365) the Hoare annotation is: (and (= ULTIMATE.start_test_~splverifierCounter~0 0) (<= 1 ~waterLevel~0) (= ~pumpRunning~0 0)) [2019-01-12 14:54:46,228 INFO L448 ceAbstractionStarter]: For program point L326(lines 326 330) no Hoare annotation was computed. [2019-01-12 14:54:46,228 INFO L448 ceAbstractionStarter]: For program point L326-2(lines 326 330) no Hoare annotation was computed. [2019-01-12 14:54:46,228 INFO L448 ceAbstractionStarter]: For program point L326-3(lines 326 330) no Hoare annotation was computed. [2019-01-12 14:54:46,228 INFO L448 ceAbstractionStarter]: For program point L326-5(lines 326 330) no Hoare annotation was computed. [2019-01-12 14:54:46,228 INFO L448 ceAbstractionStarter]: For program point L326-6(lines 326 330) no Hoare annotation was computed. [2019-01-12 14:54:46,228 INFO L448 ceAbstractionStarter]: For program point L326-8(lines 326 330) no Hoare annotation was computed. [2019-01-12 14:54:46,228 INFO L448 ceAbstractionStarter]: For program point L326-9(lines 326 330) no Hoare annotation was computed. [2019-01-12 14:54:46,228 INFO L448 ceAbstractionStarter]: For program point L326-11(lines 326 330) no Hoare annotation was computed. [2019-01-12 14:54:46,228 INFO L448 ceAbstractionStarter]: For program point L326-12(lines 326 330) no Hoare annotation was computed. [2019-01-12 14:54:46,229 INFO L448 ceAbstractionStarter]: For program point L326-14(lines 326 330) no Hoare annotation was computed. [2019-01-12 14:54:46,229 INFO L448 ceAbstractionStarter]: For program point L326-15(lines 326 330) no Hoare annotation was computed. [2019-01-12 14:54:46,229 INFO L448 ceAbstractionStarter]: For program point L326-17(lines 326 330) no Hoare annotation was computed. [2019-01-12 14:54:46,229 INFO L448 ceAbstractionStarter]: For program point L228(lines 228 236) no Hoare annotation was computed. [2019-01-12 14:54:46,229 INFO L448 ceAbstractionStarter]: For program point L228-1(lines 228 236) no Hoare annotation was computed. [2019-01-12 14:54:46,229 INFO L448 ceAbstractionStarter]: For program point L228-2(lines 228 236) no Hoare annotation was computed. [2019-01-12 14:54:46,229 INFO L448 ceAbstractionStarter]: For program point L428(lines 428 434) no Hoare annotation was computed. [2019-01-12 14:54:46,229 INFO L444 ceAbstractionStarter]: At program point L428-1(lines 166 172) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0))) (let ((.cse2 (and .cse0 (= ~pumpRunning~0 0))) (.cse3 (<= 1 ~waterLevel~0)) (.cse1 (= ~systemActive~0 1))) (or (and (<= 2 ~waterLevel~0) .cse0 .cse1) (and .cse2 (= ~systemActive~0 0) .cse3) (and (and .cse2 .cse3) .cse1)))) [2019-01-12 14:54:46,229 INFO L448 ceAbstractionStarter]: For program point L131(lines 131 137) no Hoare annotation was computed. [2019-01-12 14:54:46,230 INFO L448 ceAbstractionStarter]: For program point L131-1(lines 131 137) no Hoare annotation was computed. [2019-01-12 14:54:46,230 INFO L448 ceAbstractionStarter]: For program point L131-2(lines 131 137) no Hoare annotation was computed. [2019-01-12 14:54:46,230 INFO L448 ceAbstractionStarter]: For program point L131-3(lines 131 137) no Hoare annotation was computed. [2019-01-12 14:54:46,230 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 14:54:46,230 INFO L448 ceAbstractionStarter]: For program point L131-4(lines 131 137) no Hoare annotation was computed. [2019-01-12 14:54:46,230 INFO L448 ceAbstractionStarter]: For program point L131-5(lines 131 137) no Hoare annotation was computed. [2019-01-12 14:54:46,230 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 953) no Hoare annotation was computed. [2019-01-12 14:54:46,230 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 215) no Hoare annotation was computed. [2019-01-12 14:54:46,230 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 198 215) no Hoare annotation was computed. [2019-01-12 14:54:46,230 INFO L448 ceAbstractionStarter]: For program point L198-2(lines 198 215) no Hoare annotation was computed. [2019-01-12 14:54:46,231 INFO L448 ceAbstractionStarter]: For program point L198-3(lines 198 215) no Hoare annotation was computed. [2019-01-12 14:54:46,231 INFO L448 ceAbstractionStarter]: For program point L66(lines 66 70) no Hoare annotation was computed. [2019-01-12 14:54:46,231 INFO L448 ceAbstractionStarter]: For program point L198-4(lines 198 215) no Hoare annotation was computed. [2019-01-12 14:54:46,231 INFO L448 ceAbstractionStarter]: For program point L198-5(lines 198 215) no Hoare annotation was computed. [2019-01-12 14:54:46,231 INFO L444 ceAbstractionStarter]: At program point L826-2(lines 826 840) the Hoare annotation is: false [2019-01-12 14:54:46,231 INFO L444 ceAbstractionStarter]: At program point L166(lines 165 184) the Hoare annotation is: (let ((.cse1 (<= 1 ~waterLevel~0)) (.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0))) (or (and (and .cse0 (= ~pumpRunning~0 0)) (= ~systemActive~0 0) .cse1) (and .cse1 (and .cse0 (= ~systemActive~0 1))))) [2019-01-12 14:54:46,231 INFO L448 ceAbstractionStarter]: For program point L166-1(lines 166 172) no Hoare annotation was computed. [2019-01-12 14:54:46,231 INFO L444 ceAbstractionStarter]: At program point L166-2(lines 165 184) the Hoare annotation is: false [2019-01-12 14:54:46,231 INFO L444 ceAbstractionStarter]: At program point L166-3(lines 165 184) the Hoare annotation is: false [2019-01-12 14:54:46,231 INFO L448 ceAbstractionStarter]: For program point L827(line 827) no Hoare annotation was computed. [2019-01-12 14:54:46,232 INFO L444 ceAbstractionStarter]: At program point L332(lines 317 335) the Hoare annotation is: false [2019-01-12 14:54:46,232 INFO L444 ceAbstractionStarter]: At program point L332-1(lines 317 335) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (= ~pumpRunning~0 0)) (.cse2 (= ~systemActive~0 1))) (or (and (and (<= 2 ~waterLevel~0) .cse0 .cse1) .cse2) (and (and (and (= 0 |ULTIMATE.start_isHighWaterLevel_#res|) .cse0 (= 0 ULTIMATE.start_isHighWaterLevel_~tmp___0~0) .cse1) (<= 1 ~waterLevel~0)) .cse2))) [2019-01-12 14:54:46,232 INFO L444 ceAbstractionStarter]: At program point L332-2(lines 317 335) the Hoare annotation is: false [2019-01-12 14:54:46,232 INFO L444 ceAbstractionStarter]: At program point L332-3(lines 317 335) the Hoare annotation is: false [2019-01-12 14:54:46,232 INFO L444 ceAbstractionStarter]: At program point L332-4(lines 317 335) the Hoare annotation is: false [2019-01-12 14:54:46,232 INFO L444 ceAbstractionStarter]: At program point L332-5(lines 317 335) the Hoare annotation is: false [2019-01-12 14:54:46,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:54:46 BoogieIcfgContainer [2019-01-12 14:54:46,257 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:54:46,258 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:54:46,258 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:54:46,258 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:54:46,258 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:54:29" (3/4) ... [2019-01-12 14:54:46,262 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 14:54:46,304 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2019-01-12 14:54:46,305 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2019-01-12 14:54:46,306 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-01-12 14:54:46,308 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 14:54:46,309 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 14:54:46,310 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-12 14:54:46,345 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((systemActive == 0 && 1 <= waterLevel) && splverifierCounter == 0 && pumpRunning == 0) || ((((!(\result == 0) && 2 <= waterLevel) && splverifierCounter == 0) && !(tmp == 0)) && systemActive == 1)) || (((splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) && systemActive == 1) [2019-01-12 14:54:46,348 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\result == 0) && 2 <= waterLevel) && splverifierCounter == 0) && systemActive == 1) || ((systemActive == 0 && 1 <= waterLevel) && splverifierCounter == 0 && pumpRunning == 0)) || (((splverifierCounter == 0 && pumpRunning == 0) && systemActive == 1) && 1 <= waterLevel) [2019-01-12 14:54:46,349 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 == \result && splverifierCounter == 0) && 1 <= waterLevel) && systemActive == 1 [2019-01-12 14:54:46,350 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((splverifierCounter == 0 && 1 == \result) && 1 <= waterLevel) && pumpRunning == 0) && systemActive == 1) || (((2 <= waterLevel && splverifierCounter == 0) && pumpRunning == 0) && systemActive == 1) [2019-01-12 14:54:46,351 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == \result && systemActive == 0) && splverifierCounter == 0) && 1 <= waterLevel) && pumpRunning == 0) || ((((0 == \result && splverifierCounter == 0) && 1 <= waterLevel) && pumpRunning == 0) && systemActive == 1) [2019-01-12 14:54:46,351 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 <= tmp___0 && 0 == tmp) && 0 == \result) && splverifierCounter == 0) && 1 <= \result) && 1 <= waterLevel) && systemActive == 1 [2019-01-12 14:54:46,352 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((2 <= waterLevel && splverifierCounter == 0) && pumpRunning == 0) && systemActive == 1) || (((((0 == \result && splverifierCounter == 0) && 0 == tmp___0) && pumpRunning == 0) && 1 <= waterLevel) && systemActive == 1) [2019-01-12 14:54:46,483 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:54:46,483 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:54:46,484 INFO L168 Benchmark]: Toolchain (without parser) took 19700.91 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 315.1 MB). Free memory was 952.7 MB in the beginning and 890.4 MB in the end (delta: 62.2 MB). Peak memory consumption was 377.3 MB. Max. memory is 11.5 GB. [2019-01-12 14:54:46,484 INFO L168 Benchmark]: CDTParser took 0.26 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:54:46,485 INFO L168 Benchmark]: CACSL2BoogieTranslator took 666.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -182.7 MB). Peak memory consumption was 44.9 MB. Max. memory is 11.5 GB. [2019-01-12 14:54:46,485 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:54:46,485 INFO L168 Benchmark]: Boogie Preprocessor took 59.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:54:46,486 INFO L168 Benchmark]: RCFGBuilder took 1566.48 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.6 MB). Peak memory consumption was 58.6 MB. Max. memory is 11.5 GB. [2019-01-12 14:54:46,486 INFO L168 Benchmark]: TraceAbstraction took 17093.79 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 166.7 MB). Free memory was 1.1 GB in the beginning and 908.9 MB in the end (delta: 154.6 MB). Peak memory consumption was 389.4 MB. Max. memory is 11.5 GB. [2019-01-12 14:54:46,487 INFO L168 Benchmark]: Witness Printer took 225.29 ms. Allocated memory is still 1.3 GB. Free memory was 908.9 MB in the beginning and 890.4 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-01-12 14:54:46,490 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.26 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 666.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -182.7 MB). Peak memory consumption was 44.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 84.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1566.48 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.6 MB). Peak memory consumption was 58.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17093.79 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 166.7 MB). Free memory was 1.1 GB in the beginning and 908.9 MB in the end (delta: 154.6 MB). Peak memory consumption was 389.4 MB. Max. memory is 11.5 GB. * Witness Printer took 225.29 ms. Allocated memory is still 1.3 GB. Free memory was 908.9 MB in the beginning and 890.4 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 953]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 953]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 953]: 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: 141]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 389]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 826]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((splverifierCounter == 0 && pumpRunning == 0) && systemActive == 0) && 1 <= waterLevel) || (1 <= waterLevel && splverifierCounter == 0 && systemActive == 1) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 317]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: ((0 == \result && splverifierCounter == 0) && 1 <= waterLevel) && systemActive == 1 - InvariantResult [Line: 317]: Loop Invariant Derived loop invariant: (((2 <= waterLevel && splverifierCounter == 0) && pumpRunning == 0) && systemActive == 1) || (((((0 == \result && splverifierCounter == 0) && 0 == tmp___0) && pumpRunning == 0) && 1 <= waterLevel) && systemActive == 1) - InvariantResult [Line: 317]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 336]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 272]: Loop Invariant Derived loop invariant: ((((0 == \result && systemActive == 0) && splverifierCounter == 0) && 1 <= waterLevel) && pumpRunning == 0) || ((((0 == \result && splverifierCounter == 0) && 1 <= waterLevel) && pumpRunning == 0) && systemActive == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (waterLevel == 1 && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 336]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: (((2 <= waterLevel && splverifierCounter == 0) && systemActive == 1) || (((splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) && systemActive == 1)) || (((systemActive == 0 && splverifierCounter == 0) && 1 <= waterLevel) && pumpRunning == 0) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 400]: Loop Invariant Derived loop invariant: (((2 <= waterLevel && splverifierCounter == 0) && systemActive == 1) || ((systemActive == 0 && splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel)) || (((splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) && systemActive == 1) - InvariantResult [Line: 118]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 410]: Loop Invariant Derived loop invariant: (((2 <= waterLevel && splverifierCounter == 0) && systemActive == 1) || ((systemActive == 0 && splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel)) || (((splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) && systemActive == 1) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 900]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 118]: Loop Invariant Derived loop invariant: ((((!(\result == 0) && 2 <= waterLevel) && splverifierCounter == 0) && systemActive == 1) || ((systemActive == 0 && 1 <= waterLevel) && splverifierCounter == 0 && pumpRunning == 0)) || (((splverifierCounter == 0 && pumpRunning == 0) && systemActive == 1) && 1 <= waterLevel) - InvariantResult [Line: 890]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: ((((splverifierCounter == 0 && 1 == \result) && 1 <= waterLevel) && pumpRunning == 0) && systemActive == 1) || (((2 <= waterLevel && splverifierCounter == 0) && pumpRunning == 0) && systemActive == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: (((2 <= waterLevel && splverifierCounter == 0) && systemActive == 1) || (((splverifierCounter == 0 && pumpRunning == 0) && systemActive == 0) && 1 <= waterLevel)) || (((splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) && systemActive == 1) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 272]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 870]: Loop Invariant Derived loop invariant: (waterLevel == 1 && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 272]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 336]: Loop Invariant Derived loop invariant: (((((1 <= tmp___0 && 0 == tmp) && 0 == \result) && splverifierCounter == 0) && 1 <= \result) && 1 <= waterLevel) && systemActive == 1 - InvariantResult [Line: 317]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 317]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 317]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 359]: Loop Invariant Derived loop invariant: (splverifierCounter == 0 && 1 <= waterLevel) && pumpRunning == 0 - InvariantResult [Line: 939]: Loop Invariant Derived loop invariant: (waterLevel == 1 && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((systemActive == 0 && 1 <= waterLevel) && splverifierCounter == 0 && pumpRunning == 0) || ((((!(\result == 0) && 2 <= waterLevel) && splverifierCounter == 0) && !(tmp == 0)) && systemActive == 1)) || (((splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) && systemActive == 1) - InvariantResult [Line: 118]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 119 locations, 3 error locations. SAFE Result, 16.9s OverallTime, 12 OverallIterations, 2 TraceHistogramMax, 4.8s AutomataDifference, 0.0s DeadEndRemovalTime, 8.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 1320 SDtfs, 1837 SDslu, 2290 SDs, 0 SdLazy, 301 SolverSat, 68 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 139 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=310occurred in iteration=11, 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.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 1385 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 44 LocationsWithAnnotation, 44 PreInvPairs, 225 NumberOfFragments, 481 HoareAnnotationTreeSize, 44 FomulaSimplifications, 526375 FormulaSimplificationTreeSizeReduction, 1.9s HoareSimplificationTime, 44 FomulaSimplificationsInter, 228221 FormulaSimplificationTreeSizeReductionInter, 6.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 428 NumberOfCodeBlocks, 428 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 415 ConstructedInterpolants, 0 QuantifiedInterpolants, 22842 SizeOfPredicates, 4 NumberOfNonLiveVariables, 403 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 54/56 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...