./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec4_product37_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/product-lines/minepump_spec4_product37_false-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 903a1f53bc072e1ab483040d7a35aae5e2bdf412 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 09:43:41,588 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 09:43:41,590 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 09:43:41,606 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 09:43:41,607 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 09:43:41,610 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 09:43:41,611 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 09:43:41,614 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 09:43:41,618 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 09:43:41,619 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 09:43:41,627 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 09:43:41,627 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 09:43:41,628 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 09:43:41,630 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 09:43:41,631 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 09:43:41,631 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 09:43:41,634 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 09:43:41,640 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 09:43:41,644 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 09:43:41,647 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 09:43:41,647 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 09:43:41,649 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 09:43:41,651 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 09:43:41,652 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 09:43:41,653 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 09:43:41,654 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 09:43:41,655 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 09:43:41,656 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 09:43:41,656 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 09:43:41,664 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 09:43:41,664 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 09:43:41,665 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 09:43:41,665 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 09:43:41,665 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 09:43:41,668 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 09:43:41,668 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 09:43:41,669 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 09:43:41,698 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 09:43:41,698 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 09:43:41,699 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 09:43:41,699 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 09:43:41,700 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 09:43:41,700 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 09:43:41,701 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 09:43:41,701 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 09:43:41,701 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 09:43:41,701 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 09:43:41,701 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 09:43:41,701 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 09:43:41,701 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 09:43:41,702 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 09:43:41,702 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 09:43:41,702 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 09:43:41,702 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 09:43:41,702 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 09:43:41,703 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 09:43:41,704 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 09:43:41,704 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 09:43:41,704 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:43:41,704 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 09:43:41,705 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 09:43:41,705 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 09:43:41,705 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 09:43:41,705 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 09:43:41,706 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 09:43:41,706 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 -> 903a1f53bc072e1ab483040d7a35aae5e2bdf412 [2018-12-31 09:43:41,759 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 09:43:41,771 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 09:43:41,775 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 09:43:41,776 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 09:43:41,777 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 09:43:41,777 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec4_product37_false-unreach-call_false-termination.cil.c [2018-12-31 09:43:41,839 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/662de2239/c2eeffd960db41cd9f6e19a91f644a5b/FLAG4f8c602a6 [2018-12-31 09:43:42,390 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 09:43:42,391 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec4_product37_false-unreach-call_false-termination.cil.c [2018-12-31 09:43:42,404 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/662de2239/c2eeffd960db41cd9f6e19a91f644a5b/FLAG4f8c602a6 [2018-12-31 09:43:42,635 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/662de2239/c2eeffd960db41cd9f6e19a91f644a5b [2018-12-31 09:43:42,639 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 09:43:42,640 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 09:43:42,641 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 09:43:42,641 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 09:43:42,645 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 09:43:42,646 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:43:42" (1/1) ... [2018-12-31 09:43:42,649 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50c9968d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:42, skipping insertion in model container [2018-12-31 09:43:42,649 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:43:42" (1/1) ... [2018-12-31 09:43:42,657 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 09:43:42,717 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 09:43:43,172 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:43:43,198 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 09:43:43,377 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:43:43,414 INFO L195 MainTranslator]: Completed translation [2018-12-31 09:43:43,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:43 WrapperNode [2018-12-31 09:43:43,415 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 09:43:43,416 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 09:43:43,416 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 09:43:43,416 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 09:43:43,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:43" (1/1) ... [2018-12-31 09:43:43,442 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:43" (1/1) ... [2018-12-31 09:43:43,492 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 09:43:43,493 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 09:43:43,493 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 09:43:43,493 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 09:43:43,504 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:43" (1/1) ... [2018-12-31 09:43:43,504 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:43" (1/1) ... [2018-12-31 09:43:43,509 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:43" (1/1) ... [2018-12-31 09:43:43,510 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:43" (1/1) ... [2018-12-31 09:43:43,521 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:43" (1/1) ... [2018-12-31 09:43:43,531 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:43" (1/1) ... [2018-12-31 09:43:43,535 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:43" (1/1) ... [2018-12-31 09:43:43,541 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 09:43:43,541 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 09:43:43,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 09:43:43,542 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 09:43:43,542 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:43:43,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 09:43:43,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-31 09:43:43,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 09:43:43,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 09:43:45,113 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 09:43:45,113 INFO L280 CfgBuilder]: Removed 156 assue(true) statements. [2018-12-31 09:43:45,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:43:45 BoogieIcfgContainer [2018-12-31 09:43:45,114 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 09:43:45,115 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 09:43:45,115 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 09:43:45,119 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 09:43:45,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 09:43:42" (1/3) ... [2018-12-31 09:43:45,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45988d65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:43:45, skipping insertion in model container [2018-12-31 09:43:45,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:43:43" (2/3) ... [2018-12-31 09:43:45,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45988d65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:43:45, skipping insertion in model container [2018-12-31 09:43:45,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:43:45" (3/3) ... [2018-12-31 09:43:45,123 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product37_false-unreach-call_false-termination.cil.c [2018-12-31 09:43:45,133 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 09:43:45,142 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 09:43:45,160 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 09:43:45,194 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 09:43:45,195 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 09:43:45,195 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 09:43:45,195 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 09:43:45,196 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 09:43:45,196 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 09:43:45,196 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 09:43:45,196 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 09:43:45,196 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 09:43:45,215 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2018-12-31 09:43:45,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 09:43:45,222 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:43:45,223 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:43:45,225 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:43:45,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:43:45,231 INFO L82 PathProgramCache]: Analyzing trace with hash 2109695399, now seen corresponding path program 1 times [2018-12-31 09:43:45,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:43:45,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:43:45,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:45,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:45,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:45,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:43:45,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:43:45,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:43:45,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:43:45,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 09:43:45,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 09:43:45,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 09:43:45,510 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 2 states. [2018-12-31 09:43:45,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:43:45,546 INFO L93 Difference]: Finished difference Result 216 states and 329 transitions. [2018-12-31 09:43:45,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 09:43:45,548 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-12-31 09:43:45,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:43:45,562 INFO L225 Difference]: With dead ends: 216 [2018-12-31 09:43:45,562 INFO L226 Difference]: Without dead ends: 107 [2018-12-31 09:43:45,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 09:43:45,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-31 09:43:45,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-31 09:43:45,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-31 09:43:45,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 156 transitions. [2018-12-31 09:43:45,617 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 156 transitions. Word has length 16 [2018-12-31 09:43:45,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:43:45,617 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 156 transitions. [2018-12-31 09:43:45,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 09:43:45,618 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 156 transitions. [2018-12-31 09:43:45,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-31 09:43:45,619 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:43:45,619 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:43:45,620 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:43:45,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:43:45,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1093063509, now seen corresponding path program 1 times [2018-12-31 09:43:45,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:43:45,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:43:45,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:45,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:45,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:43:45,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:43:45,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:43:45,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:43:45,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:43:45,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:43:45,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:43:45,783 INFO L87 Difference]: Start difference. First operand 107 states and 156 transitions. Second operand 3 states. [2018-12-31 09:43:45,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:43:45,816 INFO L93 Difference]: Finished difference Result 107 states and 156 transitions. [2018-12-31 09:43:45,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:43:45,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-31 09:43:45,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:43:45,818 INFO L225 Difference]: With dead ends: 107 [2018-12-31 09:43:45,818 INFO L226 Difference]: Without dead ends: 45 [2018-12-31 09:43:45,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:43:45,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-31 09:43:45,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-31 09:43:45,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-31 09:43:45,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 65 transitions. [2018-12-31 09:43:45,830 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 65 transitions. Word has length 17 [2018-12-31 09:43:45,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:43:45,831 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 65 transitions. [2018-12-31 09:43:45,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:43:45,831 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 65 transitions. [2018-12-31 09:43:45,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 09:43:45,832 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:43:45,832 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:43:45,837 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:43:45,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:43:45,837 INFO L82 PathProgramCache]: Analyzing trace with hash -720159228, now seen corresponding path program 1 times [2018-12-31 09:43:45,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:43:45,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:43:45,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:45,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:45,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:45,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:43:46,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:43:46,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:43:46,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:43:46,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:43:46,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:43:46,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:43:46,022 INFO L87 Difference]: Start difference. First operand 45 states and 65 transitions. Second operand 3 states. [2018-12-31 09:43:46,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:43:46,045 INFO L93 Difference]: Finished difference Result 84 states and 124 transitions. [2018-12-31 09:43:46,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:43:46,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-31 09:43:46,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:43:46,051 INFO L225 Difference]: With dead ends: 84 [2018-12-31 09:43:46,051 INFO L226 Difference]: Without dead ends: 45 [2018-12-31 09:43:46,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:43:46,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-31 09:43:46,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-31 09:43:46,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-31 09:43:46,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 64 transitions. [2018-12-31 09:43:46,065 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 64 transitions. Word has length 22 [2018-12-31 09:43:46,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:43:46,065 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 64 transitions. [2018-12-31 09:43:46,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:43:46,065 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 64 transitions. [2018-12-31 09:43:46,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-31 09:43:46,066 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:43:46,069 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:43:46,069 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:43:46,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:43:46,069 INFO L82 PathProgramCache]: Analyzing trace with hash 2091202829, now seen corresponding path program 1 times [2018-12-31 09:43:46,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:43:46,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:43:46,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:46,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:46,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:46,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:43:46,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:43:46,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:43:46,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:43:46,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:43:46,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:43:46,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:43:46,187 INFO L87 Difference]: Start difference. First operand 45 states and 64 transitions. Second operand 3 states. [2018-12-31 09:43:46,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:43:46,285 INFO L93 Difference]: Finished difference Result 105 states and 152 transitions. [2018-12-31 09:43:46,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:43:46,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-31 09:43:46,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:43:46,293 INFO L225 Difference]: With dead ends: 105 [2018-12-31 09:43:46,293 INFO L226 Difference]: Without dead ends: 66 [2018-12-31 09:43:46,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:43:46,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-31 09:43:46,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-12-31 09:43:46,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-31 09:43:46,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 90 transitions. [2018-12-31 09:43:46,313 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 90 transitions. Word has length 24 [2018-12-31 09:43:46,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:43:46,313 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 90 transitions. [2018-12-31 09:43:46,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:43:46,313 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 90 transitions. [2018-12-31 09:43:46,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-31 09:43:46,314 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:43:46,314 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] [2018-12-31 09:43:46,317 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:43:46,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:43:46,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1013899842, now seen corresponding path program 1 times [2018-12-31 09:43:46,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:43:46,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:43:46,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:46,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:46,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:46,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:43:46,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:43:46,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:43:46,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:43:46,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:43:46,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:43:46,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:43:46,485 INFO L87 Difference]: Start difference. First operand 64 states and 90 transitions. Second operand 5 states. [2018-12-31 09:43:46,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:43:46,636 INFO L93 Difference]: Finished difference Result 171 states and 239 transitions. [2018-12-31 09:43:46,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:43:46,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-12-31 09:43:46,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:43:46,639 INFO L225 Difference]: With dead ends: 171 [2018-12-31 09:43:46,640 INFO L226 Difference]: Without dead ends: 113 [2018-12-31 09:43:46,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 09:43:46,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-31 09:43:46,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 70. [2018-12-31 09:43:46,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-31 09:43:46,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 96 transitions. [2018-12-31 09:43:46,651 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 96 transitions. Word has length 30 [2018-12-31 09:43:46,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:43:46,651 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 96 transitions. [2018-12-31 09:43:46,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:43:46,652 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 96 transitions. [2018-12-31 09:43:46,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-31 09:43:46,653 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:43:46,653 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] [2018-12-31 09:43:46,653 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:43:46,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:43:46,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1648611201, now seen corresponding path program 1 times [2018-12-31 09:43:46,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:43:46,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:43:46,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:46,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:46,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:43:46,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:43:46,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:43:46,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:43:46,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:43:46,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:43:46,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:43:46,799 INFO L87 Difference]: Start difference. First operand 70 states and 96 transitions. Second operand 5 states. [2018-12-31 09:43:47,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:43:47,100 INFO L93 Difference]: Finished difference Result 247 states and 346 transitions. [2018-12-31 09:43:47,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:43:47,100 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-12-31 09:43:47,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:43:47,103 INFO L225 Difference]: With dead ends: 247 [2018-12-31 09:43:47,103 INFO L226 Difference]: Without dead ends: 183 [2018-12-31 09:43:47,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:43:47,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-12-31 09:43:47,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 113. [2018-12-31 09:43:47,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-31 09:43:47,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 152 transitions. [2018-12-31 09:43:47,121 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 152 transitions. Word has length 30 [2018-12-31 09:43:47,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:43:47,121 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 152 transitions. [2018-12-31 09:43:47,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:43:47,122 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 152 transitions. [2018-12-31 09:43:47,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 09:43:47,123 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:43:47,123 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:43:47,123 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:43:47,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:43:47,124 INFO L82 PathProgramCache]: Analyzing trace with hash -359204993, now seen corresponding path program 1 times [2018-12-31 09:43:47,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:43:47,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:43:47,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:47,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:47,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:47,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:43:47,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:43:47,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:43:47,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:43:47,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:43:47,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:43:47,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:43:47,447 INFO L87 Difference]: Start difference. First operand 113 states and 152 transitions. Second operand 5 states. [2018-12-31 09:43:47,917 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-12-31 09:43:48,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:43:48,595 INFO L93 Difference]: Finished difference Result 241 states and 330 transitions. [2018-12-31 09:43:48,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 09:43:48,596 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-12-31 09:43:48,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:43:48,598 INFO L225 Difference]: With dead ends: 241 [2018-12-31 09:43:48,598 INFO L226 Difference]: Without dead ends: 239 [2018-12-31 09:43:48,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:43:48,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-12-31 09:43:48,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 113. [2018-12-31 09:43:48,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-31 09:43:48,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 151 transitions. [2018-12-31 09:43:48,622 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 151 transitions. Word has length 31 [2018-12-31 09:43:48,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:43:48,623 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 151 transitions. [2018-12-31 09:43:48,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:43:48,623 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 151 transitions. [2018-12-31 09:43:48,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 09:43:48,624 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:43:48,624 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:43:48,626 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:43:48,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:43:48,627 INFO L82 PathProgramCache]: Analyzing trace with hash 880224250, now seen corresponding path program 1 times [2018-12-31 09:43:48,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:43:48,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:43:48,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:48,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:48,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:48,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:43:48,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:43:48,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:43:48,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:43:48,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:43:48,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:43:48,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:43:48,794 INFO L87 Difference]: Start difference. First operand 113 states and 151 transitions. Second operand 5 states. [2018-12-31 09:43:48,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:43:48,977 INFO L93 Difference]: Finished difference Result 266 states and 356 transitions. [2018-12-31 09:43:48,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:43:48,978 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-12-31 09:43:48,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:43:48,979 INFO L225 Difference]: With dead ends: 266 [2018-12-31 09:43:48,979 INFO L226 Difference]: Without dead ends: 159 [2018-12-31 09:43:48,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:43:48,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-31 09:43:48,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 98. [2018-12-31 09:43:48,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-31 09:43:48,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 128 transitions. [2018-12-31 09:43:48,996 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 128 transitions. Word has length 31 [2018-12-31 09:43:48,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:43:48,997 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 128 transitions. [2018-12-31 09:43:48,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:43:48,997 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 128 transitions. [2018-12-31 09:43:48,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 09:43:48,998 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:43:48,998 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:43:48,999 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:43:48,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:43:48,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1138389688, now seen corresponding path program 1 times [2018-12-31 09:43:48,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:43:48,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:43:49,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:49,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:49,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:43:49,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:43:49,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:43:49,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:43:49,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:43:49,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:43:49,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:43:49,207 INFO L87 Difference]: Start difference. First operand 98 states and 128 transitions. Second operand 5 states. [2018-12-31 09:43:49,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:43:49,623 INFO L93 Difference]: Finished difference Result 265 states and 357 transitions. [2018-12-31 09:43:49,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:43:49,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-12-31 09:43:49,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:43:49,627 INFO L225 Difference]: With dead ends: 265 [2018-12-31 09:43:49,627 INFO L226 Difference]: Without dead ends: 197 [2018-12-31 09:43:49,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:43:49,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-12-31 09:43:49,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 139. [2018-12-31 09:43:49,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-12-31 09:43:49,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 180 transitions. [2018-12-31 09:43:49,647 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 180 transitions. Word has length 31 [2018-12-31 09:43:49,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:43:49,649 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 180 transitions. [2018-12-31 09:43:49,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:43:49,649 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 180 transitions. [2018-12-31 09:43:49,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-31 09:43:49,651 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:43:49,652 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:43:49,652 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:43:49,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:43:49,652 INFO L82 PathProgramCache]: Analyzing trace with hash 2022214963, now seen corresponding path program 1 times [2018-12-31 09:43:49,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:43:49,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:43:49,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:49,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:49,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:49,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:43:49,937 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:43:49,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:43:49,938 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 09:43:49,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:43:50,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:43:50,106 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:43:50,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:43:50,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-31 09:43:50,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 09:43:50,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 09:43:50,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:43:50,139 INFO L87 Difference]: Start difference. First operand 139 states and 180 transitions. Second operand 6 states. [2018-12-31 09:43:50,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:43:50,989 INFO L93 Difference]: Finished difference Result 431 states and 573 transitions. [2018-12-31 09:43:50,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 09:43:50,990 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-12-31 09:43:50,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:43:50,992 INFO L225 Difference]: With dead ends: 431 [2018-12-31 09:43:50,992 INFO L226 Difference]: Without dead ends: 322 [2018-12-31 09:43:50,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-12-31 09:43:50,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-12-31 09:43:51,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 191. [2018-12-31 09:43:51,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-12-31 09:43:51,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 250 transitions. [2018-12-31 09:43:51,030 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 250 transitions. Word has length 50 [2018-12-31 09:43:51,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:43:51,031 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 250 transitions. [2018-12-31 09:43:51,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 09:43:51,031 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 250 transitions. [2018-12-31 09:43:51,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-31 09:43:51,039 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:43:51,040 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-31 09:43:51,040 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:43:51,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:43:51,040 INFO L82 PathProgramCache]: Analyzing trace with hash 866267864, now seen corresponding path program 2 times [2018-12-31 09:43:51,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:43:51,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:43:51,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:51,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:43:51,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:43:51,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:43:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:43:51,718 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 09:43:51,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:43:51 BoogieIcfgContainer [2018-12-31 09:43:51,915 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 09:43:51,915 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 09:43:51,915 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 09:43:51,916 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 09:43:51,916 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:43:45" (3/4) ... [2018-12-31 09:43:51,921 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 09:43:52,092 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 09:43:52,092 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 09:43:52,093 INFO L168 Benchmark]: Toolchain (without parser) took 9453.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 214.4 MB). Free memory was 952.7 MB in the beginning and 981.4 MB in the end (delta: -28.7 MB). Peak memory consumption was 185.8 MB. Max. memory is 11.5 GB. [2018-12-31 09:43:52,094 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:43:52,094 INFO L168 Benchmark]: CACSL2BoogieTranslator took 774.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -170.1 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2018-12-31 09:43:52,094 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.01 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:43:52,094 INFO L168 Benchmark]: Boogie Preprocessor took 48.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-31 09:43:52,095 INFO L168 Benchmark]: RCFGBuilder took 1572.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 59.0 MB). Peak memory consumption was 59.0 MB. Max. memory is 11.5 GB. [2018-12-31 09:43:52,095 INFO L168 Benchmark]: TraceAbstraction took 6799.58 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.3 MB). Peak memory consumption was 116.6 MB. Max. memory is 11.5 GB. [2018-12-31 09:43:52,095 INFO L168 Benchmark]: Witness Printer took 176.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 981.4 MB in the end (delta: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2018-12-31 09:43:52,098 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.16 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 774.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -170.1 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 77.01 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1572.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 59.0 MB). Peak memory consumption was 59.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6799.58 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.3 MB). Peak memory consumption was 116.6 MB. Max. memory is 11.5 GB. * Witness Printer took 176.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 981.4 MB in the end (delta: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 434]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L155] int pumpRunning = 0; [L156] int systemActive = 1; [L334] int cleanupTimeShifts = 4; [L440] int waterLevel = 1; [L441] int methaneLevelCritical = 0; [L703] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L407] int retValue_acc ; [L408] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L69] int retValue_acc ; [L72] retValue_acc = 1 [L73] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L414] tmp = valid_product() [L416] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L83] int splverifierCounter ; [L84] int tmp ; [L85] int tmp___0 ; [L86] int tmp___1 ; [L87] int tmp___2 ; [L90] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L92] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L94] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L100] tmp = __VERIFIER_nondet_int() [L102] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L458] COND TRUE waterLevel < 2 [L459] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L110] tmp___0 = __VERIFIER_nondet_int() [L112] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L120] tmp___2 = __VERIFIER_nondet_int() [L122] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L163] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L170] COND TRUE \read(systemActive) [L218] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L221] COND FALSE !(\read(pumpRunning)) [L192] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L195] COND TRUE ! pumpRunning [L315] int retValue_acc ; [L316] int tmp ; [L317] int tmp___0 ; [L520] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L523] COND FALSE !(waterLevel < 2) [L527] retValue_acc = 0 [L528] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L321] tmp = isHighWaterSensorDry() [L323] COND FALSE !(\read(tmp)) [L326] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L328] retValue_acc = tmp___0 [L329] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L197] tmp = isHighWaterLevel() [L199] COND TRUE \read(tmp) [L246] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L901] int tmp ; [L902] int tmp___0 ; [L511] int retValue_acc ; [L514] retValue_acc = waterLevel [L515] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L906] tmp = getWaterLevel() [L908] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L92] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L94] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L100] tmp = __VERIFIER_nondet_int() [L102] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L110] tmp___0 = __VERIFIER_nondet_int() [L112] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L120] tmp___2 = __VERIFIER_nondet_int() [L122] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L163] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L446] COND TRUE waterLevel > 0 [L447] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L170] COND TRUE \read(systemActive) [L218] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L221] COND TRUE \read(pumpRunning) [L259] int retValue_acc ; [L479] int retValue_acc ; [L482] retValue_acc = methaneLevelCritical [L483] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L263] retValue_acc = isMethaneLevelCritical() [L265] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L223] tmp = isMethaneAlarm() [L225] COND FALSE !(\read(tmp)) [L192] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L195] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L901] int tmp ; [L902] int tmp___0 ; [L511] int retValue_acc ; [L514] retValue_acc = waterLevel [L515] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L906] tmp = getWaterLevel() [L908] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L92] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L94] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L100] tmp = __VERIFIER_nondet_int() [L102] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L110] tmp___0 = __VERIFIER_nondet_int() [L112] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L120] tmp___2 = __VERIFIER_nondet_int() [L122] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L163] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L446] COND TRUE waterLevel > 0 [L447] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L170] COND TRUE \read(systemActive) [L218] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L221] COND TRUE \read(pumpRunning) [L259] int retValue_acc ; [L479] int retValue_acc ; [L482] retValue_acc = methaneLevelCritical [L483] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L263] retValue_acc = isMethaneLevelCritical() [L265] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L223] tmp = isMethaneAlarm() [L225] COND FALSE !(\read(tmp)) [L192] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L195] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L901] int tmp ; [L902] int tmp___0 ; [L511] int retValue_acc ; [L514] retValue_acc = waterLevel [L515] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L906] tmp = getWaterLevel() [L908] COND TRUE tmp == 0 [L270] int retValue_acc ; [L273] retValue_acc = pumpRunning [L274] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L910] tmp___0 = isPumpRunning() [L912] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L434] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 111 locations, 3 error locations. UNSAFE Result, 6.7s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 952 SDtfs, 1206 SDslu, 1382 SDs, 0 SdLazy, 233 SolverSat, 56 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=191occurred in iteration=10, 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.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 491 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 401 NumberOfCodeBlocks, 401 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 321 ConstructedInterpolants, 0 QuantifiedInterpolants, 22445 SizeOfPredicates, 4 NumberOfNonLiveVariables, 393 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 22/28 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...