./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product52.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec1_product52.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 eb59a6e6bbeea05d6faf844d6f750609a5360ad9 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 17:24:31,202 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:24:31,205 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:24:31,217 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:24:31,218 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:24:31,219 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:24:31,220 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:24:31,222 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:24:31,224 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:24:31,225 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:24:31,226 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:24:31,227 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:24:31,228 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:24:31,229 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:24:31,230 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:24:31,231 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:24:31,232 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:24:31,233 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:24:31,235 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:24:31,237 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:24:31,239 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:24:31,240 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:24:31,241 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:24:31,242 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:24:31,244 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:24:31,245 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:24:31,245 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:24:31,246 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:24:31,246 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:24:31,247 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:24:31,247 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:24:31,248 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:24:31,249 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:24:31,250 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:24:31,251 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:24:31,251 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:24:31,252 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:24:31,252 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:24:31,252 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:24:31,253 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:24:31,254 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:24:31,255 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 17:24:31,270 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:24:31,270 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:24:31,271 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:24:31,272 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:24:31,272 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:24:31,272 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:24:31,272 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:24:31,273 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:24:31,273 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:24:31,273 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:24:31,273 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:24:31,273 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:24:31,274 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:24:31,274 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:24:31,274 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:24:31,274 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:24:31,274 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:24:31,275 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:24:31,275 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:24:31,275 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:24:31,275 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:24:31,276 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:24:31,276 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:24:31,276 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:24:31,276 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:24:31,276 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:24:31,277 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:24:31,277 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:24:31,277 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:24:31,277 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 -> eb59a6e6bbeea05d6faf844d6f750609a5360ad9 [2019-11-28 17:24:31,627 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:24:31,642 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:24:31,646 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:24:31,650 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:24:31,651 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:24:31,652 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product52.cil.c [2019-11-28 17:24:31,730 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/639e31d41/2530f5c64a3e4308be0dcf1413b2ec91/FLAG897a148fd [2019-11-28 17:24:32,299 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:24:32,300 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product52.cil.c [2019-11-28 17:24:32,322 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/639e31d41/2530f5c64a3e4308be0dcf1413b2ec91/FLAG897a148fd [2019-11-28 17:24:32,593 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/639e31d41/2530f5c64a3e4308be0dcf1413b2ec91 [2019-11-28 17:24:32,597 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:24:32,598 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:24:32,600 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:24:32,600 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:24:32,603 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:24:32,604 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:24:32" (1/1) ... [2019-11-28 17:24:32,607 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e93ac70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:32, skipping insertion in model container [2019-11-28 17:24:32,608 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:24:32" (1/1) ... [2019-11-28 17:24:32,615 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:24:32,677 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:24:33,072 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:24:33,084 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:24:33,195 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:24:33,235 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:24:33,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:33 WrapperNode [2019-11-28 17:24:33,236 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:24:33,236 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:24:33,237 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:24:33,237 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:24:33,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:33" (1/1) ... [2019-11-28 17:24:33,264 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:33" (1/1) ... [2019-11-28 17:24:33,322 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:24:33,327 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:24:33,327 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:24:33,327 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:24:33,339 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:33" (1/1) ... [2019-11-28 17:24:33,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:33" (1/1) ... [2019-11-28 17:24:33,345 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:33" (1/1) ... [2019-11-28 17:24:33,345 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:33" (1/1) ... [2019-11-28 17:24:33,358 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:33" (1/1) ... [2019-11-28 17:24:33,368 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:33" (1/1) ... [2019-11-28 17:24:33,371 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:33" (1/1) ... [2019-11-28 17:24:33,376 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:24:33,377 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:24:33,377 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:24:33,377 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:24:33,378 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:24:33,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 17:24:33,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 17:24:33,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:24:33,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:24:34,504 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:24:34,504 INFO L287 CfgBuilder]: Removed 162 assume(true) statements. [2019-11-28 17:24:34,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:24:34 BoogieIcfgContainer [2019-11-28 17:24:34,507 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:24:34,510 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:24:34,511 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:24:34,514 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:24:34,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:24:32" (1/3) ... [2019-11-28 17:24:34,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e6cb8d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:24:34, skipping insertion in model container [2019-11-28 17:24:34,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:33" (2/3) ... [2019-11-28 17:24:34,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e6cb8d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:24:34, skipping insertion in model container [2019-11-28 17:24:34,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:24:34" (3/3) ... [2019-11-28 17:24:34,522 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product52.cil.c [2019-11-28 17:24:34,531 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:24:34,540 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 17:24:34,551 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 17:24:34,575 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:24:34,575 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:24:34,575 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:24:34,576 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:24:34,576 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:24:34,576 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:24:34,576 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:24:34,577 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:24:34,596 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states. [2019-11-28 17:24:34,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 17:24:34,604 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:34,605 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:24:34,606 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:34,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:34,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1794729554, now seen corresponding path program 1 times [2019-11-28 17:24:34,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:34,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235221446] [2019-11-28 17:24:34,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:34,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:34,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:24:34,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235221446] [2019-11-28 17:24:34,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:34,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:24:34,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117640860] [2019-11-28 17:24:34,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 17:24:34,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:34,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 17:24:34,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 17:24:34,971 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 2 states. [2019-11-28 17:24:35,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:35,019 INFO L93 Difference]: Finished difference Result 232 states and 353 transitions. [2019-11-28 17:24:35,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 17:24:35,020 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-28 17:24:35,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:35,032 INFO L225 Difference]: With dead ends: 232 [2019-11-28 17:24:35,033 INFO L226 Difference]: Without dead ends: 115 [2019-11-28 17:24:35,037 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 17:24:35,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-28 17:24:35,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-11-28 17:24:35,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-28 17:24:35,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 168 transitions. [2019-11-28 17:24:35,088 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 168 transitions. Word has length 16 [2019-11-28 17:24:35,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:35,088 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 168 transitions. [2019-11-28 17:24:35,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 17:24:35,089 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 168 transitions. [2019-11-28 17:24:35,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 17:24:35,090 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:35,090 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:24:35,091 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:35,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:35,092 INFO L82 PathProgramCache]: Analyzing trace with hash 529368141, now seen corresponding path program 1 times [2019-11-28 17:24:35,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:35,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210682791] [2019-11-28 17:24:35,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:35,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:35,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:24:35,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210682791] [2019-11-28 17:24:35,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:35,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:24:35,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544193051] [2019-11-28 17:24:35,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:24:35,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:35,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:24:35,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:35,187 INFO L87 Difference]: Start difference. First operand 115 states and 168 transitions. Second operand 3 states. [2019-11-28 17:24:35,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:35,204 INFO L93 Difference]: Finished difference Result 115 states and 168 transitions. [2019-11-28 17:24:35,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:24:35,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 17:24:35,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:35,207 INFO L225 Difference]: With dead ends: 115 [2019-11-28 17:24:35,207 INFO L226 Difference]: Without dead ends: 49 [2019-11-28 17:24:35,210 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:35,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-28 17:24:35,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-11-28 17:24:35,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-28 17:24:35,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2019-11-28 17:24:35,220 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 17 [2019-11-28 17:24:35,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:35,221 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 71 transitions. [2019-11-28 17:24:35,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:24:35,221 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 71 transitions. [2019-11-28 17:24:35,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 17:24:35,224 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:35,224 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:24:35,225 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:35,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:35,226 INFO L82 PathProgramCache]: Analyzing trace with hash -2061312917, now seen corresponding path program 1 times [2019-11-28 17:24:35,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:35,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544823741] [2019-11-28 17:24:35,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:35,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:35,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:24:35,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544823741] [2019-11-28 17:24:35,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:35,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:24:35,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555472297] [2019-11-28 17:24:35,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:24:35,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:35,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:24:35,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:24:35,411 INFO L87 Difference]: Start difference. First operand 49 states and 71 transitions. Second operand 5 states. [2019-11-28 17:24:35,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:35,524 INFO L93 Difference]: Finished difference Result 115 states and 170 transitions. [2019-11-28 17:24:35,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:24:35,527 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-28 17:24:35,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:35,528 INFO L225 Difference]: With dead ends: 115 [2019-11-28 17:24:35,528 INFO L226 Difference]: Without dead ends: 72 [2019-11-28 17:24:35,529 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:24:35,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-28 17:24:35,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2019-11-28 17:24:35,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-28 17:24:35,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 100 transitions. [2019-11-28 17:24:35,547 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 100 transitions. Word has length 22 [2019-11-28 17:24:35,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:35,553 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 100 transitions. [2019-11-28 17:24:35,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:24:35,553 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 100 transitions. [2019-11-28 17:24:35,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 17:24:35,554 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:35,555 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:24:35,555 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:35,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:35,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1499976397, now seen corresponding path program 1 times [2019-11-28 17:24:35,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:35,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698128649] [2019-11-28 17:24:35,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:35,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:35,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:24:35,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698128649] [2019-11-28 17:24:35,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:35,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:24:35,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303488449] [2019-11-28 17:24:35,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:24:35,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:35,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:24:35,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:35,648 INFO L87 Difference]: Start difference. First operand 68 states and 100 transitions. Second operand 3 states. [2019-11-28 17:24:35,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:35,709 INFO L93 Difference]: Finished difference Result 151 states and 224 transitions. [2019-11-28 17:24:35,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:24:35,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 17:24:35,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:35,713 INFO L225 Difference]: With dead ends: 151 [2019-11-28 17:24:35,714 INFO L226 Difference]: Without dead ends: 89 [2019-11-28 17:24:35,715 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:35,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-28 17:24:35,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2019-11-28 17:24:35,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-28 17:24:35,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 124 transitions. [2019-11-28 17:24:35,735 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 124 transitions. Word has length 24 [2019-11-28 17:24:35,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:35,738 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 124 transitions. [2019-11-28 17:24:35,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:24:35,738 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 124 transitions. [2019-11-28 17:24:35,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 17:24:35,739 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:35,740 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:24:35,740 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:35,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:35,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1678878848, now seen corresponding path program 1 times [2019-11-28 17:24:35,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:35,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159905864] [2019-11-28 17:24:35,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:35,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:35,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:24:35,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159905864] [2019-11-28 17:24:35,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:35,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:24:35,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616868182] [2019-11-28 17:24:35,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:24:35,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:35,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:24:35,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:24:35,868 INFO L87 Difference]: Start difference. First operand 87 states and 124 transitions. Second operand 5 states. [2019-11-28 17:24:36,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:36,091 INFO L93 Difference]: Finished difference Result 445 states and 650 transitions. [2019-11-28 17:24:36,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 17:24:36,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-28 17:24:36,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:36,095 INFO L225 Difference]: With dead ends: 445 [2019-11-28 17:24:36,096 INFO L226 Difference]: Without dead ends: 364 [2019-11-28 17:24:36,097 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 17:24:36,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-11-28 17:24:36,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 160. [2019-11-28 17:24:36,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-11-28 17:24:36,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 226 transitions. [2019-11-28 17:24:36,122 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 226 transitions. Word has length 25 [2019-11-28 17:24:36,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:36,122 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 226 transitions. [2019-11-28 17:24:36,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:24:36,123 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 226 transitions. [2019-11-28 17:24:36,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 17:24:36,124 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:36,125 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:24:36,125 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:36,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:36,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1475071754, now seen corresponding path program 1 times [2019-11-28 17:24:36,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:36,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171343716] [2019-11-28 17:24:36,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:36,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:24:36,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171343716] [2019-11-28 17:24:36,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:36,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:24:36,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668469902] [2019-11-28 17:24:36,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:24:36,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:36,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:24:36,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:24:36,196 INFO L87 Difference]: Start difference. First operand 160 states and 226 transitions. Second operand 5 states. [2019-11-28 17:24:36,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:36,362 INFO L93 Difference]: Finished difference Result 448 states and 637 transitions. [2019-11-28 17:24:36,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 17:24:36,363 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 17:24:36,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:36,366 INFO L225 Difference]: With dead ends: 448 [2019-11-28 17:24:36,366 INFO L226 Difference]: Without dead ends: 446 [2019-11-28 17:24:36,367 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 17:24:36,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-11-28 17:24:36,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 160. [2019-11-28 17:24:36,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-11-28 17:24:36,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 224 transitions. [2019-11-28 17:24:36,392 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 224 transitions. Word has length 26 [2019-11-28 17:24:36,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:36,393 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 224 transitions. [2019-11-28 17:24:36,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:24:36,393 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 224 transitions. [2019-11-28 17:24:36,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 17:24:36,395 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:36,395 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:24:36,396 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:36,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:36,396 INFO L82 PathProgramCache]: Analyzing trace with hash 317568404, now seen corresponding path program 1 times [2019-11-28 17:24:36,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:36,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784348737] [2019-11-28 17:24:36,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:36,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:36,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:24:36,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784348737] [2019-11-28 17:24:36,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:36,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:24:36,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077380963] [2019-11-28 17:24:36,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:24:36,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:36,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:24:36,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:24:36,467 INFO L87 Difference]: Start difference. First operand 160 states and 224 transitions. Second operand 5 states. [2019-11-28 17:24:36,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:36,564 INFO L93 Difference]: Finished difference Result 476 states and 660 transitions. [2019-11-28 17:24:36,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:24:36,565 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-28 17:24:36,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:36,567 INFO L225 Difference]: With dead ends: 476 [2019-11-28 17:24:36,568 INFO L226 Difference]: Without dead ends: 322 [2019-11-28 17:24:36,569 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:24:36,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-11-28 17:24:36,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 172. [2019-11-28 17:24:36,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-11-28 17:24:36,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 236 transitions. [2019-11-28 17:24:36,588 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 236 transitions. Word has length 31 [2019-11-28 17:24:36,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:36,588 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 236 transitions. [2019-11-28 17:24:36,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:24:36,589 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 236 transitions. [2019-11-28 17:24:36,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 17:24:36,593 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:36,593 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:24:36,593 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:36,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:36,596 INFO L82 PathProgramCache]: Analyzing trace with hash -75458606, now seen corresponding path program 1 times [2019-11-28 17:24:36,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:36,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717021288] [2019-11-28 17:24:36,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:36,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:24:36,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717021288] [2019-11-28 17:24:36,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:36,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:24:36,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929397825] [2019-11-28 17:24:36,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:24:36,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:36,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:24:36,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:24:36,658 INFO L87 Difference]: Start difference. First operand 172 states and 236 transitions. Second operand 4 states. [2019-11-28 17:24:36,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:36,720 INFO L93 Difference]: Finished difference Result 434 states and 592 transitions. [2019-11-28 17:24:36,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 17:24:36,721 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-28 17:24:36,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:36,723 INFO L225 Difference]: With dead ends: 434 [2019-11-28 17:24:36,723 INFO L226 Difference]: Without dead ends: 268 [2019-11-28 17:24:36,724 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 17:24:36,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-11-28 17:24:36,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 180. [2019-11-28 17:24:36,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-28 17:24:36,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 244 transitions. [2019-11-28 17:24:36,744 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 244 transitions. Word has length 31 [2019-11-28 17:24:36,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:36,744 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 244 transitions. [2019-11-28 17:24:36,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:24:36,744 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 244 transitions. [2019-11-28 17:24:36,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 17:24:36,746 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:36,746 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:24:36,746 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:36,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:36,746 INFO L82 PathProgramCache]: Analyzing trace with hash 182706832, now seen corresponding path program 1 times [2019-11-28 17:24:36,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:36,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042638969] [2019-11-28 17:24:36,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:36,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:24:36,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042638969] [2019-11-28 17:24:36,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:36,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:24:36,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543152909] [2019-11-28 17:24:36,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:24:36,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:36,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:24:36,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:36,789 INFO L87 Difference]: Start difference. First operand 180 states and 244 transitions. Second operand 3 states. [2019-11-28 17:24:36,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:36,838 INFO L93 Difference]: Finished difference Result 442 states and 598 transitions. [2019-11-28 17:24:36,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:24:36,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-28 17:24:36,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:36,841 INFO L225 Difference]: With dead ends: 442 [2019-11-28 17:24:36,841 INFO L226 Difference]: Without dead ends: 268 [2019-11-28 17:24:36,842 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:36,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-11-28 17:24:36,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2019-11-28 17:24:36,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-11-28 17:24:36,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 354 transitions. [2019-11-28 17:24:36,894 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 354 transitions. Word has length 31 [2019-11-28 17:24:36,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:36,894 INFO L462 AbstractCegarLoop]: Abstraction has 268 states and 354 transitions. [2019-11-28 17:24:36,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:24:36,895 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 354 transitions. [2019-11-28 17:24:36,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 17:24:36,896 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:36,896 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 17:24:36,896 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:36,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:36,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1930053038, now seen corresponding path program 1 times [2019-11-28 17:24:36,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:36,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306785147] [2019-11-28 17:24:36,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:24:37,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:24:37,044 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 17:24:37,044 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 17:24:37,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:24:37 BoogieIcfgContainer [2019-11-28 17:24:37,166 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:24:37,167 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:24:37,167 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:24:37,167 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:24:37,168 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:24:34" (3/4) ... [2019-11-28 17:24:37,175 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 17:24:37,307 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:24:37,311 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:24:37,317 INFO L168 Benchmark]: Toolchain (without parser) took 4716.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 212.9 MB). Free memory was 960.4 MB in the beginning and 1.2 GB in the end (delta: -197.5 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:37,317 INFO L168 Benchmark]: CDTParser took 0.91 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:24:37,321 INFO L168 Benchmark]: CACSL2BoogieTranslator took 636.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -162.2 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:37,323 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:37,323 INFO L168 Benchmark]: Boogie Preprocessor took 49.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:24:37,327 INFO L168 Benchmark]: RCFGBuilder took 1129.89 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: 70.1 MB). Peak memory consumption was 70.1 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:37,327 INFO L168 Benchmark]: TraceAbstraction took 2657.02 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.9 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -121.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:24:37,328 INFO L168 Benchmark]: Witness Printer took 145.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:37,332 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.91 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 636.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -162.2 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 86.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.73 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 1129.89 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: 70.1 MB). Peak memory consumption was 70.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2657.02 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.9 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -121.3 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 145.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 383]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L48] int waterLevel = 1; [L49] int methaneLevelCritical = 0; [L158] int pumpRunning = 0; [L159] int systemActive = 1; [L458] int cleanupTimeShifts = 4; [L752] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L534] int retValue_acc ; [L535] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L975] int retValue_acc ; [L978] retValue_acc = 1 [L979] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L541] tmp = valid_product() [L543] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L390] int splverifierCounter ; [L391] int tmp ; [L392] int tmp___0 ; [L393] int tmp___1 ; [L394] int tmp___2 ; [L397] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L399] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L401] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L407] tmp = __VERIFIER_nondet_int() [L409] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L66] COND TRUE waterLevel < 2 [L67] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L417] tmp___0 = __VERIFIER_nondet_int() [L419] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L78] COND FALSE !(\read(methaneLevelCritical)) [L81] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L427] tmp___2 = __VERIFIER_nondet_int() [L429] COND TRUE \read(tmp___2) [L374] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L166] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L173] COND TRUE \read(systemActive) [L221] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L224] COND FALSE !(\read(pumpRunning)) [L195] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L198] COND TRUE ! pumpRunning [L318] int retValue_acc ; [L319] int tmp ; [L320] int tmp___0 ; [L128] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L131] COND FALSE !(waterLevel < 2) [L135] retValue_acc = 0 [L136] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L324] tmp = isHighWaterSensorDry() [L326] COND FALSE !(\read(tmp)) [L329] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L331] retValue_acc = tmp___0 [L332] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L200] tmp = isHighWaterLevel() [L202] COND TRUE \read(tmp) [L249] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L558] int tmp ; [L559] int tmp___0 ; [L87] int retValue_acc ; [L90] retValue_acc = methaneLevelCritical [L91] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L563] tmp = isMethaneLevelCritical() [L565] COND TRUE \read(tmp) [L273] int retValue_acc ; [L276] retValue_acc = pumpRunning [L277] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L567] tmp___0 = isPumpRunning() [L569] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L383] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 119 locations, 3 error locations. Result: UNSAFE, OverallTime: 2.4s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 875 SDtfs, 1177 SDslu, 1132 SDs, 0 SdLazy, 149 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=268occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 734 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 255 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 214 ConstructedInterpolants, 0 QuantifiedInterpolants, 10056 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...