./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec4_product33.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_product33.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 2bf5cdbd1397f8c2609b4d66a963cb35955afadc ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:46,816 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 21:22:46,819 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 21:22:46,834 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 21:22:46,834 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 21:22:46,835 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 21:22:46,837 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 21:22:46,840 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 21:22:46,849 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 21:22:46,850 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 21:22:46,851 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 21:22:46,853 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 21:22:46,853 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 21:22:46,854 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 21:22:46,855 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 21:22:46,856 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 21:22:46,857 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 21:22:46,858 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 21:22:46,860 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 21:22:46,861 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 21:22:46,863 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 21:22:46,864 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 21:22:46,865 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 21:22:46,866 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 21:22:46,869 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 21:22:46,869 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 21:22:46,869 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 21:22:46,870 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 21:22:46,870 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 21:22:46,871 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 21:22:46,872 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 21:22:46,872 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 21:22:46,873 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 21:22:46,874 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 21:22:46,875 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 21:22:46,875 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 21:22:46,876 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 21:22:46,876 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 21:22:46,876 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 21:22:46,877 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 21:22:46,878 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 21:22:46,879 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:46,893 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 21:22:46,894 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 21:22:46,895 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 21:22:46,895 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 21:22:46,896 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 21:22:46,896 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 21:22:46,896 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 21:22:46,896 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 21:22:46,896 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 21:22:46,897 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 21:22:46,897 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 21:22:46,897 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 21:22:46,897 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 21:22:46,898 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 21:22:46,898 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 21:22:46,898 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 21:22:46,898 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 21:22:46,899 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 21:22:46,899 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 21:22:46,899 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 21:22:46,899 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 21:22:46,899 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 21:22:46,900 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 21:22:46,900 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 21:22:46,900 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 21:22:46,900 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 21:22:46,901 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 21:22:46,901 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 21:22:46,901 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 -> 2bf5cdbd1397f8c2609b4d66a963cb35955afadc [2019-11-19 21:22:47,196 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 21:22:47,210 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 21:22:47,214 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 21:22:47,215 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 21:22:47,216 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 21:22:47,217 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec4_product33.cil.c [2019-11-19 21:22:47,280 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fca114157/c28a49f8341e48c7b3e8537bab3cbe6b/FLAG813c63342 [2019-11-19 21:22:47,835 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 21:22:47,835 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product33.cil.c [2019-11-19 21:22:47,850 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fca114157/c28a49f8341e48c7b3e8537bab3cbe6b/FLAG813c63342 [2019-11-19 21:22:48,124 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fca114157/c28a49f8341e48c7b3e8537bab3cbe6b [2019-11-19 21:22:48,128 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 21:22:48,129 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 21:22:48,130 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 21:22:48,131 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 21:22:48,141 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 21:22:48,142 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:22:48" (1/1) ... [2019-11-19 21:22:48,145 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5834b72a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:48, skipping insertion in model container [2019-11-19 21:22:48,146 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:22:48" (1/1) ... [2019-11-19 21:22:48,154 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 21:22:48,210 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 21:22:48,606 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:22:48,630 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 21:22:48,753 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:22:48,791 INFO L192 MainTranslator]: Completed translation [2019-11-19 21:22:48,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:48 WrapperNode [2019-11-19 21:22:48,792 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 21:22:48,793 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 21:22:48,793 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 21:22:48,794 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 21:22:48,803 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:48" (1/1) ... [2019-11-19 21:22:48,824 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:48" (1/1) ... [2019-11-19 21:22:48,876 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 21:22:48,877 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 21:22:48,877 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 21:22:48,877 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 21:22:48,887 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:48" (1/1) ... [2019-11-19 21:22:48,887 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:48" (1/1) ... [2019-11-19 21:22:48,892 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:48" (1/1) ... [2019-11-19 21:22:48,892 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:48" (1/1) ... [2019-11-19 21:22:48,902 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:48" (1/1) ... [2019-11-19 21:22:48,910 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:48" (1/1) ... [2019-11-19 21:22:48,913 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:48" (1/1) ... [2019-11-19 21:22:48,919 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 21:22:48,920 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 21:22:48,920 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 21:22:48,920 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 21:22:48,921 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:48" (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:48,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 21:22:48,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-19 21:22:48,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 21:22:48,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 21:22:49,876 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 21:22:49,877 INFO L285 CfgBuilder]: Removed 96 assume(true) statements. [2019-11-19 21:22:49,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:22:49 BoogieIcfgContainer [2019-11-19 21:22:49,878 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 21:22:49,880 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 21:22:49,881 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 21:22:49,886 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 21:22:49,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:22:48" (1/3) ... [2019-11-19 21:22:49,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@791ab991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:22:49, skipping insertion in model container [2019-11-19 21:22:49,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:48" (2/3) ... [2019-11-19 21:22:49,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@791ab991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:22:49, skipping insertion in model container [2019-11-19 21:22:49,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:22:49" (3/3) ... [2019-11-19 21:22:49,898 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product33.cil.c [2019-11-19 21:22:49,909 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 21:22:49,916 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-19 21:22:49,927 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-19 21:22:49,952 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 21:22:49,953 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 21:22:49,953 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 21:22:49,953 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 21:22:49,953 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 21:22:49,953 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 21:22:49,953 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 21:22:49,954 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 21:22:49,970 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2019-11-19 21:22:49,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-19 21:22:49,978 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:49,979 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:49,980 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:49,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:49,986 INFO L82 PathProgramCache]: Analyzing trace with hash 768274677, now seen corresponding path program 1 times [2019-11-19 21:22:49,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:49,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37686955] [2019-11-19 21:22:49,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:50,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:50,303 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:50,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37686955] [2019-11-19 21:22:50,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:22:50,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 21:22:50,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398276502] [2019-11-19 21:22:50,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-19 21:22:50,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:50,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-19 21:22:50,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 21:22:50,329 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 2 states. [2019-11-19 21:22:50,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:50,358 INFO L93 Difference]: Finished difference Result 150 states and 227 transitions. [2019-11-19 21:22:50,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-19 21:22:50,360 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-19 21:22:50,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:50,371 INFO L225 Difference]: With dead ends: 150 [2019-11-19 21:22:50,371 INFO L226 Difference]: Without dead ends: 74 [2019-11-19 21:22:50,374 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:50,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-19 21:22:50,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-19 21:22:50,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-19 21:22:50,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 105 transitions. [2019-11-19 21:22:50,414 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 105 transitions. Word has length 16 [2019-11-19 21:22:50,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:50,414 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 105 transitions. [2019-11-19 21:22:50,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-19 21:22:50,414 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2019-11-19 21:22:50,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-19 21:22:50,415 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:50,416 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:50,416 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:50,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:50,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1484097871, now seen corresponding path program 1 times [2019-11-19 21:22:50,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:50,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720925459] [2019-11-19 21:22:50,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:50,563 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:50,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720925459] [2019-11-19 21:22:50,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:22:50,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:22:50,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559803397] [2019-11-19 21:22:50,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:22:50,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:50,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:22:50,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:22:50,571 INFO L87 Difference]: Start difference. First operand 74 states and 105 transitions. Second operand 3 states. [2019-11-19 21:22:50,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:50,588 INFO L93 Difference]: Finished difference Result 74 states and 105 transitions. [2019-11-19 21:22:50,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:22:50,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-19 21:22:50,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:50,593 INFO L225 Difference]: With dead ends: 74 [2019-11-19 21:22:50,594 INFO L226 Difference]: Without dead ends: 34 [2019-11-19 21:22:50,596 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:50,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-19 21:22:50,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-11-19 21:22:50,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-19 21:22:50,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2019-11-19 21:22:50,608 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 17 [2019-11-19 21:22:50,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:50,609 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2019-11-19 21:22:50,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:22:50,609 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2019-11-19 21:22:50,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-19 21:22:50,612 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:50,612 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:50,613 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:50,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:50,614 INFO L82 PathProgramCache]: Analyzing trace with hash 670124178, now seen corresponding path program 1 times [2019-11-19 21:22:50,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:50,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446117109] [2019-11-19 21:22:50,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:50,759 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:50,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446117109] [2019-11-19 21:22:50,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:22:50,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 21:22:50,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878270855] [2019-11-19 21:22:50,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:22:50,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:50,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:22:50,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:22:50,764 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand 3 states. [2019-11-19 21:22:50,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:50,777 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2019-11-19 21:22:50,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:22:50,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-19 21:22:50,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:50,779 INFO L225 Difference]: With dead ends: 62 [2019-11-19 21:22:50,779 INFO L226 Difference]: Without dead ends: 34 [2019-11-19 21:22:50,780 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:50,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-19 21:22:50,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-11-19 21:22:50,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-19 21:22:50,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 47 transitions. [2019-11-19 21:22:50,788 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 47 transitions. Word has length 22 [2019-11-19 21:22:50,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:50,789 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 47 transitions. [2019-11-19 21:22:50,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:22:50,792 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2019-11-19 21:22:50,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-19 21:22:50,794 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:50,794 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] [2019-11-19 21:22:50,795 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:50,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:50,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1804645939, now seen corresponding path program 1 times [2019-11-19 21:22:50,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:50,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518835669] [2019-11-19 21:22:50,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:50,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:50,854 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:50,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518835669] [2019-11-19 21:22:50,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:22:50,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 21:22:50,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744883275] [2019-11-19 21:22:50,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:22:50,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:50,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:22:50,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:22:50,857 INFO L87 Difference]: Start difference. First operand 34 states and 47 transitions. Second operand 3 states. [2019-11-19 21:22:50,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:50,888 INFO L93 Difference]: Finished difference Result 83 states and 118 transitions. [2019-11-19 21:22:50,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:22:50,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-19 21:22:50,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:50,890 INFO L225 Difference]: With dead ends: 83 [2019-11-19 21:22:50,890 INFO L226 Difference]: Without dead ends: 55 [2019-11-19 21:22:50,891 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:50,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-19 21:22:50,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2019-11-19 21:22:50,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-19 21:22:50,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 74 transitions. [2019-11-19 21:22:50,901 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 74 transitions. Word has length 23 [2019-11-19 21:22:50,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:50,901 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 74 transitions. [2019-11-19 21:22:50,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:22:50,901 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 74 transitions. [2019-11-19 21:22:50,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-19 21:22:50,902 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:50,903 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] [2019-11-19 21:22:50,903 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:50,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:50,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1746371458, now seen corresponding path program 1 times [2019-11-19 21:22:50,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:50,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820609227] [2019-11-19 21:22:50,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:50,978 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:50,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820609227] [2019-11-19 21:22:50,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:22:50,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:22:50,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392030054] [2019-11-19 21:22:50,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:22:50,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:50,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:22:50,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:22:50,981 INFO L87 Difference]: Start difference. First operand 53 states and 74 transitions. Second operand 5 states. [2019-11-19 21:22:51,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:51,061 INFO L93 Difference]: Finished difference Result 139 states and 194 transitions. [2019-11-19 21:22:51,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 21:22:51,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-19 21:22:51,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:51,063 INFO L225 Difference]: With dead ends: 139 [2019-11-19 21:22:51,063 INFO L226 Difference]: Without dead ends: 92 [2019-11-19 21:22:51,064 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,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-19 21:22:51,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 56. [2019-11-19 21:22:51,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-19 21:22:51,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 77 transitions. [2019-11-19 21:22:51,073 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 77 transitions. Word has length 29 [2019-11-19 21:22:51,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:51,074 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 77 transitions. [2019-11-19 21:22:51,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:22:51,074 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 77 transitions. [2019-11-19 21:22:51,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-19 21:22:51,075 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:51,075 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] [2019-11-19 21:22:51,076 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:51,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:51,076 INFO L82 PathProgramCache]: Analyzing trace with hash 916139585, now seen corresponding path program 1 times [2019-11-19 21:22:51,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:51,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221851046] [2019-11-19 21:22:51,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:51,163 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,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221851046] [2019-11-19 21:22:51,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:22:51,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:22:51,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679072948] [2019-11-19 21:22:51,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:22:51,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:51,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:22:51,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:22:51,168 INFO L87 Difference]: Start difference. First operand 56 states and 77 transitions. Second operand 5 states. [2019-11-19 21:22:51,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:51,285 INFO L93 Difference]: Finished difference Result 203 states and 287 transitions. [2019-11-19 21:22:51,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 21:22:51,286 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-19 21:22:51,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:51,288 INFO L225 Difference]: With dead ends: 203 [2019-11-19 21:22:51,288 INFO L226 Difference]: Without dead ends: 153 [2019-11-19 21:22:51,289 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:51,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-19 21:22:51,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 98. [2019-11-19 21:22:51,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-19 21:22:51,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 132 transitions. [2019-11-19 21:22:51,322 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 132 transitions. Word has length 29 [2019-11-19 21:22:51,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:51,323 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 132 transitions. [2019-11-19 21:22:51,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:22:51,323 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 132 transitions. [2019-11-19 21:22:51,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-19 21:22:51,330 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:51,330 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,333 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:51,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:51,335 INFO L82 PathProgramCache]: Analyzing trace with hash -949743997, now seen corresponding path program 1 times [2019-11-19 21:22:51,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:51,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016454067] [2019-11-19 21:22:51,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:51,426 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,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016454067] [2019-11-19 21:22:51,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:22:51,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:22:51,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792828867] [2019-11-19 21:22:51,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:22:51,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:51,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:22:51,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:22:51,429 INFO L87 Difference]: Start difference. First operand 98 states and 132 transitions. Second operand 5 states. [2019-11-19 21:22:51,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:51,569 INFO L93 Difference]: Finished difference Result 197 states and 271 transitions. [2019-11-19 21:22:51,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 21:22:51,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-19 21:22:51,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:51,574 INFO L225 Difference]: With dead ends: 197 [2019-11-19 21:22:51,574 INFO L226 Difference]: Without dead ends: 195 [2019-11-19 21:22:51,576 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:51,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-11-19 21:22:51,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 98. [2019-11-19 21:22:51,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-19 21:22:51,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 131 transitions. [2019-11-19 21:22:51,602 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 131 transitions. Word has length 30 [2019-11-19 21:22:51,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:51,602 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 131 transitions. [2019-11-19 21:22:51,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:22:51,603 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 131 transitions. [2019-11-19 21:22:51,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-19 21:22:51,608 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:51,608 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,608 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:51,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:51,609 INFO L82 PathProgramCache]: Analyzing trace with hash 289685246, now seen corresponding path program 1 times [2019-11-19 21:22:51,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:51,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871669279] [2019-11-19 21:22:51,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:51,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:51,681 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,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871669279] [2019-11-19 21:22:51,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:22:51,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:22:51,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240686361] [2019-11-19 21:22:51,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:22:51,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:51,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:22:51,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:22:51,684 INFO L87 Difference]: Start difference. First operand 98 states and 131 transitions. Second operand 5 states. [2019-11-19 21:22:51,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:51,757 INFO L93 Difference]: Finished difference Result 228 states and 307 transitions. [2019-11-19 21:22:51,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 21:22:51,758 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-19 21:22:51,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:51,760 INFO L225 Difference]: With dead ends: 228 [2019-11-19 21:22:51,760 INFO L226 Difference]: Without dead ends: 136 [2019-11-19 21:22:51,761 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:51,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-11-19 21:22:51,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 81. [2019-11-19 21:22:51,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-19 21:22:51,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 106 transitions. [2019-11-19 21:22:51,776 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 106 transitions. Word has length 30 [2019-11-19 21:22:51,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:51,777 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 106 transitions. [2019-11-19 21:22:51,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:22:51,777 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 106 transitions. [2019-11-19 21:22:51,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-19 21:22:51,778 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:51,778 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,779 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:51,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:51,780 INFO L82 PathProgramCache]: Analyzing trace with hash 547850684, now seen corresponding path program 1 times [2019-11-19 21:22:51,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:51,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757226952] [2019-11-19 21:22:51,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:51,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:51,848 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,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757226952] [2019-11-19 21:22:51,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:22:51,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:22:51,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650493975] [2019-11-19 21:22:51,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:22:51,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:51,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:22:51,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:22:51,852 INFO L87 Difference]: Start difference. First operand 81 states and 106 transitions. Second operand 5 states. [2019-11-19 21:22:51,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:51,998 INFO L93 Difference]: Finished difference Result 208 states and 285 transitions. [2019-11-19 21:22:51,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 21:22:51,999 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-19 21:22:52,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:52,002 INFO L225 Difference]: With dead ends: 208 [2019-11-19 21:22:52,002 INFO L226 Difference]: Without dead ends: 156 [2019-11-19 21:22:52,005 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,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-19 21:22:52,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 118. [2019-11-19 21:22:52,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-19 21:22:52,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 154 transitions. [2019-11-19 21:22:52,031 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 154 transitions. Word has length 30 [2019-11-19 21:22:52,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:52,031 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 154 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 118 states and 154 transitions. [2019-11-19 21:22:52,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-19 21:22:52,035 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:52,036 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] [2019-11-19 21:22:52,036 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:52,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:52,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1693810360, now seen corresponding path program 1 times [2019-11-19 21:22:52,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:52,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67624167] [2019-11-19 21:22:52,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:52,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:52,182 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,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67624167] [2019-11-19 21:22:52,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728616456] [2019-11-19 21:22:52,185 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:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:52,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 21:22:52,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:22:52,426 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,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:22:52,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-11-19 21:22:52,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322561401] [2019-11-19 21:22:52,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 21:22:52,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:52,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 21:22:52,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-19 21:22:52,431 INFO L87 Difference]: Start difference. First operand 118 states and 154 transitions. Second operand 6 states. [2019-11-19 21:22:52,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:52,659 INFO L93 Difference]: Finished difference Result 345 states and 466 transitions. [2019-11-19 21:22:52,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 21:22:52,660 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2019-11-19 21:22:52,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:52,662 INFO L225 Difference]: With dead ends: 345 [2019-11-19 21:22:52,662 INFO L226 Difference]: Without dead ends: 256 [2019-11-19 21:22:52,670 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 49 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:52,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-11-19 21:22:52,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 159. [2019-11-19 21:22:52,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-11-19 21:22:52,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 210 transitions. [2019-11-19 21:22:52,695 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 210 transitions. Word has length 45 [2019-11-19 21:22:52,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:52,695 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 210 transitions. [2019-11-19 21:22:52,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 21:22:52,695 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 210 transitions. [2019-11-19 21:22:52,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-19 21:22:52,696 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:52,696 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-19 21:22:52,903 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:22:52,903 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:52,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:52,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1880584764, now seen corresponding path program 2 times [2019-11-19 21:22:52,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:52,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225813290] [2019-11-19 21:22:52,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:52,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 21:22:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 21:22:53,104 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 21:22:53,105 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 21:22:53,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:22:53 BoogieIcfgContainer [2019-11-19 21:22:53,253 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 21:22:53,253 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 21:22:53,254 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 21:22:53,254 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 21:22:53,255 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:49" (3/4) ... [2019-11-19 21:22:53,259 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-19 21:22:53,474 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 21:22:53,474 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 21:22:53,477 INFO L168 Benchmark]: Toolchain (without parser) took 5347.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 215.5 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -164.7 MB). Peak memory consumption was 50.8 MB. Max. memory is 11.5 GB. [2019-11-19 21:22:53,478 INFO L168 Benchmark]: CDTParser took 0.30 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:53,478 INFO L168 Benchmark]: CACSL2BoogieTranslator took 662.29 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: -162.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-19 21:22:53,478 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-19 21:22:53,479 INFO L168 Benchmark]: Boogie Preprocessor took 42.63 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-19 21:22:53,479 INFO L168 Benchmark]: RCFGBuilder took 958.74 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: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 11.5 GB. [2019-11-19 21:22:53,479 INFO L168 Benchmark]: TraceAbstraction took 3372.60 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -82.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:22:53,480 INFO L168 Benchmark]: Witness Printer took 221.20 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: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-11-19 21:22:53,482 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.30 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 662.29 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: -162.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 83.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.63 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 958.74 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: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3372.60 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -82.9 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 221.20 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: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 869]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L209] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L406] int cleanupTimeShifts = 4; [L615] int waterLevel = 1; [L616] int methaneLevelCritical = 0; [L712] int pumpRunning = 0; [L713] int systemActive = 1; [L487] int retValue_acc ; [L488] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L536] int retValue_acc ; [L539] retValue_acc = 1 [L540] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L494] tmp = valid_product() [L496] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L546] int splverifierCounter ; [L547] int tmp ; [L548] int tmp___0 ; [L549] int tmp___1 ; [L550] int tmp___2 ; [L553] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L555] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L557] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L563] tmp = __VERIFIER_nondet_int() [L565] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L633] COND TRUE waterLevel < 2 [L634] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L573] tmp___0 = __VERIFIER_nondet_int() [L575] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L583] tmp___2 = __VERIFIER_nondet_int() [L585] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L720] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L727] COND TRUE \read(systemActive) [L749] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L752] COND TRUE ! pumpRunning [L846] int retValue_acc ; [L847] int tmp ; [L848] int tmp___0 ; [L695] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L698] COND FALSE !(waterLevel < 2) [L702] retValue_acc = 0 [L703] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L852] tmp = isHighWaterSensorDry() [L854] COND FALSE !(\read(tmp)) [L857] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L859] retValue_acc = tmp___0 [L860] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L754] tmp = isHighWaterLevel() [L756] COND TRUE \read(tmp) [L777] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L875] int tmp ; [L876] int tmp___0 ; [L686] int retValue_acc ; [L689] retValue_acc = waterLevel [L690] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L880] tmp = getWaterLevel() [L882] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L555] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L557] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L563] tmp = __VERIFIER_nondet_int() [L565] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L573] tmp___0 = __VERIFIER_nondet_int() [L575] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L583] tmp___2 = __VERIFIER_nondet_int() [L585] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L720] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L621] COND TRUE waterLevel > 0 [L622] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L727] COND TRUE \read(systemActive) [L749] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L752] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L875] int tmp ; [L876] int tmp___0 ; [L686] int retValue_acc ; [L689] retValue_acc = waterLevel [L690] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L880] tmp = getWaterLevel() [L882] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L555] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L557] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L563] tmp = __VERIFIER_nondet_int() [L565] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L573] tmp___0 = __VERIFIER_nondet_int() [L575] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L583] tmp___2 = __VERIFIER_nondet_int() [L585] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L720] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L621] COND TRUE waterLevel > 0 [L622] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L727] COND TRUE \read(systemActive) [L749] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L752] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L875] int tmp ; [L876] int tmp___0 ; [L686] int retValue_acc ; [L689] retValue_acc = waterLevel [L690] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L880] tmp = getWaterLevel() [L882] COND TRUE tmp == 0 [L801] int retValue_acc ; [L804] retValue_acc = pumpRunning [L805] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L884] tmp___0 = isPumpRunning() [L886] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L869] __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, 78 locations, 3 error locations. Result: UNSAFE, OverallTime: 3.2s, OverallIterations: 11, TraceHistogramMax: 3, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 714 SDtfs, 902 SDslu, 1054 SDs, 0 SdLazy, 184 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred 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, 380 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 376 NumberOfCodeBlocks, 376 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 305 ConstructedInterpolants, 0 QuantifiedInterpolants, 19573 SizeOfPredicates, 4 NumberOfNonLiveVariables, 375 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...