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.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-4eac566 [2018-09-23 19:45:46,969 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-23 19:45:46,971 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-23 19:45:46,984 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-23 19:45:46,984 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-23 19:45:46,985 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-23 19:45:46,986 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-23 19:45:46,988 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-23 19:45:46,990 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-23 19:45:46,993 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-23 19:45:46,996 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-23 19:45:46,998 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-23 19:45:46,999 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-23 19:45:47,001 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-23 19:45:47,005 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-23 19:45:47,006 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-23 19:45:47,010 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-23 19:45:47,012 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-23 19:45:47,014 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-23 19:45:47,019 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-23 19:45:47,023 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-23 19:45:47,024 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-23 19:45:47,027 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-23 19:45:47,027 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-23 19:45:47,027 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-23 19:45:47,028 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-23 19:45:47,029 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-23 19:45:47,030 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-23 19:45:47,031 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-23 19:45:47,032 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-23 19:45:47,032 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-23 19:45:47,033 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-23 19:45:47,033 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-23 19:45:47,033 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-23 19:45:47,034 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-23 19:45:47,035 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-23 19:45:47,035 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-23 19:45:47,059 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-23 19:45:47,061 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-23 19:45:47,062 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-23 19:45:47,063 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-23 19:45:47,063 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-23 19:45:47,064 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-23 19:45:47,064 INFO L133 SettingsManager]: * Use SBE=true [2018-09-23 19:45:47,064 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-23 19:45:47,065 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-23 19:45:47,066 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-23 19:45:47,066 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-23 19:45:47,066 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-23 19:45:47,066 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-23 19:45:47,066 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-23 19:45:47,067 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-23 19:45:47,067 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-23 19:45:47,067 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-23 19:45:47,067 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-23 19:45:47,069 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-23 19:45:47,069 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-23 19:45:47,069 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-23 19:45:47,070 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-23 19:45:47,070 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-23 19:45:47,070 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-23 19:45:47,070 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-23 19:45:47,070 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-23 19:45:47,071 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-23 19:45:47,071 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-23 19:45:47,071 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-23 19:45:47,071 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-23 19:45:47,138 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-23 19:45:47,154 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-23 19:45:47,159 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-23 19:45:47,161 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-23 19:45:47,162 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-23 19:45:47,163 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl [2018-09-23 19:45:47,163 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit01.bpl' [2018-09-23 19:45:47,220 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-23 19:45:47,226 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-23 19:45:47,226 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-23 19:45:47,227 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-23 19:45:47,227 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-23 19:45:47,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:45:47" (1/1) ... [2018-09-23 19:45:47,264 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:45:47" (1/1) ... [2018-09-23 19:45:47,270 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-23 19:45:47,271 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-23 19:45:47,271 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-23 19:45:47,273 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-23 19:45:47,274 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-23 19:45:47,274 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-23 19:45:47,274 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-23 19:45:47,286 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:45:47" (1/1) ... [2018-09-23 19:45:47,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:45:47" (1/1) ... [2018-09-23 19:45:47,287 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:45:47" (1/1) ... [2018-09-23 19:45:47,287 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:45:47" (1/1) ... [2018-09-23 19:45:47,291 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:45:47" (1/1) ... [2018-09-23 19:45:47,297 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:45:47" (1/1) ... [2018-09-23 19:45:47,298 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:45:47" (1/1) ... [2018-09-23 19:45:47,299 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-23 19:45:47,300 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-23 19:45:47,300 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-23 19:45:47,300 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-23 19:45:47,302 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:45:47" (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-23 19:45:47,379 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-09-23 19:45:47,380 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-23 19:45:47,380 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-23 19:45:47,555 INFO L351 CfgBuilder]: Using library mode [2018-09-23 19:45:47,556 INFO L202 PluginConnector]: Adding new model ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 07:45:47 BoogieIcfgContainer [2018-09-23 19:45:47,556 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-23 19:45:47,557 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-23 19:45:47,557 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-23 19:45:47,561 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-23 19:45:47,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 07:45:47" (1/2) ... [2018-09-23 19:45:47,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1832d34e and model type ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.09 07:45:47, skipping insertion in model container [2018-09-23 19:45:47,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 07:45:47" (2/2) ... [2018-09-23 19:45:47,564 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit01.bpl [2018-09-23 19:45:47,575 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-23 19:45:47,584 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-23 19:45:47,638 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-23 19:45:47,639 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-23 19:45:47,639 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-23 19:45:47,639 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-23 19:45:47,639 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-23 19:45:47,640 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-23 19:45:47,640 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-23 19:45:47,640 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-23 19:45:47,640 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-23 19:45:47,655 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-09-23 19:45:47,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-09-23 19:45:47,662 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:45:47,663 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-09-23 19:45:47,664 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:45:47,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:45:47,671 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2018-09-23 19:45:47,673 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:45:47,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:45:47,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:47,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:45:47,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:47,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:45:47,817 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-23 19:45:47,820 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 19:45:47,820 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-23 19:45:47,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 19:45:47,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 19:45:47,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 19:45:47,841 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-09-23 19:45:47,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:45:47,877 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-09-23 19:45:47,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 19:45:47,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-09-23 19:45:47,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:45:47,889 INFO L225 Difference]: With dead ends: 11 [2018-09-23 19:45:47,889 INFO L226 Difference]: Without dead ends: 5 [2018-09-23 19:45:47,894 INFO L605 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 [2018-09-23 19:45:47,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-09-23 19:45:47,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-09-23 19:45:47,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-09-23 19:45:47,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-09-23 19:45:47,931 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-09-23 19:45:47,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:45:47,931 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-09-23 19:45:47,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 19:45:47,932 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-09-23 19:45:47,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-23 19:45:47,932 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:45:47,932 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-23 19:45:47,932 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:45:47,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:45:47,933 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2018-09-23 19:45:47,933 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:45:47,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:45:47,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:47,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:45:47,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:47,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:45:48,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:45:48,266 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:45:48,266 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-23 19:45:48,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:45:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:45:48,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:45:48,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:45:48,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:45:48,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-23 19:45:48,438 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-09-23 19:45:48,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:45:48,550 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:45:48,551 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2018-09-23 19:45:48,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-23 19:45:48,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-23 19:45:48,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-23 19:45:48,552 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 7 states. [2018-09-23 19:45:48,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:45:48,772 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-09-23 19:45:48,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-23 19:45:48,772 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 4 [2018-09-23 19:45:48,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:45:48,773 INFO L225 Difference]: With dead ends: 8 [2018-09-23 19:45:48,773 INFO L226 Difference]: Without dead ends: 6 [2018-09-23 19:45:48,774 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-09-23 19:45:48,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-09-23 19:45:48,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-09-23 19:45:48,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-09-23 19:45:48,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-09-23 19:45:48,776 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-09-23 19:45:48,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:45:48,776 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-09-23 19:45:48,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-23 19:45:48,777 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-09-23 19:45:48,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-23 19:45:48,777 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:45:48,777 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-09-23 19:45:48,777 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:45:48,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:45:48,778 INFO L82 PathProgramCache]: Analyzing trace with hash 28752352, now seen corresponding path program 2 times [2018-09-23 19:45:48,778 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:45:48,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:45:48,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:48,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:45:48,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:48,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:45:49,054 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-09-23 19:45:49,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:45:49,146 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:45:49,146 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:45:49,154 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:45:49,168 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:45:49,169 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:45:49,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:45:49,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:45:49,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:45:49,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-23 19:45:49,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-09-23 19:45:49,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-09-23 19:45:49,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:45:49,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-23 19:45:49,279 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-09-23 19:45:49,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:45:49,497 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:45:49,498 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2018-09-23 19:45:49,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-23 19:45:49,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-23 19:45:49,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-09-23 19:45:49,500 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 10 states. [2018-09-23 19:45:49,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:45:49,628 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-09-23 19:45:49,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-23 19:45:49,630 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2018-09-23 19:45:49,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:45:49,631 INFO L225 Difference]: With dead ends: 9 [2018-09-23 19:45:49,632 INFO L226 Difference]: Without dead ends: 7 [2018-09-23 19:45:49,632 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-09-23 19:45:49,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-23 19:45:49,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-09-23 19:45:49,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-23 19:45:49,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-09-23 19:45:49,637 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-09-23 19:45:49,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:45:49,638 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-09-23 19:45:49,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-23 19:45:49,638 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-09-23 19:45:49,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-23 19:45:49,639 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:45:49,639 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-09-23 19:45:49,639 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:45:49,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:45:49,640 INFO L82 PathProgramCache]: Analyzing trace with hash 891320966, now seen corresponding path program 3 times [2018-09-23 19:45:49,640 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:45:49,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:45:49,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:49,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:45:49,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:45:50,251 WARN L178 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2018-09-23 19:45:50,275 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:45:50,276 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:45:50,276 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:45:50,284 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:45:50,294 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-09-23 19:45:50,295 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:45:50,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:45:50,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:45:50,312 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:45:50,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-23 19:45:50,321 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-09-23 19:45:50,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-09-23 19:45:50,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:45:50,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-23 19:45:50,383 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-09-23 19:45:50,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-09-23 19:45:50,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:45:50,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-09-23 19:45:50,537 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-09-23 19:45:50,607 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:45:50,628 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:45:50,628 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2018-09-23 19:45:50,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-23 19:45:50,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-23 19:45:50,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-09-23 19:45:50,629 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 12 states. [2018-09-23 19:45:50,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:45:50,761 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-09-23 19:45:50,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-23 19:45:50,762 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2018-09-23 19:45:50,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:45:50,763 INFO L225 Difference]: With dead ends: 10 [2018-09-23 19:45:50,763 INFO L226 Difference]: Without dead ends: 8 [2018-09-23 19:45:50,764 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-09-23 19:45:50,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-09-23 19:45:50,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-09-23 19:45:50,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-09-23 19:45:50,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-09-23 19:45:50,767 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-09-23 19:45:50,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:45:50,768 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-09-23 19:45:50,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-23 19:45:50,768 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-09-23 19:45:50,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-23 19:45:50,769 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:45:50,769 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-09-23 19:45:50,769 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:45:50,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:45:50,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144224, now seen corresponding path program 4 times [2018-09-23 19:45:50,769 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:45:50,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:45:50,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:50,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:45:50,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:50,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:45:51,277 WARN L178 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2018-09-23 19:45:51,319 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:45:51,320 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:45:51,320 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:45:51,328 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 19:45:51,335 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 19:45:51,335 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:45:51,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:45:51,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:45:51,429 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:45:51,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-23 19:45:51,500 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-09-23 19:45:51,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-09-23 19:45:51,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:45:51,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-23 19:45:51,541 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-09-23 19:45:51,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-09-23 19:45:51,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:45:51,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-09-23 19:45:51,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-09-23 19:45:51,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-09-23 19:45:51,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:45:51,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-09-23 19:45:51,673 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-09-23 19:45:51,810 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:45:51,830 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:45:51,831 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-09-23 19:45:51,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-23 19:45:51,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-23 19:45:51,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-09-23 19:45:51,832 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 14 states. [2018-09-23 19:45:52,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:45:52,047 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-09-23 19:45:52,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-23 19:45:52,048 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2018-09-23 19:45:52,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:45:52,049 INFO L225 Difference]: With dead ends: 11 [2018-09-23 19:45:52,049 INFO L226 Difference]: Without dead ends: 9 [2018-09-23 19:45:52,050 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-09-23 19:45:52,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-23 19:45:52,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-09-23 19:45:52,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-23 19:45:52,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-09-23 19:45:52,054 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-09-23 19:45:52,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:45:52,055 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-09-23 19:45:52,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-23 19:45:52,055 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-09-23 19:45:52,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 19:45:52,056 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:45:52,056 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-09-23 19:45:52,056 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:45:52,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:45:52,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894150, now seen corresponding path program 5 times [2018-09-23 19:45:52,057 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:45:52,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:45:52,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:52,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:45:52,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:52,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:45:52,639 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 30 [2018-09-23 19:45:52,657 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:45:52,657 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:45:52,658 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:45:52,666 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 19:45:52,679 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-09-23 19:45:52,680 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:45:52,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:45:52,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:45:52,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:45:52,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-23 19:45:52,707 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-09-23 19:45:52,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-09-23 19:45:52,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:45:52,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-23 19:45:52,759 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-09-23 19:45:52,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-09-23 19:45:52,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:45:52,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-09-23 19:45:52,836 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-09-23 19:45:52,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-09-23 19:45:52,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:45:52,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-09-23 19:45:52,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-09-23 19:45:53,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-09-23 19:45:53,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:45:53,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-09-23 19:45:53,046 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2018-09-23 19:45:53,392 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:45:53,412 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:45:53,413 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-09-23 19:45:53,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-23 19:45:53,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-23 19:45:53,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-09-23 19:45:53,414 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 16 states. [2018-09-23 19:45:53,940 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2018-09-23 19:45:53,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:45:53,979 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-09-23 19:45:53,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-23 19:45:53,980 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 8 [2018-09-23 19:45:53,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:45:53,981 INFO L225 Difference]: With dead ends: 12 [2018-09-23 19:45:53,981 INFO L226 Difference]: Without dead ends: 10 [2018-09-23 19:45:53,981 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2018-09-23 19:45:53,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-09-23 19:45:53,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-09-23 19:45:53,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-09-23 19:45:53,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-09-23 19:45:53,985 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-09-23 19:45:53,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:45:53,985 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-09-23 19:45:53,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-23 19:45:53,986 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-09-23 19:45:53,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-23 19:45:53,986 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:45:53,986 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-09-23 19:45:53,987 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:45:53,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:45:53,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141856, now seen corresponding path program 6 times [2018-09-23 19:45:53,987 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:45:53,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:45:53,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:53,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:45:53,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:45:54,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:45:54,617 WARN L178 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 42 [2018-09-23 19:45:54,901 WARN L178 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 37 [2018-09-23 19:45:54,921 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:45:54,922 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:45:54,922 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:45:54,932 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 19:45:54,943 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-09-23 19:45:54,943 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:45:54,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:45:54,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:45:54,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:45:54,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-23 19:45:54,973 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-09-23 19:45:55,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-09-23 19:45:55,017 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:45:55,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-23 19:45:55,046 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-09-23 19:45:55,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-09-23 19:45:55,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:45:55,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-09-23 19:45:55,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-09-23 19:45:55,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-09-23 19:45:55,209 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:45:55,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-09-23 19:45:55,230 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-09-23 19:45:55,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-09-23 19:45:55,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:45:55,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-09-23 19:45:55,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2018-09-23 19:45:55,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-09-23 19:45:55,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:45:55,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-09-23 19:45:55,675 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2018-09-23 19:45:57,807 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:45:57,826 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:45:57,826 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2018-09-23 19:45:57,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-23 19:45:57,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-23 19:45:57,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2018-09-23 19:45:57,828 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 18 states. [2018-09-23 19:46:02,309 WARN L178 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2018-09-23 19:46:02,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:46:02,318 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-09-23 19:46:02,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-23 19:46:02,318 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 9 [2018-09-23 19:46:02,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:46:02,319 INFO L225 Difference]: With dead ends: 13 [2018-09-23 19:46:02,319 INFO L226 Difference]: Without dead ends: 11 [2018-09-23 19:46:02,320 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=86, Invalid=255, Unknown=1, NotChecked=0, Total=342 [2018-09-23 19:46:02,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-23 19:46:02,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-23 19:46:02,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-23 19:46:02,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-09-23 19:46:02,326 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-09-23 19:46:02,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:46:02,326 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-09-23 19:46:02,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-23 19:46:02,326 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-09-23 19:46:02,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-23 19:46:02,327 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:46:02,327 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-09-23 19:46:02,327 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:46:02,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:46:02,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820742, now seen corresponding path program 7 times [2018-09-23 19:46:02,328 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:46:02,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:46:02,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:46:02,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:46:02,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:46:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:46:02,792 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 32 [2018-09-23 19:46:02,979 WARN L178 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 29 [2018-09-23 19:46:03,272 WARN L178 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 47 [2018-09-23 19:46:03,669 WARN L178 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 52 [2018-09-23 19:46:03,699 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:46:03,699 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:46:03,699 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:46:03,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:46:03,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:46:03,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:46:03,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:46:03,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:46:03,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-23 19:46:03,736 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-09-23 19:46:03,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-09-23 19:46:03,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:46:03,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-23 19:46:03,770 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-09-23 19:46:03,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-09-23 19:46:03,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:46:03,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-09-23 19:46:03,926 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-09-23 19:46:03,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-09-23 19:46:03,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:46:03,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-09-23 19:46:03,985 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-09-23 19:46:04,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-09-23 19:46:04,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:46:04,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-09-23 19:46:04,087 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2018-09-23 19:46:04,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-09-23 19:46:04,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:46:04,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-09-23 19:46:04,346 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2018-09-23 19:46:07,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-09-23 19:46:07,019 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:46:07,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-09-23 19:46:07,055 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:75, output treesize:74 [2018-09-23 19:46:22,714 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:46:22,735 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:46:22,736 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2018-09-23 19:46:22,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-23 19:46:22,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-23 19:46:22,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=286, Unknown=4, NotChecked=0, Total=380 [2018-09-23 19:46:22,738 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 20 states. [2018-09-23 19:46:29,195 WARN L178 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 84 DAG size of output: 49 [2018-09-23 19:46:40,015 WARN L178 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 86 DAG size of output: 45 [2018-09-23 19:47:00,088 WARN L178 SmtUtils]: Spent 4.93 s on a formula simplification that was a NOOP. DAG size: 48 [2018-09-23 19:47:00,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:47:00,113 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-09-23 19:47:00,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-23 19:47:00,114 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 10 [2018-09-23 19:47:00,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:47:00,114 INFO L225 Difference]: With dead ends: 14 [2018-09-23 19:47:00,115 INFO L226 Difference]: Without dead ends: 12 [2018-09-23 19:47:00,116 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 47.9s TimeCoverageRelationStatistics Valid=158, Invalid=482, Unknown=10, NotChecked=0, Total=650 [2018-09-23 19:47:00,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-09-23 19:47:00,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-09-23 19:47:00,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-09-23 19:47:00,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-09-23 19:47:00,120 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-09-23 19:47:00,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:47:00,120 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-09-23 19:47:00,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-23 19:47:00,120 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-09-23 19:47:00,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-23 19:47:00,121 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:47:00,121 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-09-23 19:47:00,121 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:47:00,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:47:00,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166496, now seen corresponding path program 8 times [2018-09-23 19:47:00,121 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:47:00,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:47:00,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:47:00,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 19:47:00,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:47:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:47:00,770 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 25 [2018-09-23 19:47:01,015 WARN L178 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 29 [2018-09-23 19:47:01,457 WARN L178 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 44 [2018-09-23 19:47:02,227 WARN L178 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 57 [2018-09-23 19:47:02,312 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:47:02,313 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:47:02,313 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:47:02,323 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 19:47:02,356 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 19:47:02,357 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:47:02,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:47:02,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:47:02,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:47:02,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-23 19:47:02,472 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-09-23 19:47:02,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-09-23 19:47:02,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:47:02,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-23 19:47:02,506 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-09-23 19:47:02,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-09-23 19:47:02,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:47:02,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-09-23 19:47:02,796 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-09-23 19:47:03,268 INFO L303 Elim1Store]: Index analysis took 141 ms [2018-09-23 19:47:03,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-09-23 19:47:03,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:47:03,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-09-23 19:47:03,433 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-09-23 19:47:03,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-09-23 19:47:03,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:47:03,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-09-23 19:47:03,542 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2018-09-23 19:47:03,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-09-23 19:47:03,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:47:03,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-09-23 19:47:03,852 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2018-09-23 19:47:06,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-09-23 19:47:06,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:47:06,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-09-23 19:47:06,795 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:75, output treesize:74 [2018-09-23 19:47:20,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-09-23 19:47:20,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:47:20,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-09-23 19:47:20,299 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:85, output treesize:84 [2018-09-23 19:47:54,487 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 34 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:47:54,508 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 19:47:54,509 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2018-09-23 19:47:54,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-23 19:47:54,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-23 19:47:54,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=336, Unknown=16, NotChecked=0, Total=462 [2018-09-23 19:47:54,510 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 22 states. [2018-09-23 19:47:56,363 WARN L178 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2018-09-23 19:48:14,284 WARN L178 SmtUtils]: Spent 11.96 s on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2018-09-23 19:48:39,604 WARN L178 SmtUtils]: Spent 11.88 s on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2018-09-23 19:49:30,457 WARN L178 SmtUtils]: Spent 12.07 s on a formula simplification. DAG size of input: 101 DAG size of output: 53 [2018-09-23 19:49:30,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 19:49:30,495 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-09-23 19:49:30,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-23 19:49:30,495 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 11 [2018-09-23 19:49:30,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 19:49:30,496 INFO L225 Difference]: With dead ends: 15 [2018-09-23 19:49:30,496 INFO L226 Difference]: Without dead ends: 13 [2018-09-23 19:49:30,497 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 128.1s TimeCoverageRelationStatistics Valid=156, Invalid=517, Unknown=29, NotChecked=0, Total=702 [2018-09-23 19:49:30,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-23 19:49:30,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-23 19:49:30,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-23 19:49:30,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-09-23 19:49:30,501 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-09-23 19:49:30,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 19:49:30,501 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-09-23 19:49:30,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-23 19:49:30,502 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-09-23 19:49:30,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 19:49:30,502 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 19:49:30,502 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-09-23 19:49:30,502 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 19:49:30,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 19:49:30,503 INFO L82 PathProgramCache]: Analyzing trace with hash -562523066, now seen corresponding path program 9 times [2018-09-23 19:49:30,503 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 19:49:30,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 19:49:30,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:49:30,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 19:49:30,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 19:49:30,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 19:49:30,985 WARN L178 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 12 [2018-09-23 19:49:31,299 WARN L178 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 23 [2018-09-23 19:49:31,568 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 31 [2018-09-23 19:49:31,958 WARN L178 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 34 [2018-09-23 19:49:32,857 WARN L178 SmtUtils]: Spent 639.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 52 [2018-09-23 19:49:33,437 WARN L178 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 59 [2018-09-23 19:49:33,461 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-23 19:49:33,461 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 19:49:33,462 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:49:33,470 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 19:49:33,483 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-09-23 19:49:33,484 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 19:49:33,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 19:49:33,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 19:49:33,542 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:49:33,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-23 19:49:33,548 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-09-23 19:49:33,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-09-23 19:49:33,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:49:33,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-23 19:49:33,588 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2018-09-23 19:49:33,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-09-23 19:49:33,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:49:33,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-09-23 19:49:33,651 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-09-23 19:49:33,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-09-23 19:49:33,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:49:33,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-09-23 19:49:33,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-09-23 19:49:33,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-09-23 19:49:33,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:49:33,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-09-23 19:49:33,904 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:54 [2018-09-23 19:49:34,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-09-23 19:49:34,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:49:34,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-09-23 19:49:34,398 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:64 [2018-09-23 19:49:37,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-09-23 19:49:37,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:49:37,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-09-23 19:49:37,094 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:75, output treesize:74 [2018-09-23 19:49:53,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-09-23 19:49:53,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:49:53,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-09-23 19:49:53,274 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:85, output treesize:84 [2018-09-23 19:50:20,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 46 [2018-09-23 19:50:20,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 19:50:20,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2018-09-23 19:50:20,979 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 10 variables, input treesize:95, output treesize:94 Received shutdown request... [2018-09-23 19:50:36,948 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-09-23 19:50:37,149 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 19:50:37,149 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-23 19:50:37,155 WARN L206 ceAbstractionStarter]: Timeout [2018-09-23 19:50:37,155 INFO L202 PluginConnector]: Adding new model ArrayInit01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.09 07:50:37 BoogieIcfgContainer [2018-09-23 19:50:37,155 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-23 19:50:37,156 INFO L168 Benchmark]: Toolchain (without parser) took 289934.90 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 136.8 MB). Free memory was 1.4 GB in the beginning and 978.3 MB in the end (delta: 466.3 MB). Peak memory consumption was 603.2 MB. Max. memory is 7.1 GB. [2018-09-23 19:50:37,157 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-23 19:50:37,157 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.01 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-23 19:50:37,157 INFO L168 Benchmark]: Boogie Preprocessor took 25.75 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-23 19:50:37,158 INFO L168 Benchmark]: RCFGBuilder took 256.00 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-23 19:50:37,158 INFO L168 Benchmark]: TraceAbstraction took 289598.31 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 136.8 MB). Free memory was 1.4 GB in the beginning and 978.3 MB in the end (delta: 445.2 MB). Peak memory consumption was 582.0 MB. Max. memory is 7.1 GB. [2018-09-23 19:50:37,160 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 47.01 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.75 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 256.00 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 289598.31 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 136.8 MB). Free memory was 1.4 GB in the beginning and 978.3 MB in the end (delta: 445.2 MB). Peak memory consumption was 582.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 34]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 34). Cancelled while BasicCegarLoop was analyzing trace of length 13 with TraceHistMax 9, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 22 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 289.5s OverallTime, 10 OverallIterations, 9 TraceHistogramMax, 139.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 21 SDtfs, 12 SDslu, 27 SDs, 0 SdLazy, 383 SolverSat, 32 SolverUnsat, 13 SolverUnknown, 0 SolverNotchecked, 30.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 185.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=9, 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.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 82.8s InterpolantComputationTime, 123 NumberOfCodeBlocks, 123 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 106 ConstructedInterpolants, 43 QuantifiedInterpolants, 26107 SizeOfPredicates, 16 NumberOfNonLiveVariables, 224 ConjunctsInSsa, 112 ConjunctsInUnsatCore, 17 InterpolantComputations, 1 PerfectInterpolantSequences, 0/240 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/ArrayInit01.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-23_19-50-37-169.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/ArrayInit01.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-23_19-50-37-169.csv Completed graceful shutdown