./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec4_product35.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_product35.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 cad5f4eca7a20f7ca6dddfa07fda554bac28f7be .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:44,619 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:22:44,621 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:22:44,640 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:22:44,640 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:22:44,643 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:22:44,644 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:22:44,653 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:22:44,658 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:22:44,662 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:22:44,663 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:22:44,665 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:22:44,666 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:22:44,668 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:22:44,669 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:22:44,671 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:22:44,672 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:22:44,673 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:22:44,676 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:22:44,680 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:22:44,684 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:22:44,689 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:22:44,690 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:22:44,692 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:22:44,696 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:22:44,696 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:22:44,696 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:22:44,698 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:22:44,698 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:22:44,699 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:22:44,699 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:22:44,700 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:22:44,701 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:22:44,702 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:22:44,703 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:22:44,704 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:22:44,705 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:22:44,705 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:22:44,705 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:22:44,706 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:22:44,707 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:22:44,708 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:44,746 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:22:44,746 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:22:44,751 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:22:44,751 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:22:44,751 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:22:44,752 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:22:44,752 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:22:44,752 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:22:44,752 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:22:44,752 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:22:44,753 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:22:44,753 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:22:44,753 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:22:44,753 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:22:44,753 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:22:44,754 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:22:44,755 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:22:44,756 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:22:44,756 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:22:44,756 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:22:44,756 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:22:44,757 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:22:44,757 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:22:44,757 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:22:44,757 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:22:44,757 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:22:44,758 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:22:44,758 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:22:44,758 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 -> cad5f4eca7a20f7ca6dddfa07fda554bac28f7be [2019-11-28 00:22:45,065 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:22:45,079 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:22:45,082 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:22:45,083 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:22:45,083 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:22:45,085 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec4_product35.cil.c [2019-11-28 00:22:45,144 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d4a4999b/c8738df640f74bfd884357808ba6e260/FLAGf24450137 [2019-11-28 00:22:45,672 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:22:45,672 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product35.cil.c [2019-11-28 00:22:45,690 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d4a4999b/c8738df640f74bfd884357808ba6e260/FLAGf24450137 [2019-11-28 00:22:45,933 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d4a4999b/c8738df640f74bfd884357808ba6e260 [2019-11-28 00:22:45,937 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:22:45,939 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:22:45,940 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:22:45,940 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:22:45,942 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:22:45,943 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:22:45" (1/1) ... [2019-11-28 00:22:45,945 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@672d8e3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:45, skipping insertion in model container [2019-11-28 00:22:45,945 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:22:45" (1/1) ... [2019-11-28 00:22:45,952 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:22:46,001 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:22:46,396 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:22:46,409 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:22:46,532 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:22:46,563 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:22:46,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:46 WrapperNode [2019-11-28 00:22:46,564 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:22:46,565 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:22:46,565 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:22:46,565 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:22:46,573 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:46" (1/1) ... [2019-11-28 00:22:46,596 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:46" (1/1) ... [2019-11-28 00:22:46,630 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:22:46,631 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:22:46,631 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:22:46,631 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:22:46,638 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:46" (1/1) ... [2019-11-28 00:22:46,639 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:46" (1/1) ... [2019-11-28 00:22:46,643 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:46" (1/1) ... [2019-11-28 00:22:46,643 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:46" (1/1) ... [2019-11-28 00:22:46,653 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:46" (1/1) ... [2019-11-28 00:22:46,660 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:46" (1/1) ... [2019-11-28 00:22:46,663 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:46" (1/1) ... [2019-11-28 00:22:46,667 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:22:46,667 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:22:46,667 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:22:46,668 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:22:46,669 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:22:46,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 00:22:46,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 00:22:46,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:22:46,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:22:47,487 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:22:47,487 INFO L297 CfgBuilder]: Removed 100 assume(true) statements. [2019-11-28 00:22:47,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:22:47 BoogieIcfgContainer [2019-11-28 00:22:47,489 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:22:47,490 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:22:47,490 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:22:47,493 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:22:47,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:22:45" (1/3) ... [2019-11-28 00:22:47,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d997fb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:22:47, skipping insertion in model container [2019-11-28 00:22:47,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:46" (2/3) ... [2019-11-28 00:22:47,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d997fb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:22:47, skipping insertion in model container [2019-11-28 00:22:47,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:22:47" (3/3) ... [2019-11-28 00:22:47,497 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product35.cil.c [2019-11-28 00:22:47,507 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:22:47,514 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 00:22:47,526 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 00:22:47,551 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:22:47,551 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:22:47,551 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:22:47,551 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:22:47,551 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:22:47,552 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:22:47,552 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:22:47,552 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:22:47,566 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2019-11-28 00:22:47,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 00:22:47,573 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:47,574 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:47,574 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:47,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:47,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1355288485, now seen corresponding path program 1 times [2019-11-28 00:22:47,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:47,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790134210] [2019-11-28 00:22:47,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:47,812 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:47,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790134210] [2019-11-28 00:22:47,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:47,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:22:47,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571888387] [2019-11-28 00:22:47,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 00:22:47,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:47,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 00:22:47,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 00:22:47,838 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 2 states. [2019-11-28 00:22:47,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:47,871 INFO L93 Difference]: Finished difference Result 154 states and 233 transitions. [2019-11-28 00:22:47,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 00:22:47,873 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-28 00:22:47,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:47,885 INFO L225 Difference]: With dead ends: 154 [2019-11-28 00:22:47,885 INFO L226 Difference]: Without dead ends: 76 [2019-11-28 00:22:47,889 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:47,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-28 00:22:47,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-11-28 00:22:47,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-28 00:22:47,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 108 transitions. [2019-11-28 00:22:47,933 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 108 transitions. Word has length 16 [2019-11-28 00:22:47,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:47,934 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 108 transitions. [2019-11-28 00:22:47,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 00:22:47,934 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 108 transitions. [2019-11-28 00:22:47,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 00:22:47,935 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:47,936 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:47,936 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:47,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:47,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1892921914, now seen corresponding path program 1 times [2019-11-28 00:22:47,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:47,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132044299] [2019-11-28 00:22:47,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:48,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:48,091 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,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132044299] [2019-11-28 00:22:48,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:48,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:22:48,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31165947] [2019-11-28 00:22:48,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:22:48,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:48,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:22:48,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:22:48,098 INFO L87 Difference]: Start difference. First operand 76 states and 108 transitions. Second operand 3 states. [2019-11-28 00:22:48,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:48,120 INFO L93 Difference]: Finished difference Result 76 states and 108 transitions. [2019-11-28 00:22:48,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:22:48,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 00:22:48,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:48,121 INFO L225 Difference]: With dead ends: 76 [2019-11-28 00:22:48,122 INFO L226 Difference]: Without dead ends: 36 [2019-11-28 00:22:48,123 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:48,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-28 00:22:48,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-28 00:22:48,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-28 00:22:48,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2019-11-28 00:22:48,129 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 17 [2019-11-28 00:22:48,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:48,129 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2019-11-28 00:22:48,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:22:48,130 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2019-11-28 00:22:48,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 00:22:48,131 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:48,131 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:48,131 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:48,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:48,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1160602350, now seen corresponding path program 1 times [2019-11-28 00:22:48,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:48,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524098871] [2019-11-28 00:22:48,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:48,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:48,235 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,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524098871] [2019-11-28 00:22:48,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:48,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:22:48,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200193857] [2019-11-28 00:22:48,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:22:48,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:48,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:22:48,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:22:48,238 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand 3 states. [2019-11-28 00:22:48,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:48,277 INFO L93 Difference]: Finished difference Result 96 states and 141 transitions. [2019-11-28 00:22:48,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:22:48,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 00:22:48,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:48,279 INFO L225 Difference]: With dead ends: 96 [2019-11-28 00:22:48,279 INFO L226 Difference]: Without dead ends: 66 [2019-11-28 00:22:48,280 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:48,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-28 00:22:48,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2019-11-28 00:22:48,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-28 00:22:48,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 91 transitions. [2019-11-28 00:22:48,291 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 91 transitions. Word has length 22 [2019-11-28 00:22:48,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:48,291 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 91 transitions. [2019-11-28 00:22:48,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:22:48,291 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 91 transitions. [2019-11-28 00:22:48,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 00:22:48,292 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:48,293 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] [2019-11-28 00:22:48,293 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:48,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:48,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1572373846, now seen corresponding path program 1 times [2019-11-28 00:22:48,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:48,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316014281] [2019-11-28 00:22:48,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:48,390 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,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316014281] [2019-11-28 00:22:48,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:48,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:22:48,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077552445] [2019-11-28 00:22:48,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:22:48,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:48,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:22:48,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:22:48,394 INFO L87 Difference]: Start difference. First operand 62 states and 91 transitions. Second operand 3 states. [2019-11-28 00:22:48,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:48,443 INFO L93 Difference]: Finished difference Result 159 states and 238 transitions. [2019-11-28 00:22:48,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:22:48,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 00:22:48,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:48,446 INFO L225 Difference]: With dead ends: 159 [2019-11-28 00:22:48,446 INFO L226 Difference]: Without dead ends: 103 [2019-11-28 00:22:48,447 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:48,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-28 00:22:48,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2019-11-28 00:22:48,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-28 00:22:48,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 147 transitions. [2019-11-28 00:22:48,461 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 147 transitions. Word has length 23 [2019-11-28 00:22:48,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:48,461 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 147 transitions. [2019-11-28 00:22:48,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:22:48,462 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 147 transitions. [2019-11-28 00:22:48,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 00:22:48,463 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:48,463 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] [2019-11-28 00:22:48,463 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:48,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:48,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1956458727, now seen corresponding path program 1 times [2019-11-28 00:22:48,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:48,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717018055] [2019-11-28 00:22:48,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:48,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:48,538 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,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717018055] [2019-11-28 00:22:48,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:48,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:22:48,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950402264] [2019-11-28 00:22:48,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:48,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:48,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:48,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:48,541 INFO L87 Difference]: Start difference. First operand 101 states and 147 transitions. Second operand 5 states. [2019-11-28 00:22:48,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:48,650 INFO L93 Difference]: Finished difference Result 369 states and 545 transitions. [2019-11-28 00:22:48,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:22:48,651 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-28 00:22:48,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:48,654 INFO L225 Difference]: With dead ends: 369 [2019-11-28 00:22:48,654 INFO L226 Difference]: Without dead ends: 274 [2019-11-28 00:22:48,655 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:48,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-11-28 00:22:48,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 182. [2019-11-28 00:22:48,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-11-28 00:22:48,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 256 transitions. [2019-11-28 00:22:48,678 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 256 transitions. Word has length 25 [2019-11-28 00:22:48,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:48,678 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 256 transitions. [2019-11-28 00:22:48,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:48,678 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 256 transitions. [2019-11-28 00:22:48,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 00:22:48,680 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:48,680 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] [2019-11-28 00:22:48,680 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:48,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:48,681 INFO L82 PathProgramCache]: Analyzing trace with hash -2850263, now seen corresponding path program 1 times [2019-11-28 00:22:48,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:48,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37289652] [2019-11-28 00:22:48,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:48,767 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,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37289652] [2019-11-28 00:22:48,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:48,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:22:48,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903660407] [2019-11-28 00:22:48,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:48,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:48,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:48,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:48,772 INFO L87 Difference]: Start difference. First operand 182 states and 256 transitions. Second operand 5 states. [2019-11-28 00:22:48,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:48,890 INFO L93 Difference]: Finished difference Result 368 states and 530 transitions. [2019-11-28 00:22:48,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:22:48,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 00:22:48,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:48,894 INFO L225 Difference]: With dead ends: 368 [2019-11-28 00:22:48,895 INFO L226 Difference]: Without dead ends: 366 [2019-11-28 00:22:48,896 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:48,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-11-28 00:22:48,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 182. [2019-11-28 00:22:48,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-11-28 00:22:48,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 254 transitions. [2019-11-28 00:22:48,915 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 254 transitions. Word has length 26 [2019-11-28 00:22:48,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:48,915 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 254 transitions. [2019-11-28 00:22:48,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:48,916 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 254 transitions. [2019-11-28 00:22:48,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 00:22:48,918 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:48,918 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:48,918 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:48,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:48,919 INFO L82 PathProgramCache]: Analyzing trace with hash -2047428375, now seen corresponding path program 1 times [2019-11-28 00:22:48,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:48,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75401484] [2019-11-28 00:22:48,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:48,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:48,983 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,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75401484] [2019-11-28 00:22:48,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:48,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:22:48,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228987011] [2019-11-28 00:22:48,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:48,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:48,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:48,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:48,986 INFO L87 Difference]: Start difference. First operand 182 states and 254 transitions. Second operand 5 states. [2019-11-28 00:22:49,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:49,053 INFO L93 Difference]: Finished difference Result 505 states and 702 transitions. [2019-11-28 00:22:49,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:22:49,054 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-28 00:22:49,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:49,056 INFO L225 Difference]: With dead ends: 505 [2019-11-28 00:22:49,056 INFO L226 Difference]: Without dead ends: 329 [2019-11-28 00:22:49,058 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,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-11-28 00:22:49,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 194. [2019-11-28 00:22:49,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-11-28 00:22:49,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 266 transitions. [2019-11-28 00:22:49,076 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 266 transitions. Word has length 30 [2019-11-28 00:22:49,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:49,077 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 266 transitions. [2019-11-28 00:22:49,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:49,077 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 266 transitions. [2019-11-28 00:22:49,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 00:22:49,086 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:22:49,087 INFO L410 AbstractCegarLoop]: === Iteration 8 === [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 1854511911, now seen corresponding path program 1 times [2019-11-28 00:22:49,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:49,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578799945] [2019-11-28 00:22:49,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:49,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:49,143 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,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578799945] [2019-11-28 00:22:49,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:49,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:22:49,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449041579] [2019-11-28 00:22:49,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:22:49,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:49,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:22:49,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:22:49,147 INFO L87 Difference]: Start difference. First operand 194 states and 266 transitions. Second operand 4 states. [2019-11-28 00:22:49,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:49,193 INFO L93 Difference]: Finished difference Result 426 states and 583 transitions. [2019-11-28 00:22:49,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:22:49,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-11-28 00:22:49,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:49,195 INFO L225 Difference]: With dead ends: 426 [2019-11-28 00:22:49,196 INFO L226 Difference]: Without dead ends: 238 [2019-11-28 00:22:49,198 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:49,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-11-28 00:22:49,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 159. [2019-11-28 00:22:49,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-11-28 00:22:49,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 214 transitions. [2019-11-28 00:22:49,215 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 214 transitions. Word has length 30 [2019-11-28 00:22:49,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:49,216 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 214 transitions. [2019-11-28 00:22:49,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:22:49,217 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 214 transitions. [2019-11-28 00:22:49,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 00:22:49,219 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:49,219 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,219 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:49,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:49,220 INFO L82 PathProgramCache]: Analyzing trace with hash 2112677349, now seen corresponding path program 1 times [2019-11-28 00:22:49,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:49,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423478187] [2019-11-28 00:22:49,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:49,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:49,298 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,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423478187] [2019-11-28 00:22:49,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:49,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:22:49,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005435087] [2019-11-28 00:22:49,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:49,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:49,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:49,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:49,300 INFO L87 Difference]: Start difference. First operand 159 states and 214 transitions. Second operand 5 states. [2019-11-28 00:22:49,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:49,415 INFO L93 Difference]: Finished difference Result 420 states and 588 transitions. [2019-11-28 00:22:49,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:22:49,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-28 00:22:49,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:49,418 INFO L225 Difference]: With dead ends: 420 [2019-11-28 00:22:49,418 INFO L226 Difference]: Without dead ends: 315 [2019-11-28 00:22:49,419 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:49,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-11-28 00:22:49,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 236. [2019-11-28 00:22:49,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-11-28 00:22:49,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 315 transitions. [2019-11-28 00:22:49,439 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 315 transitions. Word has length 30 [2019-11-28 00:22:49,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:49,439 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 315 transitions. [2019-11-28 00:22:49,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:49,440 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 315 transitions. [2019-11-28 00:22:49,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 00:22:49,441 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:49,441 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] [2019-11-28 00:22:49,441 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:49,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:49,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1942803224, now seen corresponding path program 1 times [2019-11-28 00:22:49,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:49,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911708723] [2019-11-28 00:22:49,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:49,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:49,515 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:49,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911708723] [2019-11-28 00:22:49,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049470815] [2019-11-28 00:22:49,516 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:49,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:49,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 00:22:49,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:22:49,726 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:49,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:22:49,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-11-28 00:22:49,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582533681] [2019-11-28 00:22:49,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:22:49,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:49,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:22:49,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:22:49,731 INFO L87 Difference]: Start difference. First operand 236 states and 315 transitions. Second operand 6 states. [2019-11-28 00:22:49,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:49,929 INFO L93 Difference]: Finished difference Result 699 states and 959 transitions. [2019-11-28 00:22:49,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:22:49,930 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2019-11-28 00:22:49,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:49,934 INFO L225 Difference]: With dead ends: 699 [2019-11-28 00:22:49,936 INFO L226 Difference]: Without dead ends: 517 [2019-11-28 00:22:49,937 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 49 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:49,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2019-11-28 00:22:49,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 321. [2019-11-28 00:22:49,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-11-28 00:22:49,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 433 transitions. [2019-11-28 00:22:49,975 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 433 transitions. Word has length 45 [2019-11-28 00:22:49,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:49,976 INFO L462 AbstractCegarLoop]: Abstraction has 321 states and 433 transitions. [2019-11-28 00:22:49,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:22:49,976 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 433 transitions. [2019-11-28 00:22:49,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-28 00:22:49,978 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:49,978 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-28 00:22:50,183 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:22:50,184 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:50,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:50,184 INFO L82 PathProgramCache]: Analyzing trace with hash 511998341, now seen corresponding path program 2 times [2019-11-28 00:22:50,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:50,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687298442] [2019-11-28 00:22:50,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:22:50,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:22:50,337 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 00:22:50,338 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 00:22:50,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:22:50 BoogieIcfgContainer [2019-11-28 00:22:50,460 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:22:50,460 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:22:50,460 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:22:50,461 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:22:50,461 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:47" (3/4) ... [2019-11-28 00:22:50,464 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 00:22:50,668 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:22:50,668 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:22:50,670 INFO L168 Benchmark]: Toolchain (without parser) took 4731.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.3 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -117.3 MB). Peak memory consumption was 82.9 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:50,671 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:22:50,671 INFO L168 Benchmark]: CACSL2BoogieTranslator took 624.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -141.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:50,671 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:50,672 INFO L168 Benchmark]: Boogie Preprocessor took 36.10 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:22:50,672 INFO L168 Benchmark]: RCFGBuilder took 821.49 ms. Allocated memory is still 1.1 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:50,672 INFO L168 Benchmark]: TraceAbstraction took 2970.20 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 83.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -67.0 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:50,673 INFO L168 Benchmark]: Witness Printer took 207.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:50,675 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 624.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -141.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.10 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 821.49 ms. Allocated memory is still 1.1 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 2970.20 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 83.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -67.0 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. * Witness Printer took 207.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 784]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L148] int pumpRunning = 0; [L149] int systemActive = 1; [L315] int cleanupTimeShifts = 4; [L583] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L824] int waterLevel = 1; [L825] int methaneLevelCritical = 0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L391] int retValue_acc ; [L392] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L815] int retValue_acc ; [L818] retValue_acc = 1 [L819] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L398] tmp = valid_product() [L400] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L46] int splverifierCounter ; [L47] int tmp ; [L48] int tmp___0 ; [L49] int tmp___1 ; [L50] int tmp___2 ; [L53] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L55] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L57] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L63] tmp = __VERIFIER_nondet_int() [L65] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L842] COND TRUE waterLevel < 2 [L843] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L73] tmp___0 = __VERIFIER_nondet_int() [L75] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L83] tmp___2 = __VERIFIER_nondet_int() [L85] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L155] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L162] COND TRUE \read(systemActive) [L184] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L187] COND TRUE ! pumpRunning [L281] int retValue_acc ; [L282] int tmp ; [L283] int tmp___0 ; [L904] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L907] COND FALSE !(waterLevel < 2) [L911] retValue_acc = 0 [L912] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L287] tmp = isHighWaterSensorDry() [L289] COND FALSE !(\read(tmp)) [L292] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L294] retValue_acc = tmp___0 [L295] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L189] tmp = isHighWaterLevel() [L191] COND TRUE \read(tmp) [L212] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L116] int tmp ; [L117] int tmp___0 ; [L895] int retValue_acc ; [L898] retValue_acc = waterLevel [L899] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L121] tmp = getWaterLevel() [L123] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L55] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L57] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L63] tmp = __VERIFIER_nondet_int() [L65] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L73] tmp___0 = __VERIFIER_nondet_int() [L75] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L83] tmp___2 = __VERIFIER_nondet_int() [L85] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L155] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L830] COND TRUE waterLevel > 0 [L831] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L162] COND TRUE \read(systemActive) [L184] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L187] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L116] int tmp ; [L117] int tmp___0 ; [L895] int retValue_acc ; [L898] retValue_acc = waterLevel [L899] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L121] tmp = getWaterLevel() [L123] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L55] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L57] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L63] tmp = __VERIFIER_nondet_int() [L65] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L73] tmp___0 = __VERIFIER_nondet_int() [L75] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L83] tmp___2 = __VERIFIER_nondet_int() [L85] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L155] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L830] COND TRUE waterLevel > 0 [L831] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L162] COND TRUE \read(systemActive) [L184] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L187] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L116] int tmp ; [L117] int tmp___0 ; [L895] int retValue_acc ; [L898] retValue_acc = waterLevel [L899] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L121] tmp = getWaterLevel() [L123] COND TRUE tmp == 0 [L236] int retValue_acc ; [L239] retValue_acc = pumpRunning [L240] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L125] tmp___0 = isPumpRunning() [L127] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L784] __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, 80 locations, 3 error locations. Result: UNSAFE, OverallTime: 2.7s, OverallIterations: 11, TraceHistogramMax: 3, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 796 SDtfs, 909 SDslu, 1189 SDs, 0 SdLazy, 191 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=321occurred 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, 771 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 369 NumberOfCodeBlocks, 369 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 298 ConstructedInterpolants, 0 QuantifiedInterpolants, 17410 SizeOfPredicates, 4 NumberOfNonLiveVariables, 375 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...