./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec4_product52_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/product-lines/minepump_spec4_product52_true-unreach-call_false-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ac98b61700c421642ba0cea32b1043bdcac0ece8 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 09:49:44,701 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 09:49:44,702 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 09:49:44,714 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 09:49:44,714 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 09:49:44,716 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 09:49:44,717 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 09:49:44,719 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 09:49:44,720 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 09:49:44,721 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 09:49:44,722 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 09:49:44,723 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 09:49:44,724 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 09:49:44,725 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 09:49:44,726 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 09:49:44,730 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 09:49:44,731 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 09:49:44,733 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 09:49:44,735 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 09:49:44,737 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 09:49:44,738 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 09:49:44,739 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 09:49:44,742 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 09:49:44,742 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 09:49:44,742 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 09:49:44,743 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 09:49:44,744 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 09:49:44,745 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 09:49:44,746 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 09:49:44,749 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 09:49:44,750 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 09:49:44,754 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 09:49:44,754 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 09:49:44,754 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 09:49:44,755 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 09:49:44,762 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 09:49:44,762 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 09:49:44,790 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 09:49:44,791 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 09:49:44,793 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 09:49:44,794 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 09:49:44,794 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 09:49:44,794 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 09:49:44,794 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 09:49:44,795 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 09:49:44,795 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 09:49:44,795 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 09:49:44,796 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 09:49:44,796 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 09:49:44,796 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 09:49:44,796 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 09:49:44,797 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 09:49:44,797 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 09:49:44,797 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 09:49:44,798 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 09:49:44,798 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 09:49:44,798 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 09:49:44,798 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 09:49:44,798 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:49:44,798 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 09:49:44,801 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 09:49:44,801 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 09:49:44,801 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 09:49:44,802 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 09:49:44,802 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 09:49:44,802 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ac98b61700c421642ba0cea32b1043bdcac0ece8 [2018-12-31 09:49:44,861 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 09:49:44,881 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 09:49:44,887 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 09:49:44,889 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 09:49:44,889 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 09:49:44,890 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec4_product52_true-unreach-call_false-termination.cil.c [2018-12-31 09:49:44,954 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5318ed2a/72a1c1d8bf87440eaa74b7ed3b8e7300/FLAG76cb55fc2 [2018-12-31 09:49:45,448 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 09:49:45,449 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec4_product52_true-unreach-call_false-termination.cil.c [2018-12-31 09:49:45,467 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5318ed2a/72a1c1d8bf87440eaa74b7ed3b8e7300/FLAG76cb55fc2 [2018-12-31 09:49:45,779 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5318ed2a/72a1c1d8bf87440eaa74b7ed3b8e7300 [2018-12-31 09:49:45,786 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 09:49:45,788 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 09:49:45,789 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 09:49:45,789 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 09:49:45,793 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 09:49:45,794 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:49:45" (1/1) ... [2018-12-31 09:49:45,798 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f1dbaa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:49:45, skipping insertion in model container [2018-12-31 09:49:45,799 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:49:45" (1/1) ... [2018-12-31 09:49:45,807 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 09:49:45,871 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 09:49:46,307 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:49:46,325 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 09:49:46,475 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:49:46,513 INFO L195 MainTranslator]: Completed translation [2018-12-31 09:49:46,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:49:46 WrapperNode [2018-12-31 09:49:46,513 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 09:49:46,514 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 09:49:46,514 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 09:49:46,514 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 09:49:46,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:49:46" (1/1) ... [2018-12-31 09:49:46,544 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:49:46" (1/1) ... [2018-12-31 09:49:46,597 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 09:49:46,597 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 09:49:46,597 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 09:49:46,597 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 09:49:46,608 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:49:46" (1/1) ... [2018-12-31 09:49:46,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:49:46" (1/1) ... [2018-12-31 09:49:46,614 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:49:46" (1/1) ... [2018-12-31 09:49:46,615 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:49:46" (1/1) ... [2018-12-31 09:49:46,627 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:49:46" (1/1) ... [2018-12-31 09:49:46,636 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:49:46" (1/1) ... [2018-12-31 09:49:46,640 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:49:46" (1/1) ... [2018-12-31 09:49:46,646 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 09:49:46,647 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 09:49:46,647 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 09:49:46,647 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 09:49:46,648 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:49:46" (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 [2018-12-31 09:49:46,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 09:49:46,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-31 09:49:46,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 09:49:46,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 09:49:48,278 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 09:49:48,279 INFO L280 CfgBuilder]: Removed 162 assue(true) statements. [2018-12-31 09:49:48,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:49:48 BoogieIcfgContainer [2018-12-31 09:49:48,280 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 09:49:48,281 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 09:49:48,281 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 09:49:48,284 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 09:49:48,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 09:49:45" (1/3) ... [2018-12-31 09:49:48,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d00211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:49:48, skipping insertion in model container [2018-12-31 09:49:48,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:49:46" (2/3) ... [2018-12-31 09:49:48,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d00211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:49:48, skipping insertion in model container [2018-12-31 09:49:48,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:49:48" (3/3) ... [2018-12-31 09:49:48,288 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product52_true-unreach-call_false-termination.cil.c [2018-12-31 09:49:48,298 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 09:49:48,307 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 09:49:48,325 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 09:49:48,360 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 09:49:48,360 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 09:49:48,361 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 09:49:48,361 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 09:49:48,361 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 09:49:48,361 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 09:49:48,361 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 09:49:48,362 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 09:49:48,362 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 09:49:48,382 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states. [2018-12-31 09:49:48,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 09:49:48,390 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:49:48,391 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:49:48,393 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:49:48,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:49:48,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1794729554, now seen corresponding path program 1 times [2018-12-31 09:49:48,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:49:48,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:49:48,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:49:48,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:49:48,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:49:48,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:49:48,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:49:48,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:49:48,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:49:48,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 09:49:48,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 09:49:48,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 09:49:48,697 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 2 states. [2018-12-31 09:49:48,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:49:48,730 INFO L93 Difference]: Finished difference Result 232 states and 353 transitions. [2018-12-31 09:49:48,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 09:49:48,732 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-12-31 09:49:48,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:49:48,744 INFO L225 Difference]: With dead ends: 232 [2018-12-31 09:49:48,745 INFO L226 Difference]: Without dead ends: 115 [2018-12-31 09:49:48,748 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 [2018-12-31 09:49:48,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-31 09:49:48,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-12-31 09:49:48,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-31 09:49:48,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 168 transitions. [2018-12-31 09:49:48,799 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 168 transitions. Word has length 16 [2018-12-31 09:49:48,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:49:48,800 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 168 transitions. [2018-12-31 09:49:48,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 09:49:48,800 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 168 transitions. [2018-12-31 09:49:48,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-31 09:49:48,801 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:49:48,802 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:49:48,802 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:49:48,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:49:48,802 INFO L82 PathProgramCache]: Analyzing trace with hash 529368141, now seen corresponding path program 1 times [2018-12-31 09:49:48,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:49:48,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:49:48,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:49:48,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:49:48,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:49:48,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:49:48,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:49:48,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:49:48,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:49:48,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:49:48,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:49:48,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:49:48,991 INFO L87 Difference]: Start difference. First operand 115 states and 168 transitions. Second operand 3 states. [2018-12-31 09:49:49,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:49:49,029 INFO L93 Difference]: Finished difference Result 115 states and 168 transitions. [2018-12-31 09:49:49,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:49:49,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-31 09:49:49,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:49:49,031 INFO L225 Difference]: With dead ends: 115 [2018-12-31 09:49:49,032 INFO L226 Difference]: Without dead ends: 49 [2018-12-31 09:49:49,033 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 [2018-12-31 09:49:49,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-31 09:49:49,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-31 09:49:49,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-31 09:49:49,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2018-12-31 09:49:49,041 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 17 [2018-12-31 09:49:49,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:49:49,041 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 71 transitions. [2018-12-31 09:49:49,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:49:49,041 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 71 transitions. [2018-12-31 09:49:49,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 09:49:49,043 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:49:49,043 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] [2018-12-31 09:49:49,044 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:49:49,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:49:49,044 INFO L82 PathProgramCache]: Analyzing trace with hash -2061312917, now seen corresponding path program 1 times [2018-12-31 09:49:49,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:49:49,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:49:49,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:49:49,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:49:49,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:49:49,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:49:49,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:49:49,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:49:49,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:49:49,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:49:49,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:49:49,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:49:49,158 INFO L87 Difference]: Start difference. First operand 49 states and 71 transitions. Second operand 3 states. [2018-12-31 09:49:49,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:49:49,270 INFO L93 Difference]: Finished difference Result 135 states and 201 transitions. [2018-12-31 09:49:49,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:49:49,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-31 09:49:49,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:49:49,276 INFO L225 Difference]: With dead ends: 135 [2018-12-31 09:49:49,277 INFO L226 Difference]: Without dead ends: 92 [2018-12-31 09:49:49,277 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 [2018-12-31 09:49:49,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-31 09:49:49,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2018-12-31 09:49:49,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-31 09:49:49,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 131 transitions. [2018-12-31 09:49:49,290 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 131 transitions. Word has length 22 [2018-12-31 09:49:49,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:49:49,291 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 131 transitions. [2018-12-31 09:49:49,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:49:49,291 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 131 transitions. [2018-12-31 09:49:49,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-31 09:49:49,292 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:49:49,292 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] [2018-12-31 09:49:49,293 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:49:49,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:49:49,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1499976397, now seen corresponding path program 1 times [2018-12-31 09:49:49,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:49:49,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:49:49,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:49:49,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:49:49,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:49:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:49:49,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:49:49,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:49:49,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:49:49,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:49:49,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:49:49,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:49:49,423 INFO L87 Difference]: Start difference. First operand 88 states and 131 transitions. Second operand 3 states. [2018-12-31 09:49:49,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:49:49,679 INFO L93 Difference]: Finished difference Result 211 states and 318 transitions. [2018-12-31 09:49:49,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:49:49,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-31 09:49:49,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:49:49,683 INFO L225 Difference]: With dead ends: 211 [2018-12-31 09:49:49,683 INFO L226 Difference]: Without dead ends: 129 [2018-12-31 09:49:49,687 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 [2018-12-31 09:49:49,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-12-31 09:49:49,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2018-12-31 09:49:49,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-12-31 09:49:49,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 185 transitions. [2018-12-31 09:49:49,709 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 185 transitions. Word has length 24 [2018-12-31 09:49:49,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:49:49,710 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 185 transitions. [2018-12-31 09:49:49,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:49:49,710 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 185 transitions. [2018-12-31 09:49:49,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-31 09:49:49,711 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:49:49,711 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] [2018-12-31 09:49:49,712 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:49:49,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:49:49,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1678878848, now seen corresponding path program 1 times [2018-12-31 09:49:49,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:49:49,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:49:49,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:49:49,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:49:49,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:49:49,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:49:50,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:49:50,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:49:50,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:49:50,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:49:50,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:49:50,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:49:50,006 INFO L87 Difference]: Start difference. First operand 127 states and 185 transitions. Second operand 5 states. [2018-12-31 09:49:50,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:49:50,495 INFO L93 Difference]: Finished difference Result 451 states and 663 transitions. [2018-12-31 09:49:50,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:49:50,496 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-12-31 09:49:50,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:49:50,498 INFO L225 Difference]: With dead ends: 451 [2018-12-31 09:49:50,498 INFO L226 Difference]: Without dead ends: 330 [2018-12-31 09:49:50,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:49:50,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-12-31 09:49:50,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 210. [2018-12-31 09:49:50,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-12-31 09:49:50,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 296 transitions. [2018-12-31 09:49:50,539 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 296 transitions. Word has length 25 [2018-12-31 09:49:50,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:49:50,541 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 296 transitions. [2018-12-31 09:49:50,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:49:50,541 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 296 transitions. [2018-12-31 09:49:50,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-31 09:49:50,542 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:49:50,542 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] [2018-12-31 09:49:50,544 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:49:50,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:49:50,544 INFO L82 PathProgramCache]: Analyzing trace with hash -280430142, now seen corresponding path program 1 times [2018-12-31 09:49:50,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:49:50,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:49:50,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:49:50,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:49:50,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:49:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:49:50,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:49:50,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:49:50,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:49:50,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:49:50,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:49:50,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:49:50,677 INFO L87 Difference]: Start difference. First operand 210 states and 296 transitions. Second operand 5 states. [2018-12-31 09:49:50,957 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-12-31 09:49:51,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:49:51,789 INFO L93 Difference]: Finished difference Result 450 states and 648 transitions. [2018-12-31 09:49:51,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 09:49:51,791 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-12-31 09:49:51,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:49:51,795 INFO L225 Difference]: With dead ends: 450 [2018-12-31 09:49:51,795 INFO L226 Difference]: Without dead ends: 448 [2018-12-31 09:49:51,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:49:51,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2018-12-31 09:49:51,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 210. [2018-12-31 09:49:51,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-12-31 09:49:51,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 294 transitions. [2018-12-31 09:49:51,839 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 294 transitions. Word has length 26 [2018-12-31 09:49:51,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:49:51,840 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 294 transitions. [2018-12-31 09:49:51,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:49:51,840 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 294 transitions. [2018-12-31 09:49:51,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 09:49:51,844 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:49:51,845 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] [2018-12-31 09:49:51,845 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:49:51,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:49:51,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1932951004, now seen corresponding path program 1 times [2018-12-31 09:49:51,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:49:51,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:49:51,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:49:51,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:49:51,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:49:51,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:49:51,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:49:51,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:49:51,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:49:51,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:49:51,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:49:51,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:49:51,981 INFO L87 Difference]: Start difference. First operand 210 states and 294 transitions. Second operand 5 states. [2018-12-31 09:49:52,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:49:52,400 INFO L93 Difference]: Finished difference Result 585 states and 811 transitions. [2018-12-31 09:49:52,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:49:52,400 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-12-31 09:49:52,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:49:52,405 INFO L225 Difference]: With dead ends: 585 [2018-12-31 09:49:52,405 INFO L226 Difference]: Without dead ends: 381 [2018-12-31 09:49:52,406 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 [2018-12-31 09:49:52,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-12-31 09:49:52,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 228. [2018-12-31 09:49:52,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-12-31 09:49:52,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 312 transitions. [2018-12-31 09:49:52,438 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 312 transitions. Word has length 31 [2018-12-31 09:49:52,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:49:52,438 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 312 transitions. [2018-12-31 09:49:52,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:49:52,439 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 312 transitions. [2018-12-31 09:49:52,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 09:49:52,441 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:49:52,442 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] [2018-12-31 09:49:52,442 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:49:52,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:49:52,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1539923994, now seen corresponding path program 1 times [2018-12-31 09:49:52,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:49:52,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:49:52,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:49:52,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:49:52,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:49:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:49:52,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:49:52,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:49:52,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:49:52,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 09:49:52,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 09:49:52,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 09:49:52,537 INFO L87 Difference]: Start difference. First operand 228 states and 312 transitions. Second operand 4 states. [2018-12-31 09:49:52,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:49:52,781 INFO L93 Difference]: Finished difference Result 508 states and 691 transitions. [2018-12-31 09:49:52,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 09:49:52,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-12-31 09:49:52,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:49:52,785 INFO L225 Difference]: With dead ends: 508 [2018-12-31 09:49:52,785 INFO L226 Difference]: Without dead ends: 286 [2018-12-31 09:49:52,786 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 [2018-12-31 09:49:52,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-12-31 09:49:52,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 197. [2018-12-31 09:49:52,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-12-31 09:49:52,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 264 transitions. [2018-12-31 09:49:52,809 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 264 transitions. Word has length 31 [2018-12-31 09:49:52,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:49:52,810 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 264 transitions. [2018-12-31 09:49:52,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 09:49:52,810 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 264 transitions. [2018-12-31 09:49:52,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 09:49:52,816 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:49:52,816 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] [2018-12-31 09:49:52,816 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:49:52,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:49:52,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1798089432, now seen corresponding path program 1 times [2018-12-31 09:49:52,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:49:52,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:49:52,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:49:52,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:49:52,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:49:52,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:49:52,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:49:52,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:49:52,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:49:52,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:49:52,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:49:52,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:49:52,982 INFO L87 Difference]: Start difference. First operand 197 states and 264 transitions. Second operand 5 states. [2018-12-31 09:49:53,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:49:53,681 INFO L93 Difference]: Finished difference Result 761 states and 1046 transitions. [2018-12-31 09:49:53,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 09:49:53,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-12-31 09:49:53,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:49:53,688 INFO L225 Difference]: With dead ends: 761 [2018-12-31 09:49:53,689 INFO L226 Difference]: Without dead ends: 620 [2018-12-31 09:49:53,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:49:53,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2018-12-31 09:49:53,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 282. [2018-12-31 09:49:53,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-12-31 09:49:53,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 373 transitions. [2018-12-31 09:49:53,737 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 373 transitions. Word has length 31 [2018-12-31 09:49:53,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:49:53,737 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 373 transitions. [2018-12-31 09:49:53,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:49:53,738 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 373 transitions. [2018-12-31 09:49:53,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-31 09:49:53,741 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:49:53,741 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:49:53,741 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:49:53,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:49:53,742 INFO L82 PathProgramCache]: Analyzing trace with hash -860512174, now seen corresponding path program 1 times [2018-12-31 09:49:53,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:49:53,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:49:53,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:49:53,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:49:53,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:49:53,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:49:53,857 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-31 09:49:53,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:49:53,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:49:53,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:49:53,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:49:53,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:49:53,859 INFO L87 Difference]: Start difference. First operand 282 states and 373 transitions. Second operand 3 states. [2018-12-31 09:49:53,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:49:53,969 INFO L93 Difference]: Finished difference Result 481 states and 636 transitions. [2018-12-31 09:49:53,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:49:53,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-31 09:49:53,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:49:53,971 INFO L225 Difference]: With dead ends: 481 [2018-12-31 09:49:53,972 INFO L226 Difference]: Without dead ends: 205 [2018-12-31 09:49:53,973 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 [2018-12-31 09:49:53,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-12-31 09:49:54,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 199. [2018-12-31 09:49:54,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-31 09:49:54,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 260 transitions. [2018-12-31 09:49:54,003 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 260 transitions. Word has length 49 [2018-12-31 09:49:54,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:49:54,004 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 260 transitions. [2018-12-31 09:49:54,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:49:54,004 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 260 transitions. [2018-12-31 09:49:54,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-31 09:49:54,005 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:49:54,005 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:49:54,005 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:49:54,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:49:54,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1573662553, now seen corresponding path program 1 times [2018-12-31 09:49:54,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:49:54,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:49:54,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:49:54,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:49:54,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:49:54,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:49:54,138 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:49:54,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:49:54,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 09:49:54,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 09:49:54,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 09:49:54,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:49:54,140 INFO L87 Difference]: Start difference. First operand 199 states and 260 transitions. Second operand 6 states. [2018-12-31 09:49:55,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:49:55,152 INFO L93 Difference]: Finished difference Result 896 states and 1200 transitions. [2018-12-31 09:49:55,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 09:49:55,153 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2018-12-31 09:49:55,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:49:55,159 INFO L225 Difference]: With dead ends: 896 [2018-12-31 09:49:55,159 INFO L226 Difference]: Without dead ends: 745 [2018-12-31 09:49:55,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-12-31 09:49:55,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2018-12-31 09:49:55,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 310. [2018-12-31 09:49:55,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-12-31 09:49:55,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 415 transitions. [2018-12-31 09:49:55,217 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 415 transitions. Word has length 52 [2018-12-31 09:49:55,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:49:55,218 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 415 transitions. [2018-12-31 09:49:55,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 09:49:55,218 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 415 transitions. [2018-12-31 09:49:55,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-31 09:49:55,220 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:49:55,220 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:49:55,221 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:49:55,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:49:55,222 INFO L82 PathProgramCache]: Analyzing trace with hash -872597975, now seen corresponding path program 1 times [2018-12-31 09:49:55,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:49:55,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:49:55,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:49:55,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:49:55,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:49:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:49:55,546 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-31 09:49:55,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:49:55,547 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:49:55,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:49:55,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:49:55,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:49:55,972 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-31 09:49:55,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-31 09:49:55,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2018-12-31 09:49:55,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 09:49:55,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 09:49:55,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:49:56,001 INFO L87 Difference]: Start difference. First operand 310 states and 415 transitions. Second operand 9 states. [2018-12-31 09:49:56,673 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-12-31 09:49:57,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:49:57,020 INFO L93 Difference]: Finished difference Result 694 states and 923 transitions. [2018-12-31 09:49:57,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 09:49:57,021 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2018-12-31 09:49:57,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:49:57,022 INFO L225 Difference]: With dead ends: 694 [2018-12-31 09:49:57,022 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 09:49:57,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-12-31 09:49:57,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 09:49:57,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 09:49:57,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 09:49:57,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 09:49:57,025 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2018-12-31 09:49:57,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:49:57,025 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 09:49:57,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 09:49:57,026 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 09:49:57,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 09:49:57,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 09:49:57,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:57,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:57,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:57,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:57,322 WARN L181 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 125 [2018-12-31 09:49:57,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:57,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:57,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:57,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:57,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:57,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:57,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:57,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:57,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:57,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:57,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:57,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:57,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:57,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:57,639 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 120 [2018-12-31 09:49:57,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:57,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:57,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:57,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:57,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:57,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:57,865 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 115 [2018-12-31 09:49:57,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:58,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:58,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:58,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:58,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:58,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:58,080 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 115 [2018-12-31 09:49:58,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:58,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:58,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:58,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:58,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:58,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:58,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:58,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:58,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:58,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:58,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:58,368 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 122 [2018-12-31 09:49:58,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:58,505 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 104 [2018-12-31 09:49:58,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:58,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:49:58,617 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 99 [2018-12-31 09:50:00,848 WARN L181 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 118 DAG size of output: 16 [2018-12-31 09:50:01,037 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 22 [2018-12-31 09:50:01,210 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 17 [2018-12-31 09:50:01,405 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-12-31 09:50:02,198 WARN L181 SmtUtils]: Spent 744.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 19 [2018-12-31 09:50:02,891 WARN L181 SmtUtils]: Spent 689.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 19 [2018-12-31 09:50:03,433 WARN L181 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 19 [2018-12-31 09:50:03,788 WARN L181 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 22 [2018-12-31 09:50:04,325 WARN L181 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 19 [2018-12-31 09:50:04,717 WARN L181 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 10 [2018-12-31 09:50:05,099 WARN L181 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 25 [2018-12-31 09:50:05,104 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 953) no Hoare annotation was computed. [2018-12-31 09:50:05,104 INFO L448 ceAbstractionStarter]: For program point L400(lines 400 406) no Hoare annotation was computed. [2018-12-31 09:50:05,104 INFO L444 ceAbstractionStarter]: At program point L400-1(lines 400 406) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0))) (let ((.cse2 (and .cse0 (= ~pumpRunning~0 0))) (.cse3 (<= 1 ~waterLevel~0)) (.cse1 (= ~systemActive~0 1))) (or (and (<= 2 ~waterLevel~0) .cse0 .cse1) (and (= ~systemActive~0 0) .cse2 .cse3) (and (and .cse2 .cse3) .cse1)))) [2018-12-31 09:50:05,104 INFO L448 ceAbstractionStarter]: For program point L202(lines 202 210) no Hoare annotation was computed. [2018-12-31 09:50:05,104 INFO L448 ceAbstractionStarter]: For program point L202-1(lines 202 210) no Hoare annotation was computed. [2018-12-31 09:50:05,105 INFO L444 ceAbstractionStarter]: At program point L136(lines 127 140) the Hoare annotation is: false [2018-12-31 09:50:05,105 INFO L448 ceAbstractionStarter]: For program point L202-2(lines 202 210) no Hoare annotation was computed. [2018-12-31 09:50:05,105 INFO L444 ceAbstractionStarter]: At program point L136-1(lines 127 140) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (= ~pumpRunning~0 0)) (.cse2 (= ~systemActive~0 1))) (or (and .cse0 (= 1 |ULTIMATE.start_isHighWaterSensorDry_#res|) (<= 1 ~waterLevel~0) .cse1 .cse2) (and (and (<= 2 ~waterLevel~0) .cse0 .cse1) .cse2))) [2018-12-31 09:50:05,105 INFO L448 ceAbstractionStarter]: For program point L202-3(lines 202 210) no Hoare annotation was computed. [2018-12-31 09:50:05,105 INFO L444 ceAbstractionStarter]: At program point L136-2(lines 127 140) the Hoare annotation is: false [2018-12-31 09:50:05,105 INFO L448 ceAbstractionStarter]: For program point L202-4(lines 202 210) no Hoare annotation was computed. [2018-12-31 09:50:05,105 INFO L444 ceAbstractionStarter]: At program point L136-3(lines 127 140) the Hoare annotation is: false [2018-12-31 09:50:05,105 INFO L448 ceAbstractionStarter]: For program point L202-5(lines 202 210) no Hoare annotation was computed. [2018-12-31 09:50:05,105 INFO L444 ceAbstractionStarter]: At program point L136-4(lines 127 140) the Hoare annotation is: false [2018-12-31 09:50:05,105 INFO L444 ceAbstractionStarter]: At program point L136-5(lines 127 140) the Hoare annotation is: false [2018-12-31 09:50:05,106 INFO L448 ceAbstractionStarter]: For program point L830(lines 830 834) no Hoare annotation was computed. [2018-12-31 09:50:05,106 INFO L448 ceAbstractionStarter]: For program point L830-1(lines 166 172) no Hoare annotation was computed. [2018-12-31 09:50:05,106 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 953) no Hoare annotation was computed. [2018-12-31 09:50:05,106 INFO L444 ceAbstractionStarter]: At program point L173(lines 173 179) the Hoare annotation is: (let ((.cse1 (= ~systemActive~0 1)) (.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse3 (<= 1 ~waterLevel~0)) (.cse2 (= ~pumpRunning~0 0))) (or (and (<= 2 ~waterLevel~0) .cse0 .cse1) (and (and (and .cse0 .cse2) .cse3) .cse1) (and (= ~systemActive~0 0) .cse0 .cse3 .cse2))) [2018-12-31 09:50:05,106 INFO L444 ceAbstractionStarter]: At program point L173-1(lines 173 179) the Hoare annotation is: false [2018-12-31 09:50:05,106 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 953) no Hoare annotation was computed. [2018-12-31 09:50:05,106 INFO L444 ceAbstractionStarter]: At program point L173-2(lines 173 179) the Hoare annotation is: false [2018-12-31 09:50:05,106 INFO L448 ceAbstractionStarter]: For program point L966(lines 966 979) no Hoare annotation was computed. [2018-12-31 09:50:05,107 INFO L444 ceAbstractionStarter]: At program point L966-1(lines 1 982) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_test_~splverifierCounter~0 0))) (let ((.cse1 (and .cse2 (= ~pumpRunning~0 0))) (.cse0 (<= 1 ~waterLevel~0)) (.cse3 (= ~systemActive~0 1))) (or (and (= ~systemActive~0 0) .cse0 .cse1) (and (not (= |ULTIMATE.start_getWaterLevel_#res| 0)) (<= 2 ~waterLevel~0) .cse2 (not (= ULTIMATE.start___utac_acc__Specification4_spec__1_~tmp~9 0)) .cse3) (and (and .cse1 .cse0) .cse3)))) [2018-12-31 09:50:05,107 INFO L448 ceAbstractionStarter]: For program point L900(lines 900 907) no Hoare annotation was computed. [2018-12-31 09:50:05,107 INFO L448 ceAbstractionStarter]: For program point L966-2(lines 966 979) no Hoare annotation was computed. [2018-12-31 09:50:05,107 INFO L444 ceAbstractionStarter]: At program point L966-3(lines 1 982) the Hoare annotation is: false [2018-12-31 09:50:05,107 INFO L451 ceAbstractionStarter]: At program point L900-1(lines 900 907) the Hoare annotation is: true [2018-12-31 09:50:05,107 INFO L448 ceAbstractionStarter]: For program point L966-4(lines 966 979) no Hoare annotation was computed. [2018-12-31 09:50:05,107 INFO L444 ceAbstractionStarter]: At program point L966-5(lines 1 982) the Hoare annotation is: false [2018-12-31 09:50:05,107 INFO L444 ceAbstractionStarter]: At program point L440(lines 389 441) the Hoare annotation is: false [2018-12-31 09:50:05,107 INFO L444 ceAbstractionStarter]: At program point L936(lines 1 982) the Hoare annotation is: (and (= ~waterLevel~0 1) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2018-12-31 09:50:05,108 INFO L448 ceAbstractionStarter]: For program point L78(lines 78 82) no Hoare annotation was computed. [2018-12-31 09:50:05,108 INFO L448 ceAbstractionStarter]: For program point L970(lines 970 976) no Hoare annotation was computed. [2018-12-31 09:50:05,108 INFO L448 ceAbstractionStarter]: For program point L970-2(lines 970 976) no Hoare annotation was computed. [2018-12-31 09:50:05,108 INFO L448 ceAbstractionStarter]: For program point L970-4(lines 970 976) no Hoare annotation was computed. [2018-12-31 09:50:05,108 INFO L444 ceAbstractionStarter]: At program point L277(lines 272 280) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_isPumpRunning_#res|)) (.cse1 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse2 (<= 1 ~waterLevel~0)) (.cse3 (= ~pumpRunning~0 0))) (or (and .cse0 (= ~systemActive~0 0) .cse1 .cse2 .cse3) (and (and .cse0 .cse1 .cse2 .cse3) (= ~systemActive~0 1)))) [2018-12-31 09:50:05,108 INFO L444 ceAbstractionStarter]: At program point L277-1(lines 272 280) the Hoare annotation is: false [2018-12-31 09:50:05,108 INFO L444 ceAbstractionStarter]: At program point L277-2(lines 272 280) the Hoare annotation is: false [2018-12-31 09:50:05,108 INFO L448 ceAbstractionStarter]: For program point L410(lines 410 416) no Hoare annotation was computed. [2018-12-31 09:50:05,109 INFO L444 ceAbstractionStarter]: At program point L410-1(lines 410 416) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0))) (let ((.cse2 (and .cse0 (= ~pumpRunning~0 0))) (.cse3 (<= 1 ~waterLevel~0)) (.cse1 (= ~systemActive~0 1))) (or (and (<= 2 ~waterLevel~0) .cse0 .cse1) (and (= ~systemActive~0 0) .cse2 .cse3) (and (and .cse2 .cse3) .cse1)))) [2018-12-31 09:50:05,109 INFO L444 ceAbstractionStarter]: At program point L146(lines 141 149) the Hoare annotation is: (and (= 0 |ULTIMATE.start_isLowWaterSensorDry_#res|) (= ULTIMATE.start_test_~splverifierCounter~0 0) (<= 1 ~waterLevel~0) (= ~systemActive~0 1)) [2018-12-31 09:50:05,109 INFO L444 ceAbstractionStarter]: At program point L146-1(lines 141 149) the Hoare annotation is: false [2018-12-31 09:50:05,109 INFO L444 ceAbstractionStarter]: At program point L146-2(lines 141 149) the Hoare annotation is: false [2018-12-31 09:50:05,109 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 349) no Hoare annotation was computed. [2018-12-31 09:50:05,109 INFO L448 ceAbstractionStarter]: For program point L345-2(lines 345 349) no Hoare annotation was computed. [2018-12-31 09:50:05,109 INFO L448 ceAbstractionStarter]: For program point L345-3(lines 345 349) no Hoare annotation was computed. [2018-12-31 09:50:05,109 INFO L448 ceAbstractionStarter]: For program point L345-5(lines 345 349) no Hoare annotation was computed. [2018-12-31 09:50:05,109 INFO L448 ceAbstractionStarter]: For program point L345-6(lines 345 349) no Hoare annotation was computed. [2018-12-31 09:50:05,109 INFO L448 ceAbstractionStarter]: For program point L345-8(lines 345 349) no Hoare annotation was computed. [2018-12-31 09:50:05,110 INFO L444 ceAbstractionStarter]: At program point L874(lines 870 876) the Hoare annotation is: (and (= ~waterLevel~0 1) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2018-12-31 09:50:05,110 INFO L451 ceAbstractionStarter]: At program point L909(lines 890 912) the Hoare annotation is: true [2018-12-31 09:50:05,110 INFO L444 ceAbstractionStarter]: At program point L944(lines 939 947) the Hoare annotation is: (and (= ~waterLevel~0 1) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2018-12-31 09:50:05,110 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 09:50:05,110 INFO L444 ceAbstractionStarter]: At program point L351(lines 336 354) the Hoare annotation is: (and (<= 1 ULTIMATE.start_isLowWaterLevel_~tmp___0~1) (= 0 ULTIMATE.start_isLowWaterLevel_~tmp~3) (= 0 |ULTIMATE.start_isLowWaterSensorDry_#res|) (= ULTIMATE.start_test_~splverifierCounter~0 0) (<= 1 |ULTIMATE.start_isLowWaterLevel_#res|) (<= 1 ~waterLevel~0) (= ~systemActive~0 1)) [2018-12-31 09:50:05,110 INFO L444 ceAbstractionStarter]: At program point L351-1(lines 336 354) the Hoare annotation is: false [2018-12-31 09:50:05,110 INFO L444 ceAbstractionStarter]: At program point L351-2(lines 336 354) the Hoare annotation is: false [2018-12-31 09:50:05,110 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 58) no Hoare annotation was computed. [2018-12-31 09:50:05,111 INFO L448 ceAbstractionStarter]: For program point L54-3(lines 54 58) no Hoare annotation was computed. [2018-12-31 09:50:05,111 INFO L448 ceAbstractionStarter]: For program point L54-6(lines 54 58) no Hoare annotation was computed. [2018-12-31 09:50:05,111 INFO L448 ceAbstractionStarter]: For program point L420(lines 420 435) no Hoare annotation was computed. [2018-12-31 09:50:05,111 INFO L444 ceAbstractionStarter]: At program point L123(lines 118 126) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse3 (= ~pumpRunning~0 0)) (.cse1 (= ~systemActive~0 1)) (.cse2 (<= 1 ~waterLevel~0))) (or (and (not (= |ULTIMATE.start_getWaterLevel_#res| 0)) (<= 2 ~waterLevel~0) .cse0 .cse1) (and (= ~systemActive~0 0) .cse2 (and .cse0 .cse3)) (and (and .cse0 .cse3 .cse1) .cse2))) [2018-12-31 09:50:05,111 INFO L444 ceAbstractionStarter]: At program point L123-1(lines 118 126) the Hoare annotation is: false [2018-12-31 09:50:05,111 INFO L444 ceAbstractionStarter]: At program point L123-2(lines 118 126) the Hoare annotation is: false [2018-12-31 09:50:05,111 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 09:50:05,111 INFO L448 ceAbstractionStarter]: For program point L224(lines 224 241) no Hoare annotation was computed. [2018-12-31 09:50:05,111 INFO L448 ceAbstractionStarter]: For program point L224-1(lines 224 241) no Hoare annotation was computed. [2018-12-31 09:50:05,111 INFO L448 ceAbstractionStarter]: For program point L224-2(lines 224 241) no Hoare annotation was computed. [2018-12-31 09:50:05,112 INFO L448 ceAbstractionStarter]: For program point L391(lines 390 439) no Hoare annotation was computed. [2018-12-31 09:50:05,112 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 09:50:05,112 INFO L448 ceAbstractionStarter]: For program point L953(line 953) no Hoare annotation was computed. [2018-12-31 09:50:05,112 INFO L448 ceAbstractionStarter]: For program point L953-1(line 953) no Hoare annotation was computed. [2018-12-31 09:50:05,112 INFO L448 ceAbstractionStarter]: For program point L953-2(line 953) no Hoare annotation was computed. [2018-12-31 09:50:05,112 INFO L448 ceAbstractionStarter]: For program point L392(lines 392 396) no Hoare annotation was computed. [2018-12-31 09:50:05,112 INFO L448 ceAbstractionStarter]: For program point L359(lines 359 365) no Hoare annotation was computed. [2018-12-31 09:50:05,112 INFO L444 ceAbstractionStarter]: At program point L359-1(lines 359 365) the Hoare annotation is: (and (= ULTIMATE.start_test_~splverifierCounter~0 0) (<= 1 ~waterLevel~0) (= ~pumpRunning~0 0)) [2018-12-31 09:50:05,112 INFO L448 ceAbstractionStarter]: For program point L326(lines 326 330) no Hoare annotation was computed. [2018-12-31 09:50:05,112 INFO L448 ceAbstractionStarter]: For program point L326-2(lines 326 330) no Hoare annotation was computed. [2018-12-31 09:50:05,112 INFO L448 ceAbstractionStarter]: For program point L326-3(lines 326 330) no Hoare annotation was computed. [2018-12-31 09:50:05,113 INFO L448 ceAbstractionStarter]: For program point L326-5(lines 326 330) no Hoare annotation was computed. [2018-12-31 09:50:05,113 INFO L448 ceAbstractionStarter]: For program point L326-6(lines 326 330) no Hoare annotation was computed. [2018-12-31 09:50:05,113 INFO L448 ceAbstractionStarter]: For program point L326-8(lines 326 330) no Hoare annotation was computed. [2018-12-31 09:50:05,113 INFO L448 ceAbstractionStarter]: For program point L326-9(lines 326 330) no Hoare annotation was computed. [2018-12-31 09:50:05,113 INFO L448 ceAbstractionStarter]: For program point L326-11(lines 326 330) no Hoare annotation was computed. [2018-12-31 09:50:05,113 INFO L448 ceAbstractionStarter]: For program point L326-12(lines 326 330) no Hoare annotation was computed. [2018-12-31 09:50:05,113 INFO L448 ceAbstractionStarter]: For program point L326-14(lines 326 330) no Hoare annotation was computed. [2018-12-31 09:50:05,113 INFO L448 ceAbstractionStarter]: For program point L326-15(lines 326 330) no Hoare annotation was computed. [2018-12-31 09:50:05,113 INFO L448 ceAbstractionStarter]: For program point L326-17(lines 326 330) no Hoare annotation was computed. [2018-12-31 09:50:05,113 INFO L448 ceAbstractionStarter]: For program point L228(lines 228 236) no Hoare annotation was computed. [2018-12-31 09:50:05,113 INFO L448 ceAbstractionStarter]: For program point L228-1(lines 228 236) no Hoare annotation was computed. [2018-12-31 09:50:05,113 INFO L448 ceAbstractionStarter]: For program point L228-2(lines 228 236) no Hoare annotation was computed. [2018-12-31 09:50:05,114 INFO L448 ceAbstractionStarter]: For program point L428(lines 428 434) no Hoare annotation was computed. [2018-12-31 09:50:05,114 INFO L444 ceAbstractionStarter]: At program point L428-1(lines 166 172) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0))) (let ((.cse2 (and .cse0 (= ~pumpRunning~0 0))) (.cse3 (<= 1 ~waterLevel~0)) (.cse1 (= ~systemActive~0 1))) (or (and (<= 2 ~waterLevel~0) .cse0 .cse1) (and .cse2 (= ~systemActive~0 0) .cse3) (and (and .cse2 .cse3) .cse1)))) [2018-12-31 09:50:05,114 INFO L448 ceAbstractionStarter]: For program point L131(lines 131 137) no Hoare annotation was computed. [2018-12-31 09:50:05,114 INFO L448 ceAbstractionStarter]: For program point L131-1(lines 131 137) no Hoare annotation was computed. [2018-12-31 09:50:05,114 INFO L448 ceAbstractionStarter]: For program point L131-2(lines 131 137) no Hoare annotation was computed. [2018-12-31 09:50:05,114 INFO L448 ceAbstractionStarter]: For program point L131-3(lines 131 137) no Hoare annotation was computed. [2018-12-31 09:50:05,114 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-31 09:50:05,114 INFO L448 ceAbstractionStarter]: For program point L131-4(lines 131 137) no Hoare annotation was computed. [2018-12-31 09:50:05,115 INFO L448 ceAbstractionStarter]: For program point L131-5(lines 131 137) no Hoare annotation was computed. [2018-12-31 09:50:05,115 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 215) no Hoare annotation was computed. [2018-12-31 09:50:05,115 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 198 215) no Hoare annotation was computed. [2018-12-31 09:50:05,115 INFO L448 ceAbstractionStarter]: For program point L198-2(lines 198 215) no Hoare annotation was computed. [2018-12-31 09:50:05,115 INFO L448 ceAbstractionStarter]: For program point L198-3(lines 198 215) no Hoare annotation was computed. [2018-12-31 09:50:05,115 INFO L448 ceAbstractionStarter]: For program point L66(lines 66 70) no Hoare annotation was computed. [2018-12-31 09:50:05,115 INFO L448 ceAbstractionStarter]: For program point L198-4(lines 198 215) no Hoare annotation was computed. [2018-12-31 09:50:05,115 INFO L448 ceAbstractionStarter]: For program point L198-5(lines 198 215) no Hoare annotation was computed. [2018-12-31 09:50:05,115 INFO L444 ceAbstractionStarter]: At program point L826-2(lines 826 840) the Hoare annotation is: false [2018-12-31 09:50:05,115 INFO L444 ceAbstractionStarter]: At program point L166(lines 165 184) the Hoare annotation is: (let ((.cse1 (<= 1 ~waterLevel~0)) (.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0))) (or (and (and .cse0 (= ~pumpRunning~0 0)) (= ~systemActive~0 0) .cse1) (and .cse1 (and .cse0 (= ~systemActive~0 1))))) [2018-12-31 09:50:05,115 INFO L448 ceAbstractionStarter]: For program point L166-1(lines 166 172) no Hoare annotation was computed. [2018-12-31 09:50:05,116 INFO L444 ceAbstractionStarter]: At program point L166-2(lines 165 184) the Hoare annotation is: false [2018-12-31 09:50:05,116 INFO L444 ceAbstractionStarter]: At program point L166-3(lines 165 184) the Hoare annotation is: false [2018-12-31 09:50:05,116 INFO L448 ceAbstractionStarter]: For program point L827(line 827) no Hoare annotation was computed. [2018-12-31 09:50:05,116 INFO L444 ceAbstractionStarter]: At program point L332(lines 317 335) the Hoare annotation is: false [2018-12-31 09:50:05,116 INFO L444 ceAbstractionStarter]: At program point L332-1(lines 317 335) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (= ~pumpRunning~0 0)) (.cse2 (= ~systemActive~0 1))) (or (and (and (<= 2 ~waterLevel~0) .cse0 .cse1) .cse2) (and (and (and (= 0 |ULTIMATE.start_isHighWaterLevel_#res|) .cse0 (= 0 ULTIMATE.start_isHighWaterLevel_~tmp___0~0) .cse1) (<= 1 ~waterLevel~0)) .cse2))) [2018-12-31 09:50:05,116 INFO L444 ceAbstractionStarter]: At program point L332-2(lines 317 335) the Hoare annotation is: false [2018-12-31 09:50:05,116 INFO L444 ceAbstractionStarter]: At program point L332-3(lines 317 335) the Hoare annotation is: false [2018-12-31 09:50:05,116 INFO L444 ceAbstractionStarter]: At program point L332-4(lines 317 335) the Hoare annotation is: false [2018-12-31 09:50:05,116 INFO L444 ceAbstractionStarter]: At program point L332-5(lines 317 335) the Hoare annotation is: false [2018-12-31 09:50:05,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:50:05 BoogieIcfgContainer [2018-12-31 09:50:05,140 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 09:50:05,141 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 09:50:05,141 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 09:50:05,141 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 09:50:05,142 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:49:48" (3/4) ... [2018-12-31 09:50:05,145 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 09:50:05,167 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2018-12-31 09:50:05,168 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2018-12-31 09:50:05,169 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-12-31 09:50:05,170 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-31 09:50:05,171 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-31 09:50:05,173 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-31 09:50:05,214 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((systemActive == 0 && 1 <= waterLevel) && splverifierCounter == 0 && pumpRunning == 0) || ((((!(\result == 0) && 2 <= waterLevel) && splverifierCounter == 0) && !(tmp == 0)) && systemActive == 1)) || (((splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) && systemActive == 1) [2018-12-31 09:50:05,218 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\result == 0) && 2 <= waterLevel) && splverifierCounter == 0) && systemActive == 1) || ((systemActive == 0 && 1 <= waterLevel) && splverifierCounter == 0 && pumpRunning == 0)) || (((splverifierCounter == 0 && pumpRunning == 0) && systemActive == 1) && 1 <= waterLevel) [2018-12-31 09:50:05,219 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 == \result && splverifierCounter == 0) && 1 <= waterLevel) && systemActive == 1 [2018-12-31 09:50:05,220 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((splverifierCounter == 0 && 1 == \result) && 1 <= waterLevel) && pumpRunning == 0) && systemActive == 1) || (((2 <= waterLevel && splverifierCounter == 0) && pumpRunning == 0) && systemActive == 1) [2018-12-31 09:50:05,220 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == \result && systemActive == 0) && splverifierCounter == 0) && 1 <= waterLevel) && pumpRunning == 0) || ((((0 == \result && splverifierCounter == 0) && 1 <= waterLevel) && pumpRunning == 0) && systemActive == 1) [2018-12-31 09:50:05,222 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 <= tmp___0 && 0 == tmp) && 0 == \result) && splverifierCounter == 0) && 1 <= \result) && 1 <= waterLevel) && systemActive == 1 [2018-12-31 09:50:05,223 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((2 <= waterLevel && splverifierCounter == 0) && pumpRunning == 0) && systemActive == 1) || (((((0 == \result && splverifierCounter == 0) && 0 == tmp___0) && pumpRunning == 0) && 1 <= waterLevel) && systemActive == 1) [2018-12-31 09:50:05,346 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 09:50:05,347 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 09:50:05,347 INFO L168 Benchmark]: Toolchain (without parser) took 19560.89 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 314.6 MB). Free memory was 951.3 MB in the beginning and 945.7 MB in the end (delta: 5.7 MB). Peak memory consumption was 320.3 MB. Max. memory is 11.5 GB. [2018-12-31 09:50:05,351 INFO L168 Benchmark]: CDTParser took 0.15 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. [2018-12-31 09:50:05,351 INFO L168 Benchmark]: CACSL2BoogieTranslator took 724.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -166.0 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2018-12-31 09:50:05,352 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.65 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. [2018-12-31 09:50:05,352 INFO L168 Benchmark]: Boogie Preprocessor took 49.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-31 09:50:05,352 INFO L168 Benchmark]: RCFGBuilder took 1632.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.7 MB). Peak memory consumption was 58.7 MB. Max. memory is 11.5 GB. [2018-12-31 09:50:05,353 INFO L168 Benchmark]: TraceAbstraction took 16859.85 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.8 MB). Free memory was 1.1 GB in the beginning and 957.0 MB in the end (delta: 94.9 MB). Peak memory consumption was 402.1 MB. Max. memory is 11.5 GB. [2018-12-31 09:50:05,353 INFO L168 Benchmark]: Witness Printer took 205.72 ms. Allocated memory is still 1.3 GB. Free memory was 957.0 MB in the beginning and 945.7 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 11.5 GB. [2018-12-31 09:50:05,359 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 724.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -166.0 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 82.65 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 49.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1632.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.7 MB). Peak memory consumption was 58.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16859.85 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.8 MB). Free memory was 1.1 GB in the beginning and 957.0 MB in the end (delta: 94.9 MB). Peak memory consumption was 402.1 MB. Max. memory is 11.5 GB. * Witness Printer took 205.72 ms. Allocated memory is still 1.3 GB. Free memory was 957.0 MB in the beginning and 945.7 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 953]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 953]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 953]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 389]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 826]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((splverifierCounter == 0 && pumpRunning == 0) && systemActive == 0) && 1 <= waterLevel) || (1 <= waterLevel && splverifierCounter == 0 && systemActive == 1) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 317]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: ((0 == \result && splverifierCounter == 0) && 1 <= waterLevel) && systemActive == 1 - InvariantResult [Line: 317]: Loop Invariant Derived loop invariant: (((2 <= waterLevel && splverifierCounter == 0) && pumpRunning == 0) && systemActive == 1) || (((((0 == \result && splverifierCounter == 0) && 0 == tmp___0) && pumpRunning == 0) && 1 <= waterLevel) && systemActive == 1) - InvariantResult [Line: 317]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 336]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 272]: Loop Invariant Derived loop invariant: ((((0 == \result && systemActive == 0) && splverifierCounter == 0) && 1 <= waterLevel) && pumpRunning == 0) || ((((0 == \result && splverifierCounter == 0) && 1 <= waterLevel) && pumpRunning == 0) && systemActive == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (waterLevel == 1 && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 336]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: (((2 <= waterLevel && splverifierCounter == 0) && systemActive == 1) || (((splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) && systemActive == 1)) || (((systemActive == 0 && splverifierCounter == 0) && 1 <= waterLevel) && pumpRunning == 0) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 400]: Loop Invariant Derived loop invariant: (((2 <= waterLevel && splverifierCounter == 0) && systemActive == 1) || ((systemActive == 0 && splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel)) || (((splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) && systemActive == 1) - InvariantResult [Line: 118]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 410]: Loop Invariant Derived loop invariant: (((2 <= waterLevel && splverifierCounter == 0) && systemActive == 1) || ((systemActive == 0 && splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel)) || (((splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) && systemActive == 1) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 900]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 118]: Loop Invariant Derived loop invariant: ((((!(\result == 0) && 2 <= waterLevel) && splverifierCounter == 0) && systemActive == 1) || ((systemActive == 0 && 1 <= waterLevel) && splverifierCounter == 0 && pumpRunning == 0)) || (((splverifierCounter == 0 && pumpRunning == 0) && systemActive == 1) && 1 <= waterLevel) - InvariantResult [Line: 890]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: ((((splverifierCounter == 0 && 1 == \result) && 1 <= waterLevel) && pumpRunning == 0) && systemActive == 1) || (((2 <= waterLevel && splverifierCounter == 0) && pumpRunning == 0) && systemActive == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: (((2 <= waterLevel && splverifierCounter == 0) && systemActive == 1) || (((splverifierCounter == 0 && pumpRunning == 0) && systemActive == 0) && 1 <= waterLevel)) || (((splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) && systemActive == 1) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 272]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 870]: Loop Invariant Derived loop invariant: (waterLevel == 1 && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 272]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 336]: Loop Invariant Derived loop invariant: (((((1 <= tmp___0 && 0 == tmp) && 0 == \result) && splverifierCounter == 0) && 1 <= \result) && 1 <= waterLevel) && systemActive == 1 - InvariantResult [Line: 317]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 317]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 317]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 359]: Loop Invariant Derived loop invariant: (splverifierCounter == 0 && 1 <= waterLevel) && pumpRunning == 0 - InvariantResult [Line: 939]: Loop Invariant Derived loop invariant: (waterLevel == 1 && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((systemActive == 0 && 1 <= waterLevel) && splverifierCounter == 0 && pumpRunning == 0) || ((((!(\result == 0) && 2 <= waterLevel) && splverifierCounter == 0) && !(tmp == 0)) && systemActive == 1)) || (((splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) && systemActive == 1) - InvariantResult [Line: 118]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 119 locations, 3 error locations. SAFE Result, 16.7s OverallTime, 12 OverallIterations, 2 TraceHistogramMax, 5.6s AutomataDifference, 0.0s DeadEndRemovalTime, 8.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1320 SDtfs, 1837 SDslu, 2290 SDs, 0 SdLazy, 301 SolverSat, 68 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 139 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=310occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 1385 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 44 LocationsWithAnnotation, 44 PreInvPairs, 225 NumberOfFragments, 481 HoareAnnotationTreeSize, 44 FomulaSimplifications, 526375 FormulaSimplificationTreeSizeReduction, 1.5s HoareSimplificationTime, 44 FomulaSimplificationsInter, 228221 FormulaSimplificationTreeSizeReductionInter, 6.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 428 NumberOfCodeBlocks, 428 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 415 ConstructedInterpolants, 0 QuantifiedInterpolants, 22842 SizeOfPredicates, 4 NumberOfNonLiveVariables, 403 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 54/56 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...