./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec2_product44.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_product44.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 1e304dec1a19556a559249c7b1ef76290bc8b678 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:21:03,974 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:21:03,976 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:21:03,992 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:21:03,992 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:21:03,995 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:21:03,997 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:21:04,007 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:21:04,012 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:21:04,015 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:21:04,016 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:21:04,018 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:21:04,019 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:21:04,021 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:21:04,022 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:21:04,024 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:21:04,025 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:21:04,026 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:21:04,029 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:21:04,032 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:21:04,037 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:21:04,042 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:21:04,043 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:21:04,045 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:21:04,047 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:21:04,047 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:21:04,047 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:21:04,049 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:21:04,050 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:21:04,051 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:21:04,051 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:21:04,052 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:21:04,052 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:21:04,054 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:21:04,055 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:21:04,055 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:21:04,056 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:21:04,056 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:21:04,057 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:21:04,057 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:21:04,060 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:21:04,061 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:21:04,087 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:21:04,088 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:21:04,089 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:21:04,090 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:21:04,090 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:21:04,090 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:21:04,091 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:21:04,091 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:21:04,091 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:21:04,091 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:21:04,092 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:21:04,092 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:21:04,092 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:21:04,092 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:21:04,093 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:21:04,093 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:21:04,093 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:21:04,094 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:21:04,095 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:21:04,095 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:21:04,095 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:21:04,095 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:21:04,096 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:21:04,096 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:21:04,096 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:21:04,096 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:21:04,096 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:21:04,097 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:21:04,097 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 -> 1e304dec1a19556a559249c7b1ef76290bc8b678 [2019-11-28 00:21:04,437 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:21:04,451 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:21:04,454 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:21:04,456 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:21:04,456 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:21:04,457 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec2_product44.cil.c [2019-11-28 00:21:04,534 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/155f236c0/0ec4035c11a447d3acea0c98c040102f/FLAGe31adf9e8 [2019-11-28 00:21:05,081 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:21:05,082 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product44.cil.c [2019-11-28 00:21:05,101 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/155f236c0/0ec4035c11a447d3acea0c98c040102f/FLAGe31adf9e8 [2019-11-28 00:21:05,454 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/155f236c0/0ec4035c11a447d3acea0c98c040102f [2019-11-28 00:21:05,458 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:21:05,460 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:21:05,461 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:21:05,461 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:21:05,464 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:21:05,465 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:21:05" (1/1) ... [2019-11-28 00:21:05,468 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1381c3b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:05, skipping insertion in model container [2019-11-28 00:21:05,468 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:21:05" (1/1) ... [2019-11-28 00:21:05,476 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:21:05,529 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:21:05,972 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:21:05,990 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:21:06,084 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:21:06,124 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:21:06,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:06 WrapperNode [2019-11-28 00:21:06,124 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:21:06,125 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:21:06,125 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:21:06,126 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:21:06,132 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:06" (1/1) ... [2019-11-28 00:21:06,154 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:06" (1/1) ... [2019-11-28 00:21:06,206 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:21:06,206 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:21:06,207 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:21:06,207 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:21:06,215 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:06" (1/1) ... [2019-11-28 00:21:06,215 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:06" (1/1) ... [2019-11-28 00:21:06,222 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:06" (1/1) ... [2019-11-28 00:21:06,222 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:06" (1/1) ... [2019-11-28 00:21:06,234 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:06" (1/1) ... [2019-11-28 00:21:06,245 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:06" (1/1) ... [2019-11-28 00:21:06,249 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:06" (1/1) ... [2019-11-28 00:21:06,254 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:21:06,254 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:21:06,254 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:21:06,254 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:21:06,255 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:06" (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:06,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 00:21:06,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 00:21:06,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:21:06,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:21:07,177 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:21:07,177 INFO L297 CfgBuilder]: Removed 122 assume(true) statements. [2019-11-28 00:21:07,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:21:07 BoogieIcfgContainer [2019-11-28 00:21:07,179 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:21:07,180 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:21:07,180 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:21:07,184 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:21:07,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:21:05" (1/3) ... [2019-11-28 00:21:07,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32ec401a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:21:07, skipping insertion in model container [2019-11-28 00:21:07,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:06" (2/3) ... [2019-11-28 00:21:07,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32ec401a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:21:07, skipping insertion in model container [2019-11-28 00:21:07,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:21:07" (3/3) ... [2019-11-28 00:21:07,188 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product44.cil.c [2019-11-28 00:21:07,199 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:21:07,208 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 00:21:07,223 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 00:21:07,254 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:21:07,254 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:21:07,255 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:21:07,255 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:21:07,255 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:21:07,255 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:21:07,256 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:21:07,256 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:21:07,285 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states. [2019-11-28 00:21:07,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 00:21:07,294 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:07,296 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:07,297 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:07,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:07,305 INFO L82 PathProgramCache]: Analyzing trace with hash -732978716, now seen corresponding path program 1 times [2019-11-28 00:21:07,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:07,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549276018] [2019-11-28 00:21:07,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:07,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:07,629 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:07,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549276018] [2019-11-28 00:21:07,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:07,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:21:07,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953885748] [2019-11-28 00:21:07,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 00:21:07,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:07,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 00:21:07,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 00:21:07,653 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 2 states. [2019-11-28 00:21:07,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:07,689 INFO L93 Difference]: Finished difference Result 179 states and 270 transitions. [2019-11-28 00:21:07,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 00:21:07,691 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-11-28 00:21:07,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:07,707 INFO L225 Difference]: With dead ends: 179 [2019-11-28 00:21:07,707 INFO L226 Difference]: Without dead ends: 89 [2019-11-28 00:21:07,711 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:07,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-28 00:21:07,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-11-28 00:21:07,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-28 00:21:07,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 127 transitions. [2019-11-28 00:21:07,761 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 127 transitions. Word has length 18 [2019-11-28 00:21:07,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:07,762 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 127 transitions. [2019-11-28 00:21:07,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 00:21:07,762 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 127 transitions. [2019-11-28 00:21:07,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 00:21:07,763 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:07,764 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:07,764 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:07,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:07,765 INFO L82 PathProgramCache]: Analyzing trace with hash -951814685, now seen corresponding path program 1 times [2019-11-28 00:21:07,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:07,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838912677] [2019-11-28 00:21:07,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:07,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:07,939 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:07,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838912677] [2019-11-28 00:21:07,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:07,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:21:07,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891798588] [2019-11-28 00:21:07,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:21:07,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:07,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:21:07,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:21:07,948 INFO L87 Difference]: Start difference. First operand 89 states and 127 transitions. Second operand 3 states. [2019-11-28 00:21:07,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:07,975 INFO L93 Difference]: Finished difference Result 89 states and 127 transitions. [2019-11-28 00:21:07,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:21:07,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 00:21:07,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:07,979 INFO L225 Difference]: With dead ends: 89 [2019-11-28 00:21:07,979 INFO L226 Difference]: Without dead ends: 41 [2019-11-28 00:21:07,981 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:07,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-28 00:21:07,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-28 00:21:07,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-28 00:21:07,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2019-11-28 00:21:07,998 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 19 [2019-11-28 00:21:07,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:07,998 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2019-11-28 00:21:07,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:21:07,999 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2019-11-28 00:21:08,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 00:21:08,000 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:08,001 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:08,001 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:08,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:08,001 INFO L82 PathProgramCache]: Analyzing trace with hash -2025304256, now seen corresponding path program 1 times [2019-11-28 00:21:08,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:08,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689967523] [2019-11-28 00:21:08,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:08,119 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:08,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689967523] [2019-11-28 00:21:08,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:08,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:21:08,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783869499] [2019-11-28 00:21:08,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:21:08,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:08,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:21:08,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:21:08,124 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand 3 states. [2019-11-28 00:21:08,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:08,164 INFO L93 Difference]: Finished difference Result 109 states and 160 transitions. [2019-11-28 00:21:08,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:21:08,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 00:21:08,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:08,166 INFO L225 Difference]: With dead ends: 109 [2019-11-28 00:21:08,166 INFO L226 Difference]: Without dead ends: 75 [2019-11-28 00:21:08,167 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:08,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-28 00:21:08,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2019-11-28 00:21:08,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-28 00:21:08,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 104 transitions. [2019-11-28 00:21:08,178 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 104 transitions. Word has length 24 [2019-11-28 00:21:08,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:08,178 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 104 transitions. [2019-11-28 00:21:08,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:21:08,178 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 104 transitions. [2019-11-28 00:21:08,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 00:21:08,180 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:08,180 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:08,180 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:08,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:08,181 INFO L82 PathProgramCache]: Analyzing trace with hash 193545241, now seen corresponding path program 1 times [2019-11-28 00:21:08,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:08,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383219759] [2019-11-28 00:21:08,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:08,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:08,249 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:08,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383219759] [2019-11-28 00:21:08,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:08,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:21:08,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618795670] [2019-11-28 00:21:08,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:21:08,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:08,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:21:08,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:21:08,252 INFO L87 Difference]: Start difference. First operand 71 states and 104 transitions. Second operand 3 states. [2019-11-28 00:21:08,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:08,307 INFO L93 Difference]: Finished difference Result 178 states and 267 transitions. [2019-11-28 00:21:08,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:21:08,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 00:21:08,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:08,310 INFO L225 Difference]: With dead ends: 178 [2019-11-28 00:21:08,310 INFO L226 Difference]: Without dead ends: 114 [2019-11-28 00:21:08,311 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:08,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-28 00:21:08,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2019-11-28 00:21:08,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-28 00:21:08,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 164 transitions. [2019-11-28 00:21:08,326 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 164 transitions. Word has length 25 [2019-11-28 00:21:08,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:08,326 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 164 transitions. [2019-11-28 00:21:08,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:21:08,327 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 164 transitions. [2019-11-28 00:21:08,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 00:21:08,328 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:08,328 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:08,329 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:08,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:08,330 INFO L82 PathProgramCache]: Analyzing trace with hash 433385865, now seen corresponding path program 1 times [2019-11-28 00:21:08,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:08,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481493981] [2019-11-28 00:21:08,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:08,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:08,397 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:08,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481493981] [2019-11-28 00:21:08,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:08,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:21:08,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781292485] [2019-11-28 00:21:08,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:21:08,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:08,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:21:08,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:21:08,401 INFO L87 Difference]: Start difference. First operand 112 states and 164 transitions. Second operand 5 states. [2019-11-28 00:21:08,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:08,558 INFO L93 Difference]: Finished difference Result 544 states and 809 transitions. [2019-11-28 00:21:08,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 00:21:08,560 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-28 00:21:08,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:08,564 INFO L225 Difference]: With dead ends: 544 [2019-11-28 00:21:08,565 INFO L226 Difference]: Without dead ends: 439 [2019-11-28 00:21:08,568 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:08,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2019-11-28 00:21:08,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 203. [2019-11-28 00:21:08,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-11-28 00:21:08,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 292 transitions. [2019-11-28 00:21:08,617 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 292 transitions. Word has length 27 [2019-11-28 00:21:08,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:08,618 INFO L462 AbstractCegarLoop]: Abstraction has 203 states and 292 transitions. [2019-11-28 00:21:08,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:21:08,618 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 292 transitions. [2019-11-28 00:21:08,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 00:21:08,622 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:08,622 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:08,622 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:08,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:08,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1000759295, now seen corresponding path program 1 times [2019-11-28 00:21:08,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:08,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388681156] [2019-11-28 00:21:08,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:08,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:08,723 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:08,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388681156] [2019-11-28 00:21:08,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:08,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:21:08,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20659884] [2019-11-28 00:21:08,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:21:08,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:08,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:21:08,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:21:08,728 INFO L87 Difference]: Start difference. First operand 203 states and 292 transitions. Second operand 5 states. [2019-11-28 00:21:08,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:08,887 INFO L93 Difference]: Finished difference Result 769 states and 1111 transitions. [2019-11-28 00:21:08,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:21:08,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-11-28 00:21:08,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:08,891 INFO L225 Difference]: With dead ends: 769 [2019-11-28 00:21:08,891 INFO L226 Difference]: Without dead ends: 573 [2019-11-28 00:21:08,892 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:08,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2019-11-28 00:21:08,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 201. [2019-11-28 00:21:08,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-11-28 00:21:08,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 286 transitions. [2019-11-28 00:21:08,918 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 286 transitions. Word has length 28 [2019-11-28 00:21:08,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:08,920 INFO L462 AbstractCegarLoop]: Abstraction has 201 states and 286 transitions. [2019-11-28 00:21:08,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:21:08,920 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 286 transitions. [2019-11-28 00:21:08,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 00:21:08,925 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:08,925 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, 1, 1] [2019-11-28 00:21:08,928 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:08,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:08,929 INFO L82 PathProgramCache]: Analyzing trace with hash 341285158, now seen corresponding path program 1 times [2019-11-28 00:21:08,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:08,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380301363] [2019-11-28 00:21:08,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:08,995 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:08,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380301363] [2019-11-28 00:21:08,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:08,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:21:08,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122737500] [2019-11-28 00:21:08,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:21:08,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:08,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:21:08,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:21:08,998 INFO L87 Difference]: Start difference. First operand 201 states and 286 transitions. Second operand 5 states. [2019-11-28 00:21:09,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:09,068 INFO L93 Difference]: Finished difference Result 555 states and 781 transitions. [2019-11-28 00:21:09,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:21:09,069 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-11-28 00:21:09,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:09,071 INFO L225 Difference]: With dead ends: 555 [2019-11-28 00:21:09,071 INFO L226 Difference]: Without dead ends: 361 [2019-11-28 00:21:09,072 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:09,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-11-28 00:21:09,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 213. [2019-11-28 00:21:09,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-11-28 00:21:09,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 298 transitions. [2019-11-28 00:21:09,093 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 298 transitions. Word has length 35 [2019-11-28 00:21:09,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:09,093 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 298 transitions. [2019-11-28 00:21:09,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:21:09,094 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 298 transitions. [2019-11-28 00:21:09,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 00:21:09,095 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:09,095 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, 1, 1] [2019-11-28 00:21:09,095 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:09,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:09,096 INFO L82 PathProgramCache]: Analyzing trace with hash -669832092, now seen corresponding path program 1 times [2019-11-28 00:21:09,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:09,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496867350] [2019-11-28 00:21:09,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:09,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:09,142 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:09,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496867350] [2019-11-28 00:21:09,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:09,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:21:09,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231182437] [2019-11-28 00:21:09,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:21:09,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:09,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:21:09,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:21:09,145 INFO L87 Difference]: Start difference. First operand 213 states and 298 transitions. Second operand 4 states. [2019-11-28 00:21:09,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:09,187 INFO L93 Difference]: Finished difference Result 515 states and 715 transitions. [2019-11-28 00:21:09,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:21:09,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-28 00:21:09,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:09,190 INFO L225 Difference]: With dead ends: 515 [2019-11-28 00:21:09,190 INFO L226 Difference]: Without dead ends: 309 [2019-11-28 00:21:09,190 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:21:09,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-11-28 00:21:09,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 221. [2019-11-28 00:21:09,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-11-28 00:21:09,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 306 transitions. [2019-11-28 00:21:09,210 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 306 transitions. Word has length 35 [2019-11-28 00:21:09,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:09,210 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 306 transitions. [2019-11-28 00:21:09,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:21:09,210 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 306 transitions. [2019-11-28 00:21:09,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 00:21:09,211 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:09,212 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, 1, 1] [2019-11-28 00:21:09,212 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:09,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:09,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1690900446, now seen corresponding path program 1 times [2019-11-28 00:21:09,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:09,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481985522] [2019-11-28 00:21:09,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:09,253 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:09,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481985522] [2019-11-28 00:21:09,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:09,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:21:09,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082229933] [2019-11-28 00:21:09,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:21:09,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:09,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:21:09,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:21:09,256 INFO L87 Difference]: Start difference. First operand 221 states and 306 transitions. Second operand 3 states. [2019-11-28 00:21:09,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:09,300 INFO L93 Difference]: Finished difference Result 535 states and 735 transitions. [2019-11-28 00:21:09,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:21:09,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-28 00:21:09,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:09,302 INFO L225 Difference]: With dead ends: 535 [2019-11-28 00:21:09,303 INFO L226 Difference]: Without dead ends: 321 [2019-11-28 00:21:09,303 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:09,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-11-28 00:21:09,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2019-11-28 00:21:09,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-11-28 00:21:09,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 428 transitions. [2019-11-28 00:21:09,335 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 428 transitions. Word has length 35 [2019-11-28 00:21:09,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:09,336 INFO L462 AbstractCegarLoop]: Abstraction has 321 states and 428 transitions. [2019-11-28 00:21:09,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:21:09,336 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 428 transitions. [2019-11-28 00:21:09,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 00:21:09,337 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:09,337 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, 1, 1, 1] [2019-11-28 00:21:09,338 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:09,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:09,338 INFO L82 PathProgramCache]: Analyzing trace with hash -2015558942, now seen corresponding path program 1 times [2019-11-28 00:21:09,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:09,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170056311] [2019-11-28 00:21:09,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:09,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:09,415 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:09,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170056311] [2019-11-28 00:21:09,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:09,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 00:21:09,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955422798] [2019-11-28 00:21:09,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 00:21:09,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:09,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 00:21:09,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:21:09,418 INFO L87 Difference]: Start difference. First operand 321 states and 428 transitions. Second operand 8 states. [2019-11-28 00:21:10,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:10,130 INFO L93 Difference]: Finished difference Result 1403 states and 1854 transitions. [2019-11-28 00:21:10,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-28 00:21:10,131 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2019-11-28 00:21:10,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:10,138 INFO L225 Difference]: With dead ends: 1403 [2019-11-28 00:21:10,139 INFO L226 Difference]: Without dead ends: 1089 [2019-11-28 00:21:10,140 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2019-11-28 00:21:10,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2019-11-28 00:21:10,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 321. [2019-11-28 00:21:10,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-11-28 00:21:10,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 420 transitions. [2019-11-28 00:21:10,178 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 420 transitions. Word has length 36 [2019-11-28 00:21:10,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:10,178 INFO L462 AbstractCegarLoop]: Abstraction has 321 states and 420 transitions. [2019-11-28 00:21:10,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 00:21:10,179 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 420 transitions. [2019-11-28 00:21:10,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 00:21:10,180 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:10,181 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:21:10,181 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:10,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:10,182 INFO L82 PathProgramCache]: Analyzing trace with hash -59965040, now seen corresponding path program 1 times [2019-11-28 00:21:10,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:10,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282360769] [2019-11-28 00:21:10,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:10,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:10,237 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:21:10,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282360769] [2019-11-28 00:21:10,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:10,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:21:10,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079712607] [2019-11-28 00:21:10,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:21:10,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:10,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:21:10,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:21:10,241 INFO L87 Difference]: Start difference. First operand 321 states and 420 transitions. Second operand 3 states. [2019-11-28 00:21:10,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:10,302 INFO L93 Difference]: Finished difference Result 471 states and 623 transitions. [2019-11-28 00:21:10,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:21:10,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-28 00:21:10,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:10,306 INFO L225 Difference]: With dead ends: 471 [2019-11-28 00:21:10,306 INFO L226 Difference]: Without dead ends: 469 [2019-11-28 00:21:10,307 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:10,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2019-11-28 00:21:10,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 361. [2019-11-28 00:21:10,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-11-28 00:21:10,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 481 transitions. [2019-11-28 00:21:10,344 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 481 transitions. Word has length 51 [2019-11-28 00:21:10,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:10,345 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 481 transitions. [2019-11-28 00:21:10,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:21:10,345 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 481 transitions. [2019-11-28 00:21:10,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-28 00:21:10,347 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:10,347 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-28 00:21:10,348 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:10,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:10,348 INFO L82 PathProgramCache]: Analyzing trace with hash -376855367, now seen corresponding path program 1 times [2019-11-28 00:21:10,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:10,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218206209] [2019-11-28 00:21:10,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:10,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:21:10,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:21:10,591 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 00:21:10,591 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 00:21:10,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:21:10 BoogieIcfgContainer [2019-11-28 00:21:10,777 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:21:10,779 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:21:10,779 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:21:10,779 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:21:10,779 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:07" (3/4) ... [2019-11-28 00:21:10,782 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 00:21:10,922 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:21:10,922 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:21:10,924 INFO L168 Benchmark]: Toolchain (without parser) took 5464.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 201.3 MB). Free memory was 953.7 MB in the beginning and 978.3 MB in the end (delta: -24.7 MB). Peak memory consumption was 176.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:21:10,925 INFO L168 Benchmark]: CDTParser took 0.20 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-28 00:21:10,925 INFO L168 Benchmark]: CACSL2BoogieTranslator took 663.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -151.1 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-28 00:21:10,925 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.84 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:21:10,926 INFO L168 Benchmark]: Boogie Preprocessor took 47.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:21:10,926 INFO L168 Benchmark]: RCFGBuilder took 924.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.8 MB). Peak memory consumption was 57.8 MB. Max. memory is 11.5 GB. [2019-11-28 00:21:10,927 INFO L168 Benchmark]: TraceAbstraction took 3597.11 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 78.1 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 38.2 MB). Peak memory consumption was 116.3 MB. Max. memory is 11.5 GB. [2019-11-28 00:21:10,927 INFO L168 Benchmark]: Witness Printer took 143.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 978.3 MB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:21:10,929 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.20 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 663.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -151.1 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 80.84 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.35 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 924.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 57.8 MB). Peak memory consumption was 57.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3597.11 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 78.1 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 38.2 MB). Peak memory consumption was 116.3 MB. Max. memory is 11.5 GB. * Witness Printer took 143.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 978.3 MB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 44]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L132] int pumpRunning = 0; [L133] int systemActive = 1; [L364] int cleanupTimeShifts = 4; [L462] int methAndRunningLastTime ; [L502] int waterLevel = 1; [L503] int methaneLevelCritical = 0; [L765] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L439] int retValue_acc ; [L440] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L355] int retValue_acc ; [L358] retValue_acc = 1 [L359] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L446] tmp = valid_product() [L448] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L467] methAndRunningLastTime = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L56] int splverifierCounter ; [L57] int tmp ; [L58] int tmp___0 ; [L59] int tmp___1 ; [L60] int tmp___2 ; [L63] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L65] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L67] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L73] tmp = __VERIFIER_nondet_int() [L75] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L520] COND TRUE waterLevel < 2 [L521] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L83] tmp___0 = __VERIFIER_nondet_int() [L85] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L93] tmp___2 = __VERIFIER_nondet_int() [L95] COND TRUE \read(tmp___2) [L321] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L140] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L147] COND TRUE \read(systemActive) [L169] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L172] COND TRUE ! pumpRunning [L284] int retValue_acc ; [L285] int tmp ; [L286] int tmp___0 ; [L582] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L585] COND FALSE !(waterLevel < 2) [L589] retValue_acc = 0 [L590] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L290] tmp = isHighWaterSensorDry() [L292] COND FALSE !(\read(tmp)) [L295] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L297] retValue_acc = tmp___0 [L298] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L174] tmp = isHighWaterLevel() [L176] COND TRUE \read(tmp) [L203] int tmp ; [L228] int retValue_acc ; [L541] int retValue_acc ; [L544] retValue_acc = methaneLevelCritical [L545] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L232] retValue_acc = isMethaneLevelCritical() [L234] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L207] tmp = isMethaneAlarm() [L209] COND FALSE !(\read(tmp)) [L197] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L472] int tmp ; [L473] int tmp___0 ; [L541] int retValue_acc ; [L544] retValue_acc = methaneLevelCritical [L545] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L477] tmp = isMethaneLevelCritical() [L479] COND FALSE !(\read(tmp)) [L495] methAndRunningLastTime = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L65] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L67] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L73] tmp = __VERIFIER_nondet_int() [L75] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L83] tmp___0 = __VERIFIER_nondet_int() [L85] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L532] COND FALSE !(\read(methaneLevelCritical)) [L535] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L93] tmp___2 = __VERIFIER_nondet_int() [L95] COND TRUE \read(tmp___2) [L321] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L140] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L508] COND TRUE waterLevel > 0 [L509] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L147] COND TRUE \read(systemActive) [L169] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L172] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L472] int tmp ; [L473] int tmp___0 ; [L541] int retValue_acc ; [L544] retValue_acc = methaneLevelCritical [L545] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L477] tmp = isMethaneLevelCritical() [L479] COND TRUE \read(tmp) [L239] int retValue_acc ; [L242] retValue_acc = pumpRunning [L243] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L481] tmp___0 = isPumpRunning() [L483] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L484] COND FALSE !(\read(methAndRunningLastTime)) [L489] methAndRunningLastTime = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L65] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L67] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L73] tmp = __VERIFIER_nondet_int() [L75] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L83] tmp___0 = __VERIFIER_nondet_int() [L85] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L93] tmp___2 = __VERIFIER_nondet_int() [L95] COND TRUE \read(tmp___2) [L321] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L140] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L508] COND TRUE waterLevel > 0 [L509] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L147] COND TRUE \read(systemActive) [L169] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L172] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L472] int tmp ; [L473] int tmp___0 ; [L541] int retValue_acc ; [L544] retValue_acc = methaneLevelCritical [L545] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L477] tmp = isMethaneLevelCritical() [L479] COND TRUE \read(tmp) [L239] int retValue_acc ; [L242] retValue_acc = pumpRunning [L243] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L481] tmp___0 = isPumpRunning() [L483] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L484] COND TRUE \read(methAndRunningLastTime) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L44] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 93 locations, 3 error locations. Result: UNSAFE, OverallTime: 3.3s, OverallIterations: 12, TraceHistogramMax: 3, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 966 SDtfs, 1119 SDslu, 2015 SDs, 0 SdLazy, 277 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=361occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 1726 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 402 NumberOfCodeBlocks, 402 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 322 ConstructedInterpolants, 0 QuantifiedInterpolants, 18652 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 14/14 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...