./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec3_product33_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_spec3_product33_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 5667765c016e1c72bafcc0c365d87d7652cb3eb1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:52:32,597 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:52:32,600 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:52:32,616 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:52:32,616 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:52:32,617 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:52:32,619 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:52:32,620 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:52:32,622 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:52:32,623 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:52:32,624 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:52:32,624 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:52:32,625 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:52:32,626 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:52:32,627 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:52:32,628 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:52:32,629 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:52:32,630 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:52:32,632 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:52:32,634 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:52:32,635 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:52:32,640 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:52:32,642 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:52:32,642 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:52:32,643 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:52:32,647 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:52:32,649 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:52:32,650 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:52:32,652 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:52:32,653 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:52:32,653 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:52:32,654 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:52:32,654 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:52:32,654 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:52:32,656 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:52:32,657 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:52:32,657 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:52:32,672 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:52:32,672 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:52:32,673 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:52:32,674 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:52:32,674 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:52:32,675 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:52:32,675 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:52:32,675 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:52:32,675 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:52:32,675 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:52:32,675 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:52:32,676 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:52:32,676 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:52:32,676 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:52:32,676 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:52:32,676 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:52:32,676 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:52:32,678 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:52:32,678 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:52:32,679 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:52:32,679 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:52:32,679 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:52:32,679 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:52:32,679 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:52:32,680 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:52:32,681 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:52:32,681 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:52:32,681 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:52:32,681 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 -> 5667765c016e1c72bafcc0c365d87d7652cb3eb1 [2019-01-12 14:52:32,730 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:52:32,745 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:52:32,750 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:52:32,751 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:52:32,751 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:52:32,753 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec3_product33_true-unreach-call_false-termination.cil.c [2019-01-12 14:52:32,818 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6c0ac065/8b1a44f089a14f5bbaa7785f76b10e75/FLAG7c032cb54 [2019-01-12 14:52:33,300 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:52:33,301 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec3_product33_true-unreach-call_false-termination.cil.c [2019-01-12 14:52:33,316 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6c0ac065/8b1a44f089a14f5bbaa7785f76b10e75/FLAG7c032cb54 [2019-01-12 14:52:33,617 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6c0ac065/8b1a44f089a14f5bbaa7785f76b10e75 [2019-01-12 14:52:33,623 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:52:33,625 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:52:33,626 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:52:33,629 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:52:33,633 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:52:33,634 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:52:33" (1/1) ... [2019-01-12 14:52:33,637 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a7d791d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:52:33, skipping insertion in model container [2019-01-12 14:52:33,638 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:52:33" (1/1) ... [2019-01-12 14:52:33,647 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:52:33,717 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:52:34,072 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:52:34,090 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:52:34,272 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:52:34,316 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:52:34,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:52:34 WrapperNode [2019-01-12 14:52:34,317 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:52:34,318 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:52:34,318 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:52:34,318 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:52:34,325 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:52:34" (1/1) ... [2019-01-12 14:52:34,343 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:52:34" (1/1) ... [2019-01-12 14:52:34,385 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:52:34,385 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:52:34,385 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:52:34,386 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:52:34,394 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:52:34" (1/1) ... [2019-01-12 14:52:34,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:52:34" (1/1) ... [2019-01-12 14:52:34,398 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:52:34" (1/1) ... [2019-01-12 14:52:34,399 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:52:34" (1/1) ... [2019-01-12 14:52:34,408 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:52:34" (1/1) ... [2019-01-12 14:52:34,416 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:52:34" (1/1) ... [2019-01-12 14:52:34,419 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:52:34" (1/1) ... [2019-01-12 14:52:34,424 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:52:34,425 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:52:34,425 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:52:34,425 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:52:34,426 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:52:34" (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:52:34,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 14:52:34,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-12 14:52:34,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:52:34,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:52:35,724 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:52:35,725 INFO L286 CfgBuilder]: Removed 102 assue(true) statements. [2019-01-12 14:52:35,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:52:35 BoogieIcfgContainer [2019-01-12 14:52:35,726 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:52:35,728 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:52:35,728 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:52:35,731 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:52:35,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:52:33" (1/3) ... [2019-01-12 14:52:35,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34fb0109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:52:35, skipping insertion in model container [2019-01-12 14:52:35,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:52:34" (2/3) ... [2019-01-12 14:52:35,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34fb0109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:52:35, skipping insertion in model container [2019-01-12 14:52:35,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:52:35" (3/3) ... [2019-01-12 14:52:35,735 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec3_product33_true-unreach-call_false-termination.cil.c [2019-01-12 14:52:35,745 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:52:35,754 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 14:52:35,771 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 14:52:35,812 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:52:35,812 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:52:35,813 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:52:35,813 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:52:35,813 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:52:35,813 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:52:35,813 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:52:35,814 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:52:35,814 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:52:35,831 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2019-01-12 14:52:35,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 14:52:35,838 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:52:35,839 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:52:35,841 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:52:35,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:52:35,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1284074395, now seen corresponding path program 1 times [2019-01-12 14:52:35,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:52:35,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:52:35,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:35,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:52:35,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:36,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:52:36,133 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:52:36,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:52:36,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:52:36,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 14:52:36,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 14:52:36,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:52:36,157 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 2 states. [2019-01-12 14:52:36,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:52:36,184 INFO L93 Difference]: Finished difference Result 162 states and 245 transitions. [2019-01-12 14:52:36,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 14:52:36,186 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-01-12 14:52:36,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:52:36,200 INFO L225 Difference]: With dead ends: 162 [2019-01-12 14:52:36,200 INFO L226 Difference]: Without dead ends: 80 [2019-01-12 14:52:36,204 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:52:36,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-12 14:52:36,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-01-12 14:52:36,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-12 14:52:36,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 114 transitions. [2019-01-12 14:52:36,250 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 114 transitions. Word has length 18 [2019-01-12 14:52:36,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:52:36,251 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 114 transitions. [2019-01-12 14:52:36,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 14:52:36,251 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 114 transitions. [2019-01-12 14:52:36,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-12 14:52:36,252 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:52:36,252 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:52:36,253 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:52:36,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:52:36,253 INFO L82 PathProgramCache]: Analyzing trace with hash 373043642, now seen corresponding path program 1 times [2019-01-12 14:52:36,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:52:36,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:52:36,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:36,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:52:36,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:36,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:52:36,439 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:52:36,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:52:36,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:52:36,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:52:36,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:52:36,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:52:36,443 INFO L87 Difference]: Start difference. First operand 80 states and 114 transitions. Second operand 3 states. [2019-01-12 14:52:36,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:52:36,465 INFO L93 Difference]: Finished difference Result 80 states and 114 transitions. [2019-01-12 14:52:36,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:52:36,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-01-12 14:52:36,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:52:36,469 INFO L225 Difference]: With dead ends: 80 [2019-01-12 14:52:36,469 INFO L226 Difference]: Without dead ends: 36 [2019-01-12 14:52:36,470 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:52:36,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-12 14:52:36,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-12 14:52:36,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-12 14:52:36,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2019-01-12 14:52:36,484 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 19 [2019-01-12 14:52:36,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:52:36,485 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2019-01-12 14:52:36,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:52:36,486 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2019-01-12 14:52:36,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-12 14:52:36,488 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:52:36,488 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:52:36,489 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:52:36,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:52:36,490 INFO L82 PathProgramCache]: Analyzing trace with hash -196588044, now seen corresponding path program 1 times [2019-01-12 14:52:36,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:52:36,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:52:36,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:36,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:52:36,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:52:36,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:52:36,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:52:36,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:52:36,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:52:36,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:52:36,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:52:36,692 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand 3 states. [2019-01-12 14:52:36,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:52:36,705 INFO L93 Difference]: Finished difference Result 66 states and 96 transitions. [2019-01-12 14:52:36,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:52:36,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-12 14:52:36,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:52:36,707 INFO L225 Difference]: With dead ends: 66 [2019-01-12 14:52:36,707 INFO L226 Difference]: Without dead ends: 36 [2019-01-12 14:52:36,708 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:52:36,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-12 14:52:36,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-12 14:52:36,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-12 14:52:36,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2019-01-12 14:52:36,713 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 50 transitions. Word has length 24 [2019-01-12 14:52:36,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:52:36,714 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 50 transitions. [2019-01-12 14:52:36,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:52:36,714 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2019-01-12 14:52:36,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-12 14:52:36,717 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:52:36,717 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:52:36,717 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:52:36,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:52:36,718 INFO L82 PathProgramCache]: Analyzing trace with hash 961211503, now seen corresponding path program 1 times [2019-01-12 14:52:36,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:52:36,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:52:36,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:36,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:52:36,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:36,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:52:36,834 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:52:36,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:52:36,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:52:36,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:52:36,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:52:36,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:52:36,836 INFO L87 Difference]: Start difference. First operand 36 states and 50 transitions. Second operand 3 states. [2019-01-12 14:52:36,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:52:36,892 INFO L93 Difference]: Finished difference Result 89 states and 127 transitions. [2019-01-12 14:52:36,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:52:36,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-01-12 14:52:36,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:52:36,894 INFO L225 Difference]: With dead ends: 89 [2019-01-12 14:52:36,894 INFO L226 Difference]: Without dead ends: 59 [2019-01-12 14:52:36,895 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:52:36,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-12 14:52:36,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2019-01-12 14:52:36,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-12 14:52:36,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions. [2019-01-12 14:52:36,913 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 80 transitions. Word has length 25 [2019-01-12 14:52:36,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:52:36,913 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 80 transitions. [2019-01-12 14:52:36,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:52:36,913 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions. [2019-01-12 14:52:36,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-12 14:52:36,915 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:52:36,915 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:52:36,916 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:52:36,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:52:36,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1128412896, now seen corresponding path program 1 times [2019-01-12 14:52:36,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:52:36,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:52:36,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:36,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:52:36,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:52:37,226 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:52:37,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:52:37,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:52:37,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:52:37,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:52:37,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:52:37,229 INFO L87 Difference]: Start difference. First operand 57 states and 80 transitions. Second operand 5 states. [2019-01-12 14:52:37,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:52:37,421 INFO L93 Difference]: Finished difference Result 149 states and 209 transitions. [2019-01-12 14:52:37,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:52:37,423 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-01-12 14:52:37,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:52:37,424 INFO L225 Difference]: With dead ends: 149 [2019-01-12 14:52:37,424 INFO L226 Difference]: Without dead ends: 98 [2019-01-12 14:52:37,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:52:37,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-12 14:52:37,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 60. [2019-01-12 14:52:37,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-12 14:52:37,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 83 transitions. [2019-01-12 14:52:37,435 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 83 transitions. Word has length 31 [2019-01-12 14:52:37,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:52:37,435 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 83 transitions. [2019-01-12 14:52:37,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:52:37,435 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 83 transitions. [2019-01-12 14:52:37,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-12 14:52:37,436 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:52:37,436 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:52:37,437 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:52:37,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:52:37,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1016803, now seen corresponding path program 1 times [2019-01-12 14:52:37,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:52:37,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:52:37,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:37,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:52:37,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:52:37,550 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:52:37,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:52:37,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:52:37,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:52:37,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:52:37,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:52:37,552 INFO L87 Difference]: Start difference. First operand 60 states and 83 transitions. Second operand 5 states. [2019-01-12 14:52:37,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:52:37,911 INFO L93 Difference]: Finished difference Result 314 states and 451 transitions. [2019-01-12 14:52:37,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 14:52:37,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-01-12 14:52:37,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:52:37,919 INFO L225 Difference]: With dead ends: 314 [2019-01-12 14:52:37,919 INFO L226 Difference]: Without dead ends: 260 [2019-01-12 14:52:37,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:52:37,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-01-12 14:52:37,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 106. [2019-01-12 14:52:37,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-12 14:52:37,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 144 transitions. [2019-01-12 14:52:37,965 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 144 transitions. Word has length 31 [2019-01-12 14:52:37,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:52:37,965 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 144 transitions. [2019-01-12 14:52:37,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:52:37,966 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 144 transitions. [2019-01-12 14:52:37,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-12 14:52:37,967 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:52:37,969 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:52:37,973 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:52:37,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:52:37,973 INFO L82 PathProgramCache]: Analyzing trace with hash -2111743067, now seen corresponding path program 1 times [2019-01-12 14:52:37,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:52:37,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:52:37,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:37,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:52:37,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:52:38,223 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:52:38,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:52:38,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:52:38,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:52:38,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:52:38,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:52:38,229 INFO L87 Difference]: Start difference. First operand 106 states and 144 transitions. Second operand 5 states. [2019-01-12 14:52:38,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:52:38,915 INFO L93 Difference]: Finished difference Result 446 states and 629 transitions. [2019-01-12 14:52:38,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 14:52:38,920 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-01-12 14:52:38,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:52:38,924 INFO L225 Difference]: With dead ends: 446 [2019-01-12 14:52:38,924 INFO L226 Difference]: Without dead ends: 392 [2019-01-12 14:52:38,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:52:38,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-01-12 14:52:38,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 152. [2019-01-12 14:52:38,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-01-12 14:52:38,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 207 transitions. [2019-01-12 14:52:38,970 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 207 transitions. Word has length 32 [2019-01-12 14:52:38,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:52:38,971 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 207 transitions. [2019-01-12 14:52:38,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:52:38,971 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 207 transitions. [2019-01-12 14:52:38,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-12 14:52:38,978 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:52:38,978 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:52:38,978 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:52:38,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:52:38,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1172106979, now seen corresponding path program 1 times [2019-01-12 14:52:38,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:52:38,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:52:38,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:38,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:52:38,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:52:39,094 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:52:39,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:52:39,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:52:39,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 14:52:39,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 14:52:39,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 14:52:39,096 INFO L87 Difference]: Start difference. First operand 152 states and 207 transitions. Second operand 4 states. [2019-01-12 14:52:39,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:52:39,159 INFO L93 Difference]: Finished difference Result 352 states and 487 transitions. [2019-01-12 14:52:39,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 14:52:39,162 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-01-12 14:52:39,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:52:39,165 INFO L225 Difference]: With dead ends: 352 [2019-01-12 14:52:39,166 INFO L226 Difference]: Without dead ends: 250 [2019-01-12 14:52:39,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:52:39,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-01-12 14:52:39,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 149. [2019-01-12 14:52:39,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-01-12 14:52:39,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 203 transitions. [2019-01-12 14:52:39,206 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 203 transitions. Word has length 32 [2019-01-12 14:52:39,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:52:39,208 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 203 transitions. [2019-01-12 14:52:39,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 14:52:39,208 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 203 transitions. [2019-01-12 14:52:39,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-12 14:52:39,217 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:52:39,217 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:52:39,218 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:52:39,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:52:39,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1737298786, now seen corresponding path program 1 times [2019-01-12 14:52:39,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:52:39,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:52:39,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:39,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:52:39,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:52:39,426 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:52:39,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:52:39,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 14:52:39,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:52:39,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:52:39,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:52:39,428 INFO L87 Difference]: Start difference. First operand 149 states and 203 transitions. Second operand 6 states. [2019-01-12 14:52:40,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:52:40,081 INFO L93 Difference]: Finished difference Result 383 states and 531 transitions. [2019-01-12 14:52:40,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 14:52:40,082 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-01-12 14:52:40,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:52:40,085 INFO L225 Difference]: With dead ends: 383 [2019-01-12 14:52:40,085 INFO L226 Difference]: Without dead ends: 120 [2019-01-12 14:52:40,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-12 14:52:40,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-01-12 14:52:40,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 60. [2019-01-12 14:52:40,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-12 14:52:40,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 76 transitions. [2019-01-12 14:52:40,100 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 76 transitions. Word has length 32 [2019-01-12 14:52:40,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:52:40,101 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 76 transitions. [2019-01-12 14:52:40,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:52:40,101 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 76 transitions. [2019-01-12 14:52:40,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-12 14:52:40,102 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:52:40,102 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:52:40,102 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:52:40,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:52:40,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1430272417, now seen corresponding path program 1 times [2019-01-12 14:52:40,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:52:40,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:52:40,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:40,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:52:40,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:52:40,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:52:40,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:52:40,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:52:40,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:52:40,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:52:40,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:52:40,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:52:40,376 INFO L87 Difference]: Start difference. First operand 60 states and 76 transitions. Second operand 5 states. [2019-01-12 14:52:40,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:52:40,516 INFO L93 Difference]: Finished difference Result 103 states and 131 transitions. [2019-01-12 14:52:40,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 14:52:40,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-01-12 14:52:40,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:52:40,517 INFO L225 Difference]: With dead ends: 103 [2019-01-12 14:52:40,518 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 14:52:40,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:52:40,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 14:52:40,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 14:52:40,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 14:52:40,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 14:52:40,519 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2019-01-12 14:52:40,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:52:40,519 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 14:52:40,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:52:40,520 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 14:52:40,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 14:52:40,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 14:52:40,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:40,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:40,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:40,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:40,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:40,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:40,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:40,704 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 60 [2019-01-12 14:52:40,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:40,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:40,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:40,837 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 59 [2019-01-12 14:52:40,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:40,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:40,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:40,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:40,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:41,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:41,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:41,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:41,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:41,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:41,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:41,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:41,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:52:42,167 WARN L181 SmtUtils]: Spent 980.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 22 [2019-01-12 14:52:42,312 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 16 [2019-01-12 14:52:42,597 WARN L181 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 14 [2019-01-12 14:52:42,861 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 14 [2019-01-12 14:52:43,370 WARN L181 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2019-01-12 14:52:43,491 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 18 [2019-01-12 14:52:43,670 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 14 [2019-01-12 14:52:43,706 INFO L448 ceAbstractionStarter]: For program point L828(lines 828 832) no Hoare annotation was computed. [2019-01-12 14:52:43,706 INFO L448 ceAbstractionStarter]: For program point L828-2(lines 828 832) no Hoare annotation was computed. [2019-01-12 14:52:43,706 INFO L448 ceAbstractionStarter]: For program point L828-3(lines 828 832) no Hoare annotation was computed. [2019-01-12 14:52:43,706 INFO L448 ceAbstractionStarter]: For program point L828-5(lines 828 832) no Hoare annotation was computed. [2019-01-12 14:52:43,706 INFO L448 ceAbstractionStarter]: For program point L630(lines 630 634) no Hoare annotation was computed. [2019-01-12 14:52:43,706 INFO L448 ceAbstractionStarter]: For program point L828-6(lines 828 832) no Hoare annotation was computed. [2019-01-12 14:52:43,706 INFO L448 ceAbstractionStarter]: For program point L828-8(lines 828 832) no Hoare annotation was computed. [2019-01-12 14:52:43,707 INFO L444 ceAbstractionStarter]: At program point L779(lines 774 782) the Hoare annotation is: (and (not (= 0 ~pumpRunning~0)) (= ULTIMATE.start_isHighWaterLevel_~tmp~6 0) (= ULTIMATE.start_test_~splverifierCounter~0 0) (not (= 0 |ULTIMATE.start_isPumpRunning_#res|)) (= ~systemActive~0 1)) [2019-01-12 14:52:43,707 INFO L444 ceAbstractionStarter]: At program point L779-1(lines 774 782) the Hoare annotation is: false [2019-01-12 14:52:43,707 INFO L444 ceAbstractionStarter]: At program point L779-2(lines 774 782) the Hoare annotation is: false [2019-01-12 14:52:43,707 INFO L444 ceAbstractionStarter]: At program point L135(lines 126 139) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (= ~pumpRunning~0 0)) (.cse2 (= ~systemActive~0 1))) (or (and (and .cse0 .cse1) (= 0 |ULTIMATE.start_isHighWaterSensorDry_#res|) .cse2) (and .cse0 (<= ~waterLevel~0 1) .cse1 .cse2))) [2019-01-12 14:52:43,707 INFO L444 ceAbstractionStarter]: At program point L135-1(lines 126 139) the Hoare annotation is: false [2019-01-12 14:52:43,707 INFO L444 ceAbstractionStarter]: At program point L135-2(lines 126 139) the Hoare annotation is: false [2019-01-12 14:52:43,707 INFO L444 ceAbstractionStarter]: At program point L895(lines 1 906) the Hoare annotation is: (and (= 1 ~waterLevel~0) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2019-01-12 14:52:43,708 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 613) no Hoare annotation was computed. [2019-01-12 14:52:43,708 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 14:52:43,709 INFO L448 ceAbstractionStarter]: For program point L730(lines 730 738) no Hoare annotation was computed. [2019-01-12 14:52:43,709 INFO L448 ceAbstractionStarter]: For program point L730-1(lines 730 738) no Hoare annotation was computed. [2019-01-12 14:52:43,709 INFO L448 ceAbstractionStarter]: For program point L664(lines 664 668) no Hoare annotation was computed. [2019-01-12 14:52:43,709 INFO L448 ceAbstractionStarter]: For program point L730-2(lines 730 738) no Hoare annotation was computed. [2019-01-12 14:52:43,710 INFO L448 ceAbstractionStarter]: For program point L664-2(lines 694 700) no Hoare annotation was computed. [2019-01-12 14:52:43,710 INFO L448 ceAbstractionStarter]: For program point L53(lines 53 57) no Hoare annotation was computed. [2019-01-12 14:52:43,710 INFO L448 ceAbstractionStarter]: For program point L53-3(lines 53 57) no Hoare annotation was computed. [2019-01-12 14:52:43,710 INFO L448 ceAbstractionStarter]: For program point L53-6(lines 53 57) no Hoare annotation was computed. [2019-01-12 14:52:43,710 INFO L444 ceAbstractionStarter]: At program point L202(lines 198 204) the Hoare annotation is: (and (= 1 ~waterLevel~0) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2019-01-12 14:52:43,710 INFO L448 ceAbstractionStarter]: For program point L648(lines 648 654) no Hoare annotation was computed. [2019-01-12 14:52:43,711 INFO L444 ceAbstractionStarter]: At program point L648-1(lines 648 654) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (= ~systemActive~0 1))) (or (and (= ULTIMATE.start_isHighWaterLevel_~tmp~6 0) .cse0 .cse1) (and (and .cse0 (= ~pumpRunning~0 0)) .cse1))) [2019-01-12 14:52:43,711 INFO L444 ceAbstractionStarter]: At program point L153-2(lines 153 167) the Hoare annotation is: false [2019-01-12 14:52:43,711 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-01-12 14:52:43,711 INFO L448 ceAbstractionStarter]: For program point L848(lines 848 868) no Hoare annotation was computed. [2019-01-12 14:52:43,711 INFO L448 ceAbstractionStarter]: For program point L848-2(lines 848 868) no Hoare annotation was computed. [2019-01-12 14:52:43,712 INFO L448 ceAbstractionStarter]: For program point L848-4(lines 848 868) no Hoare annotation was computed. [2019-01-12 14:52:43,712 INFO L444 ceAbstractionStarter]: At program point L122(lines 117 125) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (= ~systemActive~0 1))) (or (and (not (= 0 ~pumpRunning~0)) (= ULTIMATE.start_isHighWaterLevel_~tmp~6 0) .cse0 .cse1) (and (and (= ULTIMATE.start_processEnvironment_~tmp~5 0) (<= |ULTIMATE.start_getWaterLevel_#res| 1) .cse0 (<= ~waterLevel~0 1) (= ~pumpRunning~0 0)) .cse1))) [2019-01-12 14:52:43,712 INFO L444 ceAbstractionStarter]: At program point L122-1(lines 117 125) the Hoare annotation is: false [2019-01-12 14:52:43,712 INFO L444 ceAbstractionStarter]: At program point L122-2(lines 117 125) the Hoare annotation is: false [2019-01-12 14:52:43,712 INFO L451 ceAbstractionStarter]: At program point L238(lines 219 241) the Hoare annotation is: true [2019-01-12 14:52:43,712 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 613) no Hoare annotation was computed. [2019-01-12 14:52:43,712 INFO L444 ceAbstractionStarter]: At program point L701(lines 701 707) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (= ~systemActive~0 1))) (or (and (= ULTIMATE.start_processEnvironment_~tmp~5 0) .cse0 (<= ~waterLevel~0 1) (= ~pumpRunning~0 0) .cse1) (and (not (= 0 ~pumpRunning~0)) (= ULTIMATE.start_isHighWaterLevel_~tmp~6 0) .cse0 .cse1))) [2019-01-12 14:52:43,713 INFO L444 ceAbstractionStarter]: At program point L701-1(lines 701 707) the Hoare annotation is: false [2019-01-12 14:52:43,713 INFO L444 ceAbstractionStarter]: At program point L701-2(lines 701 707) the Hoare annotation is: false [2019-01-12 14:52:43,713 INFO L444 ceAbstractionStarter]: At program point L90(lines 85 93) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (= ~systemActive~0 1))) (or (and (= ULTIMATE.start_processEnvironment_~tmp~5 0) .cse0 (<= ~waterLevel~0 1) (= ~pumpRunning~0 0) .cse1) (and (not (= 0 ~pumpRunning~0)) (= ULTIMATE.start_isHighWaterLevel_~tmp~6 0) .cse0 .cse1))) [2019-01-12 14:52:43,713 INFO L444 ceAbstractionStarter]: At program point L90-1(lines 85 93) the Hoare annotation is: false [2019-01-12 14:52:43,713 INFO L444 ceAbstractionStarter]: At program point L90-2(lines 85 93) the Hoare annotation is: false [2019-01-12 14:52:43,713 INFO L444 ceAbstractionStarter]: At program point L834(lines 819 837) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_isHighWaterLevel_~tmp~6 0)) (.cse1 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse2 (<= ~waterLevel~0 1)) (.cse3 (= ~pumpRunning~0 0)) (.cse4 (= ~systemActive~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (and (and .cse1 .cse3) .cse0 (= 0 |ULTIMATE.start_isHighWaterSensorDry_#res|) .cse4) (= 1 |ULTIMATE.start_isHighWaterLevel_#res|) (= 1 ULTIMATE.start_isHighWaterLevel_~tmp___0~1)) (and (and (= 0 |ULTIMATE.start_isHighWaterLevel_#res|) (= 0 ULTIMATE.start_isHighWaterLevel_~tmp___0~1) .cse1 .cse2 .cse3) .cse4))) [2019-01-12 14:52:43,713 INFO L444 ceAbstractionStarter]: At program point L834-1(lines 819 837) the Hoare annotation is: false [2019-01-12 14:52:43,713 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 14:52:43,713 INFO L444 ceAbstractionStarter]: At program point L834-2(lines 819 837) the Hoare annotation is: false [2019-01-12 14:52:43,714 INFO L448 ceAbstractionStarter]: For program point L157(lines 157 161) no Hoare annotation was computed. [2019-01-12 14:52:43,714 INFO L448 ceAbstractionStarter]: For program point L157-1(lines 694 700) no Hoare annotation was computed. [2019-01-12 14:52:43,714 INFO L448 ceAbstractionStarter]: For program point L638(lines 638 644) no Hoare annotation was computed. [2019-01-12 14:52:43,714 INFO L444 ceAbstractionStarter]: At program point L638-1(lines 638 644) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (= ~systemActive~0 1))) (or (and (= ULTIMATE.start_isHighWaterLevel_~tmp~6 0) .cse0 .cse1) (and (and .cse0 (= ~pumpRunning~0 0)) .cse1))) [2019-01-12 14:52:43,714 INFO L448 ceAbstractionStarter]: For program point L77(lines 77 81) no Hoare annotation was computed. [2019-01-12 14:52:43,714 INFO L444 ceAbstractionStarter]: At program point L903(lines 898 906) the Hoare annotation is: (and (= 1 ~waterLevel~0) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2019-01-12 14:52:43,714 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 14:52:43,714 INFO L448 ceAbstractionStarter]: For program point L854(lines 854 867) no Hoare annotation was computed. [2019-01-12 14:52:43,714 INFO L444 ceAbstractionStarter]: At program point L854-1(lines 1 906) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (= ~systemActive~0 1))) (or (and (not (= 0 ~pumpRunning~0)) (= ULTIMATE.start_isHighWaterLevel_~tmp~6 0) .cse0 .cse1) (and (<= ~waterLevel~0 1) (and .cse0 (= ~pumpRunning~0 0) .cse1)))) [2019-01-12 14:52:43,715 INFO L448 ceAbstractionStarter]: For program point L854-2(lines 854 867) no Hoare annotation was computed. [2019-01-12 14:52:43,715 INFO L444 ceAbstractionStarter]: At program point L854-3(lines 1 906) the Hoare annotation is: false [2019-01-12 14:52:43,715 INFO L448 ceAbstractionStarter]: For program point L854-4(lines 854 867) no Hoare annotation was computed. [2019-01-12 14:52:43,715 INFO L444 ceAbstractionStarter]: At program point L854-5(lines 1 906) the Hoare annotation is: false [2019-01-12 14:52:43,715 INFO L444 ceAbstractionStarter]: At program point L674(lines 627 675) the Hoare annotation is: false [2019-01-12 14:52:43,715 INFO L448 ceAbstractionStarter]: For program point L658(lines 658 669) no Hoare annotation was computed. [2019-01-12 14:52:43,715 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 236) no Hoare annotation was computed. [2019-01-12 14:52:43,715 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 613) no Hoare annotation was computed. [2019-01-12 14:52:43,716 INFO L451 ceAbstractionStarter]: At program point L229-1(lines 229 236) the Hoare annotation is: true [2019-01-12 14:52:43,716 INFO L448 ceAbstractionStarter]: For program point L130(lines 130 136) no Hoare annotation was computed. [2019-01-12 14:52:43,716 INFO L448 ceAbstractionStarter]: For program point L130-1(lines 130 136) no Hoare annotation was computed. [2019-01-12 14:52:43,716 INFO L448 ceAbstractionStarter]: For program point L130-2(lines 130 136) no Hoare annotation was computed. [2019-01-12 14:52:43,716 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 69) no Hoare annotation was computed. [2019-01-12 14:52:43,716 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 14:52:43,716 INFO L448 ceAbstractionStarter]: For program point L858(lines 858 864) no Hoare annotation was computed. [2019-01-12 14:52:43,716 INFO L448 ceAbstractionStarter]: For program point L858-2(lines 858 864) no Hoare annotation was computed. [2019-01-12 14:52:43,716 INFO L448 ceAbstractionStarter]: For program point L726(lines 726 743) no Hoare annotation was computed. [2019-01-12 14:52:43,716 INFO L448 ceAbstractionStarter]: For program point L858-4(lines 858 864) no Hoare annotation was computed. [2019-01-12 14:52:43,717 INFO L448 ceAbstractionStarter]: For program point L726-1(lines 726 743) no Hoare annotation was computed. [2019-01-12 14:52:43,717 INFO L448 ceAbstractionStarter]: For program point L726-2(lines 726 743) no Hoare annotation was computed. [2019-01-12 14:52:43,717 INFO L444 ceAbstractionStarter]: At program point L694(lines 693 712) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (= ~systemActive~0 1))) (or (and (= ULTIMATE.start_isHighWaterLevel_~tmp~6 0) .cse0 .cse1) (and (and .cse0 (= ~pumpRunning~0 0)) .cse1))) [2019-01-12 14:52:43,717 INFO L448 ceAbstractionStarter]: For program point L694-1(lines 694 700) no Hoare annotation was computed. [2019-01-12 14:52:43,717 INFO L444 ceAbstractionStarter]: At program point L694-2(lines 693 712) the Hoare annotation is: false [2019-01-12 14:52:43,717 INFO L444 ceAbstractionStarter]: At program point L694-3(lines 693 712) the Hoare annotation is: false [2019-01-12 14:52:43,717 INFO L448 ceAbstractionStarter]: For program point L629(lines 628 673) no Hoare annotation was computed. [2019-01-12 14:52:43,717 INFO L448 ceAbstractionStarter]: For program point L613(line 613) no Hoare annotation was computed. [2019-01-12 14:52:43,717 INFO L448 ceAbstractionStarter]: For program point L613-1(line 613) no Hoare annotation was computed. [2019-01-12 14:52:43,717 INFO L448 ceAbstractionStarter]: For program point L613-2(line 613) no Hoare annotation was computed. [2019-01-12 14:52:43,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:52:43 BoogieIcfgContainer [2019-01-12 14:52:43,748 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:52:43,748 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:52:43,748 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:52:43,749 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:52:43,749 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:52:35" (3/4) ... [2019-01-12 14:52:43,758 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 14:52:43,788 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2019-01-12 14:52:43,790 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2019-01-12 14:52:43,791 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-01-12 14:52:43,792 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 14:52:43,792 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 14:52:43,798 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-12 14:52:43,845 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((splverifierCounter == 0 && pumpRunning == 0) && 0 == \result) && systemActive == 1) || (((splverifierCounter == 0 && waterLevel <= 1) && pumpRunning == 0) && systemActive == 1) [2019-01-12 14:52:43,847 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(0 == pumpRunning) && tmp == 0) && splverifierCounter == 0) && systemActive == 1) || (((((tmp == 0 && \result <= 1) && splverifierCounter == 0) && waterLevel <= 1) && pumpRunning == 0) && systemActive == 1) [2019-01-12 14:52:43,850 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((tmp == 0 && splverifierCounter == 0) && waterLevel <= 1) && pumpRunning == 0) && systemActive == 1) || ((((((splverifierCounter == 0 && pumpRunning == 0) && tmp == 0) && 0 == \result) && systemActive == 1) && 1 == \result) && 1 == tmp___0)) || (((((0 == \result && 0 == tmp___0) && splverifierCounter == 0) && waterLevel <= 1) && pumpRunning == 0) && systemActive == 1) [2019-01-12 14:52:43,850 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(0 == pumpRunning) && tmp == 0) && splverifierCounter == 0) && !(0 == \result)) && systemActive == 1 [2019-01-12 14:52:43,955 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:52:43,955 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:52:43,957 INFO L168 Benchmark]: Toolchain (without parser) took 10331.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 203.4 MB). Free memory was 952.7 MB in the beginning and 970.8 MB in the end (delta: -18.1 MB). Peak memory consumption was 185.3 MB. Max. memory is 11.5 GB. [2019-01-12 14:52:43,958 INFO L168 Benchmark]: CDTParser took 0.20 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:52:43,958 INFO L168 Benchmark]: CACSL2BoogieTranslator took 691.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -157.6 MB). Peak memory consumption was 35.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:52:43,960 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:52:43,960 INFO L168 Benchmark]: Boogie Preprocessor took 39.02 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:52:43,960 INFO L168 Benchmark]: RCFGBuilder took 1301.89 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.9 MB). Peak memory consumption was 58.9 MB. Max. memory is 11.5 GB. [2019-01-12 14:52:43,961 INFO L168 Benchmark]: TraceAbstraction took 8020.43 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 978.7 MB in the end (delta: 72.8 MB). Peak memory consumption was 259.9 MB. Max. memory is 11.5 GB. [2019-01-12 14:52:43,961 INFO L168 Benchmark]: Witness Printer took 206.56 ms. Allocated memory is still 1.2 GB. Free memory was 978.7 MB in the beginning and 970.8 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 11.5 GB. [2019-01-12 14:52:43,965 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.20 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 691.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -157.6 MB). Peak memory consumption was 35.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.02 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1301.89 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.9 MB). Peak memory consumption was 58.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8020.43 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 978.7 MB in the end (delta: 72.8 MB). Peak memory consumption was 259.9 MB. Max. memory is 11.5 GB. * Witness Printer took 206.56 ms. Allocated memory is still 1.2 GB. Free memory was 978.7 MB in the beginning and 970.8 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 613]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 613]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 613]: 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: 117]: Loop Invariant Derived loop invariant: (((!(0 == pumpRunning) && tmp == 0) && splverifierCounter == 0) && systemActive == 1) || (((((tmp == 0 && \result <= 1) && splverifierCounter == 0) && waterLevel <= 1) && pumpRunning == 0) && systemActive == 1) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 627]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (((splverifierCounter == 0 && pumpRunning == 0) && 0 == \result) && systemActive == 1) || (((splverifierCounter == 0 && waterLevel <= 1) && pumpRunning == 0) && systemActive == 1) - InvariantResult [Line: 693]: Loop Invariant Derived loop invariant: ((tmp == 0 && splverifierCounter == 0) && systemActive == 1) || ((splverifierCounter == 0 && pumpRunning == 0) && systemActive == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (1 == waterLevel && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (1 == waterLevel && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 774]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 638]: Loop Invariant Derived loop invariant: ((tmp == 0 && splverifierCounter == 0) && systemActive == 1) || ((splverifierCounter == 0 && pumpRunning == 0) && systemActive == 1) - InvariantResult [Line: 898]: Loop Invariant Derived loop invariant: (1 == waterLevel && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: ((((tmp == 0 && splverifierCounter == 0) && waterLevel <= 1) && pumpRunning == 0) && systemActive == 1) || (((!(0 == pumpRunning) && tmp == 0) && splverifierCounter == 0) && systemActive == 1) - InvariantResult [Line: 819]: Loop Invariant Derived loop invariant: (((((tmp == 0 && splverifierCounter == 0) && waterLevel <= 1) && pumpRunning == 0) && systemActive == 1) || ((((((splverifierCounter == 0 && pumpRunning == 0) && tmp == 0) && 0 == \result) && systemActive == 1) && 1 == \result) && 1 == tmp___0)) || (((((0 == \result && 0 == tmp___0) && splverifierCounter == 0) && waterLevel <= 1) && pumpRunning == 0) && systemActive == 1) - InvariantResult [Line: 819]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 774]: Loop Invariant Derived loop invariant: (((!(0 == pumpRunning) && tmp == 0) && splverifierCounter == 0) && !(0 == \result)) && systemActive == 1 - InvariantResult [Line: 819]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((!(0 == pumpRunning) && tmp == 0) && splverifierCounter == 0) && systemActive == 1) || (waterLevel <= 1 && (splverifierCounter == 0 && pumpRunning == 0) && systemActive == 1) - InvariantResult [Line: 774]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 693]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 693]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 701]: Loop Invariant Derived loop invariant: ((((tmp == 0 && splverifierCounter == 0) && waterLevel <= 1) && pumpRunning == 0) && systemActive == 1) || (((!(0 == pumpRunning) && tmp == 0) && splverifierCounter == 0) && systemActive == 1) - InvariantResult [Line: 648]: Loop Invariant Derived loop invariant: ((tmp == 0 && splverifierCounter == 0) && systemActive == 1) || ((splverifierCounter == 0 && pumpRunning == 0) && systemActive == 1) - InvariantResult [Line: 701]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 701]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 219]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 229]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 84 locations, 3 error locations. SAFE Result, 7.9s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 2.3s AutomataDifference, 0.0s DeadEndRemovalTime, 3.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 751 SDtfs, 863 SDslu, 1100 SDs, 0 SdLazy, 178 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 595 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 94 NumberOfFragments, 349 HoareAnnotationTreeSize, 33 FomulaSimplifications, 23360 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 33 FomulaSimplificationsInter, 5249 FormulaSimplificationTreeSizeReductionInter, 2.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 276 NumberOfCodeBlocks, 276 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 266 ConstructedInterpolants, 0 QuantifiedInterpolants, 13265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...