./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec2_product35.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec2_product35.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 c300c29b8d9fc061a97d8a30a731a0ec640f0644 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-30f4e4a [2019-11-28 00:20:58,895 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:20:58,897 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:20:58,910 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:20:58,910 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:20:58,912 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:20:58,913 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:20:58,915 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:20:58,917 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:20:58,919 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:20:58,920 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:20:58,924 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:20:58,924 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:20:58,926 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:20:58,927 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:20:58,928 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:20:58,929 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:20:58,930 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:20:58,931 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:20:58,933 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:20:58,935 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:20:58,936 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:20:58,938 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:20:58,938 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:20:58,941 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:20:58,941 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:20:58,941 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:20:58,942 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:20:58,943 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:20:58,944 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:20:58,944 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:20:58,945 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:20:58,946 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:20:58,947 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:20:58,948 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:20:58,948 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:20:58,949 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:20:58,949 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:20:58,949 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:20:58,950 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:20:58,952 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:20:58,953 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:20:58,968 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:20:58,968 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:20:58,970 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:20:58,970 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:20:58,970 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:20:58,971 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:20:58,971 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:20:58,971 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:20:58,971 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:20:58,971 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:20:58,972 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:20:58,972 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:20:58,972 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:20:58,972 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:20:58,972 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:20:58,973 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:20:58,973 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:20:58,973 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:20:58,973 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:20:58,974 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:20:58,974 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:20:58,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:20:58,974 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:20:58,975 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:20:58,975 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:20:58,975 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:20:58,975 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:20:58,975 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:20:58,976 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 -> c300c29b8d9fc061a97d8a30a731a0ec640f0644 [2019-11-28 00:20:59,337 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:20:59,351 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:20:59,355 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:20:59,356 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:20:59,357 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:20:59,358 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec2_product35.cil.c [2019-11-28 00:20:59,434 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b20711517/dcf1862421b14569be8c08a58ed34236/FLAGd185499b6 [2019-11-28 00:21:00,022 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:21:00,023 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product35.cil.c [2019-11-28 00:21:00,040 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b20711517/dcf1862421b14569be8c08a58ed34236/FLAGd185499b6 [2019-11-28 00:21:00,317 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b20711517/dcf1862421b14569be8c08a58ed34236 [2019-11-28 00:21:00,321 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:21:00,323 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:21:00,324 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:21:00,324 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:21:00,328 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:21:00,328 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:21:00" (1/1) ... [2019-11-28 00:21:00,332 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@760d99d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:00, skipping insertion in model container [2019-11-28 00:21:00,332 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:21:00" (1/1) ... [2019-11-28 00:21:00,340 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:21:00,391 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:21:00,814 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:21:00,837 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:21:00,974 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:21:01,008 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:21:01,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:01 WrapperNode [2019-11-28 00:21:01,008 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:21:01,009 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:21:01,009 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:21:01,010 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:21:01,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:01" (1/1) ... [2019-11-28 00:21:01,040 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:01" (1/1) ... [2019-11-28 00:21:01,093 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:21:01,093 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:21:01,093 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:21:01,094 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:21:01,102 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:01" (1/1) ... [2019-11-28 00:21:01,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:01" (1/1) ... [2019-11-28 00:21:01,107 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:01" (1/1) ... [2019-11-28 00:21:01,107 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:01" (1/1) ... [2019-11-28 00:21:01,120 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:01" (1/1) ... [2019-11-28 00:21:01,128 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:01" (1/1) ... [2019-11-28 00:21:01,131 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:01" (1/1) ... [2019-11-28 00:21:01,136 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:21:01,136 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:21:01,136 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:21:01,137 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:21:01,137 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:21:01,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 00:21:01,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 00:21:01,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:21:01,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:21:02,054 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:21:02,054 INFO L297 CfgBuilder]: Removed 102 assume(true) statements. [2019-11-28 00:21:02,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:21:02 BoogieIcfgContainer [2019-11-28 00:21:02,056 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:21:02,057 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:21:02,057 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:21:02,061 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:21:02,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:21:00" (1/3) ... [2019-11-28 00:21:02,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28a103a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:21:02, skipping insertion in model container [2019-11-28 00:21:02,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:01" (2/3) ... [2019-11-28 00:21:02,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28a103a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:21:02, skipping insertion in model container [2019-11-28 00:21:02,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:21:02" (3/3) ... [2019-11-28 00:21:02,064 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product35.cil.c [2019-11-28 00:21:02,074 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:21:02,082 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 00:21:02,094 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 00:21:02,116 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:21:02,116 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:21:02,116 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:21:02,116 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:21:02,117 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:21:02,118 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:21:02,118 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:21:02,118 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:21:02,134 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2019-11-28 00:21:02,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 00:21:02,141 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:02,142 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:21:02,143 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:02,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:02,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1673386384, now seen corresponding path program 1 times [2019-11-28 00:21:02,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:02,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586033852] [2019-11-28 00:21:02,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:02,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:21:02,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586033852] [2019-11-28 00:21:02,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:02,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:21:02,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648710288] [2019-11-28 00:21:02,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 00:21:02,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:02,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 00:21:02,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 00:21:02,508 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 2 states. [2019-11-28 00:21:02,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:02,539 INFO L93 Difference]: Finished difference Result 161 states and 246 transitions. [2019-11-28 00:21:02,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 00:21:02,541 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-11-28 00:21:02,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:02,553 INFO L225 Difference]: With dead ends: 161 [2019-11-28 00:21:02,553 INFO L226 Difference]: Without dead ends: 80 [2019-11-28 00:21:02,557 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 00:21:02,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-28 00:21:02,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-11-28 00:21:02,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-28 00:21:02,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 115 transitions. [2019-11-28 00:21:02,604 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 115 transitions. Word has length 18 [2019-11-28 00:21:02,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:02,605 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 115 transitions. [2019-11-28 00:21:02,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 00:21:02,605 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 115 transitions. [2019-11-28 00:21:02,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 00:21:02,606 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:02,607 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:21:02,607 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:02,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:02,608 INFO L82 PathProgramCache]: Analyzing trace with hash 572864739, now seen corresponding path program 1 times [2019-11-28 00:21:02,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:02,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747077805] [2019-11-28 00:21:02,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:02,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:02,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:21:02,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747077805] [2019-11-28 00:21:02,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:02,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:21:02,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79213166] [2019-11-28 00:21:02,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:21:02,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:02,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:21:02,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:21:02,725 INFO L87 Difference]: Start difference. First operand 80 states and 115 transitions. Second operand 3 states. [2019-11-28 00:21:02,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:02,745 INFO L93 Difference]: Finished difference Result 80 states and 115 transitions. [2019-11-28 00:21:02,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:21:02,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 00:21:02,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:02,749 INFO L225 Difference]: With dead ends: 80 [2019-11-28 00:21:02,750 INFO L226 Difference]: Without dead ends: 38 [2019-11-28 00:21:02,751 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:21:02,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-28 00:21:02,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-11-28 00:21:02,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-28 00:21:02,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 54 transitions. [2019-11-28 00:21:02,763 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 54 transitions. Word has length 19 [2019-11-28 00:21:02,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:02,763 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 54 transitions. [2019-11-28 00:21:02,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:21:02,764 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 54 transitions. [2019-11-28 00:21:02,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 00:21:02,766 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:02,766 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:21:02,767 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:02,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:02,767 INFO L82 PathProgramCache]: Analyzing trace with hash -2071848385, now seen corresponding path program 1 times [2019-11-28 00:21:02,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:02,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172772804] [2019-11-28 00:21:02,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:02,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:21:02,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172772804] [2019-11-28 00:21:02,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:02,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:21:02,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779653831] [2019-11-28 00:21:02,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:21:02,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:02,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:21:02,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:21:02,941 INFO L87 Difference]: Start difference. First operand 38 states and 54 transitions. Second operand 6 states. [2019-11-28 00:21:03,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:03,097 INFO L93 Difference]: Finished difference Result 124 states and 184 transitions. [2019-11-28 00:21:03,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:21:03,098 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-28 00:21:03,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:03,101 INFO L225 Difference]: With dead ends: 124 [2019-11-28 00:21:03,101 INFO L226 Difference]: Without dead ends: 93 [2019-11-28 00:21:03,104 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:21:03,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-28 00:21:03,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 58. [2019-11-28 00:21:03,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-28 00:21:03,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 85 transitions. [2019-11-28 00:21:03,125 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 85 transitions. Word has length 24 [2019-11-28 00:21:03,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:03,128 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 85 transitions. [2019-11-28 00:21:03,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:21:03,129 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 85 transitions. [2019-11-28 00:21:03,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 00:21:03,130 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:03,130 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:21:03,130 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:03,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:03,132 INFO L82 PathProgramCache]: Analyzing trace with hash 343514617, now seen corresponding path program 1 times [2019-11-28 00:21:03,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:03,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729868895] [2019-11-28 00:21:03,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:03,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:03,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:21:03,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729868895] [2019-11-28 00:21:03,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:03,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:21:03,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376022155] [2019-11-28 00:21:03,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:21:03,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:03,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:21:03,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:21:03,250 INFO L87 Difference]: Start difference. First operand 58 states and 85 transitions. Second operand 3 states. [2019-11-28 00:21:03,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:03,303 INFO L93 Difference]: Finished difference Result 131 states and 195 transitions. [2019-11-28 00:21:03,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:21:03,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 00:21:03,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:03,305 INFO L225 Difference]: With dead ends: 131 [2019-11-28 00:21:03,305 INFO L226 Difference]: Without dead ends: 80 [2019-11-28 00:21:03,307 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:21:03,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-28 00:21:03,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2019-11-28 00:21:03,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-28 00:21:03,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 112 transitions. [2019-11-28 00:21:03,327 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 112 transitions. Word has length 25 [2019-11-28 00:21:03,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:03,327 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 112 transitions. [2019-11-28 00:21:03,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:21:03,328 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 112 transitions. [2019-11-28 00:21:03,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 00:21:03,329 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:03,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] [2019-11-28 00:21:03,330 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:03,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:03,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1750340408, now seen corresponding path program 1 times [2019-11-28 00:21:03,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:03,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691130695] [2019-11-28 00:21:03,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:03,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:03,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:21:03,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691130695] [2019-11-28 00:21:03,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:03,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:21:03,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106774952] [2019-11-28 00:21:03,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:21:03,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:03,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:21:03,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:21:03,457 INFO L87 Difference]: Start difference. First operand 78 states and 112 transitions. Second operand 5 states. [2019-11-28 00:21:03,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:03,581 INFO L93 Difference]: Finished difference Result 361 states and 530 transitions. [2019-11-28 00:21:03,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 00:21:03,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-28 00:21:03,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:03,586 INFO L225 Difference]: With dead ends: 361 [2019-11-28 00:21:03,588 INFO L226 Difference]: Without dead ends: 290 [2019-11-28 00:21:03,594 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 00:21:03,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-11-28 00:21:03,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 138. [2019-11-28 00:21:03,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-11-28 00:21:03,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 195 transitions. [2019-11-28 00:21:03,645 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 195 transitions. Word has length 27 [2019-11-28 00:21:03,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:03,646 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 195 transitions. [2019-11-28 00:21:03,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:21:03,646 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 195 transitions. [2019-11-28 00:21:03,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 00:21:03,649 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:03,649 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:21:03,649 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:03,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:03,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1110481728, now seen corresponding path program 1 times [2019-11-28 00:21:03,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:03,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079837552] [2019-11-28 00:21:03,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:03,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:21:03,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079837552] [2019-11-28 00:21:03,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:03,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:21:03,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015853091] [2019-11-28 00:21:03,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:21:03,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:03,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:21:03,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:21:03,770 INFO L87 Difference]: Start difference. First operand 138 states and 195 transitions. Second operand 5 states. [2019-11-28 00:21:03,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:03,963 INFO L93 Difference]: Finished difference Result 499 states and 711 transitions. [2019-11-28 00:21:03,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:21:03,964 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-11-28 00:21:03,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:03,966 INFO L225 Difference]: With dead ends: 499 [2019-11-28 00:21:03,966 INFO L226 Difference]: Without dead ends: 368 [2019-11-28 00:21:03,969 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 00:21:03,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-11-28 00:21:04,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 136. [2019-11-28 00:21:04,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-28 00:21:04,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 189 transitions. [2019-11-28 00:21:04,004 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 189 transitions. Word has length 28 [2019-11-28 00:21:04,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:04,005 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 189 transitions. [2019-11-28 00:21:04,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:21:04,005 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 189 transitions. [2019-11-28 00:21:04,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 00:21:04,014 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:04,014 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:21:04,017 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:04,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:04,019 INFO L82 PathProgramCache]: Analyzing trace with hash -2071146496, now seen corresponding path program 1 times [2019-11-28 00:21:04,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:04,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914001881] [2019-11-28 00:21:04,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:04,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:21:04,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914001881] [2019-11-28 00:21:04,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:04,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:21:04,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034291000] [2019-11-28 00:21:04,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:21:04,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:04,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:21:04,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:21:04,085 INFO L87 Difference]: Start difference. First operand 136 states and 189 transitions. Second operand 5 states. [2019-11-28 00:21:04,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:04,165 INFO L93 Difference]: Finished difference Result 401 states and 556 transitions. [2019-11-28 00:21:04,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:21:04,166 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-11-28 00:21:04,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:04,169 INFO L225 Difference]: With dead ends: 401 [2019-11-28 00:21:04,170 INFO L226 Difference]: Without dead ends: 272 [2019-11-28 00:21:04,171 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:21:04,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-28 00:21:04,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 142. [2019-11-28 00:21:04,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-11-28 00:21:04,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 195 transitions. [2019-11-28 00:21:04,197 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 195 transitions. Word has length 32 [2019-11-28 00:21:04,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:04,197 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 195 transitions. [2019-11-28 00:21:04,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:21:04,198 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 195 transitions. [2019-11-28 00:21:04,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 00:21:04,200 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:04,200 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:21:04,200 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:04,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:04,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1370081918, now seen corresponding path program 1 times [2019-11-28 00:21:04,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:04,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092006011] [2019-11-28 00:21:04,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:04,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:04,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:21:04,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092006011] [2019-11-28 00:21:04,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:04,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 00:21:04,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778300511] [2019-11-28 00:21:04,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:21:04,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:04,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:21:04,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:21:04,279 INFO L87 Difference]: Start difference. First operand 142 states and 195 transitions. Second operand 6 states. [2019-11-28 00:21:04,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:04,386 INFO L93 Difference]: Finished difference Result 435 states and 595 transitions. [2019-11-28 00:21:04,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 00:21:04,387 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-28 00:21:04,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:04,391 INFO L225 Difference]: With dead ends: 435 [2019-11-28 00:21:04,391 INFO L226 Difference]: Without dead ends: 300 [2019-11-28 00:21:04,392 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-28 00:21:04,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-28 00:21:04,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 146. [2019-11-28 00:21:04,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-28 00:21:04,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 199 transitions. [2019-11-28 00:21:04,416 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 199 transitions. Word has length 32 [2019-11-28 00:21:04,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:04,416 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 199 transitions. [2019-11-28 00:21:04,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:21:04,416 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 199 transitions. [2019-11-28 00:21:04,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 00:21:04,417 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:04,417 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:21:04,418 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:04,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:04,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1956887932, now seen corresponding path program 1 times [2019-11-28 00:21:04,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:04,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142637558] [2019-11-28 00:21:04,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:04,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:04,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:21:04,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142637558] [2019-11-28 00:21:04,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:04,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:21:04,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20386832] [2019-11-28 00:21:04,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:21:04,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:04,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:21:04,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:21:04,468 INFO L87 Difference]: Start difference. First operand 146 states and 199 transitions. Second operand 3 states. [2019-11-28 00:21:04,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:04,517 INFO L93 Difference]: Finished difference Result 371 states and 505 transitions. [2019-11-28 00:21:04,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:21:04,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-28 00:21:04,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:04,520 INFO L225 Difference]: With dead ends: 371 [2019-11-28 00:21:04,521 INFO L226 Difference]: Without dead ends: 232 [2019-11-28 00:21:04,521 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:21:04,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-11-28 00:21:04,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2019-11-28 00:21:04,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-28 00:21:04,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 307 transitions. [2019-11-28 00:21:04,562 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 307 transitions. Word has length 32 [2019-11-28 00:21:04,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:04,562 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 307 transitions. [2019-11-28 00:21:04,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:21:04,563 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 307 transitions. [2019-11-28 00:21:04,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 00:21:04,564 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:04,565 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:21:04,565 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:04,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:04,566 INFO L82 PathProgramCache]: Analyzing trace with hash 875175876, now seen corresponding path program 1 times [2019-11-28 00:21:04,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:04,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611143144] [2019-11-28 00:21:04,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:04,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:21:04,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611143144] [2019-11-28 00:21:04,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:04,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:21:04,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966500768] [2019-11-28 00:21:04,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:21:04,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:04,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:21:04,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:21:04,643 INFO L87 Difference]: Start difference. First operand 232 states and 307 transitions. Second operand 3 states. [2019-11-28 00:21:04,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:04,746 INFO L93 Difference]: Finished difference Result 315 states and 418 transitions. [2019-11-28 00:21:04,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:21:04,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-28 00:21:04,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:04,749 INFO L225 Difference]: With dead ends: 315 [2019-11-28 00:21:04,749 INFO L226 Difference]: Without dead ends: 313 [2019-11-28 00:21:04,750 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:21:04,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-11-28 00:21:04,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 265. [2019-11-28 00:21:04,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-11-28 00:21:04,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 356 transitions. [2019-11-28 00:21:04,783 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 356 transitions. Word has length 33 [2019-11-28 00:21:04,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:04,784 INFO L462 AbstractCegarLoop]: Abstraction has 265 states and 356 transitions. [2019-11-28 00:21:04,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:21:04,784 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 356 transitions. [2019-11-28 00:21:04,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 00:21:04,785 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:04,786 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:21:04,786 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:04,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:04,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1646221848, now seen corresponding path program 1 times [2019-11-28 00:21:04,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:04,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48704165] [2019-11-28 00:21:04,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:21:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:21:04,939 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 00:21:04,940 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 00:21:05,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:21:05 BoogieIcfgContainer [2019-11-28 00:21:05,085 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:21:05,086 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:21:05,086 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:21:05,086 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:21:05,087 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:21:02" (3/4) ... [2019-11-28 00:21:05,090 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 00:21:05,243 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:21:05,244 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:21:05,246 INFO L168 Benchmark]: Toolchain (without parser) took 4923.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 196.1 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -141.0 MB). Peak memory consumption was 55.0 MB. Max. memory is 11.5 GB. [2019-11-28 00:21:05,247 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:21:05,248 INFO L168 Benchmark]: CACSL2BoogieTranslator took 685.16 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -132.1 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2019-11-28 00:21:05,248 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.71 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:21:05,249 INFO L168 Benchmark]: Boogie Preprocessor took 42.72 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-28 00:21:05,254 INFO L168 Benchmark]: RCFGBuilder took 919.70 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: 58.7 MB). Peak memory consumption was 58.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:21:05,258 INFO L168 Benchmark]: TraceAbstraction took 3028.76 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 78.6 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -97.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:21:05,259 INFO L168 Benchmark]: Witness Printer took 158.04 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: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2019-11-28 00:21:05,263 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 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 685.16 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -132.1 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 83.71 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.72 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 919.70 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: 58.7 MB). Peak memory consumption was 58.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3028.76 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 78.6 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -97.9 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 158.04 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: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 736]: 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; [L416] int pumpRunning = 0; [L417] int systemActive = 1; [L655] int methAndRunningLastTime ; [L741] int cleanupTimeShifts = 4; [L839] int waterLevel = 1; [L840] int methaneLevelCritical = 0; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L815] int retValue_acc ; [L816] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L723] int retValue_acc ; [L726] retValue_acc = 1 [L727] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L822] tmp = valid_product() [L824] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L660] methAndRunningLastTime = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L588] int splverifierCounter ; [L589] int tmp ; [L590] int tmp___0 ; [L591] int tmp___1 ; [L592] int tmp___2 ; [L595] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L597] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L599] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L605] tmp = __VERIFIER_nondet_int() [L607] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L857] COND TRUE waterLevel < 2 [L858] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L615] tmp___0 = __VERIFIER_nondet_int() [L617] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L869] COND FALSE !(\read(methaneLevelCritical)) [L872] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L625] tmp___2 = __VERIFIER_nondet_int() [L627] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L424] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L431] COND TRUE \read(systemActive) [L453] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L456] COND TRUE ! pumpRunning [L550] int retValue_acc ; [L551] int tmp ; [L552] int tmp___0 ; [L919] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L922] COND FALSE !(waterLevel < 2) [L926] retValue_acc = 0 [L927] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L556] tmp = isHighWaterSensorDry() [L558] COND FALSE !(\read(tmp)) [L561] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L563] retValue_acc = tmp___0 [L564] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L458] tmp = isHighWaterLevel() [L460] COND TRUE \read(tmp) [L481] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L665] int tmp ; [L666] int tmp___0 ; [L878] int retValue_acc ; [L881] retValue_acc = methaneLevelCritical [L882] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L670] tmp = isMethaneLevelCritical() [L672] COND TRUE \read(tmp) [L505] int retValue_acc ; [L508] retValue_acc = pumpRunning [L509] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L674] tmp___0 = isPumpRunning() [L676] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L677] COND FALSE !(\read(methAndRunningLastTime)) [L682] methAndRunningLastTime = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L597] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L599] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L605] tmp = __VERIFIER_nondet_int() [L607] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L615] tmp___0 = __VERIFIER_nondet_int() [L617] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L625] tmp___2 = __VERIFIER_nondet_int() [L627] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L424] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L845] COND TRUE waterLevel > 0 [L846] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L431] COND TRUE \read(systemActive) [L453] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L456] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L665] int tmp ; [L666] int tmp___0 ; [L878] int retValue_acc ; [L881] retValue_acc = methaneLevelCritical [L882] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L670] tmp = isMethaneLevelCritical() [L672] COND TRUE \read(tmp) [L505] int retValue_acc ; [L508] retValue_acc = pumpRunning [L509] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L674] tmp___0 = isPumpRunning() [L676] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L677] COND TRUE \read(methAndRunningLastTime) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L736] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 84 locations, 3 error locations. Result: UNSAFE, OverallTime: 2.8s, OverallIterations: 11, TraceHistogramMax: 2, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 708 SDtfs, 995 SDslu, 1212 SDs, 0 SdLazy, 134 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=265occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 753 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 321 NumberOfCodeBlocks, 321 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 260 ConstructedInterpolants, 0 QuantifiedInterpolants, 14762 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...