./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/minepump_spec2_product36.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_eb4ad2a9-0b52-4903-88a1-9bc0c97beff8/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_eb4ad2a9-0b52-4903-88a1-9bc0c97beff8/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_eb4ad2a9-0b52-4903-88a1-9bc0c97beff8/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_eb4ad2a9-0b52-4903-88a1-9bc0c97beff8/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/product-lines/minepump_spec2_product36.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_eb4ad2a9-0b52-4903-88a1-9bc0c97beff8/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_eb4ad2a9-0b52-4903-88a1-9bc0c97beff8/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 49fa497f38e3a46185ee804b3f30fdc119cb200c .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-cad4683 [2019-10-22 11:22:14,946 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:22:14,949 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:22:14,959 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:22:14,960 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:22:14,961 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:22:14,963 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:22:14,964 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:22:14,966 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:22:14,966 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:22:14,967 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:22:14,968 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:22:14,969 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:22:14,969 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:22:14,970 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:22:14,971 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:22:14,972 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:22:14,972 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:22:14,974 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:22:14,975 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:22:14,976 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:22:14,977 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:22:14,978 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:22:14,979 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:22:14,981 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:22:14,981 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:22:14,981 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:22:14,982 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:22:14,982 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:22:14,983 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:22:14,983 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:22:14,984 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:22:14,984 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:22:14,985 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:22:14,986 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:22:14,986 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:22:14,986 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:22:14,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:22:14,987 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:22:14,987 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:22:14,988 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:22:14,989 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_eb4ad2a9-0b52-4903-88a1-9bc0c97beff8/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:22:14,999 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:22:14,999 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:22:15,000 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:22:15,000 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:22:15,001 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:22:15,001 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:22:15,001 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:22:15,001 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:22:15,001 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:22:15,001 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:22:15,002 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:22:15,002 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:22:15,002 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:22:15,003 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:22:15,003 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:22:15,003 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:22:15,003 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:22:15,003 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:22:15,003 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:22:15,003 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:22:15,004 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:22:15,004 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:22:15,004 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:22:15,005 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:22:15,005 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:22:15,005 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:22:15,005 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:22:15,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:22:15,005 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:22:15,006 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:22:15,006 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:22:15,006 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:22:15,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:22:15,006 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:22:15,006 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:22:15,006 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_eb4ad2a9-0b52-4903-88a1-9bc0c97beff8/bin/utaipan 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 -> Taipan 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 -> 49fa497f38e3a46185ee804b3f30fdc119cb200c [2019-10-22 11:22:15,045 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:22:15,056 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:22:15,059 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:22:15,060 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:22:15,061 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:22:15,061 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_eb4ad2a9-0b52-4903-88a1-9bc0c97beff8/bin/utaipan/../../sv-benchmarks/c/product-lines/minepump_spec2_product36.cil.c [2019-10-22 11:22:15,119 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_eb4ad2a9-0b52-4903-88a1-9bc0c97beff8/bin/utaipan/data/35c385f3c/5b06375c1f8a481e996905d4c33fc13c/FLAGfd9174f2d [2019-10-22 11:22:15,611 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:22:15,617 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_eb4ad2a9-0b52-4903-88a1-9bc0c97beff8/sv-benchmarks/c/product-lines/minepump_spec2_product36.cil.c [2019-10-22 11:22:15,632 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_eb4ad2a9-0b52-4903-88a1-9bc0c97beff8/bin/utaipan/data/35c385f3c/5b06375c1f8a481e996905d4c33fc13c/FLAGfd9174f2d [2019-10-22 11:22:15,884 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_eb4ad2a9-0b52-4903-88a1-9bc0c97beff8/bin/utaipan/data/35c385f3c/5b06375c1f8a481e996905d4c33fc13c [2019-10-22 11:22:15,887 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:22:15,888 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:22:15,889 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:22:15,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:22:15,893 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:22:15,893 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:22:15" (1/1) ... [2019-10-22 11:22:15,896 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@348d8eee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:15, skipping insertion in model container [2019-10-22 11:22:15,896 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:22:15" (1/1) ... [2019-10-22 11:22:15,903 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:22:15,945 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:22:16,275 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:22:16,288 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:22:16,389 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:22:16,410 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:22:16,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:16 WrapperNode [2019-10-22 11:22:16,411 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:22:16,412 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:22:16,412 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:22:16,412 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:22:16,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:16" (1/1) ... [2019-10-22 11:22:16,447 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:16" (1/1) ... [2019-10-22 11:22:16,494 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:22:16,495 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:22:16,495 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:22:16,495 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:22:16,502 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:16" (1/1) ... [2019-10-22 11:22:16,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:16" (1/1) ... [2019-10-22 11:22:16,505 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:16" (1/1) ... [2019-10-22 11:22:16,505 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:16" (1/1) ... [2019-10-22 11:22:16,512 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:16" (1/1) ... [2019-10-22 11:22:16,518 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:16" (1/1) ... [2019-10-22 11:22:16,520 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:16" (1/1) ... [2019-10-22 11:22:16,523 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:22:16,524 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:22:16,524 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:22:16,524 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:22:16,525 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb4ad2a9-0b52-4903-88a1-9bc0c97beff8/bin/utaipan/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-10-22 11:22:16,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:22:16,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 11:22:16,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:22:16,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:22:17,310 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:22:17,310 INFO L284 CfgBuilder]: Removed 104 assume(true) statements. [2019-10-22 11:22:17,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:17 BoogieIcfgContainer [2019-10-22 11:22:17,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:22:17,312 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:22:17,312 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:22:17,315 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:22:17,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:22:15" (1/3) ... [2019-10-22 11:22:17,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bfcc090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:22:17, skipping insertion in model container [2019-10-22 11:22:17,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:16" (2/3) ... [2019-10-22 11:22:17,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bfcc090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:22:17, skipping insertion in model container [2019-10-22 11:22:17,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:17" (3/3) ... [2019-10-22 11:22:17,320 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product36.cil.c [2019-10-22 11:22:17,329 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:22:17,339 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-22 11:22:17,350 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-22 11:22:17,371 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:22:17,372 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:22:17,372 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:22:17,372 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:22:17,372 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:22:17,372 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:22:17,372 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:22:17,372 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:22:17,385 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2019-10-22 11:22:17,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 11:22:17,392 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:17,393 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:17,395 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:17,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:17,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1480559057, now seen corresponding path program 1 times [2019-10-22 11:22:17,408 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:17,409 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753274062] [2019-10-22 11:22:17,409 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:17,409 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:17,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:17,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:17,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:17,604 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753274062] [2019-10-22 11:22:17,604 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:17,605 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:22:17,605 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284439591] [2019-10-22 11:22:17,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:22:17,610 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:17,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:22:17,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:22:17,625 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 2 states. [2019-10-22 11:22:17,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:17,650 INFO L93 Difference]: Finished difference Result 161 states and 246 transitions. [2019-10-22 11:22:17,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:22:17,652 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-10-22 11:22:17,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:17,662 INFO L225 Difference]: With dead ends: 161 [2019-10-22 11:22:17,662 INFO L226 Difference]: Without dead ends: 80 [2019-10-22 11:22:17,665 INFO L600 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-10-22 11:22:17,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-10-22 11:22:17,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-10-22 11:22:17,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-22 11:22:17,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 115 transitions. [2019-10-22 11:22:17,701 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 115 transitions. Word has length 18 [2019-10-22 11:22:17,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:17,702 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 115 transitions. [2019-10-22 11:22:17,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:22:17,702 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 115 transitions. [2019-10-22 11:22:17,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 11:22:17,703 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:17,703 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:17,703 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:17,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:17,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1228794243, now seen corresponding path program 1 times [2019-10-22 11:22:17,704 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:17,704 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179576007] [2019-10-22 11:22:17,704 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:17,704 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:17,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:17,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:17,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:17,814 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179576007] [2019-10-22 11:22:17,814 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:17,814 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:22:17,814 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616141019] [2019-10-22 11:22:17,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:22:17,816 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:17,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:22:17,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:17,817 INFO L87 Difference]: Start difference. First operand 80 states and 115 transitions. Second operand 3 states. [2019-10-22 11:22:17,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:17,828 INFO L93 Difference]: Finished difference Result 80 states and 115 transitions. [2019-10-22 11:22:17,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:22:17,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-22 11:22:17,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:17,829 INFO L225 Difference]: With dead ends: 80 [2019-10-22 11:22:17,829 INFO L226 Difference]: Without dead ends: 38 [2019-10-22 11:22:17,830 INFO L600 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-10-22 11:22:17,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-22 11:22:17,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-10-22 11:22:17,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-22 11:22:17,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 54 transitions. [2019-10-22 11:22:17,836 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 54 transitions. Word has length 19 [2019-10-22 11:22:17,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:17,836 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 54 transitions. [2019-10-22 11:22:17,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:22:17,836 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 54 transitions. [2019-10-22 11:22:17,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 11:22:17,837 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:17,837 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:17,838 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:17,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:17,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1219405376, now seen corresponding path program 1 times [2019-10-22 11:22:17,838 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:17,839 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668597752] [2019-10-22 11:22:17,839 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:17,839 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:17,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:17,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:17,908 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668597752] [2019-10-22 11:22:17,909 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:17,909 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:22:17,909 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015247635] [2019-10-22 11:22:17,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:22:17,910 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:17,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:22:17,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:17,910 INFO L87 Difference]: Start difference. First operand 38 states and 54 transitions. Second operand 3 states. [2019-10-22 11:22:17,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:17,945 INFO L93 Difference]: Finished difference Result 100 states and 148 transitions. [2019-10-22 11:22:17,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:22:17,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-22 11:22:17,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:17,949 INFO L225 Difference]: With dead ends: 100 [2019-10-22 11:22:17,949 INFO L226 Difference]: Without dead ends: 69 [2019-10-22 11:22:17,950 INFO L600 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-10-22 11:22:17,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-22 11:22:17,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2019-10-22 11:22:17,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-22 11:22:17,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 96 transitions. [2019-10-22 11:22:17,973 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 96 transitions. Word has length 24 [2019-10-22 11:22:17,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:17,973 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 96 transitions. [2019-10-22 11:22:17,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:22:17,974 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 96 transitions. [2019-10-22 11:22:17,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:22:17,974 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:17,975 INFO L380 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-10-22 11:22:17,975 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:17,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:17,975 INFO L82 PathProgramCache]: Analyzing trace with hash 999444121, now seen corresponding path program 1 times [2019-10-22 11:22:17,976 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:17,976 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16224973] [2019-10-22 11:22:17,978 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:17,978 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:17,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:18,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:18,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:18,047 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16224973] [2019-10-22 11:22:18,048 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:18,048 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:22:18,048 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852990043] [2019-10-22 11:22:18,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:22:18,049 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:18,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:22:18,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:18,050 INFO L87 Difference]: Start difference. First operand 65 states and 96 transitions. Second operand 3 states. [2019-10-22 11:22:18,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:18,083 INFO L93 Difference]: Finished difference Result 166 states and 251 transitions. [2019-10-22 11:22:18,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:22:18,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-22 11:22:18,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:18,084 INFO L225 Difference]: With dead ends: 166 [2019-10-22 11:22:18,085 INFO L226 Difference]: Without dead ends: 108 [2019-10-22 11:22:18,085 INFO L600 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-10-22 11:22:18,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-10-22 11:22:18,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2019-10-22 11:22:18,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-10-22 11:22:18,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 156 transitions. [2019-10-22 11:22:18,098 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 156 transitions. Word has length 25 [2019-10-22 11:22:18,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:18,098 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 156 transitions. [2019-10-22 11:22:18,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:22:18,099 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 156 transitions. [2019-10-22 11:22:18,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-22 11:22:18,099 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:18,100 INFO L380 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] [2019-10-22 11:22:18,100 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:18,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:18,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1239284745, now seen corresponding path program 1 times [2019-10-22 11:22:18,100 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:18,101 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218229047] [2019-10-22 11:22:18,101 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:18,101 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:18,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:18,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:18,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:18,177 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218229047] [2019-10-22 11:22:18,178 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:18,178 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:18,178 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284796808] [2019-10-22 11:22:18,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:22:18,178 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:18,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:22:18,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:18,179 INFO L87 Difference]: Start difference. First operand 106 states and 156 transitions. Second operand 5 states. [2019-10-22 11:22:18,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:18,298 INFO L93 Difference]: Finished difference Result 510 states and 765 transitions. [2019-10-22 11:22:18,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:22:18,298 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-10-22 11:22:18,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:18,301 INFO L225 Difference]: With dead ends: 510 [2019-10-22 11:22:18,301 INFO L226 Difference]: Without dead ends: 411 [2019-10-22 11:22:18,302 INFO L600 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-10-22 11:22:18,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-10-22 11:22:18,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 191. [2019-10-22 11:22:18,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-10-22 11:22:18,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 276 transitions. [2019-10-22 11:22:18,325 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 276 transitions. Word has length 27 [2019-10-22 11:22:18,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:18,326 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 276 transitions. [2019-10-22 11:22:18,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:22:18,326 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 276 transitions. [2019-10-22 11:22:18,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-22 11:22:18,332 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:18,332 INFO L380 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] [2019-10-22 11:22:18,333 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:18,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:18,333 INFO L82 PathProgramCache]: Analyzing trace with hash -194860415, now seen corresponding path program 1 times [2019-10-22 11:22:18,333 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:18,334 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716002121] [2019-10-22 11:22:18,334 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:18,334 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:18,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:18,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:18,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:18,425 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716002121] [2019-10-22 11:22:18,425 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:18,425 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:18,425 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850026878] [2019-10-22 11:22:18,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:22:18,426 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:18,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:22:18,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:18,426 INFO L87 Difference]: Start difference. First operand 191 states and 276 transitions. Second operand 5 states. [2019-10-22 11:22:18,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:18,579 INFO L93 Difference]: Finished difference Result 709 states and 1031 transitions. [2019-10-22 11:22:18,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:22:18,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-10-22 11:22:18,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:18,584 INFO L225 Difference]: With dead ends: 709 [2019-10-22 11:22:18,584 INFO L226 Difference]: Without dead ends: 525 [2019-10-22 11:22:18,585 INFO L600 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-10-22 11:22:18,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2019-10-22 11:22:18,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 189. [2019-10-22 11:22:18,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-10-22 11:22:18,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 270 transitions. [2019-10-22 11:22:18,611 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 270 transitions. Word has length 28 [2019-10-22 11:22:18,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:18,612 INFO L462 AbstractCegarLoop]: Abstraction has 189 states and 270 transitions. [2019-10-22 11:22:18,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:22:18,612 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 270 transitions. [2019-10-22 11:22:18,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 11:22:18,616 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:18,616 INFO L380 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] [2019-10-22 11:22:18,617 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:18,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:18,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1409937664, now seen corresponding path program 1 times [2019-10-22 11:22:18,617 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:18,617 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507669440] [2019-10-22 11:22:18,618 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:18,618 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:18,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:18,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:18,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:18,686 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507669440] [2019-10-22 11:22:18,686 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:18,687 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:22:18,687 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385571907] [2019-10-22 11:22:18,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:22:18,687 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:18,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:22:18,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:18,688 INFO L87 Difference]: Start difference. First operand 189 states and 270 transitions. Second operand 5 states. [2019-10-22 11:22:18,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:18,742 INFO L93 Difference]: Finished difference Result 515 states and 728 transitions. [2019-10-22 11:22:18,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:22:18,743 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-10-22 11:22:18,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:18,744 INFO L225 Difference]: With dead ends: 515 [2019-10-22 11:22:18,744 INFO L226 Difference]: Without dead ends: 333 [2019-10-22 11:22:18,745 INFO L600 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-10-22 11:22:18,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-10-22 11:22:18,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 201. [2019-10-22 11:22:18,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-10-22 11:22:18,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 282 transitions. [2019-10-22 11:22:18,763 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 282 transitions. Word has length 32 [2019-10-22 11:22:18,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:18,763 INFO L462 AbstractCegarLoop]: Abstraction has 201 states and 282 transitions. [2019-10-22 11:22:18,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:22:18,764 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 282 transitions. [2019-10-22 11:22:18,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 11:22:18,765 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:18,765 INFO L380 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] [2019-10-22 11:22:18,765 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:18,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:18,766 INFO L82 PathProgramCache]: Analyzing trace with hash 2111002242, now seen corresponding path program 1 times [2019-10-22 11:22:18,766 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:18,766 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318786067] [2019-10-22 11:22:18,766 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:18,766 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:18,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:18,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:18,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-10-22 11:22:18,815 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318786067] [2019-10-22 11:22:18,815 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:18,816 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:18,816 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439722893] [2019-10-22 11:22:18,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:18,817 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:18,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:18,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:18,817 INFO L87 Difference]: Start difference. First operand 201 states and 282 transitions. Second operand 4 states. [2019-10-22 11:22:18,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:18,871 INFO L93 Difference]: Finished difference Result 491 states and 683 transitions. [2019-10-22 11:22:18,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:18,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-10-22 11:22:18,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:18,873 INFO L225 Difference]: With dead ends: 491 [2019-10-22 11:22:18,873 INFO L226 Difference]: Without dead ends: 297 [2019-10-22 11:22:18,874 INFO L600 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-10-22 11:22:18,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-10-22 11:22:18,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 209. [2019-10-22 11:22:18,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-10-22 11:22:18,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 290 transitions. [2019-10-22 11:22:18,891 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 290 transitions. Word has length 32 [2019-10-22 11:22:18,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:18,892 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 290 transitions. [2019-10-22 11:22:18,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:18,892 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 290 transitions. [2019-10-22 11:22:18,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 11:22:18,893 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:18,893 INFO L380 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] [2019-10-22 11:22:18,893 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:18,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:18,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1524196228, now seen corresponding path program 1 times [2019-10-22 11:22:18,894 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:18,894 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065281525] [2019-10-22 11:22:18,894 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:18,894 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:18,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:18,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:18,944 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065281525] [2019-10-22 11:22:18,944 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:18,944 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:22:18,944 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017497223] [2019-10-22 11:22:18,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:22:18,945 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:18,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:22:18,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:18,945 INFO L87 Difference]: Start difference. First operand 209 states and 290 transitions. Second operand 3 states. [2019-10-22 11:22:18,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:18,985 INFO L93 Difference]: Finished difference Result 511 states and 703 transitions. [2019-10-22 11:22:18,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:22:18,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-22 11:22:18,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:18,988 INFO L225 Difference]: With dead ends: 511 [2019-10-22 11:22:18,988 INFO L226 Difference]: Without dead ends: 309 [2019-10-22 11:22:18,989 INFO L600 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-10-22 11:22:18,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-10-22 11:22:19,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2019-10-22 11:22:19,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-10-22 11:22:19,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 412 transitions. [2019-10-22 11:22:19,029 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 412 transitions. Word has length 32 [2019-10-22 11:22:19,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:19,031 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 412 transitions. [2019-10-22 11:22:19,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:22:19,032 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 412 transitions. [2019-10-22 11:22:19,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-22 11:22:19,033 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:19,033 INFO L380 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-10-22 11:22:19,033 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:19,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:19,034 INFO L82 PathProgramCache]: Analyzing trace with hash 61292740, now seen corresponding path program 1 times [2019-10-22 11:22:19,034 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:19,034 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465283130] [2019-10-22 11:22:19,034 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:19,035 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:19,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:19,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:19,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:19,104 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465283130] [2019-10-22 11:22:19,105 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:19,105 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:22:19,105 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249935584] [2019-10-22 11:22:19,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:22:19,106 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:19,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:22:19,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:19,106 INFO L87 Difference]: Start difference. First operand 309 states and 412 transitions. Second operand 3 states. [2019-10-22 11:22:19,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:19,164 INFO L93 Difference]: Finished difference Result 447 states and 603 transitions. [2019-10-22 11:22:19,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:22:19,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-22 11:22:19,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:19,166 INFO L225 Difference]: With dead ends: 447 [2019-10-22 11:22:19,166 INFO L226 Difference]: Without dead ends: 445 [2019-10-22 11:22:19,167 INFO L600 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-10-22 11:22:19,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2019-10-22 11:22:19,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 370. [2019-10-22 11:22:19,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-10-22 11:22:19,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 504 transitions. [2019-10-22 11:22:19,220 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 504 transitions. Word has length 33 [2019-10-22 11:22:19,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:19,222 INFO L462 AbstractCegarLoop]: Abstraction has 370 states and 504 transitions. [2019-10-22 11:22:19,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:22:19,222 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 504 transitions. [2019-10-22 11:22:19,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-22 11:22:19,223 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:19,223 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 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] [2019-10-22 11:22:19,225 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:19,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:19,225 INFO L82 PathProgramCache]: Analyzing trace with hash 290012344, now seen corresponding path program 1 times [2019-10-22 11:22:19,225 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:19,225 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342178840] [2019-10-22 11:22:19,226 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:19,226 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:19,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:19,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:22:19,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:22:19,831 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-22 11:22:19,831 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:22:19,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:22:19 BoogieIcfgContainer [2019-10-22 11:22:19,932 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:22:19,933 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:22:19,933 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:22:19,933 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:22:19,934 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:17" (3/4) ... [2019-10-22 11:22:19,940 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 11:22:20,077 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_eb4ad2a9-0b52-4903-88a1-9bc0c97beff8/bin/utaipan/witness.graphml [2019-10-22 11:22:20,078 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:22:20,080 INFO L168 Benchmark]: Toolchain (without parser) took 4191.02 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 236.5 MB). Free memory was 939.2 MB in the beginning and 1.0 GB in the end (delta: -86.8 MB). Peak memory consumption was 149.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:20,080 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:22:20,081 INFO L168 Benchmark]: CACSL2BoogieTranslator took 522.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.2 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -204.5 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:20,081 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.02 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-10-22 11:22:20,081 INFO L168 Benchmark]: Boogie Preprocessor took 28.79 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-10-22 11:22:20,082 INFO L168 Benchmark]: RCFGBuilder took 787.72 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: 68.7 MB). Peak memory consumption was 68.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:20,082 INFO L168 Benchmark]: TraceAbstraction took 2620.25 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 31.0 MB). Peak memory consumption was 102.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:20,082 INFO L168 Benchmark]: Witness Printer took 144.87 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:20,084 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 522.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.2 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -204.5 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 83.02 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.79 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 787.72 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: 68.7 MB). Peak memory consumption was 68.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2620.25 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 31.0 MB). Peak memory consumption was 102.3 MB. Max. memory is 11.5 GB. * Witness Printer took 144.87 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 900]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L47] int waterLevel = 1; [L48] int methaneLevelCritical = 0; [L310] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L545] int cleanupTimeShifts = 4; [L651] int pumpRunning = 0; [L652] int systemActive = 1; [L905] int methAndRunningLastTime ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L623] int retValue_acc ; [L624] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L536] int retValue_acc ; [L539] retValue_acc = 1 [L540] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L630] tmp = valid_product() [L632] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L910] methAndRunningLastTime = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L828] int splverifierCounter ; [L829] int tmp ; [L830] int tmp___0 ; [L831] int tmp___1 ; [L832] int tmp___2 ; [L835] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L837] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L839] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L845] tmp = __VERIFIER_nondet_int() [L847] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L65] COND TRUE waterLevel < 2 [L66] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L855] tmp___0 = __VERIFIER_nondet_int() [L857] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L77] COND FALSE !(\read(methaneLevelCritical)) [L80] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L865] tmp___2 = __VERIFIER_nondet_int() [L867] COND TRUE \read(tmp___2) [L822] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L659] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L666] COND TRUE \read(systemActive) [L688] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L691] COND TRUE ! pumpRunning [L785] int retValue_acc ; [L786] int tmp ; [L787] int tmp___0 ; [L127] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L130] COND FALSE !(waterLevel < 2) [L134] retValue_acc = 0 [L135] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L791] tmp = isHighWaterSensorDry() [L793] COND FALSE !(\read(tmp)) [L796] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L798] retValue_acc = tmp___0 [L799] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L693] tmp = isHighWaterLevel() [L695] COND TRUE \read(tmp) [L716] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L915] int tmp ; [L916] int tmp___0 ; [L86] int retValue_acc ; [L89] retValue_acc = methaneLevelCritical [L90] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L920] tmp = isMethaneLevelCritical() [L922] COND TRUE \read(tmp) [L740] int retValue_acc ; [L743] retValue_acc = pumpRunning [L744] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L924] tmp___0 = isPumpRunning() [L926] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L927] COND FALSE !(\read(methAndRunningLastTime)) [L932] methAndRunningLastTime = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L837] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L839] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L845] tmp = __VERIFIER_nondet_int() [L847] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L855] tmp___0 = __VERIFIER_nondet_int() [L857] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L865] tmp___2 = __VERIFIER_nondet_int() [L867] COND TRUE \read(tmp___2) [L822] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L659] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L53] COND TRUE waterLevel > 0 [L54] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L666] COND TRUE \read(systemActive) [L688] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L691] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L915] int tmp ; [L916] int tmp___0 ; [L86] int retValue_acc ; [L89] retValue_acc = methaneLevelCritical [L90] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L920] tmp = isMethaneLevelCritical() [L922] COND TRUE \read(tmp) [L740] int retValue_acc ; [L743] retValue_acc = pumpRunning [L744] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L924] tmp___0 = isPumpRunning() [L926] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L927] COND TRUE \read(methAndRunningLastTime) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L900] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 84 locations, 3 error locations. Result: UNSAFE, OverallTime: 2.5s, OverallIterations: 11, TraceHistogramMax: 2, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 712 SDtfs, 715 SDslu, 965 SDs, 0 SdLazy, 112 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=370occurred 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, 857 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 321 NumberOfCodeBlocks, 321 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 260 ConstructedInterpolants, 0 QuantifiedInterpolants, 13656 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 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...