./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec4_product45.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c 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_product45.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 a9369a06c8d4df60e49baaf177cf32aba3e52d93 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.25-f470102 [2019-11-28 17:26:57,958 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:26:57,961 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:26:57,979 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:26:57,979 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:26:57,981 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:26:57,983 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:26:57,992 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:26:57,998 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:26:58,002 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:26:58,003 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:26:58,005 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:26:58,005 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:26:58,008 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:26:58,009 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:26:58,011 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:26:58,012 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:26:58,013 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:26:58,016 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:26:58,019 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:26:58,023 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:26:58,028 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:26:58,029 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:26:58,031 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:26:58,033 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:26:58,034 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:26:58,034 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:26:58,036 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:26:58,036 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:26:58,037 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:26:58,038 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:26:58,038 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:26:58,039 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:26:58,040 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:26:58,042 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:26:58,042 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:26:58,043 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:26:58,043 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:26:58,043 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:26:58,044 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:26:58,046 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:26:58,047 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 17:26:58,073 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:26:58,073 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:26:58,074 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:26:58,075 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:26:58,075 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:26:58,075 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:26:58,075 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:26:58,076 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:26:58,076 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:26:58,076 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:26:58,076 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:26:58,076 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:26:58,077 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:26:58,077 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:26:58,077 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:26:58,077 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:26:58,078 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:26:58,078 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:26:58,078 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:26:58,078 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:26:58,078 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:26:58,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:26:58,079 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:26:58,079 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:26:58,080 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:26:58,080 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:26:58,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:26:58,080 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:26:58,080 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:26:58,081 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 -> a9369a06c8d4df60e49baaf177cf32aba3e52d93 [2019-11-28 17:26:58,367 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:26:58,380 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:26:58,383 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:26:58,384 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:26:58,385 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:26:58,385 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec4_product45.cil.c [2019-11-28 17:26:58,453 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b1f6ebba/c5ff108058894cd7af24f392fada2449/FLAG2cbe975f1 [2019-11-28 17:26:58,974 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:26:58,974 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product45.cil.c [2019-11-28 17:26:58,988 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b1f6ebba/c5ff108058894cd7af24f392fada2449/FLAG2cbe975f1 [2019-11-28 17:26:59,300 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b1f6ebba/c5ff108058894cd7af24f392fada2449 [2019-11-28 17:26:59,303 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:26:59,305 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:26:59,306 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:26:59,306 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:26:59,309 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:26:59,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:26:59" (1/1) ... [2019-11-28 17:26:59,314 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61ee7b34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:26:59, skipping insertion in model container [2019-11-28 17:26:59,314 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:26:59" (1/1) ... [2019-11-28 17:26:59,321 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:26:59,373 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:26:59,801 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:26:59,814 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:26:59,931 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:26:59,967 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:26:59,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:26:59 WrapperNode [2019-11-28 17:26:59,968 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:26:59,969 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:26:59,969 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:26:59,969 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:26:59,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:26:59" (1/1) ... [2019-11-28 17:26:59,998 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:26:59" (1/1) ... [2019-11-28 17:27:00,049 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:27:00,050 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:27:00,050 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:27:00,050 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:27:00,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:26:59" (1/1) ... [2019-11-28 17:27:00,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:26:59" (1/1) ... [2019-11-28 17:27:00,077 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:26:59" (1/1) ... [2019-11-28 17:27:00,077 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:26:59" (1/1) ... [2019-11-28 17:27:00,097 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:26:59" (1/1) ... [2019-11-28 17:27:00,107 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:26:59" (1/1) ... [2019-11-28 17:27:00,111 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:26:59" (1/1) ... [2019-11-28 17:27:00,117 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:27:00,118 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:27:00,118 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:27:00,118 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:27:00,119 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:26:59" (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 17:27:00,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 17:27:00,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 17:27:00,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:27:00,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:27:01,264 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:27:01,264 INFO L287 CfgBuilder]: Removed 192 assume(true) statements. [2019-11-28 17:27:01,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:27:01 BoogieIcfgContainer [2019-11-28 17:27:01,266 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:27:01,267 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:27:01,268 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:27:01,271 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:27:01,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:26:59" (1/3) ... [2019-11-28 17:27:01,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c17c8ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:27:01, skipping insertion in model container [2019-11-28 17:27:01,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:26:59" (2/3) ... [2019-11-28 17:27:01,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c17c8ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:27:01, skipping insertion in model container [2019-11-28 17:27:01,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:27:01" (3/3) ... [2019-11-28 17:27:01,275 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product45.cil.c [2019-11-28 17:27:01,286 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:27:01,293 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 17:27:01,304 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 17:27:01,328 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:27:01,328 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:27:01,329 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:27:01,329 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:27:01,329 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:27:01,329 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:27:01,330 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:27:01,330 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:27:01,350 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2019-11-28 17:27:01,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 17:27:01,360 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:27:01,361 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:27:01,362 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:27:01,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:27:01,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1880189342, now seen corresponding path program 1 times [2019-11-28 17:27:01,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:27:01,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806154616] [2019-11-28 17:27:01,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:27:01,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:27:01,706 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 17:27:01,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806154616] [2019-11-28 17:27:01,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:27:01,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:27:01,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763111934] [2019-11-28 17:27:01,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 17:27:01,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:27:01,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 17:27:01,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 17:27:01,738 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 2 states. [2019-11-28 17:27:01,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:27:01,801 INFO L93 Difference]: Finished difference Result 252 states and 377 transitions. [2019-11-28 17:27:01,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 17:27:01,803 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-28 17:27:01,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:27:01,823 INFO L225 Difference]: With dead ends: 252 [2019-11-28 17:27:01,824 INFO L226 Difference]: Without dead ends: 125 [2019-11-28 17:27:01,830 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 17:27:01,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-28 17:27:01,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-11-28 17:27:01,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-28 17:27:01,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 180 transitions. [2019-11-28 17:27:01,896 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 180 transitions. Word has length 16 [2019-11-28 17:27:01,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:27:01,898 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 180 transitions. [2019-11-28 17:27:01,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 17:27:01,899 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 180 transitions. [2019-11-28 17:27:01,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 17:27:01,902 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:27:01,902 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 17:27:01,902 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:27:01,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:27:01,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1368021057, now seen corresponding path program 1 times [2019-11-28 17:27:01,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:27:01,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824529935] [2019-11-28 17:27:01,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:27:01,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:27:02,102 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 17:27:02,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824529935] [2019-11-28 17:27:02,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:27:02,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:27:02,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747307231] [2019-11-28 17:27:02,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:27:02,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:27:02,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:27:02,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:27:02,106 INFO L87 Difference]: Start difference. First operand 125 states and 180 transitions. Second operand 3 states. [2019-11-28 17:27:02,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:27:02,121 INFO L93 Difference]: Finished difference Result 125 states and 180 transitions. [2019-11-28 17:27:02,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:27:02,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 17:27:02,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:27:02,124 INFO L225 Difference]: With dead ends: 125 [2019-11-28 17:27:02,124 INFO L226 Difference]: Without dead ends: 51 [2019-11-28 17:27:02,127 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 17:27:02,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-28 17:27:02,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-11-28 17:27:02,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-28 17:27:02,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2019-11-28 17:27:02,141 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 17 [2019-11-28 17:27:02,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:27:02,141 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2019-11-28 17:27:02,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:27:02,142 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2019-11-28 17:27:02,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 17:27:02,144 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:27:02,144 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 17:27:02,144 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:27:02,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:27:02,145 INFO L82 PathProgramCache]: Analyzing trace with hash -2019078694, now seen corresponding path program 1 times [2019-11-28 17:27:02,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:27:02,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403819840] [2019-11-28 17:27:02,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:27:02,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:27:02,281 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 17:27:02,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403819840] [2019-11-28 17:27:02,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:27:02,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:27:02,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399911919] [2019-11-28 17:27:02,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 17:27:02,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:27:02,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 17:27:02,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 17:27:02,285 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. Second operand 6 states. [2019-11-28 17:27:02,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:27:02,416 INFO L93 Difference]: Finished difference Result 96 states and 140 transitions. [2019-11-28 17:27:02,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:27:02,417 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-11-28 17:27:02,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:27:02,419 INFO L225 Difference]: With dead ends: 96 [2019-11-28 17:27:02,419 INFO L226 Difference]: Without dead ends: 51 [2019-11-28 17:27:02,420 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 17:27:02,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-28 17:27:02,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-11-28 17:27:02,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-28 17:27:02,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 72 transitions. [2019-11-28 17:27:02,427 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 72 transitions. Word has length 22 [2019-11-28 17:27:02,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:27:02,428 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 72 transitions. [2019-11-28 17:27:02,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 17:27:02,428 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 72 transitions. [2019-11-28 17:27:02,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 17:27:02,430 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:27:02,430 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:27:02,430 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:27:02,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:27:02,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1511639432, now seen corresponding path program 1 times [2019-11-28 17:27:02,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:27:02,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147387606] [2019-11-28 17:27:02,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:27:02,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:27:02,524 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 17:27:02,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147387606] [2019-11-28 17:27:02,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:27:02,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:27:02,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177623041] [2019-11-28 17:27:02,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:27:02,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:27:02,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:27:02,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:27:02,527 INFO L87 Difference]: Start difference. First operand 51 states and 72 transitions. Second operand 3 states. [2019-11-28 17:27:02,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:27:02,581 INFO L93 Difference]: Finished difference Result 117 states and 168 transitions. [2019-11-28 17:27:02,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:27:02,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 17:27:02,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:27:02,583 INFO L225 Difference]: With dead ends: 117 [2019-11-28 17:27:02,583 INFO L226 Difference]: Without dead ends: 72 [2019-11-28 17:27:02,584 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 17:27:02,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-28 17:27:02,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-11-28 17:27:02,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-28 17:27:02,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 98 transitions. [2019-11-28 17:27:02,601 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 98 transitions. Word has length 24 [2019-11-28 17:27:02,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:27:02,602 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 98 transitions. [2019-11-28 17:27:02,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:27:02,603 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2019-11-28 17:27:02,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 17:27:02,605 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:27:02,605 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:27:02,605 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:27:02,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:27:02,606 INFO L82 PathProgramCache]: Analyzing trace with hash 406595852, now seen corresponding path program 1 times [2019-11-28 17:27:02,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:27:02,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874063921] [2019-11-28 17:27:02,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:27:02,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:27:02,779 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 17:27:02,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874063921] [2019-11-28 17:27:02,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:27:02,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 17:27:02,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090490621] [2019-11-28 17:27:02,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 17:27:02,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:27:02,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 17:27:02,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:27:02,783 INFO L87 Difference]: Start difference. First operand 70 states and 98 transitions. Second operand 8 states. [2019-11-28 17:27:03,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:27:03,211 INFO L93 Difference]: Finished difference Result 447 states and 648 transitions. [2019-11-28 17:27:03,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 17:27:03,213 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-11-28 17:27:03,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:27:03,220 INFO L225 Difference]: With dead ends: 447 [2019-11-28 17:27:03,220 INFO L226 Difference]: Without dead ends: 383 [2019-11-28 17:27:03,222 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-11-28 17:27:03,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-11-28 17:27:03,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 169. [2019-11-28 17:27:03,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-11-28 17:27:03,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 234 transitions. [2019-11-28 17:27:03,268 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 234 transitions. Word has length 30 [2019-11-28 17:27:03,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:27:03,269 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 234 transitions. [2019-11-28 17:27:03,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 17:27:03,269 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 234 transitions. [2019-11-28 17:27:03,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 17:27:03,274 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:27:03,274 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1] [2019-11-28 17:27:03,278 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:27:03,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:27:03,278 INFO L82 PathProgramCache]: Analyzing trace with hash -553017344, now seen corresponding path program 1 times [2019-11-28 17:27:03,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:27:03,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475120210] [2019-11-28 17:27:03,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:27:03,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:27:03,361 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 17:27:03,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475120210] [2019-11-28 17:27:03,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:27:03,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:27:03,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970436347] [2019-11-28 17:27:03,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:27:03,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:27:03,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:27:03,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:27:03,365 INFO L87 Difference]: Start difference. First operand 169 states and 234 transitions. Second operand 5 states. [2019-11-28 17:27:03,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:27:03,460 INFO L93 Difference]: Finished difference Result 458 states and 627 transitions. [2019-11-28 17:27:03,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:27:03,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-11-28 17:27:03,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:27:03,462 INFO L225 Difference]: With dead ends: 458 [2019-11-28 17:27:03,463 INFO L226 Difference]: Without dead ends: 295 [2019-11-28 17:27:03,465 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 17:27:03,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-11-28 17:27:03,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 184. [2019-11-28 17:27:03,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-11-28 17:27:03,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 249 transitions. [2019-11-28 17:27:03,494 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 249 transitions. Word has length 51 [2019-11-28 17:27:03,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:27:03,496 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 249 transitions. [2019-11-28 17:27:03,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:27:03,497 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 249 transitions. [2019-11-28 17:27:03,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 17:27:03,500 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:27:03,503 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1] [2019-11-28 17:27:03,504 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:27:03,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:27:03,505 INFO L82 PathProgramCache]: Analyzing trace with hash 148582530, now seen corresponding path program 1 times [2019-11-28 17:27:03,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:27:03,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395377306] [2019-11-28 17:27:03,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:27:03,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:27:03,568 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 17:27:03,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395377306] [2019-11-28 17:27:03,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:27:03,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:27:03,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624025806] [2019-11-28 17:27:03,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:27:03,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:27:03,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:27:03,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:27:03,576 INFO L87 Difference]: Start difference. First operand 184 states and 249 transitions. Second operand 4 states. [2019-11-28 17:27:03,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:27:03,639 INFO L93 Difference]: Finished difference Result 392 states and 529 transitions. [2019-11-28 17:27:03,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 17:27:03,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-11-28 17:27:03,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:27:03,641 INFO L225 Difference]: With dead ends: 392 [2019-11-28 17:27:03,642 INFO L226 Difference]: Without dead ends: 214 [2019-11-28 17:27:03,642 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 17:27:03,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-11-28 17:27:03,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 154. [2019-11-28 17:27:03,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-28 17:27:03,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 204 transitions. [2019-11-28 17:27:03,677 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 204 transitions. Word has length 51 [2019-11-28 17:27:03,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:27:03,678 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 204 transitions. [2019-11-28 17:27:03,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:27:03,678 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 204 transitions. [2019-11-28 17:27:03,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 17:27:03,680 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:27:03,681 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:27:03,681 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:27:03,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:27:03,681 INFO L82 PathProgramCache]: Analyzing trace with hash -701166778, now seen corresponding path program 1 times [2019-11-28 17:27:03,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:27:03,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800408505] [2019-11-28 17:27:03,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:27:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:27:03,789 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-28 17:27:03,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800408505] [2019-11-28 17:27:03,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:27:03,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:27:03,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333894590] [2019-11-28 17:27:03,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 17:27:03,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:27:03,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 17:27:03,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 17:27:03,794 INFO L87 Difference]: Start difference. First operand 154 states and 204 transitions. Second operand 6 states. [2019-11-28 17:27:04,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:27:04,029 INFO L93 Difference]: Finished difference Result 756 states and 1034 transitions. [2019-11-28 17:27:04,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 17:27:04,029 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-28 17:27:04,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:27:04,033 INFO L225 Difference]: With dead ends: 756 [2019-11-28 17:27:04,033 INFO L226 Difference]: Without dead ends: 608 [2019-11-28 17:27:04,034 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-11-28 17:27:04,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-11-28 17:27:04,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 300. [2019-11-28 17:27:04,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-11-28 17:27:04,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 394 transitions. [2019-11-28 17:27:04,063 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 394 transitions. Word has length 52 [2019-11-28 17:27:04,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:27:04,064 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 394 transitions. [2019-11-28 17:27:04,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 17:27:04,064 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 394 transitions. [2019-11-28 17:27:04,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 17:27:04,065 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:27:04,066 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:27:04,066 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:27:04,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:27:04,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1850284924, now seen corresponding path program 1 times [2019-11-28 17:27:04,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:27:04,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054092433] [2019-11-28 17:27:04,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:27:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:27:04,133 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-28 17:27:04,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054092433] [2019-11-28 17:27:04,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:27:04,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:27:04,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805419470] [2019-11-28 17:27:04,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:27:04,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:27:04,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:27:04,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:27:04,136 INFO L87 Difference]: Start difference. First operand 300 states and 394 transitions. Second operand 5 states. [2019-11-28 17:27:04,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:27:04,287 INFO L93 Difference]: Finished difference Result 800 states and 1059 transitions. [2019-11-28 17:27:04,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 17:27:04,288 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-11-28 17:27:04,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:27:04,292 INFO L225 Difference]: With dead ends: 800 [2019-11-28 17:27:04,292 INFO L226 Difference]: Without dead ends: 798 [2019-11-28 17:27:04,293 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 17:27:04,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2019-11-28 17:27:04,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 300. [2019-11-28 17:27:04,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-11-28 17:27:04,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 392 transitions. [2019-11-28 17:27:04,326 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 392 transitions. Word has length 53 [2019-11-28 17:27:04,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:27:04,326 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 392 transitions. [2019-11-28 17:27:04,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:27:04,327 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 392 transitions. [2019-11-28 17:27:04,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 17:27:04,328 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:27:04,328 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:27:04,329 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:27:04,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:27:04,329 INFO L82 PathProgramCache]: Analyzing trace with hash -956023316, now seen corresponding path program 1 times [2019-11-28 17:27:04,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:27:04,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871834826] [2019-11-28 17:27:04,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:27:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:27:04,409 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 17:27:04,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871834826] [2019-11-28 17:27:04,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428439481] [2019-11-28 17:27:04,410 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 17:27:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:27:04,546 INFO L264 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 17:27:04,554 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:27:04,612 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 17:27:04,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:27:04,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-11-28 17:27:04,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155599511] [2019-11-28 17:27:04,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 17:27:04,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:27:04,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 17:27:04,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:27:04,616 INFO L87 Difference]: Start difference. First operand 300 states and 392 transitions. Second operand 8 states. [2019-11-28 17:27:04,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:27:04,924 INFO L93 Difference]: Finished difference Result 1100 states and 1463 transitions. [2019-11-28 17:27:04,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 17:27:04,925 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-11-28 17:27:04,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:27:04,933 INFO L225 Difference]: With dead ends: 1100 [2019-11-28 17:27:04,934 INFO L226 Difference]: Without dead ends: 854 [2019-11-28 17:27:04,935 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-11-28 17:27:04,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2019-11-28 17:27:04,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 386. [2019-11-28 17:27:04,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2019-11-28 17:27:04,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 500 transitions. [2019-11-28 17:27:04,988 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 500 transitions. Word has length 53 [2019-11-28 17:27:04,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:27:04,989 INFO L462 AbstractCegarLoop]: Abstraction has 386 states and 500 transitions. [2019-11-28 17:27:04,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 17:27:04,990 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 500 transitions. [2019-11-28 17:27:04,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-28 17:27:04,991 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:27:04,991 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:27:05,205 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:27:05,206 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:27:05,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:27:05,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1396677984, now seen corresponding path program 2 times [2019-11-28 17:27:05,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:27:05,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346998791] [2019-11-28 17:27:05,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:27:05,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:27:05,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:27:05,454 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 17:27:05,454 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 17:27:05,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:27:05 BoogieIcfgContainer [2019-11-28 17:27:05,691 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:27:05,691 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:27:05,692 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:27:05,692 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:27:05,692 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:27:01" (3/4) ... [2019-11-28 17:27:05,697 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 17:27:05,940 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:27:05,941 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:27:05,943 INFO L168 Benchmark]: Toolchain (without parser) took 6638.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 220.7 MB). Free memory was 957.7 MB in the beginning and 918.7 MB in the end (delta: 39.0 MB). Peak memory consumption was 259.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:27:05,944 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:27:05,944 INFO L168 Benchmark]: CACSL2BoogieTranslator took 663.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -168.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-28 17:27:05,945 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.38 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 17:27:05,945 INFO L168 Benchmark]: Boogie Preprocessor took 67.56 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 17:27:05,946 INFO L168 Benchmark]: RCFGBuilder took 1148.36 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: 63.7 MB). Peak memory consumption was 63.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:27:05,946 INFO L168 Benchmark]: TraceAbstraction took 4423.69 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.0 GB in the beginning and 948.8 MB in the end (delta: 100.4 MB). Peak memory consumption was 171.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:27:05,947 INFO L168 Benchmark]: Witness Printer took 249.55 ms. Allocated memory is still 1.2 GB. Free memory was 948.8 MB in the beginning and 918.7 MB in the end (delta: 30.1 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. [2019-11-28 17:27:05,949 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 663.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -168.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 80.38 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 67.56 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 1148.36 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: 63.7 MB). Peak memory consumption was 63.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4423.69 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.0 GB in the beginning and 948.8 MB in the end (delta: 100.4 MB). Peak memory consumption was 171.7 MB. Max. memory is 11.5 GB. * Witness Printer took 249.55 ms. Allocated memory is still 1.2 GB. Free memory was 948.8 MB in the beginning and 918.7 MB in the end (delta: 30.1 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 317]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L117] int pumpRunning = 0; [L118] int systemActive = 1; [L491] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L715] int cleanupTimeShifts = 4; [L814] int waterLevel = 1; [L815] int methaneLevelCritical = 0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L791] int retValue_acc ; [L792] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L934] int retValue_acc ; [L937] retValue_acc = 1 [L938] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L798] tmp = valid_product() [L800] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L45] int splverifierCounter ; [L46] int tmp ; [L47] int tmp___0 ; [L48] int tmp___1 ; [L49] int tmp___2 ; [L52] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L54] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L56] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L62] tmp = __VERIFIER_nondet_int() [L64] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L832] COND TRUE waterLevel < 2 [L833] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L72] tmp___0 = __VERIFIER_nondet_int() [L74] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L82] tmp___2 = __VERIFIER_nondet_int() [L84] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L125] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L132] COND TRUE \read(systemActive) [L180] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L183] COND FALSE !(\read(pumpRunning)) [L154] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L157] COND TRUE ! pumpRunning [L294] int retValue_acc ; [L295] int tmp ; [L296] int tmp___0 ; [L894] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L897] COND FALSE !(waterLevel < 2) [L901] retValue_acc = 0 [L902] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L300] tmp = isHighWaterSensorDry() [L302] COND FALSE !(\read(tmp)) [L305] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L307] retValue_acc = tmp___0 [L308] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L159] tmp = isHighWaterLevel() [L161] COND TRUE \read(tmp) [L213] int tmp ; [L238] int retValue_acc ; [L853] int retValue_acc ; [L856] retValue_acc = methaneLevelCritical [L857] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L242] retValue_acc = isMethaneLevelCritical() [L244] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L217] tmp = isMethaneAlarm() [L219] COND FALSE !(\read(tmp)) [L208] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L690] int tmp ; [L691] int tmp___0 ; [L885] int retValue_acc ; [L888] retValue_acc = waterLevel [L889] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L695] tmp = getWaterLevel() [L697] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L54] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L56] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L62] tmp = __VERIFIER_nondet_int() [L64] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L72] tmp___0 = __VERIFIER_nondet_int() [L74] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L82] tmp___2 = __VERIFIER_nondet_int() [L84] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L125] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L820] COND TRUE waterLevel > 0 [L821] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L132] COND TRUE \read(systemActive) [L180] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L183] COND TRUE \read(pumpRunning) [L238] int retValue_acc ; [L853] int retValue_acc ; [L856] retValue_acc = methaneLevelCritical [L857] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L242] retValue_acc = isMethaneLevelCritical() [L244] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L185] tmp = isMethaneAlarm() [L187] COND FALSE !(\read(tmp)) [L154] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L157] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L690] int tmp ; [L691] int tmp___0 ; [L885] int retValue_acc ; [L888] retValue_acc = waterLevel [L889] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L695] tmp = getWaterLevel() [L697] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L54] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L56] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L62] tmp = __VERIFIER_nondet_int() [L64] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L72] tmp___0 = __VERIFIER_nondet_int() [L74] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L82] tmp___2 = __VERIFIER_nondet_int() [L84] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L125] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L820] COND TRUE waterLevel > 0 [L821] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L132] COND TRUE \read(systemActive) [L180] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L183] COND TRUE \read(pumpRunning) [L238] int retValue_acc ; [L853] int retValue_acc ; [L856] retValue_acc = methaneLevelCritical [L857] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L242] retValue_acc = isMethaneLevelCritical() [L244] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L185] tmp = isMethaneAlarm() [L187] COND FALSE !(\read(tmp)) [L154] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L157] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L690] int tmp ; [L691] int tmp___0 ; [L885] int retValue_acc ; [L888] retValue_acc = waterLevel [L889] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L695] tmp = getWaterLevel() [L697] COND TRUE tmp == 0 [L249] int retValue_acc ; [L252] retValue_acc = pumpRunning [L253] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L699] tmp___0 = isPumpRunning() [L701] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L317] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 129 locations, 3 error locations. Result: UNSAFE, OverallTime: 4.1s, OverallIterations: 11, TraceHistogramMax: 3, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1090 SDtfs, 2086 SDslu, 2157 SDs, 0 SdLazy, 336 SolverSat, 87 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 134 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=386occurred 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.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 1661 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 494 NumberOfCodeBlocks, 494 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 411 ConstructedInterpolants, 0 QuantifiedInterpolants, 38596 SizeOfPredicates, 4 NumberOfNonLiveVariables, 410 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 86/92 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...