./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec5_product44_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/product-lines/minepump_spec5_product44_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 a22c1e90e019171affadaeb315d0122780579e6b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 14:55:38,898 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:55:38,900 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:55:38,911 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:55:38,912 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:55:38,912 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:55:38,914 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:55:38,916 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:55:38,918 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:55:38,919 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:55:38,920 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:55:38,920 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:55:38,922 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:55:38,923 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:55:38,924 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:55:38,925 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:55:38,926 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:55:38,928 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:55:38,930 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:55:38,932 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:55:38,933 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:55:38,935 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:55:38,938 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:55:38,938 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:55:38,938 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:55:38,939 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:55:38,941 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:55:38,941 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:55:38,942 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:55:38,943 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:55:38,944 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:55:38,944 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:55:38,945 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:55:38,945 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:55:38,946 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:55:38,946 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:55:38,947 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 14:55:38,979 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:55:38,979 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:55:38,983 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:55:38,983 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:55:38,984 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:55:38,984 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:55:38,984 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:55:38,984 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:55:38,984 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:55:38,985 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:55:38,985 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:55:38,985 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:55:38,985 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:55:38,985 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:55:38,985 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:55:38,987 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:55:38,987 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:55:38,988 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:55:38,988 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:55:38,988 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:55:38,988 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:55:38,988 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:55:38,988 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:55:38,989 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:55:38,989 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:55:38,989 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:55:38,989 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:55:38,989 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:55:38,990 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 -> a22c1e90e019171affadaeb315d0122780579e6b [2019-01-12 14:55:39,046 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:55:39,064 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:55:39,068 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:55:39,069 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:55:39,070 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:55:39,071 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec5_product44_true-unreach-call_false-termination.cil.c [2019-01-12 14:55:39,123 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/221789d59/eb5573f8d324402dbcf473c11c288e97/FLAG4cbc94400 [2019-01-12 14:55:39,556 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:55:39,557 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec5_product44_true-unreach-call_false-termination.cil.c [2019-01-12 14:55:39,571 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/221789d59/eb5573f8d324402dbcf473c11c288e97/FLAG4cbc94400 [2019-01-12 14:55:39,889 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/221789d59/eb5573f8d324402dbcf473c11c288e97 [2019-01-12 14:55:39,893 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:55:39,898 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:55:39,899 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:55:39,899 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:55:39,903 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:55:39,904 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:55:39" (1/1) ... [2019-01-12 14:55:39,906 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ac35d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:39, skipping insertion in model container [2019-01-12 14:55:39,907 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:55:39" (1/1) ... [2019-01-12 14:55:39,919 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:55:39,988 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:55:40,340 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:55:40,364 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:55:40,576 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:55:40,621 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:55:40,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:40 WrapperNode [2019-01-12 14:55:40,622 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:55:40,623 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:55:40,624 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:55:40,624 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:55:40,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:40" (1/1) ... [2019-01-12 14:55:40,657 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:40" (1/1) ... [2019-01-12 14:55:40,731 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:55:40,732 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:55:40,732 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:55:40,732 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:55:40,745 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:40" (1/1) ... [2019-01-12 14:55:40,745 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:40" (1/1) ... [2019-01-12 14:55:40,757 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:40" (1/1) ... [2019-01-12 14:55:40,760 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:40" (1/1) ... [2019-01-12 14:55:40,777 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:40" (1/1) ... [2019-01-12 14:55:40,799 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:40" (1/1) ... [2019-01-12 14:55:40,805 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:40" (1/1) ... [2019-01-12 14:55:40,812 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:55:40,815 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:55:40,815 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:55:40,815 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:55:40,816 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:55:40,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 14:55:40,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-12 14:55:40,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:55:40,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:55:42,147 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:55:42,147 INFO L286 CfgBuilder]: Removed 134 assue(true) statements. [2019-01-12 14:55:42,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:55:42 BoogieIcfgContainer [2019-01-12 14:55:42,149 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:55:42,150 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:55:42,150 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:55:42,154 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:55:42,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:55:39" (1/3) ... [2019-01-12 14:55:42,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b13d9fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:55:42, skipping insertion in model container [2019-01-12 14:55:42,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:40" (2/3) ... [2019-01-12 14:55:42,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b13d9fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:55:42, skipping insertion in model container [2019-01-12 14:55:42,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:55:42" (3/3) ... [2019-01-12 14:55:42,158 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec5_product44_true-unreach-call_false-termination.cil.c [2019-01-12 14:55:42,168 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:55:42,177 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 14:55:42,195 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 14:55:42,232 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:55:42,233 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:55:42,233 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:55:42,233 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:55:42,234 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:55:42,234 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:55:42,234 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:55:42,234 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:55:42,235 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:55:42,261 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2019-01-12 14:55:42,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-12 14:55:42,272 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:42,273 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:55:42,276 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:42,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:42,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1014623904, now seen corresponding path program 1 times [2019-01-12 14:55:42,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:42,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:42,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:42,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:42,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:42,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:55:42,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:55:42,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:55:42,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 14:55:42,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 14:55:42,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:55:42,630 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 2 states. [2019-01-12 14:55:42,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:42,661 INFO L93 Difference]: Finished difference Result 189 states and 280 transitions. [2019-01-12 14:55:42,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 14:55:42,663 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2019-01-12 14:55:42,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:42,677 INFO L225 Difference]: With dead ends: 189 [2019-01-12 14:55:42,678 INFO L226 Difference]: Without dead ends: 94 [2019-01-12 14:55:42,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:55:42,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-12 14:55:42,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-01-12 14:55:42,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-12 14:55:42,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 132 transitions. [2019-01-12 14:55:42,754 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 132 transitions. Word has length 19 [2019-01-12 14:55:42,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:42,754 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 132 transitions. [2019-01-12 14:55:42,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 14:55:42,755 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 132 transitions. [2019-01-12 14:55:42,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-12 14:55:42,756 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:42,756 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:55:42,759 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:42,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:42,760 INFO L82 PathProgramCache]: Analyzing trace with hash 2129327965, now seen corresponding path program 1 times [2019-01-12 14:55:42,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:42,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:42,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:42,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:42,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:42,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:42,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:55:42,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:55:42,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:55:42,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:55:42,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:55:42,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:55:42,905 INFO L87 Difference]: Start difference. First operand 94 states and 132 transitions. Second operand 3 states. [2019-01-12 14:55:42,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:42,933 INFO L93 Difference]: Finished difference Result 94 states and 132 transitions. [2019-01-12 14:55:42,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:55:42,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-01-12 14:55:42,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:42,939 INFO L225 Difference]: With dead ends: 94 [2019-01-12 14:55:42,940 INFO L226 Difference]: Without dead ends: 43 [2019-01-12 14:55:42,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:55:42,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-12 14:55:42,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-12 14:55:42,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-12 14:55:42,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2019-01-12 14:55:42,956 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 20 [2019-01-12 14:55:42,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:42,957 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2019-01-12 14:55:42,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:55:42,957 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2019-01-12 14:55:42,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-12 14:55:42,958 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:42,960 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:55:42,960 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:42,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:42,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1463825694, now seen corresponding path program 1 times [2019-01-12 14:55:42,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:42,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:42,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:42,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:42,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:42,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:43,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:55:43,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:55:43,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:55:43,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:55:43,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:55:43,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:55:43,074 INFO L87 Difference]: Start difference. First operand 43 states and 60 transitions. Second operand 3 states. [2019-01-12 14:55:43,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:43,165 INFO L93 Difference]: Finished difference Result 115 states and 166 transitions. [2019-01-12 14:55:43,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:55:43,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-01-12 14:55:43,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:43,168 INFO L225 Difference]: With dead ends: 115 [2019-01-12 14:55:43,169 INFO L226 Difference]: Without dead ends: 79 [2019-01-12 14:55:43,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:55:43,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-12 14:55:43,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2019-01-12 14:55:43,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-12 14:55:43,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 108 transitions. [2019-01-12 14:55:43,183 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 108 transitions. Word has length 26 [2019-01-12 14:55:43,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:43,184 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 108 transitions. [2019-01-12 14:55:43,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:55:43,184 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 108 transitions. [2019-01-12 14:55:43,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-12 14:55:43,185 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:43,186 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:55:43,187 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:43,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:43,188 INFO L82 PathProgramCache]: Analyzing trace with hash 419511483, now seen corresponding path program 1 times [2019-01-12 14:55:43,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:43,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:43,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:43,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:43,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:43,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:43,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:55:43,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:55:43,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:55:43,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:55:43,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:55:43,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:55:43,311 INFO L87 Difference]: Start difference. First operand 75 states and 108 transitions. Second operand 3 states. [2019-01-12 14:55:43,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:43,508 INFO L93 Difference]: Finished difference Result 190 states and 279 transitions. [2019-01-12 14:55:43,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:55:43,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-01-12 14:55:43,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:43,511 INFO L225 Difference]: With dead ends: 190 [2019-01-12 14:55:43,511 INFO L226 Difference]: Without dead ends: 122 [2019-01-12 14:55:43,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:55:43,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-01-12 14:55:43,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2019-01-12 14:55:43,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-01-12 14:55:43,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 172 transitions. [2019-01-12 14:55:43,531 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 172 transitions. Word has length 27 [2019-01-12 14:55:43,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:43,531 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 172 transitions. [2019-01-12 14:55:43,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:55:43,532 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 172 transitions. [2019-01-12 14:55:43,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-12 14:55:43,533 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:43,534 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:55:43,534 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:43,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:43,535 INFO L82 PathProgramCache]: Analyzing trace with hash -894632213, now seen corresponding path program 1 times [2019-01-12 14:55:43,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:43,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:43,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:43,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:43,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:43,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:43,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:55:43,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:55:43,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:55:43,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:55:43,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:55:43,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:55:43,654 INFO L87 Difference]: Start difference. First operand 120 states and 172 transitions. Second operand 5 states. [2019-01-12 14:55:44,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:44,292 INFO L93 Difference]: Finished difference Result 435 states and 625 transitions. [2019-01-12 14:55:44,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:55:44,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-01-12 14:55:44,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:44,295 INFO L225 Difference]: With dead ends: 435 [2019-01-12 14:55:44,296 INFO L226 Difference]: Without dead ends: 322 [2019-01-12 14:55:44,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:55:44,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-01-12 14:55:44,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 118. [2019-01-12 14:55:44,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-01-12 14:55:44,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 166 transitions. [2019-01-12 14:55:44,322 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 166 transitions. Word has length 29 [2019-01-12 14:55:44,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:44,322 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 166 transitions. [2019-01-12 14:55:44,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:55:44,322 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 166 transitions. [2019-01-12 14:55:44,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-12 14:55:44,324 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:44,324 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:55:44,325 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:44,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:44,325 INFO L82 PathProgramCache]: Analyzing trace with hash -855336384, now seen corresponding path program 1 times [2019-01-12 14:55:44,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:44,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:44,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:44,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:44,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:44,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:44,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:55:44,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:55:44,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:55:44,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:55:44,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:55:44,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:55:44,541 INFO L87 Difference]: Start difference. First operand 118 states and 166 transitions. Second operand 5 states. [2019-01-12 14:55:44,773 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-12 14:55:44,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:44,903 INFO L93 Difference]: Finished difference Result 321 states and 449 transitions. [2019-01-12 14:55:44,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:55:44,905 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-01-12 14:55:44,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:44,906 INFO L225 Difference]: With dead ends: 321 [2019-01-12 14:55:44,906 INFO L226 Difference]: Without dead ends: 210 [2019-01-12 14:55:44,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:55:44,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-01-12 14:55:44,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 124. [2019-01-12 14:55:44,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-01-12 14:55:44,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 172 transitions. [2019-01-12 14:55:44,929 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 172 transitions. Word has length 36 [2019-01-12 14:55:44,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:44,930 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 172 transitions. [2019-01-12 14:55:44,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:55:44,930 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 172 transitions. [2019-01-12 14:55:44,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-12 14:55:44,933 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:44,933 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:55:44,934 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:44,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:44,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1866453634, now seen corresponding path program 1 times [2019-01-12 14:55:44,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:44,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:44,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:44,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:44,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:45,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:55:45,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:55:45,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:55:45,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:55:45,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:55:45,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:55:45,271 INFO L87 Difference]: Start difference. First operand 124 states and 172 transitions. Second operand 5 states. [2019-01-12 14:55:45,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:45,960 INFO L93 Difference]: Finished difference Result 348 states and 476 transitions. [2019-01-12 14:55:45,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:55:45,961 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-01-12 14:55:45,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:45,968 INFO L225 Difference]: With dead ends: 348 [2019-01-12 14:55:45,968 INFO L226 Difference]: Without dead ends: 231 [2019-01-12 14:55:45,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:55:45,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-01-12 14:55:46,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 128. [2019-01-12 14:55:46,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-01-12 14:55:46,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 176 transitions. [2019-01-12 14:55:46,006 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 176 transitions. Word has length 36 [2019-01-12 14:55:46,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:46,009 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 176 transitions. [2019-01-12 14:55:46,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:55:46,009 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 176 transitions. [2019-01-12 14:55:46,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-12 14:55:46,015 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:46,015 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:55:46,016 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:46,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:46,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1407445308, now seen corresponding path program 1 times [2019-01-12 14:55:46,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:46,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:46,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:46,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:46,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:46,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:46,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:55:46,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:55:46,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:55:46,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:55:46,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:55:46,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:55:46,140 INFO L87 Difference]: Start difference. First operand 128 states and 176 transitions. Second operand 3 states. [2019-01-12 14:55:46,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:46,293 INFO L93 Difference]: Finished difference Result 305 states and 418 transitions. [2019-01-12 14:55:46,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:55:46,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-01-12 14:55:46,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:46,297 INFO L225 Difference]: With dead ends: 305 [2019-01-12 14:55:46,297 INFO L226 Difference]: Without dead ends: 184 [2019-01-12 14:55:46,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:55:46,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-01-12 14:55:46,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-01-12 14:55:46,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-01-12 14:55:46,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 245 transitions. [2019-01-12 14:55:46,326 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 245 transitions. Word has length 36 [2019-01-12 14:55:46,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:46,328 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 245 transitions. [2019-01-12 14:55:46,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:55:46,328 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 245 transitions. [2019-01-12 14:55:46,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-12 14:55:46,330 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:46,331 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:55:46,331 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:46,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:46,331 INFO L82 PathProgramCache]: Analyzing trace with hash -67033476, now seen corresponding path program 1 times [2019-01-12 14:55:46,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:46,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:46,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:46,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:46,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:46,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:46,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:55:46,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:55:46,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 14:55:46,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:55:46,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:55:46,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:55:46,511 INFO L87 Difference]: Start difference. First operand 184 states and 245 transitions. Second operand 6 states. [2019-01-12 14:55:46,936 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-12 14:55:47,118 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-12 14:55:47,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:47,629 INFO L93 Difference]: Finished difference Result 689 states and 945 transitions. [2019-01-12 14:55:47,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:55:47,630 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-01-12 14:55:47,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:47,633 INFO L225 Difference]: With dead ends: 689 [2019-01-12 14:55:47,633 INFO L226 Difference]: Without dead ends: 568 [2019-01-12 14:55:47,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-12 14:55:47,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-01-12 14:55:47,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 269. [2019-01-12 14:55:47,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-01-12 14:55:47,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 354 transitions. [2019-01-12 14:55:47,681 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 354 transitions. Word has length 37 [2019-01-12 14:55:47,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:47,682 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 354 transitions. [2019-01-12 14:55:47,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:55:47,682 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 354 transitions. [2019-01-12 14:55:47,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-12 14:55:47,684 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:47,684 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:55:47,684 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:47,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:47,685 INFO L82 PathProgramCache]: Analyzing trace with hash 350167364, now seen corresponding path program 1 times [2019-01-12 14:55:47,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:47,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:47,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:47,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:47,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:47,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:47,816 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:55:47,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:55:47,816 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:55:47,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:47,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:55:48,216 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:55:48,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:55:48,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-01-12 14:55:48,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 14:55:48,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 14:55:48,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:55:48,237 INFO L87 Difference]: Start difference. First operand 269 states and 354 transitions. Second operand 9 states. [2019-01-12 14:55:49,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:49,394 INFO L93 Difference]: Finished difference Result 507 states and 677 transitions. [2019-01-12 14:55:49,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 14:55:49,396 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-01-12 14:55:49,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:49,397 INFO L225 Difference]: With dead ends: 507 [2019-01-12 14:55:49,398 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 14:55:49,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-01-12 14:55:49,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 14:55:49,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 14:55:49,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 14:55:49,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 14:55:49,401 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2019-01-12 14:55:49,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:49,401 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 14:55:49,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 14:55:49,402 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 14:55:49,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 14:55:49,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 14:55:49,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,520 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 61 [2019-01-12 14:55:49,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:49,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:50,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:50,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:50,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:50,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:50,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:50,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:50,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:50,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:50,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:50,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:50,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:50,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:50,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:50,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:50,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:50,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:50,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:50,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:50,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:50,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:51,225 WARN L181 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 60 DAG size of output: 25 [2019-01-12 14:55:51,994 WARN L181 SmtUtils]: Spent 766.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 22 [2019-01-12 14:55:52,270 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 20 [2019-01-12 14:55:53,275 WARN L181 SmtUtils]: Spent 958.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 21 [2019-01-12 14:55:53,476 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 21 [2019-01-12 14:55:53,863 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 21 [2019-01-12 14:55:54,092 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 21 [2019-01-12 14:55:54,223 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 13 [2019-01-12 14:55:54,449 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 21 [2019-01-12 14:55:54,486 INFO L444 ceAbstractionStarter]: At program point L135(lines 126 139) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (= ~pumpRunning~0 0))) (or (and (not (= 0 |ULTIMATE.start_isHighWaterSensorDry_#res|)) .cse0 .cse1 (<= ~waterLevel~0 1)) (and .cse0 (= 2 ~waterLevel~0) .cse1))) [2019-01-12 14:55:54,486 INFO L444 ceAbstractionStarter]: At program point L135-1(lines 126 139) the Hoare annotation is: false [2019-01-12 14:55:54,487 INFO L444 ceAbstractionStarter]: At program point L135-2(lines 126 139) the Hoare annotation is: false [2019-01-12 14:55:54,487 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 14:55:54,487 INFO L448 ceAbstractionStarter]: For program point L53(lines 53 57) no Hoare annotation was computed. [2019-01-12 14:55:54,487 INFO L448 ceAbstractionStarter]: For program point L53-3(lines 53 57) no Hoare annotation was computed. [2019-01-12 14:55:54,487 INFO L444 ceAbstractionStarter]: At program point L879(lines 875 881) the Hoare annotation is: (and (= ~waterLevel~0 1) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2019-01-12 14:55:54,487 INFO L448 ceAbstractionStarter]: For program point L53-6(lines 53 57) no Hoare annotation was computed. [2019-01-12 14:55:54,487 INFO L444 ceAbstractionStarter]: At program point L533(lines 533 539) the Hoare annotation is: (let ((.cse3 (= 2 ~waterLevel~0))) (let ((.cse2 (or .cse3 (<= ~waterLevel~0 1))) (.cse0 (<= 1 ~pumpRunning~0)) (.cse1 (= ULTIMATE.start_test_~splverifierCounter~0 0))) (or (and (<= 1 ~switchedOnBeforeTS~0) .cse0 .cse1 (<= 1 |ULTIMATE.start_isPumpRunning_#res|) .cse2) (and (and .cse1 (= ~pumpRunning~0 0)) .cse2) (and .cse0 .cse1 .cse3)))) [2019-01-12 14:55:54,487 INFO L444 ceAbstractionStarter]: At program point L533-1(lines 533 539) the Hoare annotation is: false [2019-01-12 14:55:54,488 INFO L444 ceAbstractionStarter]: At program point L533-2(lines 533 539) the Hoare annotation is: false [2019-01-12 14:55:54,488 INFO L451 ceAbstractionStarter]: At program point L913(lines 894 916) the Hoare annotation is: true [2019-01-12 14:55:54,488 INFO L444 ceAbstractionStarter]: At program point L831-2(lines 831 845) the Hoare annotation is: false [2019-01-12 14:55:54,488 INFO L444 ceAbstractionStarter]: At program point L815(lines 810 818) the Hoare annotation is: (and (= ~waterLevel~0 1) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2019-01-12 14:55:54,488 INFO L448 ceAbstractionStarter]: For program point L832(line 832) no Hoare annotation was computed. [2019-01-12 14:55:54,488 INFO L448 ceAbstractionStarter]: For program point L733(lines 733 739) no Hoare annotation was computed. [2019-01-12 14:55:54,488 INFO L444 ceAbstractionStarter]: At program point L733-1(lines 733 739) the Hoare annotation is: (let ((.cse3 (= 2 ~waterLevel~0))) (let ((.cse1 (or .cse3 (<= ~waterLevel~0 1))) (.cse2 (<= 1 ~pumpRunning~0)) (.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0))) (or (and (and .cse0 (= ~pumpRunning~0 0)) .cse1) (and (<= 1 ~switchedOnBeforeTS~0) .cse2 .cse0 (<= 1 |ULTIMATE.start_isPumpRunning_#res|) .cse1) (and .cse2 .cse0 .cse3)))) [2019-01-12 14:55:54,488 INFO L444 ceAbstractionStarter]: At program point L122(lines 117 125) the Hoare annotation is: (let ((.cse3 (= 2 ~waterLevel~0))) (let ((.cse0 (<= 1 ~pumpRunning~0)) (.cse1 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse2 (or .cse3 (<= ~waterLevel~0 1)))) (or (and (<= 1 ~switchedOnBeforeTS~0) .cse0 .cse1 (<= 1 |ULTIMATE.start_isPumpRunning_#res|) .cse2) (and .cse0 (= 2 |ULTIMATE.start_getWaterLevel_#res|) .cse1 .cse3) (and .cse1 (= ~pumpRunning~0 0) .cse2)))) [2019-01-12 14:55:54,489 INFO L444 ceAbstractionStarter]: At program point L122-1(lines 117 125) the Hoare annotation is: false [2019-01-12 14:55:54,489 INFO L444 ceAbstractionStarter]: At program point L122-2(lines 117 125) the Hoare annotation is: false [2019-01-12 14:55:54,489 INFO L444 ceAbstractionStarter]: At program point L684(lines 669 687) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (= ~pumpRunning~0 0))) (or (and .cse0 (= 2 ~waterLevel~0) .cse1) (and (= 0 |ULTIMATE.start_isHighWaterLevel_#res|) (not (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~5)) .cse0 (= 0 ULTIMATE.start_isHighWaterLevel_~tmp___0~0) .cse1 (<= ~waterLevel~0 1)))) [2019-01-12 14:55:54,489 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 922) no Hoare annotation was computed. [2019-01-12 14:55:54,489 INFO L444 ceAbstractionStarter]: At program point L684-1(lines 669 687) the Hoare annotation is: false [2019-01-12 14:55:54,489 INFO L444 ceAbstractionStarter]: At program point L684-2(lines 669 687) the Hoare annotation is: false [2019-01-12 14:55:54,489 INFO L444 ceAbstractionStarter]: At program point L90(lines 85 93) the Hoare annotation is: (and (= ULTIMATE.start_test_~splverifierCounter~0 0) (= 2 ~waterLevel~0) (= ~pumpRunning~0 0)) [2019-01-12 14:55:54,489 INFO L444 ceAbstractionStarter]: At program point L90-1(lines 85 93) the Hoare annotation is: false [2019-01-12 14:55:54,490 INFO L444 ceAbstractionStarter]: At program point L90-2(lines 85 93) the Hoare annotation is: false [2019-01-12 14:55:54,490 INFO L444 ceAbstractionStarter]: At program point L933(lines 928 935) the Hoare annotation is: (and (= ~waterLevel~0 1) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2019-01-12 14:55:54,490 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 14:55:54,490 INFO L444 ceAbstractionStarter]: At program point L620(lines 613 623) the Hoare annotation is: (and (= ULTIMATE.start_test_~splverifierCounter~0 0) (= 2 ~waterLevel~0) (= ~pumpRunning~0 0)) [2019-01-12 14:55:54,490 INFO L444 ceAbstractionStarter]: At program point L620-1(lines 613 623) the Hoare annotation is: false [2019-01-12 14:55:54,490 INFO L444 ceAbstractionStarter]: At program point L620-2(lines 613 623) the Hoare annotation is: false [2019-01-12 14:55:54,490 INFO L448 ceAbstractionStarter]: For program point L835(lines 835 839) no Hoare annotation was computed. [2019-01-12 14:55:54,490 INFO L448 ceAbstractionStarter]: For program point L835-1(lines 835 839) no Hoare annotation was computed. [2019-01-12 14:55:54,491 INFO L448 ceAbstractionStarter]: For program point L753(lines 753 768) no Hoare annotation was computed. [2019-01-12 14:55:54,491 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 922) no Hoare annotation was computed. [2019-01-12 14:55:54,491 INFO L448 ceAbstractionStarter]: For program point L77(lines 77 81) no Hoare annotation was computed. [2019-01-12 14:55:54,491 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 14:55:54,491 INFO L448 ceAbstractionStarter]: For program point L904(lines 904 911) no Hoare annotation was computed. [2019-01-12 14:55:54,491 INFO L451 ceAbstractionStarter]: At program point L904-1(lines 904 911) the Hoare annotation is: true [2019-01-12 14:55:54,491 INFO L448 ceAbstractionStarter]: For program point L954(lines 954 971) no Hoare annotation was computed. [2019-01-12 14:55:54,491 INFO L444 ceAbstractionStarter]: At program point L954-1(lines 1 974) the Hoare annotation is: (let ((.cse3 (= 2 ~waterLevel~0))) (let ((.cse2 (<= 1 ~pumpRunning~0)) (.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (or .cse3 (<= ~waterLevel~0 1)))) (or (and (and .cse0 (= ~pumpRunning~0 0)) .cse1) (and .cse2 .cse0 (= 2 |ULTIMATE.start_getWaterLevel_#res|) .cse3 (= ULTIMATE.start___utac_acc__Specification5_spec__3_~tmp~8 2)) (and (<= 1 ~switchedOnBeforeTS~0) .cse2 .cse0 (<= 1 |ULTIMATE.start_isPumpRunning_#res|) .cse1)))) [2019-01-12 14:55:54,491 INFO L448 ceAbstractionStarter]: For program point L954-2(lines 954 971) no Hoare annotation was computed. [2019-01-12 14:55:54,492 INFO L444 ceAbstractionStarter]: At program point L954-3(lines 1 974) the Hoare annotation is: false [2019-01-12 14:55:54,492 INFO L448 ceAbstractionStarter]: For program point L954-4(lines 954 971) no Hoare annotation was computed. [2019-01-12 14:55:54,492 INFO L444 ceAbstractionStarter]: At program point L954-5(lines 1 974) the Hoare annotation is: false [2019-01-12 14:55:54,492 INFO L448 ceAbstractionStarter]: For program point L558(lines 558 575) no Hoare annotation was computed. [2019-01-12 14:55:54,492 INFO L448 ceAbstractionStarter]: For program point L558-1(lines 558 575) no Hoare annotation was computed. [2019-01-12 14:55:54,492 INFO L448 ceAbstractionStarter]: For program point L558-2(lines 558 575) no Hoare annotation was computed. [2019-01-12 14:55:54,492 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 922) no Hoare annotation was computed. [2019-01-12 14:55:54,492 INFO L444 ceAbstractionStarter]: At program point L773(lines 722 774) the Hoare annotation is: false [2019-01-12 14:55:54,492 INFO L448 ceAbstractionStarter]: For program point L922(line 922) no Hoare annotation was computed. [2019-01-12 14:55:54,492 INFO L448 ceAbstractionStarter]: For program point L922-1(line 922) no Hoare annotation was computed. [2019-01-12 14:55:54,493 INFO L448 ceAbstractionStarter]: For program point L922-2(line 922) no Hoare annotation was computed. [2019-01-12 14:55:54,493 INFO L448 ceAbstractionStarter]: For program point L724(lines 723 772) no Hoare annotation was computed. [2019-01-12 14:55:54,493 INFO L444 ceAbstractionStarter]: At program point L526(lines 522 544) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (or (= 2 ~waterLevel~0) (<= ~waterLevel~0 1)))) (or (and (<= 1 ~switchedOnBeforeTS~0) (<= 1 ~pumpRunning~0) .cse0 (<= 1 |ULTIMATE.start_isPumpRunning_#res|) .cse1) (and (and .cse0 (= ~pumpRunning~0 0)) .cse1))) [2019-01-12 14:55:54,493 INFO L444 ceAbstractionStarter]: At program point L526-1(lines 522 544) the Hoare annotation is: false [2019-01-12 14:55:54,493 INFO L444 ceAbstractionStarter]: At program point L526-2(lines 522 544) the Hoare annotation is: false [2019-01-12 14:55:54,493 INFO L444 ceAbstractionStarter]: At program point L807(lines 1 974) the Hoare annotation is: (and (= ~waterLevel~0 1) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2019-01-12 14:55:54,493 INFO L448 ceAbstractionStarter]: For program point L130(lines 130 136) no Hoare annotation was computed. [2019-01-12 14:55:54,493 INFO L448 ceAbstractionStarter]: For program point L130-1(lines 130 136) no Hoare annotation was computed. [2019-01-12 14:55:54,493 INFO L448 ceAbstractionStarter]: For program point L130-2(lines 130 136) no Hoare annotation was computed. [2019-01-12 14:55:54,494 INFO L448 ceAbstractionStarter]: For program point L725(lines 725 729) no Hoare annotation was computed. [2019-01-12 14:55:54,494 INFO L448 ceAbstractionStarter]: For program point L692(lines 692 698) no Hoare annotation was computed. [2019-01-12 14:55:54,494 INFO L444 ceAbstractionStarter]: At program point L692-1(lines 692 698) the Hoare annotation is: (and (= ULTIMATE.start_test_~splverifierCounter~0 0) (= ~pumpRunning~0 0) (or (= 2 ~waterLevel~0) (<= ~waterLevel~0 1))) [2019-01-12 14:55:54,494 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 69) no Hoare annotation was computed. [2019-01-12 14:55:54,494 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 14:55:54,494 INFO L448 ceAbstractionStarter]: For program point L743(lines 743 749) no Hoare annotation was computed. [2019-01-12 14:55:54,494 INFO L444 ceAbstractionStarter]: At program point L743-1(lines 743 749) the Hoare annotation is: (let ((.cse3 (= 2 ~waterLevel~0))) (let ((.cse1 (or .cse3 (<= ~waterLevel~0 1))) (.cse2 (<= 1 ~pumpRunning~0)) (.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0))) (or (and (and .cse0 (= ~pumpRunning~0 0)) .cse1) (and (<= 1 ~switchedOnBeforeTS~0) .cse2 .cse0 (<= 1 |ULTIMATE.start_isPumpRunning_#res|) .cse1) (and .cse2 .cse0 .cse3)))) [2019-01-12 14:55:54,494 INFO L448 ceAbstractionStarter]: For program point L958(lines 958 968) no Hoare annotation was computed. [2019-01-12 14:55:54,494 INFO L448 ceAbstractionStarter]: For program point L958-2(lines 958 968) no Hoare annotation was computed. [2019-01-12 14:55:54,494 INFO L448 ceAbstractionStarter]: For program point L958-4(lines 958 968) no Hoare annotation was computed. [2019-01-12 14:55:54,495 INFO L448 ceAbstractionStarter]: For program point L595(lines 595 601) no Hoare annotation was computed. [2019-01-12 14:55:54,495 INFO L448 ceAbstractionStarter]: For program point L562(lines 562 570) no Hoare annotation was computed. [2019-01-12 14:55:54,495 INFO L448 ceAbstractionStarter]: For program point L562-1(lines 562 570) no Hoare annotation was computed. [2019-01-12 14:55:54,495 INFO L448 ceAbstractionStarter]: For program point L595-2(lines 595 601) no Hoare annotation was computed. [2019-01-12 14:55:54,495 INFO L448 ceAbstractionStarter]: For program point L562-2(lines 562 570) no Hoare annotation was computed. [2019-01-12 14:55:54,495 INFO L448 ceAbstractionStarter]: For program point L595-4(lines 595 601) no Hoare annotation was computed. [2019-01-12 14:55:54,495 INFO L448 ceAbstractionStarter]: For program point L678(lines 678 682) no Hoare annotation was computed. [2019-01-12 14:55:54,495 INFO L448 ceAbstractionStarter]: For program point L678-2(lines 678 682) no Hoare annotation was computed. [2019-01-12 14:55:54,495 INFO L448 ceAbstractionStarter]: For program point L678-3(lines 678 682) no Hoare annotation was computed. [2019-01-12 14:55:54,495 INFO L448 ceAbstractionStarter]: For program point L678-5(lines 678 682) no Hoare annotation was computed. [2019-01-12 14:55:54,495 INFO L448 ceAbstractionStarter]: For program point L678-6(lines 678 682) no Hoare annotation was computed. [2019-01-12 14:55:54,496 INFO L448 ceAbstractionStarter]: For program point L959(lines 959 965) no Hoare annotation was computed. [2019-01-12 14:55:54,496 INFO L448 ceAbstractionStarter]: For program point L678-8(lines 678 682) no Hoare annotation was computed. [2019-01-12 14:55:54,496 INFO L448 ceAbstractionStarter]: For program point L959-2(lines 959 965) no Hoare annotation was computed. [2019-01-12 14:55:54,496 INFO L448 ceAbstractionStarter]: For program point L959-4(lines 959 965) no Hoare annotation was computed. [2019-01-12 14:55:54,498 INFO L448 ceAbstractionStarter]: For program point L761(lines 761 767) no Hoare annotation was computed. [2019-01-12 14:55:54,498 INFO L444 ceAbstractionStarter]: At program point L761-1(lines 1 974) the Hoare annotation is: (let ((.cse3 (= 2 ~waterLevel~0))) (let ((.cse2 (or .cse3 (<= ~waterLevel~0 1))) (.cse0 (<= 1 ~pumpRunning~0)) (.cse1 (= ULTIMATE.start_test_~splverifierCounter~0 0))) (or (and (<= 1 ~switchedOnBeforeTS~0) .cse0 .cse1 (<= 1 |ULTIMATE.start_isPumpRunning_#res|) .cse2) (and (and .cse1 (= ~pumpRunning~0 0)) .cse2) (and .cse0 .cse1 .cse3)))) [2019-01-12 14:55:54,498 INFO L444 ceAbstractionStarter]: At program point L629(lines 624 632) the Hoare annotation is: (let ((.cse3 (= 2 ~waterLevel~0))) (let ((.cse2 (<= 1 ~pumpRunning~0)) (.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse4 (<= 1 |ULTIMATE.start_isPumpRunning_#res|)) (.cse1 (or .cse3 (<= ~waterLevel~0 1)))) (or (and (= 0 |ULTIMATE.start_isPumpRunning_#res|) .cse0 (= ~pumpRunning~0 0) .cse1) (and .cse2 .cse0 .cse3 .cse4) (and (<= 1 ~switchedOnBeforeTS~0) .cse2 .cse0 .cse4 .cse1)))) [2019-01-12 14:55:54,498 INFO L444 ceAbstractionStarter]: At program point L629-1(lines 624 632) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (or (= 2 ~waterLevel~0) (<= ~waterLevel~0 1)))) (or (and (and (= 0 |ULTIMATE.start_isPumpRunning_#res|) .cse0 (= ~pumpRunning~0 0)) .cse1) (and (<= 1 ~switchedOnBeforeTS~0) (<= 1 ~pumpRunning~0) .cse0 (<= 1 |ULTIMATE.start_isPumpRunning_#res|) .cse1))) [2019-01-12 14:55:54,498 INFO L444 ceAbstractionStarter]: At program point L629-2(lines 624 632) the Hoare annotation is: false [2019-01-12 14:55:54,498 INFO L444 ceAbstractionStarter]: At program point L629-3(lines 624 632) the Hoare annotation is: false [2019-01-12 14:55:54,499 INFO L444 ceAbstractionStarter]: At program point L629-4(lines 624 632) the Hoare annotation is: false [2019-01-12 14:55:54,499 INFO L444 ceAbstractionStarter]: At program point L629-5(lines 624 632) the Hoare annotation is: false [2019-01-12 14:55:54,499 INFO L444 ceAbstractionStarter]: At program point L943(lines 526 532) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (or (= 2 ~waterLevel~0) (<= ~waterLevel~0 1)))) (or (and (= 0 |ULTIMATE.start_isPumpRunning_#res|) .cse0 (= ~pumpRunning~0 0) .cse1) (and (<= 1 ~switchedOnBeforeTS~0) (<= 1 ~pumpRunning~0) .cse0 (<= 1 |ULTIMATE.start_isPumpRunning_#res|) .cse1))) [2019-01-12 14:55:54,499 INFO L444 ceAbstractionStarter]: At program point L943-1(lines 526 532) the Hoare annotation is: false [2019-01-12 14:55:54,499 INFO L444 ceAbstractionStarter]: At program point L943-2(lines 526 532) the Hoare annotation is: false [2019-01-12 14:55:54,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:55:54 BoogieIcfgContainer [2019-01-12 14:55:54,543 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:55:54,543 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:55:54,543 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:55:54,544 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:55:54,544 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:55:42" (3/4) ... [2019-01-12 14:55:54,548 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 14:55:54,567 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2019-01-12 14:55:54,568 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2019-01-12 14:55:54,569 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-01-12 14:55:54,569 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 14:55:54,570 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 14:55:54,571 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-12 14:55:54,601 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((splverifierCounter == 0 && pumpRunning == 0) && (2 == waterLevel || waterLevel <= 1)) || ((((1 <= pumpRunning && splverifierCounter == 0) && 2 == \result) && 2 == waterLevel) && tmp == 2)) || ((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && 1 <= \result) && (2 == waterLevel || waterLevel <= 1)) [2019-01-12 14:55:54,602 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((splverifierCounter == 0 && pumpRunning == 0) && (2 == waterLevel || waterLevel <= 1)) || ((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && 1 <= \result) && (2 == waterLevel || waterLevel <= 1))) || ((1 <= pumpRunning && splverifierCounter == 0) && 2 == waterLevel) [2019-01-12 14:55:54,602 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((splverifierCounter == 0 && pumpRunning == 0) && (2 == waterLevel || waterLevel <= 1)) || ((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && 1 <= \result) && (2 == waterLevel || waterLevel <= 1))) || ((1 <= pumpRunning && splverifierCounter == 0) && 2 == waterLevel) [2019-01-12 14:55:54,603 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && 1 <= \result) && (2 == waterLevel || waterLevel <= 1)) || ((splverifierCounter == 0 && pumpRunning == 0) && (2 == waterLevel || waterLevel <= 1))) || ((1 <= pumpRunning && splverifierCounter == 0) && 2 == waterLevel) [2019-01-12 14:55:54,603 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == \result && splverifierCounter == 0) && pumpRunning == 0) && (2 == waterLevel || waterLevel <= 1)) || (((1 <= pumpRunning && splverifierCounter == 0) && 2 == waterLevel) && 1 <= \result)) || ((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && 1 <= \result) && (2 == waterLevel || waterLevel <= 1)) [2019-01-12 14:55:54,603 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == \result && splverifierCounter == 0) && pumpRunning == 0) && (2 == waterLevel || waterLevel <= 1)) || ((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && 1 <= \result) && (2 == waterLevel || waterLevel <= 1)) [2019-01-12 14:55:54,604 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && 1 <= \result) && (2 == waterLevel || waterLevel <= 1)) || ((splverifierCounter == 0 && pumpRunning == 0) && (2 == waterLevel || waterLevel <= 1)) [2019-01-12 14:55:54,604 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && 1 <= \result) && (2 == waterLevel || waterLevel <= 1)) || ((splverifierCounter == 0 && pumpRunning == 0) && (2 == waterLevel || waterLevel <= 1))) || ((1 <= pumpRunning && splverifierCounter == 0) && 2 == waterLevel) [2019-01-12 14:55:54,605 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && 1 <= \result) && (2 == waterLevel || waterLevel <= 1)) || (((1 <= pumpRunning && 2 == \result) && splverifierCounter == 0) && 2 == waterLevel)) || ((splverifierCounter == 0 && pumpRunning == 0) && (2 == waterLevel || waterLevel <= 1)) [2019-01-12 14:55:54,606 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(0 == \result) && splverifierCounter == 0) && pumpRunning == 0) && waterLevel <= 1) || ((splverifierCounter == 0 && 2 == waterLevel) && pumpRunning == 0) [2019-01-12 14:55:54,606 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == \result && splverifierCounter == 0) && pumpRunning == 0) && (2 == waterLevel || waterLevel <= 1)) || ((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && 1 <= \result) && (2 == waterLevel || waterLevel <= 1)) [2019-01-12 14:55:54,606 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((splverifierCounter == 0 && 2 == waterLevel) && pumpRunning == 0) || (((((0 == \result && !(0 == tmp)) && splverifierCounter == 0) && 0 == tmp___0) && pumpRunning == 0) && waterLevel <= 1) [2019-01-12 14:55:54,702 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:55:54,702 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:55:54,704 INFO L168 Benchmark]: Toolchain (without parser) took 14808.95 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 236.5 MB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -254.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:55:54,705 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:55:54,706 INFO L168 Benchmark]: CACSL2BoogieTranslator took 723.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 69.2 MB). Free memory was 951.4 MB in the beginning and 1.0 GB in the end (delta: -96.8 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. [2019-01-12 14:55:54,707 INFO L168 Benchmark]: Boogie Procedure Inliner took 108.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-01-12 14:55:54,707 INFO L168 Benchmark]: Boogie Preprocessor took 82.72 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:55:54,708 INFO L168 Benchmark]: RCFGBuilder took 1333.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 985.3 MB in the end (delta: 55.7 MB). Peak memory consumption was 55.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:55:54,708 INFO L168 Benchmark]: TraceAbstraction took 12392.92 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 167.2 MB). Free memory was 978.2 MB in the beginning and 1.2 GB in the end (delta: -246.5 MB). Peak memory consumption was 367.6 MB. Max. memory is 11.5 GB. [2019-01-12 14:55:54,709 INFO L168 Benchmark]: Witness Printer took 158.67 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:55:54,712 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 723.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 69.2 MB). Free memory was 951.4 MB in the beginning and 1.0 GB in the end (delta: -96.8 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 108.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 82.72 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1333.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 985.3 MB in the end (delta: 55.7 MB). Peak memory consumption was 55.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12392.92 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 167.2 MB). Free memory was 978.2 MB in the beginning and 1.2 GB in the end (delta: -246.5 MB). Peak memory consumption was 367.6 MB. Max. memory is 11.5 GB. * Witness Printer took 158.67 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 922]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 922]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 922]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && 1 <= \result) && (2 == waterLevel || waterLevel <= 1)) || (((1 <= pumpRunning && 2 == \result) && splverifierCounter == 0) && 2 == waterLevel)) || ((splverifierCounter == 0 && pumpRunning == 0) && (2 == waterLevel || waterLevel <= 1)) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((splverifierCounter == 0 && pumpRunning == 0) && (2 == waterLevel || waterLevel <= 1)) || ((((1 <= pumpRunning && splverifierCounter == 0) && 2 == \result) && 2 == waterLevel) && tmp == 2)) || ((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && 1 <= \result) && (2 == waterLevel || waterLevel <= 1)) - InvariantResult [Line: 526]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 522]: Loop Invariant Derived loop invariant: ((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && 1 <= \result) && (2 == waterLevel || waterLevel <= 1)) || ((splverifierCounter == 0 && pumpRunning == 0) && (2 == waterLevel || waterLevel <= 1)) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 522]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 526]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (((!(0 == \result) && splverifierCounter == 0) && pumpRunning == 0) && waterLevel <= 1) || ((splverifierCounter == 0 && 2 == waterLevel) && pumpRunning == 0) - InvariantResult [Line: 522]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 533]: Loop Invariant Derived loop invariant: (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && 1 <= \result) && (2 == waterLevel || waterLevel <= 1)) || ((splverifierCounter == 0 && pumpRunning == 0) && (2 == waterLevel || waterLevel <= 1))) || ((1 <= pumpRunning && splverifierCounter == 0) && 2 == waterLevel) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 624]: Loop Invariant Derived loop invariant: (((0 == \result && splverifierCounter == 0) && pumpRunning == 0) && (2 == waterLevel || waterLevel <= 1)) || ((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && 1 <= \result) && (2 == waterLevel || waterLevel <= 1)) - InvariantResult [Line: 624]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 624]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 733]: Loop Invariant Derived loop invariant: (((splverifierCounter == 0 && pumpRunning == 0) && (2 == waterLevel || waterLevel <= 1)) || ((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && 1 <= \result) && (2 == waterLevel || waterLevel <= 1))) || ((1 <= pumpRunning && splverifierCounter == 0) && 2 == waterLevel) - InvariantResult [Line: 624]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 624]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 722]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 810]: Loop Invariant Derived loop invariant: (waterLevel == 1 && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 875]: Loop Invariant Derived loop invariant: (waterLevel == 1 && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 526]: Loop Invariant Derived loop invariant: (((0 == \result && splverifierCounter == 0) && pumpRunning == 0) && (2 == waterLevel || waterLevel <= 1)) || ((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && 1 <= \result) && (2 == waterLevel || waterLevel <= 1)) - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: (splverifierCounter == 0 && 2 == waterLevel) && pumpRunning == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && 1 <= \result) && (2 == waterLevel || waterLevel <= 1)) || ((splverifierCounter == 0 && pumpRunning == 0) && (2 == waterLevel || waterLevel <= 1))) || ((1 <= pumpRunning && splverifierCounter == 0) && 2 == waterLevel) - InvariantResult [Line: 669]: Loop Invariant Derived loop invariant: ((splverifierCounter == 0 && 2 == waterLevel) && pumpRunning == 0) || (((((0 == \result && !(0 == tmp)) && splverifierCounter == 0) && 0 == tmp___0) && pumpRunning == 0) && waterLevel <= 1) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: (splverifierCounter == 0 && 2 == waterLevel) && pumpRunning == 0 - InvariantResult [Line: 669]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 624]: Loop Invariant Derived loop invariant: ((((0 == \result && splverifierCounter == 0) && pumpRunning == 0) && (2 == waterLevel || waterLevel <= 1)) || (((1 <= pumpRunning && splverifierCounter == 0) && 2 == waterLevel) && 1 <= \result)) || ((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && 1 <= \result) && (2 == waterLevel || waterLevel <= 1)) - InvariantResult [Line: 669]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 533]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 692]: Loop Invariant Derived loop invariant: (splverifierCounter == 0 && pumpRunning == 0) && (2 == waterLevel || waterLevel <= 1) - InvariantResult [Line: 533]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 831]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (waterLevel == 1 && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 904]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 894]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 743]: Loop Invariant Derived loop invariant: (((splverifierCounter == 0 && pumpRunning == 0) && (2 == waterLevel || waterLevel <= 1)) || ((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && 1 <= \result) && (2 == waterLevel || waterLevel <= 1))) || ((1 <= pumpRunning && splverifierCounter == 0) && 2 == waterLevel) - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 928]: Loop Invariant Derived loop invariant: (waterLevel == 1 && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 98 locations, 3 error locations. SAFE Result, 12.2s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 4.5s AutomataDifference, 0.0s DeadEndRemovalTime, 5.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 902 SDtfs, 1262 SDslu, 1402 SDs, 0 SdLazy, 239 SolverSat, 65 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=269occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 698 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 45 PreInvPairs, 181 NumberOfFragments, 605 HoareAnnotationTreeSize, 45 FomulaSimplifications, 82177 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 45 FomulaSimplificationsInter, 8827 FormulaSimplificationTreeSizeReductionInter, 4.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 374 NumberOfCodeBlocks, 374 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 363 ConstructedInterpolants, 0 QuantifiedInterpolants, 27650 SizeOfPredicates, 4 NumberOfNonLiveVariables, 416 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 22/32 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...