java -Xmx8000000000 -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 --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-09-30 20:46:32,037 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 20:46:32,039 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 20:46:32,051 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 20:46:32,051 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 20:46:32,052 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 20:46:32,053 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 20:46:32,055 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 20:46:32,057 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 20:46:32,057 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 20:46:32,058 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 20:46:32,059 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 20:46:32,060 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 20:46:32,061 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 20:46:32,062 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 20:46:32,062 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 20:46:32,063 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 20:46:32,065 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 20:46:32,067 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 20:46:32,069 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 20:46:32,070 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 20:46:32,071 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 20:46:32,073 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 20:46:32,074 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 20:46:32,074 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 20:46:32,075 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 20:46:32,076 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 20:46:32,076 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 20:46:32,077 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 20:46:32,078 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 20:46:32,078 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 20:46:32,079 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 20:46:32,079 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 20:46:32,080 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 20:46:32,080 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 20:46:32,081 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 20:46:32,081 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-09-30 20:46:32,097 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 20:46:32,097 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 20:46:32,098 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 20:46:32,098 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 20:46:32,099 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 20:46:32,099 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 20:46:32,099 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 20:46:32,100 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 20:46:32,100 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 20:46:32,100 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 20:46:32,100 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 20:46:32,100 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 20:46:32,101 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 20:46:32,101 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 20:46:32,101 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 20:46:32,101 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 20:46:32,101 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 20:46:32,102 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 20:46:32,102 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 20:46:32,102 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 20:46:32,102 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 20:46:32,102 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 20:46:32,103 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:46:32,103 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 20:46:32,103 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 20:46:32,103 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 20:46:32,103 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 20:46:32,104 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 20:46:32,104 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 20:46:32,104 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 20:46:32,104 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-30 20:46:32,146 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 20:46:32,159 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 20:46:32,163 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 20:46:32,164 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 20:46:32,165 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 20:46:32,166 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl [2018-09-30 20:46:32,166 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl' [2018-09-30 20:46:32,253 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 20:46:32,256 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 20:46:32,257 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 20:46:32,257 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 20:46:32,257 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 20:46:32,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:46:32" (1/1) ... [2018-09-30 20:46:32,293 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:46:32" (1/1) ... [2018-09-30 20:46:32,301 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 20:46:32,302 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 20:46:32,302 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 20:46:32,302 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 20:46:32,313 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:46:32" (1/1) ... [2018-09-30 20:46:32,314 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:46:32" (1/1) ... [2018-09-30 20:46:32,316 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:46:32" (1/1) ... [2018-09-30 20:46:32,317 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:46:32" (1/1) ... [2018-09-30 20:46:32,324 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:46:32" (1/1) ... [2018-09-30 20:46:32,327 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:46:32" (1/1) ... [2018-09-30 20:46:32,329 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:46:32" (1/1) ... [2018-09-30 20:46:32,332 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 20:46:32,333 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 20:46:32,333 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 20:46:32,333 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 20:46:32,334 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:46:32" (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 [2018-09-30 20:46:32,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 20:46:32,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 20:46:33,002 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 20:46:33,003 INFO L202 PluginConnector]: Adding new model pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:46:33 BoogieIcfgContainer [2018-09-30 20:46:33,003 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 20:46:33,005 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 20:46:33,005 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 20:46:33,008 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 20:46:33,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:46:32" (1/2) ... [2018-09-30 20:46:33,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f345806 and model type pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 08:46:33, skipping insertion in model container [2018-09-30 20:46:33,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:46:33" (2/2) ... [2018-09-30 20:46:33,012 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl [2018-09-30 20:46:33,021 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 20:46:33,029 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 20:46:33,077 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 20:46:33,078 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 20:46:33,078 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 20:46:33,078 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 20:46:33,078 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 20:46:33,079 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 20:46:33,079 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 20:46:33,079 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 20:46:33,079 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 20:46:33,094 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-09-30 20:46:33,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 20:46:33,101 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:46:33,102 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:46:33,103 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:46:33,109 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:46:33,110 INFO L82 PathProgramCache]: Analyzing trace with hash 679324735, now seen corresponding path program 1 times [2018-09-30 20:46:33,112 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:46:33,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:46:33,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:33,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:46:33,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:46:33,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:46:33,401 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:46:33,402 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:46:33,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:46:33,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:46:33,418 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:46:33,420 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-09-30 20:46:33,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:46:33,526 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2018-09-30 20:46:33,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:46:33,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-09-30 20:46:33,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:46:33,540 INFO L225 Difference]: With dead ends: 48 [2018-09-30 20:46:33,540 INFO L226 Difference]: Without dead ends: 31 [2018-09-30 20:46:33,544 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:46:33,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-30 20:46:33,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-09-30 20:46:33,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-30 20:46:33,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2018-09-30 20:46:33,582 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 15 [2018-09-30 20:46:33,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:46:33,583 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2018-09-30 20:46:33,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:46:33,583 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2018-09-30 20:46:33,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 20:46:33,584 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:46:33,584 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:46:33,584 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:46:33,585 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:46:33,585 INFO L82 PathProgramCache]: Analyzing trace with hash 92518721, now seen corresponding path program 1 times [2018-09-30 20:46:33,585 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:46:33,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:46:33,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:33,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:46:33,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:33,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:46:33,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:46:33,692 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:46:33,693 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:46:33,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:46:33,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:46:33,697 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:46:33,697 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand 3 states. [2018-09-30 20:46:33,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:46:33,807 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2018-09-30 20:46:33,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:46:33,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-09-30 20:46:33,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:46:33,810 INFO L225 Difference]: With dead ends: 85 [2018-09-30 20:46:33,810 INFO L226 Difference]: Without dead ends: 57 [2018-09-30 20:46:33,812 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:46:33,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-30 20:46:33,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-09-30 20:46:33,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-09-30 20:46:33,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2018-09-30 20:46:33,845 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 78 transitions. Word has length 15 [2018-09-30 20:46:33,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:46:33,846 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 78 transitions. [2018-09-30 20:46:33,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:46:33,846 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2018-09-30 20:46:33,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 20:46:33,847 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:46:33,847 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:46:33,847 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:46:33,848 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:46:33,848 INFO L82 PathProgramCache]: Analyzing trace with hash 772577091, now seen corresponding path program 1 times [2018-09-30 20:46:33,848 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:46:33,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:46:33,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:33,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:46:33,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:33,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:46:33,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:46:33,965 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:46:33,965 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:46:33,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:46:33,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:46:33,966 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:46:33,966 INFO L87 Difference]: Start difference. First operand 55 states and 78 transitions. Second operand 3 states. [2018-09-30 20:46:34,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:46:34,068 INFO L93 Difference]: Finished difference Result 163 states and 232 transitions. [2018-09-30 20:46:34,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:46:34,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-09-30 20:46:34,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:46:34,073 INFO L225 Difference]: With dead ends: 163 [2018-09-30 20:46:34,074 INFO L226 Difference]: Without dead ends: 109 [2018-09-30 20:46:34,074 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:46:34,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-30 20:46:34,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-09-30 20:46:34,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-30 20:46:34,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 150 transitions. [2018-09-30 20:46:34,126 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 150 transitions. Word has length 15 [2018-09-30 20:46:34,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:46:34,126 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 150 transitions. [2018-09-30 20:46:34,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:46:34,126 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 150 transitions. [2018-09-30 20:46:34,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 20:46:34,127 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:46:34,127 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:46:34,129 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:46:34,129 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:46:34,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1002430271, now seen corresponding path program 1 times [2018-09-30 20:46:34,130 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:46:34,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:46:34,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:34,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:46:34,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:34,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:46:34,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:46:34,287 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:46:34,287 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 20:46:34,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:46:34,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:46:34,288 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:46:34,289 INFO L87 Difference]: Start difference. First operand 107 states and 150 transitions. Second operand 3 states. [2018-09-30 20:46:34,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:46:34,459 INFO L93 Difference]: Finished difference Result 269 states and 378 transitions. [2018-09-30 20:46:34,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:46:34,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-09-30 20:46:34,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:46:34,466 INFO L225 Difference]: With dead ends: 269 [2018-09-30 20:46:34,466 INFO L226 Difference]: Without dead ends: 163 [2018-09-30 20:46:34,467 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:46:34,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-09-30 20:46:34,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2018-09-30 20:46:34,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-09-30 20:46:34,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 220 transitions. [2018-09-30 20:46:34,503 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 220 transitions. Word has length 15 [2018-09-30 20:46:34,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:46:34,503 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 220 transitions. [2018-09-30 20:46:34,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:46:34,504 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 220 transitions. [2018-09-30 20:46:34,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 20:46:34,504 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:46:34,505 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:46:34,505 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:46:34,505 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:46:34,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1000583229, now seen corresponding path program 1 times [2018-09-30 20:46:34,506 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:46:34,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:46:34,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:34,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:46:34,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:46:34,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:46:34,661 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:46:34,662 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-30 20:46:34,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 20:46:34,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 20:46:34,662 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:46:34,663 INFO L87 Difference]: Start difference. First operand 161 states and 220 transitions. Second operand 4 states. [2018-09-30 20:46:34,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:46:34,853 INFO L93 Difference]: Finished difference Result 293 states and 396 transitions. [2018-09-30 20:46:34,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 20:46:34,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-09-30 20:46:34,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:46:34,861 INFO L225 Difference]: With dead ends: 293 [2018-09-30 20:46:34,861 INFO L226 Difference]: Without dead ends: 291 [2018-09-30 20:46:34,861 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:46:34,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-09-30 20:46:34,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 177. [2018-09-30 20:46:34,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-09-30 20:46:34,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 232 transitions. [2018-09-30 20:46:34,925 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 232 transitions. Word has length 15 [2018-09-30 20:46:34,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:46:34,926 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 232 transitions. [2018-09-30 20:46:34,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 20:46:34,926 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 232 transitions. [2018-09-30 20:46:34,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-30 20:46:34,928 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:46:34,928 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:46:34,928 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:46:34,929 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:46:34,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1080825333, now seen corresponding path program 1 times [2018-09-30 20:46:34,929 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:46:34,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:46:34,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:34,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:46:34,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:46:35,072 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:46:35,073 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:46:35,073 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:46:35,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:46:35,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:46:35,074 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:46:35,074 INFO L87 Difference]: Start difference. First operand 177 states and 232 transitions. Second operand 3 states. [2018-09-30 20:46:35,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:46:35,268 INFO L93 Difference]: Finished difference Result 525 states and 690 transitions. [2018-09-30 20:46:35,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:46:35,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-09-30 20:46:35,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:46:35,275 INFO L225 Difference]: With dead ends: 525 [2018-09-30 20:46:35,275 INFO L226 Difference]: Without dead ends: 351 [2018-09-30 20:46:35,277 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:46:35,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-09-30 20:46:35,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2018-09-30 20:46:35,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-09-30 20:46:35,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 448 transitions. [2018-09-30 20:46:35,340 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 448 transitions. Word has length 28 [2018-09-30 20:46:35,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:46:35,340 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 448 transitions. [2018-09-30 20:46:35,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:46:35,341 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 448 transitions. [2018-09-30 20:46:35,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-30 20:46:35,343 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:46:35,343 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:46:35,343 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:46:35,343 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:46:35,344 INFO L82 PathProgramCache]: Analyzing trace with hash 379760755, now seen corresponding path program 1 times [2018-09-30 20:46:35,344 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:46:35,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:46:35,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:35,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:46:35,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:46:35,591 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-30 20:46:35,591 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:46:35,592 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:46:35,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:46:35,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:46:35,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:46:36,349 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-30 20:46:36,381 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:46:36,382 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2018-09-30 20:46:36,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 20:46:36,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 20:46:36,383 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:46:36,383 INFO L87 Difference]: Start difference. First operand 349 states and 448 transitions. Second operand 5 states. [2018-09-30 20:46:36,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:46:36,989 INFO L93 Difference]: Finished difference Result 591 states and 769 transitions. [2018-09-30 20:46:36,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:46:36,990 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-09-30 20:46:36,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:46:36,992 INFO L225 Difference]: With dead ends: 591 [2018-09-30 20:46:36,992 INFO L226 Difference]: Without dead ends: 349 [2018-09-30 20:46:36,993 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-09-30 20:46:36,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-09-30 20:46:37,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2018-09-30 20:46:37,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-09-30 20:46:37,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 432 transitions. [2018-09-30 20:46:37,045 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 432 transitions. Word has length 28 [2018-09-30 20:46:37,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:46:37,046 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 432 transitions. [2018-09-30 20:46:37,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 20:46:37,046 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 432 transitions. [2018-09-30 20:46:37,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-30 20:46:37,048 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:46:37,048 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-30 20:46:37,049 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:46:37,049 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:46:37,049 INFO L82 PathProgramCache]: Analyzing trace with hash 381607797, now seen corresponding path program 1 times [2018-09-30 20:46:37,049 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:46:37,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:46:37,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:37,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:46:37,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:46:37,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:46:37,124 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-09-30 20:46:37,125 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:46:37,125 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:46:37,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:46:37,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:46:37,126 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:46:37,126 INFO L87 Difference]: Start difference. First operand 349 states and 432 transitions. Second operand 3 states. [2018-09-30 20:46:37,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:46:37,487 INFO L93 Difference]: Finished difference Result 557 states and 688 transitions. [2018-09-30 20:46:37,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:46:37,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-09-30 20:46:37,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:46:37,489 INFO L225 Difference]: With dead ends: 557 [2018-09-30 20:46:37,489 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 20:46:37,490 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:46:37,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 20:46:37,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 20:46:37,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 20:46:37,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 20:46:37,491 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-09-30 20:46:37,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:46:37,491 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 20:46:37,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:46:37,492 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 20:46:37,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 20:46:37,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 20:46:38,268 WARN L178 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-09-30 20:46:38,549 INFO L422 ceAbstractionStarter]: At program point L300(lines 300 311) the Hoare annotation is: (or (= ~mode1 (* 256 (div ~mode1 256))) (<= ~r1 3)) [2018-09-30 20:46:38,549 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 66 376) no Hoare annotation was computed. [2018-09-30 20:46:38,549 INFO L422 ceAbstractionStarter]: At program point L317(lines 310 318) the Hoare annotation is: (or (= ~mode1 (* 256 (div ~mode1 256))) (<= ~r1 3)) [2018-09-30 20:46:38,550 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 66 376) no Hoare annotation was computed. [2018-09-30 20:46:38,550 INFO L422 ceAbstractionStarter]: At program point L251(lines 243 252) the Hoare annotation is: (or (= ~mode1 (* 256 (div ~mode1 256))) (<= ~r1 3)) [2018-09-30 20:46:38,550 INFO L422 ceAbstractionStarter]: At program point L367(lines 367 374) the Hoare annotation is: false [2018-09-30 20:46:38,550 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 375) no Hoare annotation was computed. [2018-09-30 20:46:38,550 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 66 376) no Hoare annotation was computed. [2018-09-30 20:46:38,550 INFO L422 ceAbstractionStarter]: At program point L256(lines 256 266) the Hoare annotation is: (or (= ~mode1 (* 256 (div ~mode1 256))) (<= ~r1 3)) [2018-09-30 20:46:38,551 INFO L422 ceAbstractionStarter]: At program point L351(lines 346 352) the Hoare annotation is: (and (<= 1 ULTIMATE.start_check_~tmp~83) (<= ~r1 3)) [2018-09-30 20:46:38,551 INFO L422 ceAbstractionStarter]: At program point L273(lines 265 274) the Hoare annotation is: (or (= ~mode1 (* 256 (div ~mode1 256))) (<= ~r1 3)) [2018-09-30 20:46:38,551 INFO L422 ceAbstractionStarter]: At program point L331(lines 331 337) the Hoare annotation is: (or (= ~mode1 (* 256 (div ~mode1 256))) (<= ~r1 3)) [2018-09-30 20:46:38,551 INFO L422 ceAbstractionStarter]: At program point L278(lines 278 288) the Hoare annotation is: (or (= ~mode1 (* 256 (div ~mode1 256))) (<= ~r1 3)) [2018-09-30 20:46:38,551 INFO L422 ceAbstractionStarter]: At program point L373(lines 226 373) the Hoare annotation is: (<= ~r1 3) [2018-09-30 20:46:38,551 INFO L422 ceAbstractionStarter]: At program point L340(lines 336 347) the Hoare annotation is: (<= ~r1 3) [2018-09-30 20:46:38,552 INFO L422 ceAbstractionStarter]: At program point L233(lines 233 244) the Hoare annotation is: (<= ~r1 3) [2018-09-30 20:46:38,552 INFO L422 ceAbstractionStarter]: At program point L361(lines 361 368) the Hoare annotation is: (and (<= ULTIMATE.start_assert_~arg 1) (<= 1 ULTIMATE.start_assert_~arg) (<= 1 ULTIMATE.start_check_~tmp~83) (<= ~r1 3)) [2018-09-30 20:46:38,552 INFO L422 ceAbstractionStarter]: At program point L295(lines 287 296) the Hoare annotation is: (or (= ~mode1 (* 256 (div ~mode1 256))) (<= ~r1 3)) [2018-09-30 20:46:38,565 INFO L202 PluginConnector]: Adding new model pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 08:46:38 BoogieIcfgContainer [2018-09-30 20:46:38,565 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 20:46:38,566 INFO L168 Benchmark]: Toolchain (without parser) took 6312.38 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 330.3 MB). Peak memory consumption was 330.3 MB. Max. memory is 7.1 GB. [2018-09-30 20:46:38,567 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:46:38,568 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.66 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:46:38,569 INFO L168 Benchmark]: Boogie Preprocessor took 30.46 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:46:38,570 INFO L168 Benchmark]: RCFGBuilder took 670.51 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-30 20:46:38,571 INFO L168 Benchmark]: TraceAbstraction took 5560.05 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 288.1 MB). Peak memory consumption was 288.1 MB. Max. memory is 7.1 GB. [2018-09-30 20:46:38,575 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.66 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.46 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 670.51 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5560.05 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 288.1 MB). Peak memory consumption was 288.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 375]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 243]: Loop Invariant Derived loop invariant: ~mode1 == 256 * (~mode1 / 256) || ~r1 <= 3 - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: ~mode1 == 256 * (~mode1 / 256) || ~r1 <= 3 - InvariantResult [Line: 287]: Loop Invariant Derived loop invariant: ~mode1 == 256 * (~mode1 / 256) || ~r1 <= 3 - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: ~mode1 == 256 * (~mode1 / 256) || ~r1 <= 3 - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: ~r1 <= 3 - InvariantResult [Line: 233]: Loop Invariant Derived loop invariant: ~r1 <= 3 - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: 1 <= check_~tmp~83 && ~r1 <= 3 - InvariantResult [Line: 336]: Loop Invariant Derived loop invariant: ~r1 <= 3 - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: ((assert_~arg <= 1 && 1 <= assert_~arg) && 1 <= check_~tmp~83) && ~r1 <= 3 - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: ~mode1 == 256 * (~mode1 / 256) || ~r1 <= 3 - InvariantResult [Line: 278]: Loop Invariant Derived loop invariant: ~mode1 == 256 * (~mode1 / 256) || ~r1 <= 3 - InvariantResult [Line: 310]: Loop Invariant Derived loop invariant: ~mode1 == 256 * (~mode1 / 256) || ~r1 <= 3 - InvariantResult [Line: 300]: Loop Invariant Derived loop invariant: ~mode1 == 256 * (~mode1 / 256) || ~r1 <= 3 - InvariantResult [Line: 367]: Loop Invariant Derived loop invariant: false - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. SAFE Result, 5.4s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 1.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 226 SDtfs, 119 SDslu, 165 SDs, 0 SdLazy, 43 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=349occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 124 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 328 NumberOfFragments, 118 HoareAnnotationTreeSize, 14 FomulaSimplifications, 10715 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 14 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 187 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 178 ConstructedInterpolants, 8 QuantifiedInterpolants, 24316 SizeOfPredicates, 1 NumberOfNonLiveVariables, 256 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 36/52 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_20-46-38-591.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/pals_lcr.4.ufo.BOUNDED-8.pals.c_19.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_20-46-38-591.csv Received shutdown request...