./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec4_product46_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_product46_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 209a5f451d4da606f6f89775a0cb8490169e98a1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:44:04,599 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 09:44:04,601 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 09:44:04,613 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 09:44:04,614 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 09:44:04,615 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 09:44:04,617 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 09:44:04,618 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 09:44:04,620 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 09:44:04,621 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 09:44:04,622 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 09:44:04,623 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 09:44:04,623 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 09:44:04,625 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 09:44:04,626 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 09:44:04,626 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 09:44:04,628 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 09:44:04,630 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 09:44:04,632 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 09:44:04,634 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 09:44:04,635 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 09:44:04,636 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 09:44:04,639 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 09:44:04,639 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 09:44:04,639 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 09:44:04,640 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 09:44:04,642 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 09:44:04,643 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 09:44:04,643 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 09:44:04,645 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 09:44:04,645 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 09:44:04,646 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 09:44:04,646 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 09:44:04,646 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 09:44:04,648 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 09:44:04,649 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 09:44:04,649 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:44:04,664 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 09:44:04,665 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 09:44:04,666 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 09:44:04,666 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 09:44:04,666 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 09:44:04,667 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 09:44:04,667 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 09:44:04,668 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 09:44:04,668 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 09:44:04,668 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 09:44:04,668 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 09:44:04,668 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 09:44:04,668 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 09:44:04,669 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 09:44:04,670 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 09:44:04,670 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 09:44:04,670 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 09:44:04,670 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 09:44:04,670 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 09:44:04,670 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 09:44:04,671 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 09:44:04,671 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:44:04,671 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 09:44:04,671 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 09:44:04,671 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 09:44:04,672 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 09:44:04,673 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 09:44:04,673 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 09:44:04,673 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 -> 209a5f451d4da606f6f89775a0cb8490169e98a1 [2018-12-31 09:44:04,711 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 09:44:04,729 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 09:44:04,734 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 09:44:04,736 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 09:44:04,736 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 09:44:04,737 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec4_product46_false-unreach-call_false-termination.cil.c [2018-12-31 09:44:04,801 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0b7e6ed3/67338701ef85407d9114e66075535775/FLAGe0af4d4fd [2018-12-31 09:44:05,360 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 09:44:05,361 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec4_product46_false-unreach-call_false-termination.cil.c [2018-12-31 09:44:05,375 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0b7e6ed3/67338701ef85407d9114e66075535775/FLAGe0af4d4fd [2018-12-31 09:44:05,608 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0b7e6ed3/67338701ef85407d9114e66075535775 [2018-12-31 09:44:05,612 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 09:44:05,614 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 09:44:05,615 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 09:44:05,615 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 09:44:05,619 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 09:44:05,620 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:44:05" (1/1) ... [2018-12-31 09:44:05,624 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3277d28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:44:05, skipping insertion in model container [2018-12-31 09:44:05,624 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:44:05" (1/1) ... [2018-12-31 09:44:05,633 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 09:44:05,695 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 09:44:06,102 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:44:06,117 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 09:44:06,281 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:44:06,326 INFO L195 MainTranslator]: Completed translation [2018-12-31 09:44:06,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:44:06 WrapperNode [2018-12-31 09:44:06,326 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 09:44:06,327 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 09:44:06,327 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 09:44:06,328 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 09:44:06,338 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:44:06" (1/1) ... [2018-12-31 09:44:06,370 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:44:06" (1/1) ... [2018-12-31 09:44:06,427 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 09:44:06,427 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 09:44:06,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 09:44:06,428 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 09:44:06,445 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:44:06" (1/1) ... [2018-12-31 09:44:06,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:44:06" (1/1) ... [2018-12-31 09:44:06,458 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:44:06" (1/1) ... [2018-12-31 09:44:06,459 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:44:06" (1/1) ... [2018-12-31 09:44:06,485 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:44:06" (1/1) ... [2018-12-31 09:44:06,498 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:44:06" (1/1) ... [2018-12-31 09:44:06,502 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:44:06" (1/1) ... [2018-12-31 09:44:06,509 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 09:44:06,512 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 09:44:06,512 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 09:44:06,512 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 09:44:06,513 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:44:06" (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:44:06,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 09:44:06,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-31 09:44:06,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 09:44:06,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 09:44:08,423 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 09:44:08,424 INFO L280 CfgBuilder]: Removed 194 assue(true) statements. [2018-12-31 09:44:08,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:44:08 BoogieIcfgContainer [2018-12-31 09:44:08,425 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 09:44:08,426 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 09:44:08,426 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 09:44:08,429 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 09:44:08,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 09:44:05" (1/3) ... [2018-12-31 09:44:08,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@374fe70c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:44:08, skipping insertion in model container [2018-12-31 09:44:08,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:44:06" (2/3) ... [2018-12-31 09:44:08,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@374fe70c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:44:08, skipping insertion in model container [2018-12-31 09:44:08,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:44:08" (3/3) ... [2018-12-31 09:44:08,433 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product46_false-unreach-call_false-termination.cil.c [2018-12-31 09:44:08,444 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 09:44:08,453 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 09:44:08,472 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 09:44:08,507 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 09:44:08,508 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 09:44:08,508 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 09:44:08,508 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 09:44:08,508 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 09:44:08,508 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 09:44:08,509 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 09:44:08,509 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 09:44:08,509 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 09:44:08,528 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2018-12-31 09:44:08,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 09:44:08,535 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:44:08,536 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:44:08,538 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:44:08,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:44:08,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1027746333, now seen corresponding path program 1 times [2018-12-31 09:44:08,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:44:08,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:44:08,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:08,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:44:08,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:08,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:44:08,818 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:44:08,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:44:08,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:44:08,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 09:44:08,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 09:44:08,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 09:44:08,846 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 2 states. [2018-12-31 09:44:08,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:44:08,884 INFO L93 Difference]: Finished difference Result 252 states and 377 transitions. [2018-12-31 09:44:08,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 09:44:08,885 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-12-31 09:44:08,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:44:08,899 INFO L225 Difference]: With dead ends: 252 [2018-12-31 09:44:08,899 INFO L226 Difference]: Without dead ends: 125 [2018-12-31 09:44:08,903 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:44:08,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-12-31 09:44:08,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-12-31 09:44:08,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-12-31 09:44:08,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 180 transitions. [2018-12-31 09:44:08,958 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 180 transitions. Word has length 16 [2018-12-31 09:44:08,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:44:08,958 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 180 transitions. [2018-12-31 09:44:08,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 09:44:08,959 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 180 transitions. [2018-12-31 09:44:08,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-31 09:44:08,962 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:44:08,963 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:44:08,963 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:44:08,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:44:08,964 INFO L82 PathProgramCache]: Analyzing trace with hash -2074503230, now seen corresponding path program 1 times [2018-12-31 09:44:08,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:44:08,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:44:08,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:08,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:44:08,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:44:09,153 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:44:09,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:44:09,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:44:09,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:44:09,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:44:09,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:44:09,158 INFO L87 Difference]: Start difference. First operand 125 states and 180 transitions. Second operand 3 states. [2018-12-31 09:44:09,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:44:09,190 INFO L93 Difference]: Finished difference Result 125 states and 180 transitions. [2018-12-31 09:44:09,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:44:09,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-31 09:44:09,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:44:09,192 INFO L225 Difference]: With dead ends: 125 [2018-12-31 09:44:09,193 INFO L226 Difference]: Without dead ends: 51 [2018-12-31 09:44:09,194 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:44:09,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-31 09:44:09,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-31 09:44:09,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-31 09:44:09,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2018-12-31 09:44:09,201 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 17 [2018-12-31 09:44:09,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:44:09,202 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2018-12-31 09:44:09,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:44:09,202 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2018-12-31 09:44:09,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 09:44:09,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:44:09,203 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:44:09,203 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:44:09,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:44:09,204 INFO L82 PathProgramCache]: Analyzing trace with hash 640818778, now seen corresponding path program 1 times [2018-12-31 09:44:09,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:44:09,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:44:09,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:09,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:44:09,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:09,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:44:09,555 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:44:09,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:44:09,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:44:09,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:44:09,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:44:09,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:44:09,557 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. Second operand 5 states. [2018-12-31 09:44:09,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:44:09,756 INFO L93 Difference]: Finished difference Result 96 states and 140 transitions. [2018-12-31 09:44:09,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 09:44:09,759 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-12-31 09:44:09,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:44:09,760 INFO L225 Difference]: With dead ends: 96 [2018-12-31 09:44:09,760 INFO L226 Difference]: Without dead ends: 51 [2018-12-31 09:44:09,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 09:44:09,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-31 09:44:09,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-31 09:44:09,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-31 09:44:09,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 72 transitions. [2018-12-31 09:44:09,771 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 72 transitions. Word has length 22 [2018-12-31 09:44:09,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:44:09,771 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 72 transitions. [2018-12-31 09:44:09,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:44:09,772 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 72 transitions. [2018-12-31 09:44:09,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-31 09:44:09,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:44:09,774 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:44:09,774 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:44:09,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:44:09,774 INFO L82 PathProgramCache]: Analyzing trace with hash -855709928, now seen corresponding path program 1 times [2018-12-31 09:44:09,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:44:09,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:44:09,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:09,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:44:09,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:09,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:44:09,888 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:44:09,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:44:09,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:44:09,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:44:09,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:44:09,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:44:09,890 INFO L87 Difference]: Start difference. First operand 51 states and 72 transitions. Second operand 3 states. [2018-12-31 09:44:09,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:44:09,999 INFO L93 Difference]: Finished difference Result 117 states and 168 transitions. [2018-12-31 09:44:09,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:44:10,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-31 09:44:10,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:44:10,001 INFO L225 Difference]: With dead ends: 117 [2018-12-31 09:44:10,001 INFO L226 Difference]: Without dead ends: 72 [2018-12-31 09:44:10,002 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:44:10,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-31 09:44:10,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-12-31 09:44:10,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-31 09:44:10,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 98 transitions. [2018-12-31 09:44:10,013 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 98 transitions. Word has length 24 [2018-12-31 09:44:10,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:44:10,014 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 98 transitions. [2018-12-31 09:44:10,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:44:10,014 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2018-12-31 09:44:10,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-31 09:44:10,015 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:44:10,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] [2018-12-31 09:44:10,016 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:44:10,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:44:10,016 INFO L82 PathProgramCache]: Analyzing trace with hash -407287284, now seen corresponding path program 1 times [2018-12-31 09:44:10,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:44:10,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:44:10,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:10,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:44:10,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:10,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:44:10,154 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:44:10,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:44:10,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:44:10,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:44:10,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:44:10,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:44:10,156 INFO L87 Difference]: Start difference. First operand 70 states and 98 transitions. Second operand 5 states. [2018-12-31 09:44:10,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:44:10,521 INFO L93 Difference]: Finished difference Result 247 states and 354 transitions. [2018-12-31 09:44:10,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:44:10,522 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-12-31 09:44:10,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:44:10,524 INFO L225 Difference]: With dead ends: 247 [2018-12-31 09:44:10,524 INFO L226 Difference]: Without dead ends: 183 [2018-12-31 09:44:10,525 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:44:10,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-12-31 09:44:10,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 113. [2018-12-31 09:44:10,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-31 09:44:10,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 155 transitions. [2018-12-31 09:44:10,546 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 155 transitions. Word has length 30 [2018-12-31 09:44:10,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:44:10,546 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 155 transitions. [2018-12-31 09:44:10,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:44:10,548 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 155 transitions. [2018-12-31 09:44:10,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 09:44:10,549 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:44:10,549 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:44:10,550 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:44:10,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:44:10,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1879863818, now seen corresponding path program 1 times [2018-12-31 09:44:10,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:44:10,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:44:10,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:10,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:44:10,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:10,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:44:10,752 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:44:10,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:44:10,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:44:10,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:44:10,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:44:10,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:44:10,754 INFO L87 Difference]: Start difference. First operand 113 states and 155 transitions. Second operand 5 states. [2018-12-31 09:44:11,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:44:11,257 INFO L93 Difference]: Finished difference Result 241 states and 338 transitions. [2018-12-31 09:44:11,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 09:44:11,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-12-31 09:44:11,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:44:11,261 INFO L225 Difference]: With dead ends: 241 [2018-12-31 09:44:11,261 INFO L226 Difference]: Without dead ends: 239 [2018-12-31 09:44:11,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:44:11,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-12-31 09:44:11,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 113. [2018-12-31 09:44:11,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-31 09:44:11,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 154 transitions. [2018-12-31 09:44:11,311 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 154 transitions. Word has length 31 [2018-12-31 09:44:11,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:44:11,312 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 154 transitions. [2018-12-31 09:44:11,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:44:11,312 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 154 transitions. [2018-12-31 09:44:11,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-31 09:44:11,317 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:44:11,317 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] [2018-12-31 09:44:11,318 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:44:11,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:44:11,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1871204221, now seen corresponding path program 1 times [2018-12-31 09:44:11,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:44:11,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:44:11,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:11,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:44:11,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:44:11,489 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:44:11,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:44:11,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:44:11,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:44:11,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:44:11,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:44:11,491 INFO L87 Difference]: Start difference. First operand 113 states and 154 transitions. Second operand 5 states. [2018-12-31 09:44:12,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:44:12,182 INFO L93 Difference]: Finished difference Result 303 states and 412 transitions. [2018-12-31 09:44:12,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:44:12,183 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-12-31 09:44:12,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:44:12,185 INFO L225 Difference]: With dead ends: 303 [2018-12-31 09:44:12,186 INFO L226 Difference]: Without dead ends: 196 [2018-12-31 09:44:12,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 09:44:12,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-12-31 09:44:12,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 122. [2018-12-31 09:44:12,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-31 09:44:12,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 163 transitions. [2018-12-31 09:44:12,218 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 163 transitions. Word has length 34 [2018-12-31 09:44:12,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:44:12,219 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 163 transitions. [2018-12-31 09:44:12,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:44:12,221 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 163 transitions. [2018-12-31 09:44:12,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-31 09:44:12,222 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:44:12,222 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] [2018-12-31 09:44:12,222 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:44:12,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:44:12,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1284398207, now seen corresponding path program 1 times [2018-12-31 09:44:12,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:44:12,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:44:12,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:12,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:44:12,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:44:12,421 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:44:12,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:44:12,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 09:44:12,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 09:44:12,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 09:44:12,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:44:12,424 INFO L87 Difference]: Start difference. First operand 122 states and 163 transitions. Second operand 6 states. [2018-12-31 09:44:12,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:44:12,711 INFO L93 Difference]: Finished difference Result 281 states and 376 transitions. [2018-12-31 09:44:12,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 09:44:12,712 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-12-31 09:44:12,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:44:12,716 INFO L225 Difference]: With dead ends: 281 [2018-12-31 09:44:12,716 INFO L226 Difference]: Without dead ends: 165 [2018-12-31 09:44:12,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-12-31 09:44:12,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-12-31 09:44:12,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 104. [2018-12-31 09:44:12,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-31 09:44:12,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 136 transitions. [2018-12-31 09:44:12,747 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 136 transitions. Word has length 34 [2018-12-31 09:44:12,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:44:12,747 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 136 transitions. [2018-12-31 09:44:12,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 09:44:12,747 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 136 transitions. [2018-12-31 09:44:12,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-31 09:44:12,755 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:44:12,755 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] [2018-12-31 09:44:12,756 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:44:12,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:44:12,756 INFO L82 PathProgramCache]: Analyzing trace with hash 4534529, now seen corresponding path program 1 times [2018-12-31 09:44:12,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:44:12,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:44:12,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:12,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:44:12,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:12,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:44:13,021 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:44:13,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:44:13,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:44:13,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:44:13,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:44:13,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:44:13,025 INFO L87 Difference]: Start difference. First operand 104 states and 136 transitions. Second operand 5 states. [2018-12-31 09:44:13,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:44:13,475 INFO L93 Difference]: Finished difference Result 283 states and 381 transitions. [2018-12-31 09:44:13,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:44:13,476 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-12-31 09:44:13,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:44:13,478 INFO L225 Difference]: With dead ends: 283 [2018-12-31 09:44:13,478 INFO L226 Difference]: Without dead ends: 209 [2018-12-31 09:44:13,479 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:44:13,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-12-31 09:44:13,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 145. [2018-12-31 09:44:13,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-12-31 09:44:13,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 188 transitions. [2018-12-31 09:44:13,509 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 188 transitions. Word has length 34 [2018-12-31 09:44:13,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:44:13,509 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 188 transitions. [2018-12-31 09:44:13,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:44:13,509 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 188 transitions. [2018-12-31 09:44:13,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-31 09:44:13,517 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:44:13,518 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:44:13,518 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:44:13,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:44:13,519 INFO L82 PathProgramCache]: Analyzing trace with hash 596801484, now seen corresponding path program 1 times [2018-12-31 09:44:13,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:44:13,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:44:13,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:13,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:44:13,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:44:13,719 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:44:13,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:44:13,720 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:44:13,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:44:13,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:44:13,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:44:13,907 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:44:13,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:44:13,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-31 09:44:13,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 09:44:13,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 09:44:13,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:44:13,947 INFO L87 Difference]: Start difference. First operand 145 states and 188 transitions. Second operand 6 states. [2018-12-31 09:44:15,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:44:15,001 INFO L93 Difference]: Finished difference Result 449 states and 597 transitions. [2018-12-31 09:44:15,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 09:44:15,001 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-31 09:44:15,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:44:15,004 INFO L225 Difference]: With dead ends: 449 [2018-12-31 09:44:15,004 INFO L226 Difference]: Without dead ends: 334 [2018-12-31 09:44:15,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-12-31 09:44:15,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-12-31 09:44:15,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 197. [2018-12-31 09:44:15,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-12-31 09:44:15,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 258 transitions. [2018-12-31 09:44:15,041 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 258 transitions. Word has length 53 [2018-12-31 09:44:15,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:44:15,041 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 258 transitions. [2018-12-31 09:44:15,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 09:44:15,041 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 258 transitions. [2018-12-31 09:44:15,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-31 09:44:15,042 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:44:15,043 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, 1, 1, 1] [2018-12-31 09:44:15,043 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:44:15,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:44:15,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1994887391, now seen corresponding path program 2 times [2018-12-31 09:44:15,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:44:15,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:44:15,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:15,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:44:15,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:44:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:44:15,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:44:15,670 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 09:44:15,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:44:15 BoogieIcfgContainer [2018-12-31 09:44:15,862 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 09:44:15,862 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 09:44:15,862 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 09:44:15,863 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 09:44:15,864 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:44:08" (3/4) ... [2018-12-31 09:44:15,866 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 09:44:16,084 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 09:44:16,084 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 09:44:16,085 INFO L168 Benchmark]: Toolchain (without parser) took 10472.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 210.2 MB). Free memory was 951.4 MB in the beginning and 975.4 MB in the end (delta: -24.0 MB). Peak memory consumption was 186.3 MB. Max. memory is 11.5 GB. [2018-12-31 09:44:16,087 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:44:16,087 INFO L168 Benchmark]: CACSL2BoogieTranslator took 712.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -165.3 MB). Peak memory consumption was 31.0 MB. Max. memory is 11.5 GB. [2018-12-31 09:44:16,088 INFO L168 Benchmark]: Boogie Procedure Inliner took 99.81 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:44:16,088 INFO L168 Benchmark]: Boogie Preprocessor took 84.11 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: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2018-12-31 09:44:16,089 INFO L168 Benchmark]: RCFGBuilder took 1912.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.4 MB). Peak memory consumption was 59.4 MB. Max. memory is 11.5 GB. [2018-12-31 09:44:16,089 INFO L168 Benchmark]: TraceAbstraction took 7436.16 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 37.1 MB). Peak memory consumption was 110.0 MB. Max. memory is 11.5 GB. [2018-12-31 09:44:16,089 INFO L168 Benchmark]: Witness Printer took 222.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 975.4 MB in the end (delta: 31.4 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2018-12-31 09:44:16,096 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 712.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -165.3 MB). Peak memory consumption was 31.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 99.81 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 84.11 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: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1912.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.4 MB). Peak memory consumption was 59.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7436.16 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 37.1 MB). Peak memory consumption was 110.0 MB. Max. memory is 11.5 GB. * Witness Printer took 222.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 975.4 MB in the end (delta: 31.4 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 543]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L40] int cleanupTimeShifts = 4; [L342] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L555] int pumpRunning = 0; [L556] int systemActive = 1; [L758] int waterLevel = 1; [L759] int methaneLevelCritical = 0; [L121] int retValue_acc ; [L122] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L945] int retValue_acc ; [L948] retValue_acc = 1 [L949] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L128] tmp = valid_product() [L130] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L853] int splverifierCounter ; [L854] int tmp ; [L855] int tmp___0 ; [L856] int tmp___1 ; [L857] int tmp___2 ; [L860] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L862] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L864] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L870] tmp = __VERIFIER_nondet_int() [L872] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L776] COND TRUE waterLevel < 2 [L777] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L880] tmp___0 = __VERIFIER_nondet_int() [L882] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L890] tmp___2 = __VERIFIER_nondet_int() [L892] COND TRUE \read(tmp___2) [L753] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L562] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L569] COND TRUE \read(systemActive) [L617] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L620] COND FALSE !(\read(pumpRunning)) [L591] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L594] COND TRUE ! pumpRunning [L731] int retValue_acc ; [L732] int tmp ; [L733] int tmp___0 ; [L838] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L841] COND FALSE !(waterLevel < 2) [L845] retValue_acc = 0 [L846] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L737] tmp = isHighWaterSensorDry() [L739] COND FALSE !(\read(tmp)) [L742] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L744] retValue_acc = tmp___0 [L745] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L596] tmp = isHighWaterLevel() [L598] COND TRUE \read(tmp) [L650] int tmp ; [L675] int retValue_acc ; [L797] int retValue_acc ; [L800] retValue_acc = methaneLevelCritical [L801] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L679] retValue_acc = isMethaneLevelCritical() [L681] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L654] tmp = isMethaneAlarm() [L656] COND FALSE !(\read(tmp)) [L645] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L148] int tmp ; [L149] int tmp___0 ; [L829] int retValue_acc ; [L832] retValue_acc = waterLevel [L833] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L153] tmp = getWaterLevel() [L155] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L862] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L864] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L870] tmp = __VERIFIER_nondet_int() [L872] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L880] tmp___0 = __VERIFIER_nondet_int() [L882] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L890] tmp___2 = __VERIFIER_nondet_int() [L892] COND TRUE \read(tmp___2) [L753] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L562] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L764] COND TRUE waterLevel > 0 [L765] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L569] COND TRUE \read(systemActive) [L617] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L620] COND TRUE \read(pumpRunning) [L675] int retValue_acc ; [L797] int retValue_acc ; [L800] retValue_acc = methaneLevelCritical [L801] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L679] retValue_acc = isMethaneLevelCritical() [L681] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L622] tmp = isMethaneAlarm() [L624] COND FALSE !(\read(tmp)) [L591] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L594] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L148] int tmp ; [L149] int tmp___0 ; [L829] int retValue_acc ; [L832] retValue_acc = waterLevel [L833] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L153] tmp = getWaterLevel() [L155] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L862] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L864] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L870] tmp = __VERIFIER_nondet_int() [L872] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L880] tmp___0 = __VERIFIER_nondet_int() [L882] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L890] tmp___2 = __VERIFIER_nondet_int() [L892] COND TRUE \read(tmp___2) [L753] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L562] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L764] COND TRUE waterLevel > 0 [L765] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L569] COND TRUE \read(systemActive) [L617] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L620] COND TRUE \read(pumpRunning) [L675] int retValue_acc ; [L797] int retValue_acc ; [L800] retValue_acc = methaneLevelCritical [L801] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L679] retValue_acc = isMethaneLevelCritical() [L681] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L622] tmp = isMethaneAlarm() [L624] COND FALSE !(\read(tmp)) [L591] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L594] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L148] int tmp ; [L149] int tmp___0 ; [L829] int retValue_acc ; [L832] retValue_acc = waterLevel [L833] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L153] tmp = getWaterLevel() [L155] COND TRUE tmp == 0 [L686] int retValue_acc ; [L689] retValue_acc = pumpRunning [L690] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L157] tmp___0 = isPumpRunning() [L159] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L543] __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, 129 locations, 3 error locations. UNSAFE Result, 7.3s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 3.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1058 SDtfs, 1599 SDslu, 1503 SDs, 0 SdLazy, 235 SolverSat, 57 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=197occurred 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.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 534 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 420 NumberOfCodeBlocks, 420 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 337 ConstructedInterpolants, 0 QuantifiedInterpolants, 23665 SizeOfPredicates, 4 NumberOfNonLiveVariables, 413 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...