./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 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_spec2_product36.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 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.25-f470102 [2019-11-28 17:25:07,239 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:25:07,241 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:25:07,253 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:25:07,253 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:25:07,255 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:25:07,257 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:25:07,259 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:25:07,260 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:25:07,261 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:25:07,262 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:25:07,264 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:25:07,264 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:25:07,265 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:25:07,266 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:25:07,267 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:25:07,268 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:25:07,269 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:25:07,271 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:25:07,274 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:25:07,276 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:25:07,277 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:25:07,278 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:25:07,279 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:25:07,282 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:25:07,282 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:25:07,282 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:25:07,284 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:25:07,284 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:25:07,285 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:25:07,286 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:25:07,287 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:25:07,288 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:25:07,291 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:25:07,292 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:25:07,293 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:25:07,294 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:25:07,294 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:25:07,294 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:25:07,295 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:25:07,296 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:25:07,297 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:25:07,312 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:25:07,313 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:25:07,314 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:25:07,314 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:25:07,314 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:25:07,315 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:25:07,315 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:25:07,315 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:25:07,315 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:25:07,315 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:25:07,316 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:25:07,316 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:25:07,316 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:25:07,316 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:25:07,317 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:25:07,317 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:25:07,317 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:25:07,317 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:25:07,317 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:25:07,318 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:25:07,318 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:25:07,318 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:25:07,318 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:25:07,319 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:25:07,319 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:25:07,319 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:25:07,319 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:25:07,319 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:25:07,320 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:25:07,320 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 -> 49fa497f38e3a46185ee804b3f30fdc119cb200c [2019-11-28 17:25:07,649 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:25:07,672 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:25:07,675 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:25:07,677 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:25:07,677 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:25:07,678 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec2_product36.cil.c [2019-11-28 17:25:07,755 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc2c3096d/60984d8f8c1a4eb5866bd634b2fd74e7/FLAGfb8cb3ab4 [2019-11-28 17:25:08,390 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:25:08,390 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product36.cil.c [2019-11-28 17:25:08,403 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc2c3096d/60984d8f8c1a4eb5866bd634b2fd74e7/FLAGfb8cb3ab4 [2019-11-28 17:25:08,706 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc2c3096d/60984d8f8c1a4eb5866bd634b2fd74e7 [2019-11-28 17:25:08,710 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:25:08,712 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:25:08,714 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:25:08,714 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:25:08,719 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:25:08,720 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:25:08" (1/1) ... [2019-11-28 17:25:08,723 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d72e966 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:08, skipping insertion in model container [2019-11-28 17:25:08,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:25:08" (1/1) ... [2019-11-28 17:25:08,732 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:25:08,796 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:25:09,208 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:25:09,227 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:25:09,322 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:25:09,359 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:25:09,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:09 WrapperNode [2019-11-28 17:25:09,359 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:25:09,360 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:25:09,361 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:25:09,361 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:25:09,369 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:25:09" (1/1) ... [2019-11-28 17:25:09,389 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:25:09" (1/1) ... [2019-11-28 17:25:09,431 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:25:09,432 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:25:09,432 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:25:09,432 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:25:09,441 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:09" (1/1) ... [2019-11-28 17:25:09,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:09" (1/1) ... [2019-11-28 17:25:09,445 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:09" (1/1) ... [2019-11-28 17:25:09,446 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:09" (1/1) ... [2019-11-28 17:25:09,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:09" (1/1) ... [2019-11-28 17:25:09,464 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:09" (1/1) ... [2019-11-28 17:25:09,467 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:09" (1/1) ... [2019-11-28 17:25:09,472 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:25:09,473 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:25:09,473 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:25:09,473 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:25:09,474 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:09" (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:25:09,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 17:25:09,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 17:25:09,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:25:09,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:25:10,276 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:25:10,276 INFO L287 CfgBuilder]: Removed 104 assume(true) statements. [2019-11-28 17:25:10,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:25:10 BoogieIcfgContainer [2019-11-28 17:25:10,278 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:25:10,279 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:25:10,279 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:25:10,283 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:25:10,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:25:08" (1/3) ... [2019-11-28 17:25:10,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb8c259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:25:10, skipping insertion in model container [2019-11-28 17:25:10,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:09" (2/3) ... [2019-11-28 17:25:10,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb8c259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:25:10, skipping insertion in model container [2019-11-28 17:25:10,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:25:10" (3/3) ... [2019-11-28 17:25:10,287 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product36.cil.c [2019-11-28 17:25:10,298 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:25:10,306 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 17:25:10,318 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 17:25:10,343 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:25:10,343 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:25:10,343 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:25:10,344 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:25:10,344 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:25:10,344 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:25:10,344 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:25:10,344 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:25:10,363 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2019-11-28 17:25:10,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 17:25:10,371 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:25:10,371 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:25:10,372 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:25:10,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:25:10,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1480559057, now seen corresponding path program 1 times [2019-11-28 17:25:10,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:25:10,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668107132] [2019-11-28 17:25:10,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:25:10,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:25:10,671 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:25:10,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668107132] [2019-11-28 17:25:10,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:25:10,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:25:10,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235433395] [2019-11-28 17:25:10,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 17:25:10,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:25:10,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 17:25:10,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 17:25:10,703 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 2 states. [2019-11-28 17:25:10,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:25:10,733 INFO L93 Difference]: Finished difference Result 161 states and 246 transitions. [2019-11-28 17:25:10,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 17:25:10,734 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-11-28 17:25:10,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:25:10,745 INFO L225 Difference]: With dead ends: 161 [2019-11-28 17:25:10,745 INFO L226 Difference]: Without dead ends: 80 [2019-11-28 17:25:10,749 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:25:10,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-28 17:25:10,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-11-28 17:25:10,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-28 17:25:10,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 115 transitions. [2019-11-28 17:25:10,797 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 115 transitions. Word has length 18 [2019-11-28 17:25:10,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:25:10,797 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 115 transitions. [2019-11-28 17:25:10,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 17:25:10,798 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 115 transitions. [2019-11-28 17:25:10,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 17:25:10,799 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:25:10,799 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:25:10,800 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:25:10,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:25:10,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1228794243, now seen corresponding path program 1 times [2019-11-28 17:25:10,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:25:10,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526798022] [2019-11-28 17:25:10,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:25:10,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:25:10,968 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:25:10,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526798022] [2019-11-28 17:25:10,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:25:10,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:25:10,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035748320] [2019-11-28 17:25:10,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:25:10,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:25:10,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:25:10,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:25:10,979 INFO L87 Difference]: Start difference. First operand 80 states and 115 transitions. Second operand 3 states. [2019-11-28 17:25:10,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:25:10,993 INFO L93 Difference]: Finished difference Result 80 states and 115 transitions. [2019-11-28 17:25:10,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:25:10,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 17:25:10,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:25:10,995 INFO L225 Difference]: With dead ends: 80 [2019-11-28 17:25:10,995 INFO L226 Difference]: Without dead ends: 38 [2019-11-28 17:25:10,996 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:25:10,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-28 17:25:11,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-11-28 17:25:11,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-28 17:25:11,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 54 transitions. [2019-11-28 17:25:11,003 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 54 transitions. Word has length 19 [2019-11-28 17:25:11,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:25:11,004 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 54 transitions. [2019-11-28 17:25:11,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:25:11,004 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 54 transitions. [2019-11-28 17:25:11,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 17:25:11,005 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:25:11,006 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:25:11,006 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:25:11,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:25:11,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1219405376, now seen corresponding path program 1 times [2019-11-28 17:25:11,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:25:11,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806002713] [2019-11-28 17:25:11,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:25:11,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:25:11,134 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:25:11,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806002713] [2019-11-28 17:25:11,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:25:11,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:25:11,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861223814] [2019-11-28 17:25:11,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:25:11,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:25:11,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:25:11,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:25:11,139 INFO L87 Difference]: Start difference. First operand 38 states and 54 transitions. Second operand 3 states. [2019-11-28 17:25:11,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:25:11,198 INFO L93 Difference]: Finished difference Result 100 states and 148 transitions. [2019-11-28 17:25:11,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:25:11,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 17:25:11,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:25:11,201 INFO L225 Difference]: With dead ends: 100 [2019-11-28 17:25:11,201 INFO L226 Difference]: Without dead ends: 69 [2019-11-28 17:25:11,203 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:25:11,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-28 17:25:11,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2019-11-28 17:25:11,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-28 17:25:11,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 96 transitions. [2019-11-28 17:25:11,225 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 96 transitions. Word has length 24 [2019-11-28 17:25:11,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:25:11,226 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 96 transitions. [2019-11-28 17:25:11,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:25:11,226 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 96 transitions. [2019-11-28 17:25:11,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 17:25:11,231 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:25:11,231 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:25:11,232 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:25:11,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:25:11,232 INFO L82 PathProgramCache]: Analyzing trace with hash 999444121, now seen corresponding path program 1 times [2019-11-28 17:25:11,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:25:11,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355046634] [2019-11-28 17:25:11,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:25:11,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:25:11,344 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:25:11,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355046634] [2019-11-28 17:25:11,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:25:11,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:25:11,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410740105] [2019-11-28 17:25:11,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:25:11,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:25:11,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:25:11,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:25:11,347 INFO L87 Difference]: Start difference. First operand 65 states and 96 transitions. Second operand 3 states. [2019-11-28 17:25:11,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:25:11,408 INFO L93 Difference]: Finished difference Result 166 states and 251 transitions. [2019-11-28 17:25:11,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:25:11,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 17:25:11,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:25:11,410 INFO L225 Difference]: With dead ends: 166 [2019-11-28 17:25:11,410 INFO L226 Difference]: Without dead ends: 108 [2019-11-28 17:25:11,411 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:25:11,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-28 17:25:11,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2019-11-28 17:25:11,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-28 17:25:11,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 156 transitions. [2019-11-28 17:25:11,444 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 156 transitions. Word has length 25 [2019-11-28 17:25:11,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:25:11,444 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 156 transitions. [2019-11-28 17:25:11,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:25:11,444 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 156 transitions. [2019-11-28 17:25:11,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 17:25:11,448 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:25:11,448 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] [2019-11-28 17:25:11,448 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:25:11,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:25:11,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1239284745, now seen corresponding path program 1 times [2019-11-28 17:25:11,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:25:11,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398852931] [2019-11-28 17:25:11,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:25:11,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:25:11,547 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:25:11,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398852931] [2019-11-28 17:25:11,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:25:11,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:25:11,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450732121] [2019-11-28 17:25:11,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:25:11,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:25:11,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:25:11,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:25:11,550 INFO L87 Difference]: Start difference. First operand 106 states and 156 transitions. Second operand 5 states. [2019-11-28 17:25:11,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:25:11,668 INFO L93 Difference]: Finished difference Result 510 states and 765 transitions. [2019-11-28 17:25:11,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 17:25:11,669 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-28 17:25:11,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:25:11,672 INFO L225 Difference]: With dead ends: 510 [2019-11-28 17:25:11,673 INFO L226 Difference]: Without dead ends: 411 [2019-11-28 17:25:11,674 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:25:11,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-11-28 17:25:11,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 191. [2019-11-28 17:25:11,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-11-28 17:25:11,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 276 transitions. [2019-11-28 17:25:11,704 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 276 transitions. Word has length 27 [2019-11-28 17:25:11,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:25:11,704 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 276 transitions. [2019-11-28 17:25:11,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:25:11,705 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 276 transitions. [2019-11-28 17:25:11,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 17:25:11,706 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:25:11,707 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] [2019-11-28 17:25:11,707 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:25:11,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:25:11,708 INFO L82 PathProgramCache]: Analyzing trace with hash -194860415, now seen corresponding path program 1 times [2019-11-28 17:25:11,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:25:11,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091863898] [2019-11-28 17:25:11,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:25:11,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:25:11,787 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:25:11,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091863898] [2019-11-28 17:25:11,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:25:11,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:25:11,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091948538] [2019-11-28 17:25:11,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:25:11,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:25:11,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:25:11,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:25:11,791 INFO L87 Difference]: Start difference. First operand 191 states and 276 transitions. Second operand 5 states. [2019-11-28 17:25:11,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:25:11,959 INFO L93 Difference]: Finished difference Result 709 states and 1031 transitions. [2019-11-28 17:25:11,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 17:25:11,960 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-11-28 17:25:11,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:25:11,964 INFO L225 Difference]: With dead ends: 709 [2019-11-28 17:25:11,965 INFO L226 Difference]: Without dead ends: 525 [2019-11-28 17:25:11,969 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:25:11,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2019-11-28 17:25:12,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 189. [2019-11-28 17:25:12,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-11-28 17:25:12,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 270 transitions. [2019-11-28 17:25:12,012 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 270 transitions. Word has length 28 [2019-11-28 17:25:12,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:25:12,012 INFO L462 AbstractCegarLoop]: Abstraction has 189 states and 270 transitions. [2019-11-28 17:25:12,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:25:12,013 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 270 transitions. [2019-11-28 17:25:12,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 17:25:12,022 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:25:12,027 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:25:12,028 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:25:12,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:25:12,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1409937664, now seen corresponding path program 1 times [2019-11-28 17:25:12,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:25:12,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596077769] [2019-11-28 17:25:12,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:25:12,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:25:12,087 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:25:12,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596077769] [2019-11-28 17:25:12,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:25:12,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:25:12,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849475313] [2019-11-28 17:25:12,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:25:12,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:25:12,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:25:12,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:25:12,089 INFO L87 Difference]: Start difference. First operand 189 states and 270 transitions. Second operand 5 states. [2019-11-28 17:25:12,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:25:12,166 INFO L93 Difference]: Finished difference Result 515 states and 728 transitions. [2019-11-28 17:25:12,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:25:12,167 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-11-28 17:25:12,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:25:12,170 INFO L225 Difference]: With dead ends: 515 [2019-11-28 17:25:12,170 INFO L226 Difference]: Without dead ends: 333 [2019-11-28 17:25:12,171 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:25:12,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-11-28 17:25:12,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 201. [2019-11-28 17:25:12,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-11-28 17:25:12,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 282 transitions. [2019-11-28 17:25:12,193 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 282 transitions. Word has length 32 [2019-11-28 17:25:12,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:25:12,193 INFO L462 AbstractCegarLoop]: Abstraction has 201 states and 282 transitions. [2019-11-28 17:25:12,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:25:12,194 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 282 transitions. [2019-11-28 17:25:12,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 17:25:12,195 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:25:12,195 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:25:12,195 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:25:12,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:25:12,196 INFO L82 PathProgramCache]: Analyzing trace with hash 2111002242, now seen corresponding path program 1 times [2019-11-28 17:25:12,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:25:12,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901069300] [2019-11-28 17:25:12,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:25:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:25:12,246 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:25:12,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901069300] [2019-11-28 17:25:12,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:25:12,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:25:12,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005435087] [2019-11-28 17:25:12,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:25:12,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:25:12,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:25:12,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:25:12,248 INFO L87 Difference]: Start difference. First operand 201 states and 282 transitions. Second operand 4 states. [2019-11-28 17:25:12,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:25:12,299 INFO L93 Difference]: Finished difference Result 491 states and 683 transitions. [2019-11-28 17:25:12,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 17:25:12,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-11-28 17:25:12,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:25:12,302 INFO L225 Difference]: With dead ends: 491 [2019-11-28 17:25:12,303 INFO L226 Difference]: Without dead ends: 297 [2019-11-28 17:25:12,304 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:25:12,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-11-28 17:25:12,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 209. [2019-11-28 17:25:12,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-11-28 17:25:12,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 290 transitions. [2019-11-28 17:25:12,322 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 290 transitions. Word has length 32 [2019-11-28 17:25:12,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:25:12,322 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 290 transitions. [2019-11-28 17:25:12,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:25:12,323 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 290 transitions. [2019-11-28 17:25:12,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 17:25:12,324 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:25:12,324 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:25:12,324 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:25:12,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:25:12,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1524196228, now seen corresponding path program 1 times [2019-11-28 17:25:12,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:25:12,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498805580] [2019-11-28 17:25:12,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:25:12,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:25:12,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:25:12,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498805580] [2019-11-28 17:25:12,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:25:12,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:25:12,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655181465] [2019-11-28 17:25:12,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:25:12,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:25:12,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:25:12,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:25:12,364 INFO L87 Difference]: Start difference. First operand 209 states and 290 transitions. Second operand 3 states. [2019-11-28 17:25:12,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:25:12,404 INFO L93 Difference]: Finished difference Result 511 states and 703 transitions. [2019-11-28 17:25:12,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:25:12,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-28 17:25:12,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:25:12,408 INFO L225 Difference]: With dead ends: 511 [2019-11-28 17:25:12,408 INFO L226 Difference]: Without dead ends: 309 [2019-11-28 17:25:12,409 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:25:12,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-11-28 17:25:12,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2019-11-28 17:25:12,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-11-28 17:25:12,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 412 transitions. [2019-11-28 17:25:12,441 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 412 transitions. Word has length 32 [2019-11-28 17:25:12,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:25:12,441 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 412 transitions. [2019-11-28 17:25:12,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:25:12,442 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 412 transitions. [2019-11-28 17:25:12,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 17:25:12,443 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:25:12,443 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:25:12,444 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:25:12,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:25:12,444 INFO L82 PathProgramCache]: Analyzing trace with hash 61292740, now seen corresponding path program 1 times [2019-11-28 17:25:12,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:25:12,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102160528] [2019-11-28 17:25:12,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:25:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:25:12,490 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:25:12,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102160528] [2019-11-28 17:25:12,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:25:12,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:25:12,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291485941] [2019-11-28 17:25:12,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:25:12,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:25:12,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:25:12,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:25:12,493 INFO L87 Difference]: Start difference. First operand 309 states and 412 transitions. Second operand 3 states. [2019-11-28 17:25:12,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:25:12,553 INFO L93 Difference]: Finished difference Result 447 states and 603 transitions. [2019-11-28 17:25:12,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:25:12,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-28 17:25:12,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:25:12,557 INFO L225 Difference]: With dead ends: 447 [2019-11-28 17:25:12,557 INFO L226 Difference]: Without dead ends: 445 [2019-11-28 17:25:12,558 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:25:12,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2019-11-28 17:25:12,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 370. [2019-11-28 17:25:12,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-11-28 17:25:12,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 504 transitions. [2019-11-28 17:25:12,620 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 504 transitions. Word has length 33 [2019-11-28 17:25:12,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:25:12,620 INFO L462 AbstractCegarLoop]: Abstraction has 370 states and 504 transitions. [2019-11-28 17:25:12,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:25:12,621 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 504 transitions. [2019-11-28 17:25:12,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 17:25:12,622 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:25:12,623 INFO L410 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-11-28 17:25:12,623 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:25:12,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:25:12,624 INFO L82 PathProgramCache]: Analyzing trace with hash 290012344, now seen corresponding path program 1 times [2019-11-28 17:25:12,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:25:12,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115594376] [2019-11-28 17:25:12,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:25:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:25:12,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:25:12,797 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 17:25:12,798 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 17:25:12,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:25:12 BoogieIcfgContainer [2019-11-28 17:25:12,928 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:25:12,928 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:25:12,929 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:25:12,929 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:25:12,930 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:25:10" (3/4) ... [2019-11-28 17:25:12,933 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 17:25:13,084 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:25:13,084 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:25:13,086 INFO L168 Benchmark]: Toolchain (without parser) took 4373.82 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 222.3 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -185.9 MB). Peak memory consumption was 36.4 MB. Max. memory is 11.5 GB. [2019-11-28 17:25:13,087 INFO L168 Benchmark]: CDTParser took 0.86 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:25:13,087 INFO L168 Benchmark]: CACSL2BoogieTranslator took 646.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -159.6 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2019-11-28 17:25:13,088 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.01 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:25:13,088 INFO L168 Benchmark]: Boogie Preprocessor took 40.72 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:25:13,089 INFO L168 Benchmark]: RCFGBuilder took 805.32 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: 57.5 MB). Peak memory consumption was 57.5 MB. Max. memory is 11.5 GB. [2019-11-28 17:25:13,089 INFO L168 Benchmark]: TraceAbstraction took 2648.96 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 80.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -113.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:25:13,090 INFO L168 Benchmark]: Witness Printer took 155.59 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2019-11-28 17:25:13,092 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.86 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 646.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -159.6 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.01 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 40.72 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 805.32 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: 57.5 MB). Peak memory consumption was 57.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2648.96 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 80.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -113.9 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 155.59 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 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.4s, OverallIterations: 11, TraceHistogramMax: 2, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 712 SDtfs, 715 SDslu, 965 SDs, 0 SdLazy, 112 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s 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.3s SatisfiabilityAnalysisTime, 0.5s 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...