./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec4_product39.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_product39.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 c228d9f74ddd17cda7010ca670107d7221f92470 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:55,513 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:26:55,516 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:26:55,534 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:26:55,535 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:26:55,537 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:26:55,539 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:26:55,548 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:26:55,551 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:26:55,562 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:26:55,563 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:26:55,566 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:26:55,567 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:26:55,570 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:26:55,571 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:26:55,573 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:26:55,575 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:26:55,577 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:26:55,579 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:26:55,584 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:26:55,588 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:26:55,593 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:26:55,595 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:26:55,597 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:26:55,601 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:26:55,602 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:26:55,602 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:26:55,604 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:26:55,604 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:26:55,605 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:26:55,606 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:26:55,607 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:26:55,608 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:26:55,608 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:26:55,610 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:26:55,610 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:26:55,611 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:26:55,611 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:26:55,611 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:26:55,612 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:26:55,613 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:26:55,614 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:55,629 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:26:55,629 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:26:55,631 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:26:55,631 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:26:55,632 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:26:55,632 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:26:55,632 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:26:55,632 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:26:55,633 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:26:55,633 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:26:55,633 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:26:55,634 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:26:55,634 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:26:55,634 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:26:55,634 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:26:55,635 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:26:55,635 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:26:55,635 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:26:55,636 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:26:55,636 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:26:55,636 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:26:55,637 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:26:55,637 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:26:55,637 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:26:55,638 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:26:55,638 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:26:55,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:26:55,638 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:26:55,639 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:26:55,639 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 -> c228d9f74ddd17cda7010ca670107d7221f92470 [2019-11-28 17:26:55,947 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:26:55,960 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:26:55,964 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:26:55,965 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:26:55,967 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:26:55,968 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec4_product39.cil.c [2019-11-28 17:26:56,041 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/075d62e8f/09797ca17f4c4b3d89fd2bdb4017c90c/FLAG6d7ece49d [2019-11-28 17:26:56,614 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:26:56,615 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product39.cil.c [2019-11-28 17:26:56,628 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/075d62e8f/09797ca17f4c4b3d89fd2bdb4017c90c/FLAG6d7ece49d [2019-11-28 17:26:56,911 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/075d62e8f/09797ca17f4c4b3d89fd2bdb4017c90c [2019-11-28 17:26:56,914 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:26:56,916 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:26:56,917 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:26:56,917 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:26:56,921 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:26:56,922 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:26:56" (1/1) ... [2019-11-28 17:26:56,925 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@791c74b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:26:56, skipping insertion in model container [2019-11-28 17:26:56,925 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:26:56" (1/1) ... [2019-11-28 17:26:56,933 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:26:56,986 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:26:57,371 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:26:57,385 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:26:57,539 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:26:57,572 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:26:57,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:26:57 WrapperNode [2019-11-28 17:26:57,573 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:26:57,574 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:26:57,574 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:26:57,574 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:26:57,582 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:57" (1/1) ... [2019-11-28 17:26:57,611 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:57" (1/1) ... [2019-11-28 17:26:57,670 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:26:57,671 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:26:57,672 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:26:57,672 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:26:57,687 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:57" (1/1) ... [2019-11-28 17:26:57,687 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:57" (1/1) ... [2019-11-28 17:26:57,692 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:57" (1/1) ... [2019-11-28 17:26:57,693 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:57" (1/1) ... [2019-11-28 17:26:57,706 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:57" (1/1) ... [2019-11-28 17:26:57,715 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:57" (1/1) ... [2019-11-28 17:26:57,719 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:57" (1/1) ... [2019-11-28 17:26:57,725 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:26:57,726 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:26:57,726 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:26:57,726 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:26:57,727 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:26:57" (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:26:57,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 17:26:57,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 17:26:57,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:26:57,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:26:58,644 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:26:58,644 INFO L287 CfgBuilder]: Removed 160 assume(true) statements. [2019-11-28 17:26:58,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:26:58 BoogieIcfgContainer [2019-11-28 17:26:58,646 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:26:58,647 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:26:58,648 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:26:58,651 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:26:58,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:26:56" (1/3) ... [2019-11-28 17:26:58,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17062bc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:26:58, skipping insertion in model container [2019-11-28 17:26:58,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:26:57" (2/3) ... [2019-11-28 17:26:58,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17062bc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:26:58, skipping insertion in model container [2019-11-28 17:26:58,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:26:58" (3/3) ... [2019-11-28 17:26:58,656 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product39.cil.c [2019-11-28 17:26:58,666 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:26:58,675 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 17:26:58,688 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 17:26:58,716 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:26:58,717 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:26:58,717 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:26:58,717 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:26:58,718 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:26:58,718 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:26:58,719 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:26:58,719 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:26:58,743 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2019-11-28 17:26:58,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 17:26:58,757 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:26:58,758 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:26:58,759 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:26:58,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:26:58,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1221872895, now seen corresponding path program 1 times [2019-11-28 17:26:58,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:26:58,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690961770] [2019-11-28 17:26:58,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:26:58,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:26:59,016 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:26:59,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690961770] [2019-11-28 17:26:59,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:26:59,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:26:59,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289130465] [2019-11-28 17:26:59,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 17:26:59,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:26:59,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 17:26:59,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 17:26:59,044 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 2 states. [2019-11-28 17:26:59,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:26:59,082 INFO L93 Difference]: Finished difference Result 220 states and 335 transitions. [2019-11-28 17:26:59,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 17:26:59,084 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-28 17:26:59,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:26:59,097 INFO L225 Difference]: With dead ends: 220 [2019-11-28 17:26:59,098 INFO L226 Difference]: Without dead ends: 109 [2019-11-28 17:26:59,102 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:26:59,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-28 17:26:59,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-11-28 17:26:59,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-28 17:26:59,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 159 transitions. [2019-11-28 17:26:59,151 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 159 transitions. Word has length 16 [2019-11-28 17:26:59,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:26:59,152 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 159 transitions. [2019-11-28 17:26:59,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 17:26:59,152 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 159 transitions. [2019-11-28 17:26:59,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 17:26:59,154 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:26:59,154 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:26:59,154 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:26:59,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:26:59,155 INFO L82 PathProgramCache]: Analyzing trace with hash 175115998, now seen corresponding path program 1 times [2019-11-28 17:26:59,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:26:59,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361416193] [2019-11-28 17:26:59,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:26:59,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:26:59,308 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:26:59,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361416193] [2019-11-28 17:26:59,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:26:59,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:26:59,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732877615] [2019-11-28 17:26:59,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:26:59,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:26:59,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:26:59,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:26:59,317 INFO L87 Difference]: Start difference. First operand 109 states and 159 transitions. Second operand 3 states. [2019-11-28 17:26:59,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:26:59,340 INFO L93 Difference]: Finished difference Result 109 states and 159 transitions. [2019-11-28 17:26:59,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:26:59,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 17:26:59,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:26:59,344 INFO L225 Difference]: With dead ends: 109 [2019-11-28 17:26:59,346 INFO L226 Difference]: Without dead ends: 47 [2019-11-28 17:26:59,348 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:26:59,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-28 17:26:59,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-28 17:26:59,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-28 17:26:59,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2019-11-28 17:26:59,358 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 17 [2019-11-28 17:26:59,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:26:59,358 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2019-11-28 17:26:59,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:26:59,359 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2019-11-28 17:26:59,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 17:26:59,360 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:26:59,360 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:26:59,361 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:26:59,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:26:59,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1744081540, now seen corresponding path program 1 times [2019-11-28 17:26:59,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:26:59,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547714696] [2019-11-28 17:26:59,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:26:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:26:59,457 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:26:59,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547714696] [2019-11-28 17:26:59,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:26:59,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:26:59,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541289601] [2019-11-28 17:26:59,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:26:59,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:26:59,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:26:59,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:26:59,460 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand 3 states. [2019-11-28 17:26:59,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:26:59,492 INFO L93 Difference]: Finished difference Result 129 states and 192 transitions. [2019-11-28 17:26:59,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:26:59,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 17:26:59,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:26:59,494 INFO L225 Difference]: With dead ends: 129 [2019-11-28 17:26:59,494 INFO L226 Difference]: Without dead ends: 88 [2019-11-28 17:26:59,495 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:26:59,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-28 17:26:59,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2019-11-28 17:26:59,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-28 17:26:59,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 125 transitions. [2019-11-28 17:26:59,508 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 125 transitions. Word has length 22 [2019-11-28 17:26:59,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:26:59,509 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 125 transitions. [2019-11-28 17:26:59,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:26:59,509 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 125 transitions. [2019-11-28 17:26:59,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 17:26:59,511 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:26:59,511 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:26:59,511 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:26:59,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:26:59,512 INFO L82 PathProgramCache]: Analyzing trace with hash -595366227, now seen corresponding path program 1 times [2019-11-28 17:26:59,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:26:59,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848736789] [2019-11-28 17:26:59,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:26:59,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:26:59,582 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:26:59,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848736789] [2019-11-28 17:26:59,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:26:59,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:26:59,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597556670] [2019-11-28 17:26:59,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:26:59,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:26:59,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:26:59,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:26:59,585 INFO L87 Difference]: Start difference. First operand 84 states and 125 transitions. Second operand 3 states. [2019-11-28 17:26:59,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:26:59,632 INFO L93 Difference]: Finished difference Result 203 states and 306 transitions. [2019-11-28 17:26:59,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:26:59,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 17:26:59,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:26:59,634 INFO L225 Difference]: With dead ends: 203 [2019-11-28 17:26:59,634 INFO L226 Difference]: Without dead ends: 125 [2019-11-28 17:26:59,636 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:26:59,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-28 17:26:59,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2019-11-28 17:26:59,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-11-28 17:26:59,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 179 transitions. [2019-11-28 17:26:59,652 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 179 transitions. Word has length 24 [2019-11-28 17:26:59,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:26:59,653 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 179 transitions. [2019-11-28 17:26:59,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:26:59,653 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 179 transitions. [2019-11-28 17:26:59,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 17:26:59,655 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:26:59,655 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:26:59,655 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:26:59,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:26:59,656 INFO L82 PathProgramCache]: Analyzing trace with hash 566175321, now seen corresponding path program 1 times [2019-11-28 17:26:59,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:26:59,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515176193] [2019-11-28 17:26:59,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:26:59,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:26:59,771 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:26:59,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515176193] [2019-11-28 17:26:59,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:26:59,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:26:59,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166807658] [2019-11-28 17:26:59,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:26:59,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:26:59,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:26:59,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:26:59,776 INFO L87 Difference]: Start difference. First operand 123 states and 179 transitions. Second operand 5 states. [2019-11-28 17:26:59,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:26:59,937 INFO L93 Difference]: Finished difference Result 439 states and 645 transitions. [2019-11-28 17:26:59,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:26:59,938 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-28 17:26:59,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:26:59,941 INFO L225 Difference]: With dead ends: 439 [2019-11-28 17:26:59,941 INFO L226 Difference]: Without dead ends: 322 [2019-11-28 17:26:59,942 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:26:59,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-11-28 17:26:59,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 206. [2019-11-28 17:26:59,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-28 17:26:59,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 290 transitions. [2019-11-28 17:26:59,994 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 290 transitions. Word has length 25 [2019-11-28 17:26:59,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:26:59,995 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 290 transitions. [2019-11-28 17:26:59,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:26:59,995 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 290 transitions. [2019-11-28 17:26:59,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 17:26:59,998 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:27:00,000 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:27:00,000 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:27:00,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:27:00,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1393133669, now seen corresponding path program 1 times [2019-11-28 17:27:00,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:27:00,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175233590] [2019-11-28 17:27:00,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:27:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:27:00,114 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:00,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175233590] [2019-11-28 17:27:00,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:27:00,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:27:00,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401530099] [2019-11-28 17:27:00,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:27:00,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:27:00,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:27:00,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:27:00,119 INFO L87 Difference]: Start difference. First operand 206 states and 290 transitions. Second operand 5 states. [2019-11-28 17:27:00,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:27:00,276 INFO L93 Difference]: Finished difference Result 438 states and 630 transitions. [2019-11-28 17:27:00,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 17:27:00,277 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 17:27:00,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:27:00,281 INFO L225 Difference]: With dead ends: 438 [2019-11-28 17:27:00,281 INFO L226 Difference]: Without dead ends: 436 [2019-11-28 17:27:00,282 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:00,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-11-28 17:27:00,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 206. [2019-11-28 17:27:00,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-28 17:27:00,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 288 transitions. [2019-11-28 17:27:00,311 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 288 transitions. Word has length 26 [2019-11-28 17:27:00,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:27:00,312 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 288 transitions. [2019-11-28 17:27:00,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:27:00,312 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 288 transitions. [2019-11-28 17:27:00,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 17:27:00,314 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:27:00,314 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] [2019-11-28 17:27:00,315 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:27:00,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:27:00,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1756729668, now seen corresponding path program 1 times [2019-11-28 17:27:00,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:27:00,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999127051] [2019-11-28 17:27:00,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:27:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:27:00,380 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:00,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999127051] [2019-11-28 17:27:00,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:27:00,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:27:00,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365537113] [2019-11-28 17:27:00,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:27:00,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:27:00,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:27:00,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:27:00,383 INFO L87 Difference]: Start difference. First operand 206 states and 288 transitions. Second operand 5 states. [2019-11-28 17:27:00,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:27:00,483 INFO L93 Difference]: Finished difference Result 577 states and 799 transitions. [2019-11-28 17:27:00,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:27:00,485 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-28 17:27:00,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:27:00,488 INFO L225 Difference]: With dead ends: 577 [2019-11-28 17:27:00,488 INFO L226 Difference]: Without dead ends: 377 [2019-11-28 17:27:00,490 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:00,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-11-28 17:27:00,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 224. [2019-11-28 17:27:00,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-11-28 17:27:00,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 306 transitions. [2019-11-28 17:27:00,516 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 306 transitions. Word has length 31 [2019-11-28 17:27:00,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:27:00,518 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 306 transitions. [2019-11-28 17:27:00,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:27:00,519 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 306 transitions. [2019-11-28 17:27:00,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 17:27:00,526 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:27:00,527 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] [2019-11-28 17:27:00,527 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:27:00,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:27:00,528 INFO L82 PathProgramCache]: Analyzing trace with hash 2145210618, now seen corresponding path program 1 times [2019-11-28 17:27:00,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:27:00,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467136149] [2019-11-28 17:27:00,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:27:00,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:27:00,632 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:00,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467136149] [2019-11-28 17:27:00,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:27:00,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:27:00,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383298759] [2019-11-28 17:27:00,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:27:00,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:27:00,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:27:00,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:27:00,635 INFO L87 Difference]: Start difference. First operand 224 states and 306 transitions. Second operand 5 states. [2019-11-28 17:27:00,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:27:00,765 INFO L93 Difference]: Finished difference Result 555 states and 749 transitions. [2019-11-28 17:27:00,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 17:27:00,765 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-28 17:27:00,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:27:00,769 INFO L225 Difference]: With dead ends: 555 [2019-11-28 17:27:00,769 INFO L226 Difference]: Without dead ends: 337 [2019-11-28 17:27:00,771 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 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:00,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-11-28 17:27:00,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 193. [2019-11-28 17:27:00,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-11-28 17:27:00,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 258 transitions. [2019-11-28 17:27:00,796 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 258 transitions. Word has length 31 [2019-11-28 17:27:00,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:27:00,796 INFO L462 AbstractCegarLoop]: Abstraction has 193 states and 258 transitions. [2019-11-28 17:27:00,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:27:00,797 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 258 transitions. [2019-11-28 17:27:00,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 17:27:00,799 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:27:00,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:27:00,800 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:27:00,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:27:00,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1891591240, now seen corresponding path program 1 times [2019-11-28 17:27:00,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:27:00,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096867888] [2019-11-28 17:27:00,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:27:00,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:27:00,872 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:00,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096867888] [2019-11-28 17:27:00,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:27:00,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:27:00,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473926228] [2019-11-28 17:27:00,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:27:00,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:27:00,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:27:00,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:27:00,876 INFO L87 Difference]: Start difference. First operand 193 states and 258 transitions. Second operand 5 states. [2019-11-28 17:27:01,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:27:01,082 INFO L93 Difference]: Finished difference Result 534 states and 732 transitions. [2019-11-28 17:27:01,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:27:01,083 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-28 17:27:01,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:27:01,085 INFO L225 Difference]: With dead ends: 534 [2019-11-28 17:27:01,085 INFO L226 Difference]: Without dead ends: 397 [2019-11-28 17:27:01,087 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:27:01,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-28 17:27:01,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 278. [2019-11-28 17:27:01,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-11-28 17:27:01,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 367 transitions. [2019-11-28 17:27:01,112 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 367 transitions. Word has length 31 [2019-11-28 17:27:01,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:27:01,112 INFO L462 AbstractCegarLoop]: Abstraction has 278 states and 367 transitions. [2019-11-28 17:27:01,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:27:01,112 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 367 transitions. [2019-11-28 17:27:01,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-28 17:27:01,113 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:27:01,114 INFO L410 BasicCegarLoop]: trace histogram [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:01,114 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:27:01,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:27:01,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1736126716, now seen corresponding path program 1 times [2019-11-28 17:27:01,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:27:01,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048298559] [2019-11-28 17:27:01,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:27:01,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:27:01,160 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 17:27:01,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048298559] [2019-11-28 17:27:01,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:27:01,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:27:01,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4100563] [2019-11-28 17:27:01,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:27:01,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:27:01,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:27:01,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:27:01,162 INFO L87 Difference]: Start difference. First operand 278 states and 367 transitions. Second operand 3 states. [2019-11-28 17:27:01,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:27:01,220 INFO L93 Difference]: Finished difference Result 344 states and 454 transitions. [2019-11-28 17:27:01,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:27:01,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-11-28 17:27:01,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:27:01,222 INFO L225 Difference]: With dead ends: 344 [2019-11-28 17:27:01,222 INFO L226 Difference]: Without dead ends: 139 [2019-11-28 17:27:01,223 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:01,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-11-28 17:27:01,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-11-28 17:27:01,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-11-28 17:27:01,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 175 transitions. [2019-11-28 17:27:01,235 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 175 transitions. Word has length 48 [2019-11-28 17:27:01,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:27:01,235 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 175 transitions. [2019-11-28 17:27:01,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:27:01,236 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 175 transitions. [2019-11-28 17:27:01,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 17:27:01,237 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:27:01,237 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] [2019-11-28 17:27:01,237 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:27:01,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:27:01,238 INFO L82 PathProgramCache]: Analyzing trace with hash -2038322788, now seen corresponding path program 1 times [2019-11-28 17:27:01,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:27:01,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048351936] [2019-11-28 17:27:01,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:27:01,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:27:01,313 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:01,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048351936] [2019-11-28 17:27:01,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30303424] [2019-11-28 17:27:01,314 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:01,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:27:01,439 INFO L264 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 17:27:01,447 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:27:01,476 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:01,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:27:01,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-11-28 17:27:01,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644420978] [2019-11-28 17:27:01,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 17:27:01,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:27:01,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 17:27:01,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 17:27:01,479 INFO L87 Difference]: Start difference. First operand 139 states and 175 transitions. Second operand 6 states. [2019-11-28 17:27:01,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:27:01,664 INFO L93 Difference]: Finished difference Result 431 states and 556 transitions. [2019-11-28 17:27:01,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 17:27:01,665 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2019-11-28 17:27:01,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:27:01,667 INFO L225 Difference]: With dead ends: 431 [2019-11-28 17:27:01,668 INFO L226 Difference]: Without dead ends: 322 [2019-11-28 17:27:01,669 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-11-28 17:27:01,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-11-28 17:27:01,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 191. [2019-11-28 17:27:01,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-11-28 17:27:01,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 243 transitions. [2019-11-28 17:27:01,695 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 243 transitions. Word has length 50 [2019-11-28 17:27:01,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:27:01,696 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 243 transitions. [2019-11-28 17:27:01,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 17:27:01,696 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 243 transitions. [2019-11-28 17:27:01,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-28 17:27:01,697 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:27:01,697 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] [2019-11-28 17:27:01,903 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:27:01,904 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:27:01,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:27:01,904 INFO L82 PathProgramCache]: Analyzing trace with hash 564554040, now seen corresponding path program 2 times [2019-11-28 17:27:01,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:27:01,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184347060] [2019-11-28 17:27:01,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:27:01,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:27:02,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:27:02,146 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 17:27:02,146 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 17:27:02,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:27:02 BoogieIcfgContainer [2019-11-28 17:27:02,388 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:27:02,389 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:27:02,389 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:27:02,390 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:27:02,390 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:26:58" (3/4) ... [2019-11-28 17:27:02,394 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 17:27:02,638 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:27:02,638 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:27:02,641 INFO L168 Benchmark]: Toolchain (without parser) took 5724.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 217.1 MB). Free memory was 955.0 MB in the beginning and 1.0 GB in the end (delta: -55.3 MB). Peak memory consumption was 161.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:27:02,642 INFO L168 Benchmark]: CDTParser took 0.74 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:02,642 INFO L168 Benchmark]: CACSL2BoogieTranslator took 656.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -164.6 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:27:02,643 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.55 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2019-11-28 17:27:02,644 INFO L168 Benchmark]: Boogie Preprocessor took 54.46 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:02,644 INFO L168 Benchmark]: RCFGBuilder took 920.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 63.8 MB). Peak memory consumption was 63.8 MB. Max. memory is 11.5 GB. [2019-11-28 17:27:02,645 INFO L168 Benchmark]: TraceAbstraction took 3741.22 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 74.4 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 9.2 MB). Peak memory consumption was 83.6 MB. Max. memory is 11.5 GB. [2019-11-28 17:27:02,646 INFO L168 Benchmark]: Witness Printer took 249.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-28 17:27:02,649 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.74 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 656.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -164.6 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 96.55 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 54.46 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 920.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 63.8 MB). Peak memory consumption was 63.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3741.22 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 74.4 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 9.2 MB). Peak memory consumption was 83.6 MB. Max. memory is 11.5 GB. * Witness Printer took 249.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 722]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L247] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L524] int pumpRunning = 0; [L525] int systemActive = 1; [L728] int waterLevel = 1; [L729] int methaneLevelCritical = 0; [L822] int cleanupTimeShifts = 4; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L895] int retValue_acc ; [L896] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L69] int retValue_acc ; [L72] retValue_acc = 1 [L73] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L902] tmp = valid_product() [L904] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L450] int splverifierCounter ; [L451] int tmp ; [L452] int tmp___0 ; [L453] int tmp___1 ; [L454] int tmp___2 ; [L457] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L459] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L461] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L467] tmp = __VERIFIER_nondet_int() [L469] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L746] COND TRUE waterLevel < 2 [L747] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L477] tmp___0 = __VERIFIER_nondet_int() [L479] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L487] tmp___2 = __VERIFIER_nondet_int() [L489] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L532] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L539] COND TRUE \read(systemActive) [L587] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L590] COND FALSE !(\read(pumpRunning)) [L561] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L564] COND TRUE ! pumpRunning [L684] int retValue_acc ; [L685] int tmp ; [L686] int tmp___0 ; [L808] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L811] COND FALSE !(waterLevel < 2) [L815] retValue_acc = 0 [L816] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L690] tmp = isHighWaterSensorDry() [L692] COND FALSE !(\read(tmp)) [L695] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L697] retValue_acc = tmp___0 [L698] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L566] tmp = isHighWaterLevel() [L568] COND TRUE \read(tmp) [L615] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L919] int tmp ; [L920] int tmp___0 ; [L799] int retValue_acc ; [L802] retValue_acc = waterLevel [L803] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L924] tmp = getWaterLevel() [L926] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L459] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L461] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L467] tmp = __VERIFIER_nondet_int() [L469] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L477] tmp___0 = __VERIFIER_nondet_int() [L479] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L487] tmp___2 = __VERIFIER_nondet_int() [L489] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L532] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L734] COND TRUE waterLevel > 0 [L735] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L539] COND TRUE \read(systemActive) [L587] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L590] COND TRUE \read(pumpRunning) [L628] int retValue_acc ; [L767] int retValue_acc ; [L770] retValue_acc = methaneLevelCritical [L771] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L632] retValue_acc = isMethaneLevelCritical() [L634] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L592] tmp = isMethaneAlarm() [L594] COND FALSE !(\read(tmp)) [L561] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L564] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L919] int tmp ; [L920] int tmp___0 ; [L799] int retValue_acc ; [L802] retValue_acc = waterLevel [L803] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L924] tmp = getWaterLevel() [L926] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L459] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L461] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L467] tmp = __VERIFIER_nondet_int() [L469] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L477] tmp___0 = __VERIFIER_nondet_int() [L479] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L487] tmp___2 = __VERIFIER_nondet_int() [L489] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L532] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L734] COND TRUE waterLevel > 0 [L735] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L539] COND TRUE \read(systemActive) [L587] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L590] COND TRUE \read(pumpRunning) [L628] int retValue_acc ; [L767] int retValue_acc ; [L770] retValue_acc = methaneLevelCritical [L771] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L632] retValue_acc = isMethaneLevelCritical() [L634] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L592] tmp = isMethaneAlarm() [L594] COND FALSE !(\read(tmp)) [L561] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L564] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L919] int tmp ; [L920] int tmp___0 ; [L799] int retValue_acc ; [L802] retValue_acc = waterLevel [L803] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L924] tmp = getWaterLevel() [L926] COND TRUE tmp == 0 [L639] int retValue_acc ; [L642] retValue_acc = pumpRunning [L643] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L928] tmp___0 = isPumpRunning() [L930] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L722] __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, 113 locations, 3 error locations. Result: UNSAFE, OverallTime: 3.4s, OverallIterations: 12, TraceHistogramMax: 3, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1097 SDtfs, 1413 SDslu, 1666 SDs, 0 SdLazy, 254 SolverSat, 65 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 121 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=278occurred in iteration=9, 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, 11 MinimizatonAttempts, 899 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 440 NumberOfCodeBlocks, 440 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 359 ConstructedInterpolants, 0 QuantifiedInterpolants, 23327 SizeOfPredicates, 4 NumberOfNonLiveVariables, 394 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 35/41 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...