./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec4_product43.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_product43.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 437b76c0cd9dd6f0417f690a0c81e41159d0829e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:50,628 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:22:50,631 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:22:50,649 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:22:50,650 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:22:50,652 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:22:50,655 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:22:50,668 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:22:50,671 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:22:50,673 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:22:50,675 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:22:50,677 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:22:50,677 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:22:50,678 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:22:50,679 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:22:50,680 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:22:50,681 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:22:50,682 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:22:50,684 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:22:50,686 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:22:50,688 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:22:50,689 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:22:50,690 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:22:50,691 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:22:50,695 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:22:50,697 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:22:50,697 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:22:50,698 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:22:50,698 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:22:50,699 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:22:50,699 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:22:50,701 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:22:50,703 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:22:50,704 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:22:50,705 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:22:50,708 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:22:50,709 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:22:50,709 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:22:50,710 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:22:50,711 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:22:50,712 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:22:50,713 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:50,727 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:22:50,728 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:22:50,729 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:22:50,729 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:22:50,730 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:22:50,730 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:22:50,730 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:22:50,730 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:22:50,731 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:22:50,731 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:22:50,731 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:22:50,732 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:22:50,732 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:22:50,732 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:22:50,732 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:22:50,733 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:22:50,733 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:22:50,733 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:22:50,734 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:22:50,734 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:22:50,734 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:22:50,734 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:22:50,735 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:22:50,735 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:22:50,735 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:22:50,736 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:22:50,736 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:22:50,736 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:22:50,736 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 -> 437b76c0cd9dd6f0417f690a0c81e41159d0829e [2019-11-28 00:22:51,050 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:22:51,071 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:22:51,077 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:22:51,079 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:22:51,080 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:22:51,081 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec4_product43.cil.c [2019-11-28 00:22:51,155 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a8077b93/c03fa6331b474b449da7a242b7ae9eaf/FLAG742a195d4 [2019-11-28 00:22:51,734 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:22:51,735 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product43.cil.c [2019-11-28 00:22:51,759 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a8077b93/c03fa6331b474b449da7a242b7ae9eaf/FLAG742a195d4 [2019-11-28 00:22:52,007 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a8077b93/c03fa6331b474b449da7a242b7ae9eaf [2019-11-28 00:22:52,010 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:22:52,012 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:22:52,013 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:22:52,013 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:22:52,016 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:22:52,017 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:22:52" (1/1) ... [2019-11-28 00:22:52,020 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ce269f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:52, skipping insertion in model container [2019-11-28 00:22:52,021 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:22:52" (1/1) ... [2019-11-28 00:22:52,027 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:22:52,080 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:22:52,518 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:22:52,535 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:22:52,609 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:22:52,647 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:22:52,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:52 WrapperNode [2019-11-28 00:22:52,648 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:22:52,649 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:22:52,649 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:22:52,650 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:22:52,659 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:52" (1/1) ... [2019-11-28 00:22:52,680 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:52" (1/1) ... [2019-11-28 00:22:52,725 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:22:52,726 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:22:52,726 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:22:52,726 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:22:52,734 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:52" (1/1) ... [2019-11-28 00:22:52,735 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:52" (1/1) ... [2019-11-28 00:22:52,739 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:52" (1/1) ... [2019-11-28 00:22:52,740 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:52" (1/1) ... [2019-11-28 00:22:52,751 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:52" (1/1) ... [2019-11-28 00:22:52,760 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:52" (1/1) ... [2019-11-28 00:22:52,763 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:52" (1/1) ... [2019-11-28 00:22:52,768 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:22:52,769 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:22:52,770 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:22:52,770 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:22:52,771 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:52" (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:52,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 00:22:52,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 00:22:52,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:22:52,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:22:53,684 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:22:53,684 INFO L297 CfgBuilder]: Removed 118 assume(true) statements. [2019-11-28 00:22:53,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:22:53 BoogieIcfgContainer [2019-11-28 00:22:53,686 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:22:53,687 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:22:53,687 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:22:53,691 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:22:53,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:22:52" (1/3) ... [2019-11-28 00:22:53,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3593d3d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:22:53, skipping insertion in model container [2019-11-28 00:22:53,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:52" (2/3) ... [2019-11-28 00:22:53,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3593d3d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:22:53, skipping insertion in model container [2019-11-28 00:22:53,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:22:53" (3/3) ... [2019-11-28 00:22:53,696 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product43.cil.c [2019-11-28 00:22:53,705 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:22:53,711 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 00:22:53,722 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 00:22:53,746 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:22:53,746 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:22:53,747 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:22:53,747 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:22:53,747 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:22:53,747 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:22:53,747 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:22:53,748 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:22:53,766 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2019-11-28 00:22:53,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 00:22:53,776 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:53,777 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:53,778 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:53,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:53,785 INFO L82 PathProgramCache]: Analyzing trace with hash 929673937, now seen corresponding path program 1 times [2019-11-28 00:22:53,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:53,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839484717] [2019-11-28 00:22:53,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:53,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:54,095 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:54,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839484717] [2019-11-28 00:22:54,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:54,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:22:54,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79857279] [2019-11-28 00:22:54,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 00:22:54,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:54,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 00:22:54,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 00:22:54,133 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 2 states. [2019-11-28 00:22:54,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:54,198 INFO L93 Difference]: Finished difference Result 172 states and 257 transitions. [2019-11-28 00:22:54,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 00:22:54,201 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-28 00:22:54,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:54,219 INFO L225 Difference]: With dead ends: 172 [2019-11-28 00:22:54,220 INFO L226 Difference]: Without dead ends: 85 [2019-11-28 00:22:54,225 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:54,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-28 00:22:54,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-11-28 00:22:54,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-28 00:22:54,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 120 transitions. [2019-11-28 00:22:54,295 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 120 transitions. Word has length 16 [2019-11-28 00:22:54,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:54,297 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 120 transitions. [2019-11-28 00:22:54,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 00:22:54,297 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 120 transitions. [2019-11-28 00:22:54,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 00:22:54,299 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:54,299 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:54,300 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:54,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:54,301 INFO L82 PathProgramCache]: Analyzing trace with hash -117082960, now seen corresponding path program 1 times [2019-11-28 00:22:54,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:54,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481170672] [2019-11-28 00:22:54,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:54,450 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:54,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481170672] [2019-11-28 00:22:54,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:54,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:22:54,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36553542] [2019-11-28 00:22:54,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:22:54,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:54,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:22:54,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:22:54,455 INFO L87 Difference]: Start difference. First operand 85 states and 120 transitions. Second operand 3 states. [2019-11-28 00:22:54,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:54,467 INFO L93 Difference]: Finished difference Result 85 states and 120 transitions. [2019-11-28 00:22:54,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:22:54,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 00:22:54,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:54,472 INFO L225 Difference]: With dead ends: 85 [2019-11-28 00:22:54,473 INFO L226 Difference]: Without dead ends: 39 [2019-11-28 00:22:54,475 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:54,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-28 00:22:54,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-11-28 00:22:54,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 00:22:54,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2019-11-28 00:22:54,486 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 17 [2019-11-28 00:22:54,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:54,487 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2019-11-28 00:22:54,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:22:54,487 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2019-11-28 00:22:54,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 00:22:54,490 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:54,491 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:54,491 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:54,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:54,492 INFO L82 PathProgramCache]: Analyzing trace with hash 337421565, now seen corresponding path program 1 times [2019-11-28 00:22:54,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:54,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283942286] [2019-11-28 00:22:54,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:54,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:54,654 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:54,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283942286] [2019-11-28 00:22:54,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:54,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:22:54,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578799945] [2019-11-28 00:22:54,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:22:54,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:54,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:22:54,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:22:54,658 INFO L87 Difference]: Start difference. First operand 39 states and 55 transitions. Second operand 6 states. [2019-11-28 00:22:54,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:54,789 INFO L93 Difference]: Finished difference Result 128 states and 187 transitions. [2019-11-28 00:22:54,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:22:54,793 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-11-28 00:22:54,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:54,795 INFO L225 Difference]: With dead ends: 128 [2019-11-28 00:22:54,795 INFO L226 Difference]: Without dead ends: 95 [2019-11-28 00:22:54,796 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:22:54,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-28 00:22:54,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 58. [2019-11-28 00:22:54,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-28 00:22:54,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 84 transitions. [2019-11-28 00:22:54,815 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 84 transitions. Word has length 22 [2019-11-28 00:22:54,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:54,816 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 84 transitions. [2019-11-28 00:22:54,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:22:54,823 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 84 transitions. [2019-11-28 00:22:54,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 00:22:54,825 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:54,825 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:54,826 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:54,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:54,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1224569535, now seen corresponding path program 1 times [2019-11-28 00:22:54,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:54,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724195684] [2019-11-28 00:22:54,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:54,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:54,915 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:54,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724195684] [2019-11-28 00:22:54,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:54,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:22:54,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959214863] [2019-11-28 00:22:54,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:22:54,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:54,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:22:54,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:22:54,919 INFO L87 Difference]: Start difference. First operand 58 states and 84 transitions. Second operand 3 states. [2019-11-28 00:22:54,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:54,953 INFO L93 Difference]: Finished difference Result 131 states and 192 transitions. [2019-11-28 00:22:54,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:22:54,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 00:22:54,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:54,955 INFO L225 Difference]: With dead ends: 131 [2019-11-28 00:22:54,955 INFO L226 Difference]: Without dead ends: 79 [2019-11-28 00:22:54,956 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:54,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-28 00:22:54,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2019-11-28 00:22:54,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-28 00:22:54,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 109 transitions. [2019-11-28 00:22:54,969 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 109 transitions. Word has length 23 [2019-11-28 00:22:54,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:54,969 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 109 transitions. [2019-11-28 00:22:54,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:22:54,970 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 109 transitions. [2019-11-28 00:22:54,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 00:22:54,971 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:54,971 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:54,972 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:54,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:54,972 INFO L82 PathProgramCache]: Analyzing trace with hash -840484654, now seen corresponding path program 1 times [2019-11-28 00:22:54,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:54,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875648264] [2019-11-28 00:22:54,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:54,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:55,032 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:55,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875648264] [2019-11-28 00:22:55,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:55,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:22:55,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458505156] [2019-11-28 00:22:55,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:55,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:55,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:55,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:55,036 INFO L87 Difference]: Start difference. First operand 77 states and 109 transitions. Second operand 5 states. [2019-11-28 00:22:55,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:55,158 INFO L93 Difference]: Finished difference Result 281 states and 406 transitions. [2019-11-28 00:22:55,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:22:55,159 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-28 00:22:55,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:55,161 INFO L225 Difference]: With dead ends: 281 [2019-11-28 00:22:55,161 INFO L226 Difference]: Without dead ends: 210 [2019-11-28 00:22:55,162 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:55,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-11-28 00:22:55,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 138. [2019-11-28 00:22:55,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-11-28 00:22:55,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 191 transitions. [2019-11-28 00:22:55,187 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 191 transitions. Word has length 25 [2019-11-28 00:22:55,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:55,188 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 191 transitions. [2019-11-28 00:22:55,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:55,188 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 191 transitions. [2019-11-28 00:22:55,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 00:22:55,190 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:55,191 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:55,191 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:55,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:55,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1495173652, now seen corresponding path program 1 times [2019-11-28 00:22:55,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:55,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802239938] [2019-11-28 00:22:55,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:55,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:55,274 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:55,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802239938] [2019-11-28 00:22:55,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:55,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:22:55,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657189253] [2019-11-28 00:22:55,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:55,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:55,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:55,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:55,278 INFO L87 Difference]: Start difference. First operand 138 states and 191 transitions. Second operand 5 states. [2019-11-28 00:22:55,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:55,409 INFO L93 Difference]: Finished difference Result 277 states and 391 transitions. [2019-11-28 00:22:55,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:22:55,410 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 00:22:55,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:55,412 INFO L225 Difference]: With dead ends: 277 [2019-11-28 00:22:55,412 INFO L226 Difference]: Without dead ends: 275 [2019-11-28 00:22:55,413 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:55,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-11-28 00:22:55,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 138. [2019-11-28 00:22:55,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-11-28 00:22:55,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 189 transitions. [2019-11-28 00:22:55,431 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 189 transitions. Word has length 26 [2019-11-28 00:22:55,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:55,432 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 189 transitions. [2019-11-28 00:22:55,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:55,432 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 189 transitions. [2019-11-28 00:22:55,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 00:22:55,434 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:55,435 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, 1, 1] [2019-11-28 00:22:55,435 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:55,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:55,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1499969411, now seen corresponding path program 1 times [2019-11-28 00:22:55,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:55,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882408748] [2019-11-28 00:22:55,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:55,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:55,503 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:55,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882408748] [2019-11-28 00:22:55,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:55,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:22:55,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465745897] [2019-11-28 00:22:55,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:55,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:55,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:55,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:55,507 INFO L87 Difference]: Start difference. First operand 138 states and 189 transitions. Second operand 5 states. [2019-11-28 00:22:55,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:55,576 INFO L93 Difference]: Finished difference Result 422 states and 578 transitions. [2019-11-28 00:22:55,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:22:55,577 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-11-28 00:22:55,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:55,579 INFO L225 Difference]: With dead ends: 422 [2019-11-28 00:22:55,579 INFO L226 Difference]: Without dead ends: 290 [2019-11-28 00:22:55,580 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:55,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-11-28 00:22:55,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 144. [2019-11-28 00:22:55,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-28 00:22:55,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 195 transitions. [2019-11-28 00:22:55,600 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 195 transitions. Word has length 33 [2019-11-28 00:22:55,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:55,600 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 195 transitions. [2019-11-28 00:22:55,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:55,601 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 195 transitions. [2019-11-28 00:22:55,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 00:22:55,602 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:55,603 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, 1, 1] [2019-11-28 00:22:55,603 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:55,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:55,604 INFO L82 PathProgramCache]: Analyzing trace with hash -2086775425, now seen corresponding path program 1 times [2019-11-28 00:22:55,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:55,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127398914] [2019-11-28 00:22:55,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:55,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:55,656 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:55,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127398914] [2019-11-28 00:22:55,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:55,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:22:55,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59013178] [2019-11-28 00:22:55,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:22:55,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:55,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:22:55,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:22:55,659 INFO L87 Difference]: Start difference. First operand 144 states and 195 transitions. Second operand 4 states. [2019-11-28 00:22:55,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:55,704 INFO L93 Difference]: Finished difference Result 335 states and 455 transitions. [2019-11-28 00:22:55,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:22:55,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-28 00:22:55,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:55,708 INFO L225 Difference]: With dead ends: 335 [2019-11-28 00:22:55,708 INFO L226 Difference]: Without dead ends: 197 [2019-11-28 00:22:55,709 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:55,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-11-28 00:22:55,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 123. [2019-11-28 00:22:55,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-11-28 00:22:55,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 164 transitions. [2019-11-28 00:22:55,724 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 164 transitions. Word has length 33 [2019-11-28 00:22:55,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:55,725 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 164 transitions. [2019-11-28 00:22:55,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:22:55,725 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 164 transitions. [2019-11-28 00:22:55,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 00:22:55,727 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:55,727 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, 1, 1] [2019-11-28 00:22:55,728 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:55,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:55,728 INFO L82 PathProgramCache]: Analyzing trace with hash 928328193, now seen corresponding path program 1 times [2019-11-28 00:22:55,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:55,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426580317] [2019-11-28 00:22:55,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:55,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:55,815 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:55,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426580317] [2019-11-28 00:22:55,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:55,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:22:55,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294179994] [2019-11-28 00:22:55,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:55,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:55,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:55,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:55,818 INFO L87 Difference]: Start difference. First operand 123 states and 164 transitions. Second operand 5 states. [2019-11-28 00:22:55,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:55,962 INFO L93 Difference]: Finished difference Result 308 states and 427 transitions. [2019-11-28 00:22:55,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:22:55,963 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-11-28 00:22:55,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:55,965 INFO L225 Difference]: With dead ends: 308 [2019-11-28 00:22:55,965 INFO L226 Difference]: Without dead ends: 232 [2019-11-28 00:22:55,966 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:55,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-11-28 00:22:55,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 179. [2019-11-28 00:22:55,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-11-28 00:22:55,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 238 transitions. [2019-11-28 00:22:55,998 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 238 transitions. Word has length 33 [2019-11-28 00:22:55,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:55,999 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 238 transitions. [2019-11-28 00:22:55,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:55,999 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 238 transitions. [2019-11-28 00:22:56,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-28 00:22:56,003 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:56,003 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] [2019-11-28 00:22:56,004 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:56,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:56,004 INFO L82 PathProgramCache]: Analyzing trace with hash -423849614, now seen corresponding path program 1 times [2019-11-28 00:22:56,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:56,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976754390] [2019-11-28 00:22:56,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:56,105 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:56,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976754390] [2019-11-28 00:22:56,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561637392] [2019-11-28 00:22:56,106 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:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:56,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 00:22:56,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:22:56,322 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:56,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:22:56,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-11-28 00:22:56,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654058870] [2019-11-28 00:22:56,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:22:56,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:56,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:22:56,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:22:56,327 INFO L87 Difference]: Start difference. First operand 179 states and 238 transitions. Second operand 6 states. [2019-11-28 00:22:56,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:56,501 INFO L93 Difference]: Finished difference Result 512 states and 700 transitions. [2019-11-28 00:22:56,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:22:56,502 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2019-11-28 00:22:56,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:56,505 INFO L225 Difference]: With dead ends: 512 [2019-11-28 00:22:56,505 INFO L226 Difference]: Without dead ends: 380 [2019-11-28 00:22:56,506 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 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:56,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-11-28 00:22:56,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 239. [2019-11-28 00:22:56,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-11-28 00:22:56,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 321 transitions. [2019-11-28 00:22:56,539 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 321 transitions. Word has length 48 [2019-11-28 00:22:56,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:56,540 INFO L462 AbstractCegarLoop]: Abstraction has 239 states and 321 transitions. [2019-11-28 00:22:56,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:22:56,540 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 321 transitions. [2019-11-28 00:22:56,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-28 00:22:56,541 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:56,542 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, 1, 1, 1] [2019-11-28 00:22:56,747 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:22:56,747 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:56,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:56,748 INFO L82 PathProgramCache]: Analyzing trace with hash -568509983, now seen corresponding path program 2 times [2019-11-28 00:22:56,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:56,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116905298] [2019-11-28 00:22:56,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:56,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:22:56,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:22:56,949 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 00:22:56,950 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 00:22:57,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:22:57 BoogieIcfgContainer [2019-11-28 00:22:57,103 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:22:57,104 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:22:57,104 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:22:57,104 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:22:57,105 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:53" (3/4) ... [2019-11-28 00:22:57,107 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 00:22:57,263 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:22:57,263 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:22:57,266 INFO L168 Benchmark]: Toolchain (without parser) took 5253.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 215.5 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -103.4 MB). Peak memory consumption was 112.1 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:57,266 INFO L168 Benchmark]: CDTParser took 0.32 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:57,267 INFO L168 Benchmark]: CACSL2BoogieTranslator took 635.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -170.1 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:57,268 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.24 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:57,268 INFO L168 Benchmark]: Boogie Preprocessor took 43.24 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:57,269 INFO L168 Benchmark]: RCFGBuilder took 916.96 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: 64.0 MB). Peak memory consumption was 64.0 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:57,269 INFO L168 Benchmark]: TraceAbstraction took 3416.10 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -34.3 MB). Peak memory consumption was 40.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:57,270 INFO L168 Benchmark]: Witness Printer took 159.47 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: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:57,274 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.32 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 635.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -170.1 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.24 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.24 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 916.96 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: 64.0 MB). Peak memory consumption was 64.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3416.10 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -34.3 MB). Peak memory consumption was 40.7 MB. Max. memory is 11.5 GB. * Witness Printer took 159.47 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: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 310]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L120] int pumpRunning = 0; [L121] int systemActive = 1; [L315] int cleanupTimeShifts = 4; [L415] int waterLevel = 1; [L416] int methaneLevelCritical = 0; [L713] static struct __ACC__ERR *head = (struct __ACC__ERR *)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] [L535] int retValue_acc ; [L538] retValue_acc = 1 [L539] 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] [L433] COND TRUE waterLevel < 2 [L434] 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] [L128] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L135] COND TRUE \read(systemActive) [L157] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L160] COND TRUE ! pumpRunning [L272] int retValue_acc ; [L273] int tmp ; [L274] int tmp___0 ; [L495] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L498] COND FALSE !(waterLevel < 2) [L502] retValue_acc = 0 [L503] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L278] tmp = isHighWaterSensorDry() [L280] COND FALSE !(\read(tmp)) [L283] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L285] retValue_acc = tmp___0 [L286] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L162] tmp = isHighWaterLevel() [L164] COND TRUE \read(tmp) [L191] int tmp ; [L216] int retValue_acc ; [L454] int retValue_acc ; [L457] retValue_acc = methaneLevelCritical [L458] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L220] retValue_acc = isMethaneLevelCritical() [L222] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L195] tmp = isMethaneAlarm() [L197] COND FALSE !(\read(tmp)) [L185] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L911] int tmp ; [L912] int tmp___0 ; [L486] int retValue_acc ; [L489] retValue_acc = waterLevel [L490] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L916] tmp = getWaterLevel() [L918] 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] [L128] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L421] COND TRUE waterLevel > 0 [L422] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L135] COND TRUE \read(systemActive) [L157] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L160] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L911] int tmp ; [L912] int tmp___0 ; [L486] int retValue_acc ; [L489] retValue_acc = waterLevel [L490] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L916] tmp = getWaterLevel() [L918] 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] [L128] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L421] COND TRUE waterLevel > 0 [L422] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L135] COND TRUE \read(systemActive) [L157] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L160] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L911] int tmp ; [L912] int tmp___0 ; [L486] int retValue_acc ; [L489] retValue_acc = waterLevel [L490] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L916] tmp = getWaterLevel() [L918] COND TRUE tmp == 0 [L227] int retValue_acc ; [L230] retValue_acc = pumpRunning [L231] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L920] tmp___0 = isPumpRunning() [L922] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L310] __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, 89 locations, 3 error locations. Result: UNSAFE, OverallTime: 3.2s, OverallIterations: 11, TraceHistogramMax: 3, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 857 SDtfs, 1126 SDslu, 1474 SDs, 0 SdLazy, 206 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=239occurred 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.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 662 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 387 NumberOfCodeBlocks, 387 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 313 ConstructedInterpolants, 0 QuantifiedInterpolants, 19846 SizeOfPredicates, 4 NumberOfNonLiveVariables, 391 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...