./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec4_product37.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/product-lines/minepump_spec4_product37.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-30f4e4a [2019-11-28 00:22:45,591 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:22:45,593 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:22:45,610 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:22:45,611 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:22:45,613 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:22:45,615 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:22:45,623 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:22:45,628 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:22:45,631 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:22:45,632 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:22:45,634 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:22:45,634 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:22:45,637 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:22:45,638 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:22:45,639 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:22:45,640 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:22:45,641 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:22:45,644 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:22:45,648 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:22:45,651 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:22:45,655 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:22:45,656 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:22:45,658 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:22:45,661 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:22:45,661 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:22:45,661 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:22:45,663 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:22:45,663 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:22:45,664 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:22:45,665 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:22:45,665 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:22:45,666 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:22:45,667 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:22:45,668 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:22:45,668 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:22:45,669 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:22:45,669 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:22:45,670 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:22:45,670 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:22:45,672 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:22:45,672 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:22:45,700 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:22:45,700 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:22:45,703 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:22:45,703 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:22:45,704 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:22:45,704 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:22:45,704 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:22:45,705 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:22:45,705 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:22:45,705 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:22:45,706 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:22:45,706 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:22:45,706 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:22:45,707 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:22:45,707 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:22:45,707 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:22:45,708 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:22:45,708 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:22:45,708 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:22:45,709 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:22:45,709 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:22:45,711 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:22:45,711 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:22:45,713 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:22:45,713 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:22:45,713 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:22:45,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:22:45,714 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:22:45,714 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2019-11-28 00:22:46,004 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:22:46,021 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:22:46,025 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:22:46,026 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:22:46,026 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:22:46,028 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec4_product37.cil.c [2019-11-28 00:22:46,101 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0532c89c4/b9eb379d83914d2c98743c9e0f75ff05/FLAGd3c3a8988 [2019-11-28 00:22:46,635 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:22:46,638 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product37.cil.c [2019-11-28 00:22:46,660 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0532c89c4/b9eb379d83914d2c98743c9e0f75ff05/FLAGd3c3a8988 [2019-11-28 00:22:46,976 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0532c89c4/b9eb379d83914d2c98743c9e0f75ff05 [2019-11-28 00:22:46,980 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:22:46,982 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:22:46,984 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:22:46,984 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:22:46,988 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:22:46,989 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:22:46" (1/1) ... [2019-11-28 00:22:46,992 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e2f9c1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:46, skipping insertion in model container [2019-11-28 00:22:46,993 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:22:46" (1/1) ... [2019-11-28 00:22:47,001 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:22:47,062 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:22:47,453 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:22:47,468 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:22:47,571 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:22:47,604 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:22:47,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:47 WrapperNode [2019-11-28 00:22:47,605 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:22:47,606 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:22:47,606 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:22:47,606 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:22:47,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:47" (1/1) ... [2019-11-28 00:22:47,633 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:47" (1/1) ... [2019-11-28 00:22:47,679 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:22:47,679 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:22:47,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:22:47,680 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:22:47,688 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:47" (1/1) ... [2019-11-28 00:22:47,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:47" (1/1) ... [2019-11-28 00:22:47,693 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:47" (1/1) ... [2019-11-28 00:22:47,693 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:47" (1/1) ... [2019-11-28 00:22:47,705 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:47" (1/1) ... [2019-11-28 00:22:47,714 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:47" (1/1) ... [2019-11-28 00:22:47,717 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:47" (1/1) ... [2019-11-28 00:22:47,722 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:22:47,723 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:22:47,723 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:22:47,723 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:22:47,724 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:22:47,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 00:22:47,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 00:22:47,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:22:47,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:22:48,589 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:22:48,589 INFO L297 CfgBuilder]: Removed 156 assume(true) statements. [2019-11-28 00:22:48,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:22:48 BoogieIcfgContainer [2019-11-28 00:22:48,591 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:22:48,592 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:22:48,592 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:22:48,595 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:22:48,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:22:46" (1/3) ... [2019-11-28 00:22:48,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ce553fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:22:48, skipping insertion in model container [2019-11-28 00:22:48,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:47" (2/3) ... [2019-11-28 00:22:48,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ce553fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:22:48, skipping insertion in model container [2019-11-28 00:22:48,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:22:48" (3/3) ... [2019-11-28 00:22:48,599 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product37.cil.c [2019-11-28 00:22:48,609 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:22:48,616 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 00:22:48,628 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 00:22:48,654 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:22:48,654 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:22:48,654 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:22:48,655 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:22:48,655 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:22:48,655 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:22:48,655 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:22:48,656 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:22:48,673 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2019-11-28 00:22:48,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 00:22:48,680 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:48,681 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:22:48,682 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:48,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:48,686 INFO L82 PathProgramCache]: Analyzing trace with hash 2109695399, now seen corresponding path program 1 times [2019-11-28 00:22:48,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:48,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785533468] [2019-11-28 00:22:48,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:48,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:48,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:22:48,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785533468] [2019-11-28 00:22:48,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:48,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:22:48,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615586280] [2019-11-28 00:22:48,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 00:22:48,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:48,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 00:22:48,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 00:22:48,977 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 2 states. [2019-11-28 00:22:49,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:49,018 INFO L93 Difference]: Finished difference Result 216 states and 329 transitions. [2019-11-28 00:22:49,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 00:22:49,020 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-28 00:22:49,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:49,032 INFO L225 Difference]: With dead ends: 216 [2019-11-28 00:22:49,032 INFO L226 Difference]: Without dead ends: 107 [2019-11-28 00:22:49,036 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 00:22:49,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-28 00:22:49,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-28 00:22:49,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-28 00:22:49,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 156 transitions. [2019-11-28 00:22:49,084 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 156 transitions. Word has length 16 [2019-11-28 00:22:49,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:49,085 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 156 transitions. [2019-11-28 00:22:49,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 00:22:49,085 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 156 transitions. [2019-11-28 00:22:49,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 00:22:49,087 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:49,087 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:22:49,088 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:49,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:49,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1093063509, now seen corresponding path program 1 times [2019-11-28 00:22:49,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:49,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624990250] [2019-11-28 00:22:49,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:49,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:49,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:22:49,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624990250] [2019-11-28 00:22:49,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:49,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:22:49,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585939698] [2019-11-28 00:22:49,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:22:49,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:49,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:22:49,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:22:49,196 INFO L87 Difference]: Start difference. First operand 107 states and 156 transitions. Second operand 3 states. [2019-11-28 00:22:49,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:49,219 INFO L93 Difference]: Finished difference Result 107 states and 156 transitions. [2019-11-28 00:22:49,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:22:49,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 00:22:49,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:49,221 INFO L225 Difference]: With dead ends: 107 [2019-11-28 00:22:49,221 INFO L226 Difference]: Without dead ends: 45 [2019-11-28 00:22:49,224 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:22:49,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-28 00:22:49,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-11-28 00:22:49,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 00:22:49,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 65 transitions. [2019-11-28 00:22:49,236 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 65 transitions. Word has length 17 [2019-11-28 00:22:49,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:49,237 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 65 transitions. [2019-11-28 00:22:49,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:22:49,237 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 65 transitions. [2019-11-28 00:22:49,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 00:22:49,239 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:49,239 INFO L410 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] [2019-11-28 00:22:49,240 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:49,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:49,241 INFO L82 PathProgramCache]: Analyzing trace with hash -720159228, now seen corresponding path program 1 times [2019-11-28 00:22:49,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:49,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529108274] [2019-11-28 00:22:49,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:49,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:49,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:22:49,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529108274] [2019-11-28 00:22:49,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:49,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:22:49,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575021668] [2019-11-28 00:22:49,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:22:49,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:49,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:22:49,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:22:49,368 INFO L87 Difference]: Start difference. First operand 45 states and 65 transitions. Second operand 3 states. [2019-11-28 00:22:49,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:49,388 INFO L93 Difference]: Finished difference Result 84 states and 124 transitions. [2019-11-28 00:22:49,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:22:49,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 00:22:49,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:49,391 INFO L225 Difference]: With dead ends: 84 [2019-11-28 00:22:49,393 INFO L226 Difference]: Without dead ends: 45 [2019-11-28 00:22:49,393 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:22:49,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-28 00:22:49,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-11-28 00:22:49,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 00:22:49,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 64 transitions. [2019-11-28 00:22:49,408 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 64 transitions. Word has length 22 [2019-11-28 00:22:49,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:49,408 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 64 transitions. [2019-11-28 00:22:49,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:22:49,410 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 64 transitions. [2019-11-28 00:22:49,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 00:22:49,413 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:49,413 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:22:49,414 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:49,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:49,415 INFO L82 PathProgramCache]: Analyzing trace with hash 2091202829, now seen corresponding path program 1 times [2019-11-28 00:22:49,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:49,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551445547] [2019-11-28 00:22:49,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:49,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:22:49,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551445547] [2019-11-28 00:22:49,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:49,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:22:49,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094464469] [2019-11-28 00:22:49,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:22:49,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:49,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:22:49,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:22:49,510 INFO L87 Difference]: Start difference. First operand 45 states and 64 transitions. Second operand 3 states. [2019-11-28 00:22:49,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:49,575 INFO L93 Difference]: Finished difference Result 105 states and 152 transitions. [2019-11-28 00:22:49,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:22:49,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 00:22:49,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:49,579 INFO L225 Difference]: With dead ends: 105 [2019-11-28 00:22:49,581 INFO L226 Difference]: Without dead ends: 66 [2019-11-28 00:22:49,582 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:22:49,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-28 00:22:49,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-11-28 00:22:49,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-28 00:22:49,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 90 transitions. [2019-11-28 00:22:49,601 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 90 transitions. Word has length 24 [2019-11-28 00:22:49,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:49,601 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 90 transitions. [2019-11-28 00:22:49,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:22:49,602 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 90 transitions. [2019-11-28 00:22:49,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 00:22:49,604 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:49,604 INFO L410 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] [2019-11-28 00:22:49,604 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:49,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:49,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1013899842, now seen corresponding path program 1 times [2019-11-28 00:22:49,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:49,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236075580] [2019-11-28 00:22:49,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:49,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:49,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:22:49,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236075580] [2019-11-28 00:22:49,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:49,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:22:49,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022907097] [2019-11-28 00:22:49,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:49,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:49,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:49,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:49,740 INFO L87 Difference]: Start difference. First operand 64 states and 90 transitions. Second operand 5 states. [2019-11-28 00:22:49,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:49,849 INFO L93 Difference]: Finished difference Result 171 states and 239 transitions. [2019-11-28 00:22:49,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:22:49,854 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-28 00:22:49,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:49,855 INFO L225 Difference]: With dead ends: 171 [2019-11-28 00:22:49,856 INFO L226 Difference]: Without dead ends: 113 [2019-11-28 00:22:49,856 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:22:49,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-28 00:22:49,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 70. [2019-11-28 00:22:49,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-28 00:22:49,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 96 transitions. [2019-11-28 00:22:49,873 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 96 transitions. Word has length 30 [2019-11-28 00:22:49,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:49,874 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 96 transitions. [2019-11-28 00:22:49,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:49,874 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 96 transitions. [2019-11-28 00:22:49,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 00:22:49,880 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:49,880 INFO L410 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] [2019-11-28 00:22:49,880 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:49,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:49,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1648611201, now seen corresponding path program 1 times [2019-11-28 00:22:49,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:49,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915467552] [2019-11-28 00:22:49,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:49,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:49,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:22:49,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915467552] [2019-11-28 00:22:49,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:49,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:22:49,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114883909] [2019-11-28 00:22:49,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:49,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:49,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:49,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:49,977 INFO L87 Difference]: Start difference. First operand 70 states and 96 transitions. Second operand 5 states. [2019-11-28 00:22:50,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:50,081 INFO L93 Difference]: Finished difference Result 247 states and 346 transitions. [2019-11-28 00:22:50,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:22:50,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-28 00:22:50,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:50,083 INFO L225 Difference]: With dead ends: 247 [2019-11-28 00:22:50,084 INFO L226 Difference]: Without dead ends: 183 [2019-11-28 00:22:50,085 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:22:50,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-11-28 00:22:50,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 113. [2019-11-28 00:22:50,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-28 00:22:50,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 152 transitions. [2019-11-28 00:22:50,100 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 152 transitions. Word has length 30 [2019-11-28 00:22:50,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:50,101 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 152 transitions. [2019-11-28 00:22:50,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:50,101 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 152 transitions. [2019-11-28 00:22:50,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 00:22:50,102 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:50,103 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:22:50,103 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:50,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:50,104 INFO L82 PathProgramCache]: Analyzing trace with hash -359204993, now seen corresponding path program 1 times [2019-11-28 00:22:50,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:50,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8806302] [2019-11-28 00:22:50,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:50,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:50,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:22:50,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8806302] [2019-11-28 00:22:50,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:50,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:22:50,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254062477] [2019-11-28 00:22:50,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:50,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:50,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:50,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:50,171 INFO L87 Difference]: Start difference. First operand 113 states and 152 transitions. Second operand 5 states. [2019-11-28 00:22:50,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:50,295 INFO L93 Difference]: Finished difference Result 241 states and 330 transitions. [2019-11-28 00:22:50,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:22:50,296 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-28 00:22:50,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:50,298 INFO L225 Difference]: With dead ends: 241 [2019-11-28 00:22:50,298 INFO L226 Difference]: Without dead ends: 239 [2019-11-28 00:22:50,298 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 00:22:50,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-11-28 00:22:50,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 113. [2019-11-28 00:22:50,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-28 00:22:50,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 151 transitions. [2019-11-28 00:22:50,314 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 151 transitions. Word has length 31 [2019-11-28 00:22:50,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:50,314 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 151 transitions. [2019-11-28 00:22:50,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:50,315 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 151 transitions. [2019-11-28 00:22:50,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 00:22:50,316 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:50,316 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:22:50,317 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:50,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:50,317 INFO L82 PathProgramCache]: Analyzing trace with hash 880224250, now seen corresponding path program 1 times [2019-11-28 00:22:50,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:50,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602834503] [2019-11-28 00:22:50,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:50,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:50,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:22:50,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602834503] [2019-11-28 00:22:50,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:50,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:22:50,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747901588] [2019-11-28 00:22:50,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:50,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:50,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:50,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:50,385 INFO L87 Difference]: Start difference. First operand 113 states and 151 transitions. Second operand 5 states. [2019-11-28 00:22:50,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:50,464 INFO L93 Difference]: Finished difference Result 266 states and 356 transitions. [2019-11-28 00:22:50,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:22:50,465 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-28 00:22:50,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:50,466 INFO L225 Difference]: With dead ends: 266 [2019-11-28 00:22:50,466 INFO L226 Difference]: Without dead ends: 159 [2019-11-28 00:22:50,467 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:22:50,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-28 00:22:50,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 98. [2019-11-28 00:22:50,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-28 00:22:50,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 128 transitions. [2019-11-28 00:22:50,480 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 128 transitions. Word has length 31 [2019-11-28 00:22:50,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:50,480 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 128 transitions. [2019-11-28 00:22:50,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:50,481 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 128 transitions. [2019-11-28 00:22:50,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 00:22:50,482 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:50,482 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:22:50,482 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:50,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:50,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1138389688, now seen corresponding path program 1 times [2019-11-28 00:22:50,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:50,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025955705] [2019-11-28 00:22:50,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:50,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:50,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:22:50,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025955705] [2019-11-28 00:22:50,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:50,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:22:50,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815628514] [2019-11-28 00:22:50,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:50,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:50,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:50,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:50,538 INFO L87 Difference]: Start difference. First operand 98 states and 128 transitions. Second operand 5 states. [2019-11-28 00:22:50,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:50,664 INFO L93 Difference]: Finished difference Result 265 states and 357 transitions. [2019-11-28 00:22:50,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:22:50,665 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-28 00:22:50,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:50,666 INFO L225 Difference]: With dead ends: 265 [2019-11-28 00:22:50,666 INFO L226 Difference]: Without dead ends: 197 [2019-11-28 00:22:50,667 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:22:50,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-11-28 00:22:50,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 139. [2019-11-28 00:22:50,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-11-28 00:22:50,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 180 transitions. [2019-11-28 00:22:50,683 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 180 transitions. Word has length 31 [2019-11-28 00:22:50,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:50,686 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 180 transitions. [2019-11-28 00:22:50,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:50,687 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 180 transitions. [2019-11-28 00:22:50,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 00:22:50,689 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:50,690 INFO L410 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] [2019-11-28 00:22:50,690 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:50,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:50,691 INFO L82 PathProgramCache]: Analyzing trace with hash 2022214963, now seen corresponding path program 1 times [2019-11-28 00:22:50,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:50,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30597446] [2019-11-28 00:22:50,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:50,807 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:22:50,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30597446] [2019-11-28 00:22:50,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325935348] [2019-11-28 00:22:50,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:22:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:50,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 00:22:50,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:22:51,024 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:22:51,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:22:51,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-11-28 00:22:51,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704870740] [2019-11-28 00:22:51,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:22:51,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:51,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:22:51,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:22:51,027 INFO L87 Difference]: Start difference. First operand 139 states and 180 transitions. Second operand 6 states. [2019-11-28 00:22:51,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:51,193 INFO L93 Difference]: Finished difference Result 431 states and 573 transitions. [2019-11-28 00:22:51,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:22:51,194 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2019-11-28 00:22:51,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:51,196 INFO L225 Difference]: With dead ends: 431 [2019-11-28 00:22:51,196 INFO L226 Difference]: Without dead ends: 322 [2019-11-28 00:22:51,197 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-11-28 00:22:51,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-11-28 00:22:51,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 191. [2019-11-28 00:22:51,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-11-28 00:22:51,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 250 transitions. [2019-11-28 00:22:51,222 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 250 transitions. Word has length 50 [2019-11-28 00:22:51,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:51,222 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 250 transitions. [2019-11-28 00:22:51,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:22:51,223 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 250 transitions. [2019-11-28 00:22:51,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-28 00:22:51,223 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:51,224 INFO L410 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] [2019-11-28 00:22:51,428 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:22:51,428 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:51,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:51,429 INFO L82 PathProgramCache]: Analyzing trace with hash 866267864, now seen corresponding path program 2 times [2019-11-28 00:22:51,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:51,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948545642] [2019-11-28 00:22:51,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:51,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:22:51,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:22:51,582 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 00:22:51,582 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 00:22:51,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:22:51 BoogieIcfgContainer [2019-11-28 00:22:51,721 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:22:51,721 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:22:51,721 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:22:51,722 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:22:51,722 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:22:48" (3/4) ... [2019-11-28 00:22:51,726 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 00:22:51,938 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:22:51,938 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:22:51,941 INFO L168 Benchmark]: Toolchain (without parser) took 4957.88 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 221.2 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -131.6 MB). Peak memory consumption was 89.6 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:51,941 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:22:51,941 INFO L168 Benchmark]: CACSL2BoogieTranslator took 621.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -155.8 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:51,942 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.48 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. [2019-11-28 00:22:51,942 INFO L168 Benchmark]: Boogie Preprocessor took 42.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:22:51,942 INFO L168 Benchmark]: RCFGBuilder took 868.37 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: 58.4 MB). Peak memory consumption was 58.4 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:51,943 INFO L168 Benchmark]: TraceAbstraction took 3128.95 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 84.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -73.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:51,943 INFO L168 Benchmark]: Witness Printer took 216.51 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:51,945 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 621.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -155.8 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 73.48 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. * Boogie Preprocessor took 42.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 868.37 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: 58.4 MB). Peak memory consumption was 58.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3128.95 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 84.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -73.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. * Witness Printer took 216.51 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 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; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [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. Result: UNSAFE, OverallTime: 2.9s, OverallIterations: 11, TraceHistogramMax: 3, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 952 SDtfs, 1206 SDslu, 1382 SDs, 0 SdLazy, 233 SolverSat, 56 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s 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 DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 491 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 401 NumberOfCodeBlocks, 401 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 321 ConstructedInterpolants, 0 QuantifiedInterpolants, 22445 SizeOfPredicates, 4 NumberOfNonLiveVariables, 394 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 22/28 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...