./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product39.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_product39.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 f2f38c4f83f0a2ec969b4b77f5129e3dfefde6fe ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:23,216 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:24:23,218 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:24:23,238 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:24:23,238 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:24:23,241 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:24:23,243 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:24:23,254 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:24:23,259 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:24:23,263 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:24:23,265 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:24:23,267 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:24:23,268 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:24:23,270 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:24:23,272 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:24:23,274 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:24:23,275 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:24:23,277 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:24:23,279 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:24:23,284 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:24:23,288 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:24:23,293 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:24:23,295 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:24:23,296 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:24:23,299 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:24:23,300 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:24:23,300 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:24:23,302 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:24:23,302 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:24:23,303 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:24:23,304 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:24:23,305 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:24:23,305 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:24:23,307 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:24:23,308 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:24:23,308 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:24:23,310 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:24:23,310 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:24:23,310 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:24:23,311 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:24:23,313 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:24:23,314 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:23,343 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:24:23,344 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:24:23,348 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:24:23,348 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:24:23,349 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:24:23,349 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:24:23,349 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:24:23,350 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:24:23,350 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:24:23,350 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:24:23,351 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:24:23,352 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:24:23,352 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:24:23,352 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:24:23,353 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:24:23,353 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:24:23,353 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:24:23,354 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:24:23,354 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:24:23,354 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:24:23,354 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:24:23,355 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:24:23,355 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:24:23,355 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:24:23,355 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:24:23,356 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:24:23,356 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:24:23,356 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:24:23,356 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:24:23,357 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 -> f2f38c4f83f0a2ec969b4b77f5129e3dfefde6fe [2019-11-28 17:24:23,659 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:24:23,672 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:24:23,676 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:24:23,678 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:24:23,678 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:24:23,679 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product39.cil.c [2019-11-28 17:24:23,742 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/660cb75a6/bf9f823963634d6384da2eabeb4e00e0/FLAGaf2a624b8 [2019-11-28 17:24:24,273 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:24:24,274 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product39.cil.c [2019-11-28 17:24:24,297 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/660cb75a6/bf9f823963634d6384da2eabeb4e00e0/FLAGaf2a624b8 [2019-11-28 17:24:24,604 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/660cb75a6/bf9f823963634d6384da2eabeb4e00e0 [2019-11-28 17:24:24,607 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:24:24,609 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:24:24,610 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:24:24,610 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:24:24,615 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:24:24,616 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:24:24" (1/1) ... [2019-11-28 17:24:24,619 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@564c4a0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:24, skipping insertion in model container [2019-11-28 17:24:24,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:24:24" (1/1) ... [2019-11-28 17:24:24,629 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:24:24,689 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:24:25,077 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:24:25,102 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:24:25,227 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:24:25,271 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:24:25,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:25 WrapperNode [2019-11-28 17:24:25,271 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:24:25,272 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:24:25,272 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:24:25,273 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:24:25,283 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:25" (1/1) ... [2019-11-28 17:24:25,304 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:25" (1/1) ... [2019-11-28 17:24:25,363 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:24:25,364 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:24:25,365 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:24:25,365 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:24:25,379 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:25" (1/1) ... [2019-11-28 17:24:25,379 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:25" (1/1) ... [2019-11-28 17:24:25,384 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:25" (1/1) ... [2019-11-28 17:24:25,385 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:25" (1/1) ... [2019-11-28 17:24:25,397 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:25" (1/1) ... [2019-11-28 17:24:25,407 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:25" (1/1) ... [2019-11-28 17:24:25,410 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:25" (1/1) ... [2019-11-28 17:24:25,416 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:24:25,417 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:24:25,417 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:24:25,417 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:24:25,418 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:25" (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:25,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 17:24:25,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 17:24:25,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:24:25,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:24:26,441 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:24:26,441 INFO L287 CfgBuilder]: Removed 160 assume(true) statements. [2019-11-28 17:24:26,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:24:26 BoogieIcfgContainer [2019-11-28 17:24:26,444 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:24:26,445 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:24:26,445 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:24:26,449 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:24:26,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:24:24" (1/3) ... [2019-11-28 17:24:26,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60be3f68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:24:26, skipping insertion in model container [2019-11-28 17:24:26,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:24:25" (2/3) ... [2019-11-28 17:24:26,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60be3f68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:24:26, skipping insertion in model container [2019-11-28 17:24:26,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:24:26" (3/3) ... [2019-11-28 17:24:26,453 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product39.cil.c [2019-11-28 17:24:26,469 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:24:26,477 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 17:24:26,490 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 17:24:26,518 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:24:26,518 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:24:26,518 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:24:26,518 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:24:26,519 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:24:26,519 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:24:26,519 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:24:26,520 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:24:26,539 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2019-11-28 17:24:26,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 17:24:26,547 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:26,548 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:26,549 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:26,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:26,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1221872895, now seen corresponding path program 1 times [2019-11-28 17:24:26,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:26,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728256950] [2019-11-28 17:24:26,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:26,793 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:26,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728256950] [2019-11-28 17:24:26,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:26,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:24:26,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158244606] [2019-11-28 17:24:26,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 17:24:26,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:26,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 17:24:26,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 17:24:26,821 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 2 states. [2019-11-28 17:24:26,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:26,858 INFO L93 Difference]: Finished difference Result 220 states and 335 transitions. [2019-11-28 17:24:26,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 17:24:26,860 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-28 17:24:26,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:26,874 INFO L225 Difference]: With dead ends: 220 [2019-11-28 17:24:26,874 INFO L226 Difference]: Without dead ends: 109 [2019-11-28 17:24:26,879 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:26,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-28 17:24:26,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-11-28 17:24:26,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-28 17:24:26,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 159 transitions. [2019-11-28 17:24:26,931 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 159 transitions. Word has length 16 [2019-11-28 17:24:26,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:26,932 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 159 transitions. [2019-11-28 17:24:26,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 17:24:26,932 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 159 transitions. [2019-11-28 17:24:26,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 17:24:26,934 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:26,934 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:26,934 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:26,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:26,935 INFO L82 PathProgramCache]: Analyzing trace with hash 175115998, now seen corresponding path program 1 times [2019-11-28 17:24:26,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:26,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592193839] [2019-11-28 17:24:26,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:26,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:27,053 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:27,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592193839] [2019-11-28 17:24:27,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:27,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:24:27,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437647657] [2019-11-28 17:24:27,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:24:27,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:27,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:24:27,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:27,060 INFO L87 Difference]: Start difference. First operand 109 states and 159 transitions. Second operand 3 states. [2019-11-28 17:24:27,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:27,090 INFO L93 Difference]: Finished difference Result 109 states and 159 transitions. [2019-11-28 17:24:27,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:24:27,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 17:24:27,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:27,095 INFO L225 Difference]: With dead ends: 109 [2019-11-28 17:24:27,095 INFO L226 Difference]: Without dead ends: 47 [2019-11-28 17:24:27,097 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:27,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-28 17:24:27,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-28 17:24:27,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-28 17:24:27,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2019-11-28 17:24:27,112 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 17 [2019-11-28 17:24:27,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:27,113 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2019-11-28 17:24:27,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:24:27,114 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2019-11-28 17:24:27,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 17:24:27,115 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:27,116 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:27,116 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:27,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:27,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1744081540, now seen corresponding path program 1 times [2019-11-28 17:24:27,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:27,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691852826] [2019-11-28 17:24:27,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:27,250 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:27,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691852826] [2019-11-28 17:24:27,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:27,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:24:27,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708957803] [2019-11-28 17:24:27,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 17:24:27,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:27,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 17:24:27,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 17:24:27,253 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand 6 states. [2019-11-28 17:24:27,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:27,412 INFO L93 Difference]: Finished difference Result 152 states and 226 transitions. [2019-11-28 17:24:27,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:24:27,415 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-11-28 17:24:27,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:27,416 INFO L225 Difference]: With dead ends: 152 [2019-11-28 17:24:27,416 INFO L226 Difference]: Without dead ends: 111 [2019-11-28 17:24:27,419 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:24:27,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-28 17:24:27,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 66. [2019-11-28 17:24:27,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-28 17:24:27,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 97 transitions. [2019-11-28 17:24:27,438 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 97 transitions. Word has length 22 [2019-11-28 17:24:27,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:27,444 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 97 transitions. [2019-11-28 17:24:27,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 17:24:27,445 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 97 transitions. [2019-11-28 17:24:27,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 17:24:27,447 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:27,447 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:27,448 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:27,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:27,449 INFO L82 PathProgramCache]: Analyzing trace with hash -595366227, now seen corresponding path program 1 times [2019-11-28 17:24:27,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:27,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526892397] [2019-11-28 17:24:27,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:27,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:27,559 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:27,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526892397] [2019-11-28 17:24:27,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:27,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:24:27,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877372443] [2019-11-28 17:24:27,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:24:27,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:27,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:24:27,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:27,562 INFO L87 Difference]: Start difference. First operand 66 states and 97 transitions. Second operand 3 states. [2019-11-28 17:24:27,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:27,616 INFO L93 Difference]: Finished difference Result 147 states and 218 transitions. [2019-11-28 17:24:27,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:24:27,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 17:24:27,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:27,618 INFO L225 Difference]: With dead ends: 147 [2019-11-28 17:24:27,618 INFO L226 Difference]: Without dead ends: 87 [2019-11-28 17:24:27,620 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:27,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-28 17:24:27,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2019-11-28 17:24:27,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-28 17:24:27,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 121 transitions. [2019-11-28 17:24:27,632 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 121 transitions. Word has length 24 [2019-11-28 17:24:27,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:27,632 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 121 transitions. [2019-11-28 17:24:27,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:24:27,633 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 121 transitions. [2019-11-28 17:24:27,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 17:24:27,634 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:27,634 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:27,634 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:27,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:27,635 INFO L82 PathProgramCache]: Analyzing trace with hash 566175321, now seen corresponding path program 1 times [2019-11-28 17:24:27,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:27,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423163879] [2019-11-28 17:24:27,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:27,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:27,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:24:27,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423163879] [2019-11-28 17:24:27,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:27,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:24:27,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176050645] [2019-11-28 17:24:27,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:24:27,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:27,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:24:27,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:24:27,769 INFO L87 Difference]: Start difference. First operand 85 states and 121 transitions. Second operand 5 states. [2019-11-28 17:24:27,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:27,964 INFO L93 Difference]: Finished difference Result 413 states and 601 transitions. [2019-11-28 17:24:27,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 17:24:27,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-28 17:24:27,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:27,968 INFO L225 Difference]: With dead ends: 413 [2019-11-28 17:24:27,968 INFO L226 Difference]: Without dead ends: 334 [2019-11-28 17:24:27,969 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 17:24:27,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-11-28 17:24:27,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 156. [2019-11-28 17:24:27,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-28 17:24:27,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 220 transitions. [2019-11-28 17:24:27,996 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 220 transitions. Word has length 25 [2019-11-28 17:24:27,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:27,996 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 220 transitions. [2019-11-28 17:24:27,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:24:27,997 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 220 transitions. [2019-11-28 17:24:27,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 17:24:27,998 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:27,998 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:27,998 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:27,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:27,999 INFO L82 PathProgramCache]: Analyzing trace with hash 362368227, now seen corresponding path program 1 times [2019-11-28 17:24:27,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:28,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056078614] [2019-11-28 17:24:28,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:28,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:28,062 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:28,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056078614] [2019-11-28 17:24:28,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:28,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:24:28,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557566803] [2019-11-28 17:24:28,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:24:28,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:28,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:24:28,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:24:28,065 INFO L87 Difference]: Start difference. First operand 156 states and 220 transitions. Second operand 5 states. [2019-11-28 17:24:28,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:28,222 INFO L93 Difference]: Finished difference Result 436 states and 619 transitions. [2019-11-28 17:24:28,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 17:24:28,222 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 17:24:28,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:28,225 INFO L225 Difference]: With dead ends: 436 [2019-11-28 17:24:28,225 INFO L226 Difference]: Without dead ends: 434 [2019-11-28 17:24:28,226 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:28,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2019-11-28 17:24:28,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 156. [2019-11-28 17:24:28,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-28 17:24:28,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 218 transitions. [2019-11-28 17:24:28,261 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 218 transitions. Word has length 26 [2019-11-28 17:24:28,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:28,261 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 218 transitions. [2019-11-28 17:24:28,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:24:28,262 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 218 transitions. [2019-11-28 17:24:28,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 17:24:28,269 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:28,273 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:28,273 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:28,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:28,274 INFO L82 PathProgramCache]: Analyzing trace with hash 922855028, now seen corresponding path program 1 times [2019-11-28 17:24:28,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:28,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240179579] [2019-11-28 17:24:28,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:28,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:28,347 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:28,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240179579] [2019-11-28 17:24:28,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:28,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:24:28,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930032811] [2019-11-28 17:24:28,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:24:28,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:28,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:24:28,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:24:28,351 INFO L87 Difference]: Start difference. First operand 156 states and 218 transitions. Second operand 5 states. [2019-11-28 17:24:28,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:28,446 INFO L93 Difference]: Finished difference Result 468 states and 648 transitions. [2019-11-28 17:24:28,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:24:28,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-28 17:24:28,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:28,448 INFO L225 Difference]: With dead ends: 468 [2019-11-28 17:24:28,449 INFO L226 Difference]: Without dead ends: 318 [2019-11-28 17:24:28,451 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:28,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-11-28 17:24:28,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 168. [2019-11-28 17:24:28,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-28 17:24:28,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 230 transitions. [2019-11-28 17:24:28,482 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 230 transitions. Word has length 31 [2019-11-28 17:24:28,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:28,483 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 230 transitions. [2019-11-28 17:24:28,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:24:28,484 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 230 transitions. [2019-11-28 17:24:28,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 17:24:28,488 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:28,489 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:28,489 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:28,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:28,489 INFO L82 PathProgramCache]: Analyzing trace with hash 529828018, now seen corresponding path program 1 times [2019-11-28 17:24:28,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:28,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688716959] [2019-11-28 17:24:28,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:28,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:28,546 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:28,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688716959] [2019-11-28 17:24:28,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:28,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:24:28,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69133403] [2019-11-28 17:24:28,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:24:28,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:28,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:24:28,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:24:28,549 INFO L87 Difference]: Start difference. First operand 168 states and 230 transitions. Second operand 4 states. [2019-11-28 17:24:28,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:28,613 INFO L93 Difference]: Finished difference Result 426 states and 580 transitions. [2019-11-28 17:24:28,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 17:24:28,614 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-28 17:24:28,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:28,616 INFO L225 Difference]: With dead ends: 426 [2019-11-28 17:24:28,616 INFO L226 Difference]: Without dead ends: 264 [2019-11-28 17:24:28,618 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:28,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-11-28 17:24:28,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 176. [2019-11-28 17:24:28,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-11-28 17:24:28,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 238 transitions. [2019-11-28 17:24:28,639 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 238 transitions. Word has length 31 [2019-11-28 17:24:28,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:28,640 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 238 transitions. [2019-11-28 17:24:28,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:24:28,640 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 238 transitions. [2019-11-28 17:24:28,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 17:24:28,641 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:28,641 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:28,642 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:28,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:28,642 INFO L82 PathProgramCache]: Analyzing trace with hash 787993456, now seen corresponding path program 1 times [2019-11-28 17:24:28,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:28,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271757269] [2019-11-28 17:24:28,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:24:28,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 17:24:28,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271757269] [2019-11-28 17:24:28,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:24:28,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:24:28,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525673477] [2019-11-28 17:24:28,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:24:28,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:24:28,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:24:28,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:28,726 INFO L87 Difference]: Start difference. First operand 176 states and 238 transitions. Second operand 3 states. [2019-11-28 17:24:28,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:24:28,777 INFO L93 Difference]: Finished difference Result 434 states and 586 transitions. [2019-11-28 17:24:28,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:24:28,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-28 17:24:28,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:24:28,779 INFO L225 Difference]: With dead ends: 434 [2019-11-28 17:24:28,779 INFO L226 Difference]: Without dead ends: 264 [2019-11-28 17:24:28,780 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:24:28,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-11-28 17:24:28,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2019-11-28 17:24:28,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-11-28 17:24:28,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 348 transitions. [2019-11-28 17:24:28,810 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 348 transitions. Word has length 31 [2019-11-28 17:24:28,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:24:28,811 INFO L462 AbstractCegarLoop]: Abstraction has 264 states and 348 transitions. [2019-11-28 17:24:28,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:24:28,811 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 348 transitions. [2019-11-28 17:24:28,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 17:24:28,812 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:24:28,812 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:28,812 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:24:28,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:24:28,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1324766414, now seen corresponding path program 1 times [2019-11-28 17:24:28,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:24:28,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5453099] [2019-11-28 17:24:28,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:24:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:24:28,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:24:28,984 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 17:24:28,984 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 17:24:29,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:24:29 BoogieIcfgContainer [2019-11-28 17:24:29,105 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:24:29,105 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:24:29,105 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:24:29,106 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:24:29,106 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:26" (3/4) ... [2019-11-28 17:24:29,112 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 17:24:29,266 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:24:29,267 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:24:29,269 INFO L168 Benchmark]: Toolchain (without parser) took 4659.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 218.6 MB). Free memory was 961.7 MB in the beginning and 1.2 GB in the end (delta: -201.7 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:29,269 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:24:29,270 INFO L168 Benchmark]: CACSL2BoogieTranslator took 661.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -165.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:29,270 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.52 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 17:24:29,271 INFO L168 Benchmark]: Boogie Preprocessor took 52.02 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:29,271 INFO L168 Benchmark]: RCFGBuilder took 1027.35 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: 72.1 MB). Peak memory consumption was 72.1 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:29,271 INFO L168 Benchmark]: TraceAbstraction took 2659.78 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.4 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -130.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:24:29,272 INFO L168 Benchmark]: Witness Printer took 161.71 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: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2019-11-28 17:24:29,274 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 661.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -165.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 91.52 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 52.02 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 1027.35 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: 72.1 MB). Peak memory consumption was 72.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2659.78 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.4 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -130.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 161.71 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: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 439]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L209] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L450] int waterLevel = 1; [L451] int methaneLevelCritical = 0; [L617] int pumpRunning = 0; [L618] int systemActive = 1; [L848] int cleanupTimeShifts = 4; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L921] int retValue_acc ; [L922] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L839] int retValue_acc ; [L842] retValue_acc = 1 [L843] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L928] tmp = valid_product() [L930] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L548] int splverifierCounter ; [L549] int tmp ; [L550] int tmp___0 ; [L551] int tmp___1 ; [L552] int tmp___2 ; [L555] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L557] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L559] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L565] tmp = __VERIFIER_nondet_int() [L567] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L468] COND TRUE waterLevel < 2 [L469] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L575] tmp___0 = __VERIFIER_nondet_int() [L577] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L480] COND FALSE !(\read(methaneLevelCritical)) [L483] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L585] tmp___2 = __VERIFIER_nondet_int() [L587] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L624] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L631] COND TRUE \read(systemActive) [L679] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L682] COND FALSE !(\read(pumpRunning)) [L653] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L656] COND TRUE ! pumpRunning [L776] int retValue_acc ; [L777] int tmp ; [L778] int tmp___0 ; [L530] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L533] COND FALSE !(waterLevel < 2) [L537] retValue_acc = 0 [L538] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L782] tmp = isHighWaterSensorDry() [L784] COND FALSE !(\read(tmp)) [L787] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L789] retValue_acc = tmp___0 [L790] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L658] tmp = isHighWaterLevel() [L660] COND TRUE \read(tmp) [L707] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L410] int tmp ; [L411] int tmp___0 ; [L489] int retValue_acc ; [L492] retValue_acc = methaneLevelCritical [L493] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L415] tmp = isMethaneLevelCritical() [L417] COND TRUE \read(tmp) [L731] int retValue_acc ; [L734] retValue_acc = pumpRunning [L735] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L419] tmp___0 = isPumpRunning() [L421] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L439] __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, 113 locations, 3 error locations. Result: UNSAFE, OverallTime: 2.4s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 831 SDtfs, 1084 SDslu, 1323 SDs, 0 SdLazy, 169 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=264occurred 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, 741 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 255 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 214 ConstructedInterpolants, 0 QuantifiedInterpolants, 10707 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...