./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec4_product38.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 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_product38.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 764a558f84753bff2f3381f04a56ebf221297041 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 21:22:47,791 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 21:22:47,793 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 21:22:47,805 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 21:22:47,805 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 21:22:47,806 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 21:22:47,808 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 21:22:47,810 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 21:22:47,812 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 21:22:47,813 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 21:22:47,814 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 21:22:47,815 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 21:22:47,816 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 21:22:47,817 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 21:22:47,818 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 21:22:47,822 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 21:22:47,823 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 21:22:47,825 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 21:22:47,827 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 21:22:47,828 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 21:22:47,830 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 21:22:47,833 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 21:22:47,834 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 21:22:47,835 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 21:22:47,841 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 21:22:47,841 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 21:22:47,842 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 21:22:47,842 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 21:22:47,845 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 21:22:47,847 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 21:22:47,847 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 21:22:47,849 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 21:22:47,850 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 21:22:47,850 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 21:22:47,852 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 21:22:47,852 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 21:22:47,852 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 21:22:47,855 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 21:22:47,855 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 21:22:47,856 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 21:22:47,857 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 21:22:47,857 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 21:22:47,882 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 21:22:47,882 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 21:22:47,884 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 21:22:47,884 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 21:22:47,884 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 21:22:47,884 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 21:22:47,884 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 21:22:47,885 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 21:22:47,885 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 21:22:47,885 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 21:22:47,886 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 21:22:47,886 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 21:22:47,886 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 21:22:47,887 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 21:22:47,887 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 21:22:47,887 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 21:22:47,887 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 21:22:47,888 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 21:22:47,888 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 21:22:47,888 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 21:22:47,888 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 21:22:47,889 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 21:22:47,889 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 21:22:47,889 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 21:22:47,889 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 21:22:47,890 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 21:22:47,890 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 21:22:47,890 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 21:22:47,890 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 -> 764a558f84753bff2f3381f04a56ebf221297041 [2019-11-19 21:22:48,184 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 21:22:48,197 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 21:22:48,200 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 21:22:48,202 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 21:22:48,202 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 21:22:48,203 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec4_product38.cil.c [2019-11-19 21:22:48,262 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce289860d/87f0cb455df14f34b550e526ba7e3dd4/FLAG467adf319 [2019-11-19 21:22:48,658 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 21:22:48,659 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product38.cil.c [2019-11-19 21:22:48,671 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce289860d/87f0cb455df14f34b550e526ba7e3dd4/FLAG467adf319 [2019-11-19 21:22:49,007 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce289860d/87f0cb455df14f34b550e526ba7e3dd4 [2019-11-19 21:22:49,010 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 21:22:49,012 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 21:22:49,013 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 21:22:49,013 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 21:22:49,016 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 21:22:49,017 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:22:49" (1/1) ... [2019-11-19 21:22:49,020 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b2141d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:49, skipping insertion in model container [2019-11-19 21:22:49,021 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:22:49" (1/1) ... [2019-11-19 21:22:49,033 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 21:22:49,099 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 21:22:49,537 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:22:49,560 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 21:22:49,635 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:22:49,676 INFO L192 MainTranslator]: Completed translation [2019-11-19 21:22:49,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:49 WrapperNode [2019-11-19 21:22:49,677 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 21:22:49,677 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 21:22:49,678 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 21:22:49,678 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 21:22:49,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:49" (1/1) ... [2019-11-19 21:22:49,716 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:49" (1/1) ... [2019-11-19 21:22:49,763 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 21:22:49,763 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 21:22:49,763 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 21:22:49,763 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 21:22:49,773 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:49" (1/1) ... [2019-11-19 21:22:49,773 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:49" (1/1) ... [2019-11-19 21:22:49,777 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:49" (1/1) ... [2019-11-19 21:22:49,777 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:49" (1/1) ... [2019-11-19 21:22:49,802 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:49" (1/1) ... [2019-11-19 21:22:49,821 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:49" (1/1) ... [2019-11-19 21:22:49,827 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:49" (1/1) ... [2019-11-19 21:22:49,838 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 21:22:49,839 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 21:22:49,839 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 21:22:49,839 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 21:22:49,841 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:49" (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-19 21:22:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 21:22:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-19 21:22:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 21:22:49,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 21:22:50,680 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 21:22:50,681 INFO L285 CfgBuilder]: Removed 158 assume(true) statements. [2019-11-19 21:22:50,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:22:50 BoogieIcfgContainer [2019-11-19 21:22:50,682 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 21:22:50,684 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 21:22:50,684 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 21:22:50,687 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 21:22:50,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:22:49" (1/3) ... [2019-11-19 21:22:50,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@667e9dc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:22:50, skipping insertion in model container [2019-11-19 21:22:50,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:49" (2/3) ... [2019-11-19 21:22:50,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@667e9dc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:22:50, skipping insertion in model container [2019-11-19 21:22:50,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:22:50" (3/3) ... [2019-11-19 21:22:50,691 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product38.cil.c [2019-11-19 21:22:50,701 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 21:22:50,708 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-19 21:22:50,720 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-19 21:22:50,750 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 21:22:50,750 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 21:22:50,751 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 21:22:50,751 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 21:22:50,751 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 21:22:50,752 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 21:22:50,752 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 21:22:50,752 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 21:22:50,779 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2019-11-19 21:22:50,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-19 21:22:50,788 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:50,789 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:22:50,790 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:50,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:50,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1529342393, now seen corresponding path program 1 times [2019-11-19 21:22:50,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:50,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336945045] [2019-11-19 21:22:50,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:51,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:51,116 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-19 21:22:51,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336945045] [2019-11-19 21:22:51,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:22:51,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 21:22:51,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408825131] [2019-11-19 21:22:51,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-19 21:22:51,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:51,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-19 21:22:51,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 21:22:51,135 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 2 states. [2019-11-19 21:22:51,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:51,168 INFO L93 Difference]: Finished difference Result 216 states and 329 transitions. [2019-11-19 21:22:51,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-19 21:22:51,169 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-19 21:22:51,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:51,180 INFO L225 Difference]: With dead ends: 216 [2019-11-19 21:22:51,181 INFO L226 Difference]: Without dead ends: 107 [2019-11-19 21:22:51,184 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-19 21:22:51,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-19 21:22:51,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-19 21:22:51,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-19 21:22:51,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 156 transitions. [2019-11-19 21:22:51,230 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 156 transitions. Word has length 16 [2019-11-19 21:22:51,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:51,231 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 156 transitions. [2019-11-19 21:22:51,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-19 21:22:51,231 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 156 transitions. [2019-11-19 21:22:51,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-19 21:22:51,232 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:51,233 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:22:51,233 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:51,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:51,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1945506518, now seen corresponding path program 1 times [2019-11-19 21:22:51,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:51,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963557673] [2019-11-19 21:22:51,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:51,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:51,336 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-19 21:22:51,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963557673] [2019-11-19 21:22:51,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:22:51,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:22:51,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284885500] [2019-11-19 21:22:51,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:22:51,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:51,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:22:51,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:22:51,340 INFO L87 Difference]: Start difference. First operand 107 states and 156 transitions. Second operand 3 states. [2019-11-19 21:22:51,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:51,356 INFO L93 Difference]: Finished difference Result 107 states and 156 transitions. [2019-11-19 21:22:51,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:22:51,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-19 21:22:51,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:51,358 INFO L225 Difference]: With dead ends: 107 [2019-11-19 21:22:51,358 INFO L226 Difference]: Without dead ends: 45 [2019-11-19 21:22:51,359 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-19 21:22:51,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-19 21:22:51,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-11-19 21:22:51,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-19 21:22:51,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 65 transitions. [2019-11-19 21:22:51,366 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 65 transitions. Word has length 17 [2019-11-19 21:22:51,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:51,366 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 65 transitions. [2019-11-19 21:22:51,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:22:51,367 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 65 transitions. [2019-11-19 21:22:51,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-19 21:22:51,369 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:51,369 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-19 21:22:51,369 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:51,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:51,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1939738244, now seen corresponding path program 1 times [2019-11-19 21:22:51,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:51,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889046572] [2019-11-19 21:22:51,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:51,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:51,532 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-19 21:22:51,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889046572] [2019-11-19 21:22:51,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:22:51,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:22:51,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344870882] [2019-11-19 21:22:51,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:22:51,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:51,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:22:51,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:22:51,535 INFO L87 Difference]: Start difference. First operand 45 states and 65 transitions. Second operand 5 states. [2019-11-19 21:22:51,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:51,599 INFO L93 Difference]: Finished difference Result 84 states and 124 transitions. [2019-11-19 21:22:51,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 21:22:51,600 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-19 21:22:51,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:51,601 INFO L225 Difference]: With dead ends: 84 [2019-11-19 21:22:51,601 INFO L226 Difference]: Without dead ends: 45 [2019-11-19 21:22:51,602 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-19 21:22:51,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-19 21:22:51,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-11-19 21:22:51,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-19 21:22:51,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 64 transitions. [2019-11-19 21:22:51,614 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 64 transitions. Word has length 22 [2019-11-19 21:22:51,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:51,615 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 64 transitions. [2019-11-19 21:22:51,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:22:51,617 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 64 transitions. [2019-11-19 21:22:51,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-19 21:22:51,619 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:51,619 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-19 21:22:51,620 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:51,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:51,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1547834963, now seen corresponding path program 1 times [2019-11-19 21:22:51,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:51,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670703124] [2019-11-19 21:22:51,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:51,727 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-19 21:22:51,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670703124] [2019-11-19 21:22:51,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:22:51,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 21:22:51,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523744511] [2019-11-19 21:22:51,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:22:51,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:51,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:22:51,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:22:51,730 INFO L87 Difference]: Start difference. First operand 45 states and 64 transitions. Second operand 3 states. [2019-11-19 21:22:51,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:51,764 INFO L93 Difference]: Finished difference Result 105 states and 152 transitions. [2019-11-19 21:22:51,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:22:51,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-19 21:22:51,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:51,766 INFO L225 Difference]: With dead ends: 105 [2019-11-19 21:22:51,766 INFO L226 Difference]: Without dead ends: 66 [2019-11-19 21:22:51,767 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-19 21:22:51,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-19 21:22:51,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-11-19 21:22:51,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-19 21:22:51,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 90 transitions. [2019-11-19 21:22:51,777 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 90 transitions. Word has length 24 [2019-11-19 21:22:51,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:51,779 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 90 transitions. [2019-11-19 21:22:51,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:22:51,779 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 90 transitions. [2019-11-19 21:22:51,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-19 21:22:51,783 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:51,783 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:22:51,783 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:51,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:51,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1827782978, now seen corresponding path program 1 times [2019-11-19 21:22:51,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:51,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986532695] [2019-11-19 21:22:51,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:51,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:51,907 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-19 21:22:51,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986532695] [2019-11-19 21:22:51,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:22:51,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:22:51,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917888293] [2019-11-19 21:22:51,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:22:51,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:51,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:22:51,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:22:51,911 INFO L87 Difference]: Start difference. First operand 64 states and 90 transitions. Second operand 5 states. [2019-11-19 21:22:52,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:52,011 INFO L93 Difference]: Finished difference Result 171 states and 239 transitions. [2019-11-19 21:22:52,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 21:22:52,013 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-19 21:22:52,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:52,015 INFO L225 Difference]: With dead ends: 171 [2019-11-19 21:22:52,015 INFO L226 Difference]: Without dead ends: 113 [2019-11-19 21:22:52,018 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-19 21:22:52,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-19 21:22:52,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 70. [2019-11-19 21:22:52,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-19 21:22:52,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 96 transitions. [2019-11-19 21:22:52,030 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 96 transitions. Word has length 30 [2019-11-19 21:22:52,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:52,032 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 96 transitions. [2019-11-19 21:22:52,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:22:52,032 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 96 transitions. [2019-11-19 21:22:52,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-19 21:22:52,033 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:52,033 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:22:52,034 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:52,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:52,034 INFO L82 PathProgramCache]: Analyzing trace with hash 834728065, now seen corresponding path program 1 times [2019-11-19 21:22:52,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:52,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662579433] [2019-11-19 21:22:52,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:52,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:52,141 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-19 21:22:52,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662579433] [2019-11-19 21:22:52,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:22:52,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:22:52,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293776896] [2019-11-19 21:22:52,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:22:52,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:52,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:22:52,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:22:52,144 INFO L87 Difference]: Start difference. First operand 70 states and 96 transitions. Second operand 5 states. [2019-11-19 21:22:52,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:52,258 INFO L93 Difference]: Finished difference Result 247 states and 346 transitions. [2019-11-19 21:22:52,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 21:22:52,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-19 21:22:52,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:52,261 INFO L225 Difference]: With dead ends: 247 [2019-11-19 21:22:52,261 INFO L226 Difference]: Without dead ends: 183 [2019-11-19 21:22:52,262 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-19 21:22:52,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-11-19 21:22:52,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 113. [2019-11-19 21:22:52,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-19 21:22:52,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 152 transitions. [2019-11-19 21:22:52,279 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 152 transitions. Word has length 30 [2019-11-19 21:22:52,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:52,280 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 152 transitions. [2019-11-19 21:22:52,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:22:52,280 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 152 transitions. [2019-11-19 21:22:52,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-19 21:22:52,281 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:52,281 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-19 21:22:52,284 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:52,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:52,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1173088129, now seen corresponding path program 1 times [2019-11-19 21:22:52,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:52,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903319322] [2019-11-19 21:22:52,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:52,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:52,366 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-19 21:22:52,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903319322] [2019-11-19 21:22:52,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:22:52,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:22:52,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146219142] [2019-11-19 21:22:52,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:22:52,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:52,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:22:52,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:22:52,374 INFO L87 Difference]: Start difference. First operand 113 states and 152 transitions. Second operand 5 states. [2019-11-19 21:22:52,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:52,498 INFO L93 Difference]: Finished difference Result 241 states and 330 transitions. [2019-11-19 21:22:52,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 21:22:52,498 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-19 21:22:52,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:52,500 INFO L225 Difference]: With dead ends: 241 [2019-11-19 21:22:52,500 INFO L226 Difference]: Without dead ends: 239 [2019-11-19 21:22:52,501 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-19 21:22:52,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-11-19 21:22:52,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 113. [2019-11-19 21:22:52,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-19 21:22:52,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 151 transitions. [2019-11-19 21:22:52,518 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 151 transitions. Word has length 31 [2019-11-19 21:22:52,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:52,518 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 151 transitions. [2019-11-19 21:22:52,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:22:52,519 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 151 transitions. [2019-11-19 21:22:52,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-19 21:22:52,520 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:52,520 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-19 21:22:52,520 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:52,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:52,521 INFO L82 PathProgramCache]: Analyzing trace with hash 66341114, now seen corresponding path program 1 times [2019-11-19 21:22:52,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:52,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410919208] [2019-11-19 21:22:52,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:52,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:52,567 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-19 21:22:52,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410919208] [2019-11-19 21:22:52,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:22:52,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:22:52,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48889340] [2019-11-19 21:22:52,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:22:52,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:52,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:22:52,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:22:52,571 INFO L87 Difference]: Start difference. First operand 113 states and 151 transitions. Second operand 4 states. [2019-11-19 21:22:52,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:52,627 INFO L93 Difference]: Finished difference Result 246 states and 329 transitions. [2019-11-19 21:22:52,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:22:52,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-19 21:22:52,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:52,628 INFO L225 Difference]: With dead ends: 246 [2019-11-19 21:22:52,629 INFO L226 Difference]: Without dead ends: 139 [2019-11-19 21:22:52,630 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-19 21:22:52,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-11-19 21:22:52,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 98. [2019-11-19 21:22:52,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-19 21:22:52,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 128 transitions. [2019-11-19 21:22:52,641 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 128 transitions. Word has length 31 [2019-11-19 21:22:52,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:52,641 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 128 transitions. [2019-11-19 21:22:52,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:22:52,641 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 128 transitions. [2019-11-19 21:22:52,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-19 21:22:52,642 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:52,643 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-19 21:22:52,643 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:52,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:52,643 INFO L82 PathProgramCache]: Analyzing trace with hash 324506552, now seen corresponding path program 1 times [2019-11-19 21:22:52,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:52,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260596417] [2019-11-19 21:22:52,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:52,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:52,705 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-19 21:22:52,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260596417] [2019-11-19 21:22:52,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:22:52,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:22:52,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235182514] [2019-11-19 21:22:52,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:22:52,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:52,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:22:52,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:22:52,708 INFO L87 Difference]: Start difference. First operand 98 states and 128 transitions. Second operand 5 states. [2019-11-19 21:22:52,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:52,848 INFO L93 Difference]: Finished difference Result 265 states and 357 transitions. [2019-11-19 21:22:52,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 21:22:52,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-19 21:22:52,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:52,850 INFO L225 Difference]: With dead ends: 265 [2019-11-19 21:22:52,850 INFO L226 Difference]: Without dead ends: 197 [2019-11-19 21:22:52,852 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-19 21:22:52,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-11-19 21:22:52,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 139. [2019-11-19 21:22:52,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-11-19 21:22:52,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 180 transitions. [2019-11-19 21:22:52,876 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 180 transitions. Word has length 31 [2019-11-19 21:22:52,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:52,878 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 180 transitions. [2019-11-19 21:22:52,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:22:52,878 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 180 transitions. [2019-11-19 21:22:52,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-19 21:22:52,885 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:52,886 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-19 21:22:52,886 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:52,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:52,887 INFO L82 PathProgramCache]: Analyzing trace with hash -337830252, now seen corresponding path program 1 times [2019-11-19 21:22:52,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:52,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893331245] [2019-11-19 21:22:52,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:52,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:52,992 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-19 21:22:52,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893331245] [2019-11-19 21:22:52,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082094846] [2019-11-19 21:22:52,993 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-19 21:22:53,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:53,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 21:22:53,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:22:53,217 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-19 21:22:53,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:22:53,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-11-19 21:22:53,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621153120] [2019-11-19 21:22:53,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 21:22:53,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:53,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 21:22:53,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-19 21:22:53,220 INFO L87 Difference]: Start difference. First operand 139 states and 180 transitions. Second operand 6 states. [2019-11-19 21:22:53,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:53,414 INFO L93 Difference]: Finished difference Result 431 states and 573 transitions. [2019-11-19 21:22:53,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 21:22:53,414 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2019-11-19 21:22:53,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:53,416 INFO L225 Difference]: With dead ends: 431 [2019-11-19 21:22:53,416 INFO L226 Difference]: Without dead ends: 322 [2019-11-19 21:22:53,419 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-19 21:22:53,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-11-19 21:22:53,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 191. [2019-11-19 21:22:53,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-11-19 21:22:53,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 250 transitions. [2019-11-19 21:22:53,446 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 250 transitions. Word has length 50 [2019-11-19 21:22:53,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:53,446 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 250 transitions. [2019-11-19 21:22:53,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 21:22:53,447 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 250 transitions. [2019-11-19 21:22:53,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-19 21:22:53,448 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:53,448 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-19 21:22:53,651 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:22:53,652 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:53,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:53,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1076130248, now seen corresponding path program 2 times [2019-11-19 21:22:53,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:53,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004084964] [2019-11-19 21:22:53,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 21:22:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 21:22:53,906 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 21:22:53,906 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 21:22:54,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:22:54 BoogieIcfgContainer [2019-11-19 21:22:54,068 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 21:22:54,069 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 21:22:54,069 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 21:22:54,069 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 21:22:54,070 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:22:50" (3/4) ... [2019-11-19 21:22:54,073 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-19 21:22:54,281 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 21:22:54,281 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 21:22:54,283 INFO L168 Benchmark]: Toolchain (without parser) took 5271.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 192.4 MB). Free memory was 952.3 MB in the beginning and 1.0 GB in the end (delta: -93.5 MB). Peak memory consumption was 98.9 MB. Max. memory is 11.5 GB. [2019-11-19 21:22:54,284 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:22:54,284 INFO L168 Benchmark]: CACSL2BoogieTranslator took 664.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -137.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-11-19 21:22:54,284 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-19 21:22:54,285 INFO L168 Benchmark]: Boogie Preprocessor took 75.21 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:22:54,285 INFO L168 Benchmark]: RCFGBuilder took 843.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 65.3 MB). Peak memory consumption was 65.3 MB. Max. memory is 11.5 GB. [2019-11-19 21:22:54,286 INFO L168 Benchmark]: TraceAbstraction took 3384.76 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 83.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -56.7 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. [2019-11-19 21:22:54,286 INFO L168 Benchmark]: Witness Printer took 212.22 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: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-11-19 21:22:54,288 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 664.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -137.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 85.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 75.21 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 843.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 65.3 MB). Peak memory consumption was 65.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3384.76 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 83.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -56.7 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. * Witness Printer took 212.22 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: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 247]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L40] int cleanupTimeShifts = 4; [L149] int waterLevel = 1; [L150] int methaneLevelCritical = 0; [L349] int pumpRunning = 0; [L350] int systemActive = 1; [L704] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L121] int retValue_acc ; [L122] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L927] int retValue_acc ; [L930] retValue_acc = 1 [L931] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L128] tmp = valid_product() [L130] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L281] int splverifierCounter ; [L282] int tmp ; [L283] int tmp___0 ; [L284] int tmp___1 ; [L285] int tmp___2 ; [L288] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L290] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L292] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L298] tmp = __VERIFIER_nondet_int() [L300] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L167] COND TRUE waterLevel < 2 [L168] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L308] tmp___0 = __VERIFIER_nondet_int() [L310] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L318] tmp___2 = __VERIFIER_nondet_int() [L320] COND TRUE \read(tmp___2) [L530] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L356] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L363] COND TRUE \read(systemActive) [L411] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L414] COND FALSE !(\read(pumpRunning)) [L385] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L388] COND TRUE ! pumpRunning [L508] int retValue_acc ; [L509] int tmp ; [L510] int tmp___0 ; [L229] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L232] COND FALSE !(waterLevel < 2) [L236] retValue_acc = 0 [L237] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L514] tmp = isHighWaterSensorDry() [L516] COND FALSE !(\read(tmp)) [L519] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L521] retValue_acc = tmp___0 [L522] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L390] tmp = isHighWaterLevel() [L392] COND TRUE \read(tmp) [L439] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L254] int tmp ; [L255] int tmp___0 ; [L220] int retValue_acc ; [L223] retValue_acc = waterLevel [L224] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L259] tmp = getWaterLevel() [L261] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L290] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L292] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L298] tmp = __VERIFIER_nondet_int() [L300] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L308] tmp___0 = __VERIFIER_nondet_int() [L310] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L318] tmp___2 = __VERIFIER_nondet_int() [L320] COND TRUE \read(tmp___2) [L530] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L356] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L155] COND TRUE waterLevel > 0 [L156] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L363] COND TRUE \read(systemActive) [L411] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L414] COND TRUE \read(pumpRunning) [L452] int retValue_acc ; [L188] int retValue_acc ; [L191] retValue_acc = methaneLevelCritical [L192] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L456] retValue_acc = isMethaneLevelCritical() [L458] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L416] tmp = isMethaneAlarm() [L418] COND FALSE !(\read(tmp)) [L385] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L388] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L254] int tmp ; [L255] int tmp___0 ; [L220] int retValue_acc ; [L223] retValue_acc = waterLevel [L224] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L259] tmp = getWaterLevel() [L261] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L290] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L292] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L298] tmp = __VERIFIER_nondet_int() [L300] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L308] tmp___0 = __VERIFIER_nondet_int() [L310] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L318] tmp___2 = __VERIFIER_nondet_int() [L320] COND TRUE \read(tmp___2) [L530] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L356] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L155] COND TRUE waterLevel > 0 [L156] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L363] COND TRUE \read(systemActive) [L411] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L414] COND TRUE \read(pumpRunning) [L452] int retValue_acc ; [L188] int retValue_acc ; [L191] retValue_acc = methaneLevelCritical [L192] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L456] retValue_acc = isMethaneLevelCritical() [L458] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L416] tmp = isMethaneAlarm() [L418] COND FALSE !(\read(tmp)) [L385] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L388] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L254] int tmp ; [L255] int tmp___0 ; [L220] int retValue_acc ; [L223] retValue_acc = waterLevel [L224] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L259] tmp = getWaterLevel() [L261] COND TRUE tmp == 0 [L463] int retValue_acc ; [L466] retValue_acc = pumpRunning [L467] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L263] tmp___0 = isPumpRunning() [L265] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L247] __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, 111 locations, 3 error locations. Result: UNSAFE, OverallTime: 3.3s, OverallIterations: 11, TraceHistogramMax: 3, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 952 SDtfs, 1233 SDslu, 1367 SDs, 0 SdLazy, 233 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=191occurred 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.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 471 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 401 NumberOfCodeBlocks, 401 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 321 ConstructedInterpolants, 0 QuantifiedInterpolants, 21005 SizeOfPredicates, 4 NumberOfNonLiveVariables, 398 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 22/28 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...