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/real-life/divisibilityWithArray.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-00a8621 [2018-09-30 10:14:32,854 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 10:14:32,856 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 10:14:32,872 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 10:14:32,872 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 10:14:32,873 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 10:14:32,875 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 10:14:32,878 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 10:14:32,880 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 10:14:32,883 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 10:14:32,886 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 10:14:32,886 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 10:14:32,887 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 10:14:32,895 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 10:14:32,896 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 10:14:32,900 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 10:14:32,901 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 10:14:32,906 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 10:14:32,911 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 10:14:32,913 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 10:14:32,916 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 10:14:32,918 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 10:14:32,925 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 10:14:32,926 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 10:14:32,926 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 10:14:32,927 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 10:14:32,928 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 10:14:32,929 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 10:14:32,930 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 10:14:32,932 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 10:14:32,932 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 10:14:32,933 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 10:14:32,933 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 10:14:32,933 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 10:14:32,935 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 10:14:32,935 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 10:14:32,936 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-30 10:14:32,963 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 10:14:32,963 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 10:14:32,964 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 10:14:32,965 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 10:14:32,965 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 10:14:32,966 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 10:14:32,966 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 10:14:32,966 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 10:14:32,969 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 10:14:32,969 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 10:14:32,969 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 10:14:32,970 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 10:14:32,970 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 10:14:32,970 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 10:14:32,970 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 10:14:32,971 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 10:14:32,971 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 10:14:32,971 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 10:14:32,971 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 10:14:32,973 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 10:14:32,973 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 10:14:32,973 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 10:14:32,973 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:14:32,974 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 10:14:32,974 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 10:14:32,974 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 10:14:32,974 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 10:14:32,974 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 10:14:32,975 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 10:14:32,975 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 10:14:33,035 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 10:14:33,052 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 10:14:33,060 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 10:14:33,061 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 10:14:33,062 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 10:14:33,063 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl [2018-09-30 10:14:33,063 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl' [2018-09-30 10:14:33,124 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 10:14:33,128 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 10:14:33,128 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 10:14:33,129 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 10:14:33,129 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 10:14:33,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:14:33" (1/1) ... [2018-09-30 10:14:33,166 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:14:33" (1/1) ... [2018-09-30 10:14:33,172 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-30 10:14:33,172 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-30 10:14:33,173 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-30 10:14:33,175 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 10:14:33,175 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 10:14:33,176 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 10:14:33,176 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 10:14:33,187 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:14:33" (1/1) ... [2018-09-30 10:14:33,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:14:33" (1/1) ... [2018-09-30 10:14:33,188 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:14:33" (1/1) ... [2018-09-30 10:14:33,190 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:14:33" (1/1) ... [2018-09-30 10:14:33,193 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:14:33" (1/1) ... [2018-09-30 10:14:33,198 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:14:33" (1/1) ... [2018-09-30 10:14:33,199 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:14:33" (1/1) ... [2018-09-30 10:14:33,200 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 10:14:33,201 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 10:14:33,201 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 10:14:33,201 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 10:14:33,203 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:14:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:14:33,276 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-09-30 10:14:33,276 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-30 10:14:33,276 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-30 10:14:33,458 INFO L345 CfgBuilder]: Using library mode [2018-09-30 10:14:33,459 INFO L202 PluginConnector]: Adding new model divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:14:33 BoogieIcfgContainer [2018-09-30 10:14:33,459 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 10:14:33,461 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 10:14:33,461 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 10:14:33,465 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 10:14:33,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:14:33" (1/2) ... [2018-09-30 10:14:33,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f59a152 and model type divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 10:14:33, skipping insertion in model container [2018-09-30 10:14:33,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:14:33" (2/2) ... [2018-09-30 10:14:33,470 INFO L112 eAbstractionObserver]: Analyzing ICFG divisibilityWithArray.bpl [2018-09-30 10:14:33,481 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 10:14:33,493 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 10:14:33,550 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 10:14:33,550 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 10:14:33,551 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 10:14:33,551 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 10:14:33,551 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 10:14:33,551 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 10:14:33,551 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 10:14:33,552 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 10:14:33,552 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 10:14:33,569 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-09-30 10:14:33,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-09-30 10:14:33,576 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:33,577 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-09-30 10:14:33,578 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:33,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:33,584 INFO L82 PathProgramCache]: Analyzing trace with hash 29920, now seen corresponding path program 1 times [2018-09-30 10:14:33,586 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:33,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:33,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:33,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:33,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:34,083 WARN L178 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 19 [2018-09-30 10:14:34,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:34,164 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:14:34,165 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-30 10:14:34,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 10:14:34,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 10:14:34,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-30 10:14:34,188 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2018-09-30 10:14:34,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:34,299 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-09-30 10:14:34,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 10:14:34,301 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-09-30 10:14:34,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:34,314 INFO L225 Difference]: With dead ends: 14 [2018-09-30 10:14:34,314 INFO L226 Difference]: Without dead ends: 7 [2018-09-30 10:14:34,318 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-30 10:14:34,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-30 10:14:34,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2018-09-30 10:14:34,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-09-30 10:14:34,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-09-30 10:14:34,349 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 3 [2018-09-30 10:14:34,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:34,350 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-09-30 10:14:34,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 10:14:34,350 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-09-30 10:14:34,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-30 10:14:34,351 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:34,351 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-09-30 10:14:34,351 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:34,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:34,352 INFO L82 PathProgramCache]: Analyzing trace with hash 28754210, now seen corresponding path program 1 times [2018-09-30 10:14:34,352 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:34,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:34,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:34,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:34,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:34,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:34,627 WARN L178 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 10:14:34,995 WARN L178 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2018-09-30 10:14:35,168 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2018-09-30 10:14:35,302 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2018-09-30 10:14:35,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:35,306 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:14:35,306 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:14:35,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:35,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:35,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:14:35,415 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 8 treesize of output 7 [2018-09-30 10:14:35,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:14:35,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:14:35,446 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:14:35,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:14:35,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:14:35,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:14:35,664 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:14:35,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:35,744 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:14:35,745 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-09-30 10:14:35,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:14:35,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:14:35,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-30 10:14:35,748 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 9 states. [2018-09-30 10:14:35,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:35,805 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-09-30 10:14:35,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-30 10:14:35,806 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2018-09-30 10:14:35,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:35,807 INFO L225 Difference]: With dead ends: 10 [2018-09-30 10:14:35,807 INFO L226 Difference]: Without dead ends: 9 [2018-09-30 10:14:35,808 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-30 10:14:35,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-30 10:14:35,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-09-30 10:14:35,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-09-30 10:14:35,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-09-30 10:14:35,812 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2018-09-30 10:14:35,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:35,813 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-09-30 10:14:35,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:14:35,814 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-09-30 10:14:35,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-30 10:14:35,814 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:35,814 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1] [2018-09-30 10:14:35,815 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:35,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:35,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1862993124, now seen corresponding path program 2 times [2018-09-30 10:14:35,816 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:35,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:35,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:35,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:35,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:35,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:36,345 WARN L178 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2018-09-30 10:14:36,476 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-30 10:14:36,477 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:14:36,477 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-30 10:14:36,488 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:14:36,495 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:14:36,495 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:14:36,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:14:36,508 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 8 treesize of output 7 [2018-09-30 10:14:36,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:14:36,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:14:36,517 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:14:36,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:14:36,629 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:14:36,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:14:36,646 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:14:36,658 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-30 10:14:36,679 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:14:36,680 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-09-30 10:14:36,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 10:14:36,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 10:14:36,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-09-30 10:14:36,682 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 11 states. [2018-09-30 10:14:36,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:36,758 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-09-30 10:14:36,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 10:14:36,759 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2018-09-30 10:14:36,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:36,760 INFO L225 Difference]: With dead ends: 12 [2018-09-30 10:14:36,760 INFO L226 Difference]: Without dead ends: 11 [2018-09-30 10:14:36,761 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-09-30 10:14:36,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-30 10:14:36,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-09-30 10:14:36,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-09-30 10:14:36,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-09-30 10:14:36,764 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2018-09-30 10:14:36,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:36,765 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-09-30 10:14:36,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 10:14:36,765 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-09-30 10:14:36,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 10:14:36,765 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:36,766 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1] [2018-09-30 10:14:36,766 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:36,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:36,766 INFO L82 PathProgramCache]: Analyzing trace with hash -664969178, now seen corresponding path program 3 times [2018-09-30 10:14:36,766 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:36,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:36,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:36,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:14:36,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:36,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:37,064 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 22 [2018-09-30 10:14:37,195 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 18 [2018-09-30 10:14:37,223 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:37,224 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:14:37,224 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-30 10:14:37,233 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:14:37,256 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-09-30 10:14:37,257 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:14:37,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:14:37,263 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 8 treesize of output 7 [2018-09-30 10:14:37,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:14:37,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:14:37,278 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:14:37,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:14:37,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:14:37,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:14:37,433 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:14:37,445 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:37,466 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:14:37,466 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-09-30 10:14:37,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 10:14:37,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 10:14:37,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-09-30 10:14:37,468 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 13 states. [2018-09-30 10:14:37,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:37,575 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-09-30 10:14:37,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-30 10:14:37,576 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2018-09-30 10:14:37,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:37,578 INFO L225 Difference]: With dead ends: 14 [2018-09-30 10:14:37,578 INFO L226 Difference]: Without dead ends: 13 [2018-09-30 10:14:37,579 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-09-30 10:14:37,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-30 10:14:37,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-09-30 10:14:37,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-09-30 10:14:37,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-09-30 10:14:37,583 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2018-09-30 10:14:37,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:37,583 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-09-30 10:14:37,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 10:14:37,583 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-09-30 10:14:37,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 10:14:37,584 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:37,584 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1] [2018-09-30 10:14:37,584 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:37,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:37,585 INFO L82 PathProgramCache]: Analyzing trace with hash 914748136, now seen corresponding path program 4 times [2018-09-30 10:14:37,585 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:37,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:37,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:37,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:14:37,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:37,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:38,006 WARN L178 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2018-09-30 10:14:38,100 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:38,101 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:14:38,101 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-30 10:14:38,117 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:14:38,151 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:14:38,152 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:14:38,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:14:38,174 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 8 treesize of output 7 [2018-09-30 10:14:38,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:14:38,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:14:38,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:14:38,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:14:38,478 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:14:38,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:14:38,482 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:14:38,493 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:38,518 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:14:38,518 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-09-30 10:14:38,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-30 10:14:38,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-30 10:14:38,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-09-30 10:14:38,520 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 15 states. [2018-09-30 10:14:38,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:38,664 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-09-30 10:14:38,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 10:14:38,665 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 11 [2018-09-30 10:14:38,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:38,666 INFO L225 Difference]: With dead ends: 16 [2018-09-30 10:14:38,666 INFO L226 Difference]: Without dead ends: 15 [2018-09-30 10:14:38,667 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-09-30 10:14:38,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-30 10:14:38,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-09-30 10:14:38,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-09-30 10:14:38,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-09-30 10:14:38,671 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-09-30 10:14:38,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:38,672 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-09-30 10:14:38,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-30 10:14:38,672 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-09-30 10:14:38,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 10:14:38,673 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:38,673 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1] [2018-09-30 10:14:38,673 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:38,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:38,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1395335894, now seen corresponding path program 5 times [2018-09-30 10:14:38,674 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:38,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:38,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:38,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:14:38,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:38,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:38,992 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:38,992 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:14:38,992 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-30 10:14:39,004 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:14:39,035 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-09-30 10:14:39,035 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:14:39,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:14:39,049 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 8 treesize of output 7 [2018-09-30 10:14:39,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:14:39,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:14:39,063 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:14:39,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:14:39,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:14:39,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:14:39,292 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:14:39,306 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:39,328 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:14:39,328 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-09-30 10:14:39,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 10:14:39,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 10:14:39,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-09-30 10:14:39,329 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 17 states. [2018-09-30 10:14:39,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:39,493 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-09-30 10:14:39,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 10:14:39,493 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 13 [2018-09-30 10:14:39,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:39,495 INFO L225 Difference]: With dead ends: 18 [2018-09-30 10:14:39,495 INFO L226 Difference]: Without dead ends: 17 [2018-09-30 10:14:39,496 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-09-30 10:14:39,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-30 10:14:39,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-09-30 10:14:39,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-09-30 10:14:39,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-09-30 10:14:39,500 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-09-30 10:14:39,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:39,500 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-09-30 10:14:39,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 10:14:39,500 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-09-30 10:14:39,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 10:14:39,501 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:39,501 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1] [2018-09-30 10:14:39,502 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:39,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:39,502 INFO L82 PathProgramCache]: Analyzing trace with hash -887996692, now seen corresponding path program 6 times [2018-09-30 10:14:39,502 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:39,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:39,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:39,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:14:39,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:39,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:39,865 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:39,866 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:14:39,866 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-30 10:14:39,875 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:14:39,885 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-09-30 10:14:39,885 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:14:39,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:14:39,894 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 8 treesize of output 7 [2018-09-30 10:14:39,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:14:39,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:14:39,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:14:40,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:14:40,168 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:14:40,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:14:40,178 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:14:40,197 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:40,219 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:14:40,220 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-09-30 10:14:40,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-30 10:14:40,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-30 10:14:40,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2018-09-30 10:14:40,221 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 19 states. [2018-09-30 10:14:40,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:40,566 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-09-30 10:14:40,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 10:14:40,567 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 15 [2018-09-30 10:14:40,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:40,568 INFO L225 Difference]: With dead ends: 20 [2018-09-30 10:14:40,568 INFO L226 Difference]: Without dead ends: 19 [2018-09-30 10:14:40,568 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2018-09-30 10:14:40,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-30 10:14:40,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-09-30 10:14:40,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-09-30 10:14:40,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-09-30 10:14:40,572 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-09-30 10:14:40,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:40,572 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-09-30 10:14:40,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-30 10:14:40,573 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-09-30 10:14:40,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-30 10:14:40,573 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:40,573 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1] [2018-09-30 10:14:40,574 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:40,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:40,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1333671982, now seen corresponding path program 7 times [2018-09-30 10:14:40,574 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:40,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:40,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:40,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:14:40,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:40,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:40,769 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-30 10:14:41,317 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:41,318 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:14:41,318 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-30 10:14:41,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:41,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:14:41,369 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 8 treesize of output 7 [2018-09-30 10:14:41,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:14:41,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:14:41,395 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:14:41,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:14:41,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:14:41,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:14:41,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:14:41,616 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:41,637 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:14:41,637 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-09-30 10:14:41,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-30 10:14:41,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-30 10:14:41,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-09-30 10:14:41,638 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 21 states. [2018-09-30 10:14:42,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:42,057 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-09-30 10:14:42,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 10:14:42,058 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 17 [2018-09-30 10:14:42,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:42,061 INFO L225 Difference]: With dead ends: 22 [2018-09-30 10:14:42,062 INFO L226 Difference]: Without dead ends: 21 [2018-09-30 10:14:42,062 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-09-30 10:14:42,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-09-30 10:14:42,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-09-30 10:14:42,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-09-30 10:14:42,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-09-30 10:14:42,066 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2018-09-30 10:14:42,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:42,067 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-09-30 10:14:42,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-30 10:14:42,067 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-09-30 10:14:42,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-30 10:14:42,067 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:42,068 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1] [2018-09-30 10:14:42,068 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:42,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:42,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1758521584, now seen corresponding path program 8 times [2018-09-30 10:14:42,068 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:42,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:42,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:42,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:42,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:42,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:42,505 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:42,505 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:14:42,506 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-30 10:14:42,513 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:14:42,524 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:14:42,525 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:14:42,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:14:42,532 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 8 treesize of output 7 [2018-09-30 10:14:42,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:14:42,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:14:42,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:14:43,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:14:43,155 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:14:43,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:14:43,159 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:14:43,174 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:43,196 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:14:43,196 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-09-30 10:14:43,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-30 10:14:43,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-30 10:14:43,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2018-09-30 10:14:43,198 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 23 states. [2018-09-30 10:14:43,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:43,544 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-09-30 10:14:43,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 10:14:43,545 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 19 [2018-09-30 10:14:43,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:43,546 INFO L225 Difference]: With dead ends: 24 [2018-09-30 10:14:43,546 INFO L226 Difference]: Without dead ends: 23 [2018-09-30 10:14:43,547 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2018-09-30 10:14:43,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-30 10:14:43,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-09-30 10:14:43,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-09-30 10:14:43,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-09-30 10:14:43,551 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2018-09-30 10:14:43,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:43,552 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-09-30 10:14:43,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-30 10:14:43,552 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-09-30 10:14:43,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-30 10:14:43,553 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:43,553 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1] [2018-09-30 10:14:43,553 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:43,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:43,554 INFO L82 PathProgramCache]: Analyzing trace with hash 2017095986, now seen corresponding path program 9 times [2018-09-30 10:14:43,554 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:43,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:43,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:43,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:14:43,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:43,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:43,954 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:43,955 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:14:43,955 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-30 10:14:43,964 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:14:43,994 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-09-30 10:14:43,995 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:14:43,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:14:44,001 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 8 treesize of output 7 [2018-09-30 10:14:44,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:14:44,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:14:44,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:14:44,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:14:44,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:14:44,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:14:44,282 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:14:44,299 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:44,320 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:14:44,320 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2018-09-30 10:14:44,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-30 10:14:44,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-30 10:14:44,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2018-09-30 10:14:44,322 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 25 states. [2018-09-30 10:14:44,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:44,579 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-09-30 10:14:44,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 10:14:44,580 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 21 [2018-09-30 10:14:44,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:44,581 INFO L225 Difference]: With dead ends: 26 [2018-09-30 10:14:44,581 INFO L226 Difference]: Without dead ends: 25 [2018-09-30 10:14:44,582 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2018-09-30 10:14:44,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-30 10:14:44,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-09-30 10:14:44,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-09-30 10:14:44,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-09-30 10:14:44,587 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2018-09-30 10:14:44,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:44,587 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-09-30 10:14:44,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-30 10:14:44,587 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-09-30 10:14:44,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-30 10:14:44,588 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:44,588 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1] [2018-09-30 10:14:44,589 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:44,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:44,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1398993140, now seen corresponding path program 10 times [2018-09-30 10:14:44,589 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:44,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:44,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:44,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:14:44,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:44,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:44,899 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 10:14:45,203 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:45,203 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:14:45,203 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:14:45,212 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:14:45,224 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:14:45,224 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:14:45,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:14:45,229 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 8 treesize of output 7 [2018-09-30 10:14:45,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:14:45,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:14:45,239 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:14:45,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:14:45,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:14:45,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:14:45,553 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:14:45,575 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:45,596 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:14:45,596 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2018-09-30 10:14:45,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-09-30 10:14:45,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-09-30 10:14:45,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=636, Unknown=0, NotChecked=0, Total=702 [2018-09-30 10:14:45,598 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 27 states. [2018-09-30 10:14:45,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:45,905 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-09-30 10:14:45,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 10:14:45,906 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 23 [2018-09-30 10:14:45,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:45,907 INFO L225 Difference]: With dead ends: 28 [2018-09-30 10:14:45,907 INFO L226 Difference]: Without dead ends: 27 [2018-09-30 10:14:45,908 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=636, Unknown=0, NotChecked=0, Total=702 [2018-09-30 10:14:45,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-30 10:14:45,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-09-30 10:14:45,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-30 10:14:45,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-09-30 10:14:45,913 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2018-09-30 10:14:45,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:45,914 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-09-30 10:14:45,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-09-30 10:14:45,914 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-09-30 10:14:45,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-30 10:14:45,915 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:45,915 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1] [2018-09-30 10:14:45,915 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:45,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:45,916 INFO L82 PathProgramCache]: Analyzing trace with hash 107644982, now seen corresponding path program 11 times [2018-09-30 10:14:45,916 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:45,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:45,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:45,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:14:45,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:45,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:46,178 WARN L178 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-30 10:14:46,644 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:46,644 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:14:46,644 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:14:46,651 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:14:46,712 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-09-30 10:14:46,712 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:14:46,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:14:46,717 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 8 treesize of output 7 [2018-09-30 10:14:46,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:14:46,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:14:46,726 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:14:47,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:14:47,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:14:47,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:14:47,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:14:47,223 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:47,243 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:14:47,244 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2018-09-30 10:14:47,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-30 10:14:47,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-30 10:14:47,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2018-09-30 10:14:47,245 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 29 states. [2018-09-30 10:14:47,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:47,696 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-09-30 10:14:47,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 10:14:47,697 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 25 [2018-09-30 10:14:47,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:47,698 INFO L225 Difference]: With dead ends: 30 [2018-09-30 10:14:47,698 INFO L226 Difference]: Without dead ends: 29 [2018-09-30 10:14:47,698 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2018-09-30 10:14:47,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-30 10:14:47,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-09-30 10:14:47,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-09-30 10:14:47,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-09-30 10:14:47,703 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2018-09-30 10:14:47,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:47,704 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-09-30 10:14:47,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-30 10:14:47,704 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-09-30 10:14:47,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-09-30 10:14:47,705 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:47,705 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 1, 1] [2018-09-30 10:14:47,705 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:47,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:47,705 INFO L82 PathProgramCache]: Analyzing trace with hash 367613688, now seen corresponding path program 12 times [2018-09-30 10:14:47,706 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:47,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:47,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:47,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:14:47,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:48,550 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:48,550 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:14:48,550 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:14:48,565 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:14:48,597 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-09-30 10:14:48,597 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:14:48,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:14:48,608 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 8 treesize of output 7 [2018-09-30 10:14:48,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:14:48,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:14:48,616 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:14:48,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:14:48,981 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:14:48,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:14:48,994 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:14:49,013 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:49,033 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:14:49,033 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2018-09-30 10:14:49,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-30 10:14:49,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-30 10:14:49,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=854, Unknown=0, NotChecked=0, Total=930 [2018-09-30 10:14:49,034 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 31 states. [2018-09-30 10:14:49,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:49,588 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-09-30 10:14:49,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 10:14:49,589 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 27 [2018-09-30 10:14:49,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:49,589 INFO L225 Difference]: With dead ends: 32 [2018-09-30 10:14:49,590 INFO L226 Difference]: Without dead ends: 31 [2018-09-30 10:14:49,590 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=76, Invalid=854, Unknown=0, NotChecked=0, Total=930 [2018-09-30 10:14:49,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-30 10:14:49,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-09-30 10:14:49,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-30 10:14:49,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-09-30 10:14:49,595 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2018-09-30 10:14:49,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:49,596 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-09-30 10:14:49,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-30 10:14:49,596 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-09-30 10:14:49,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-30 10:14:49,596 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:49,597 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 1, 1] [2018-09-30 10:14:49,597 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:49,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:49,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1089436986, now seen corresponding path program 13 times [2018-09-30 10:14:49,597 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:49,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:49,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:49,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:14:49,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:50,215 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:50,215 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:14:50,215 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:14:50,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:50,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:14:50,248 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 8 treesize of output 7 [2018-09-30 10:14:50,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:14:50,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:14:50,253 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:14:50,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:14:50,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:14:50,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:14:50,666 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:14:50,686 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:50,706 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:14:50,707 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2018-09-30 10:14:50,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-09-30 10:14:50,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-09-30 10:14:50,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=975, Unknown=0, NotChecked=0, Total=1056 [2018-09-30 10:14:50,708 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 33 states. [2018-09-30 10:14:51,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:51,554 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-09-30 10:14:51,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-30 10:14:51,555 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 29 [2018-09-30 10:14:51,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:51,556 INFO L225 Difference]: With dead ends: 34 [2018-09-30 10:14:51,556 INFO L226 Difference]: Without dead ends: 33 [2018-09-30 10:14:51,557 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=975, Unknown=0, NotChecked=0, Total=1056 [2018-09-30 10:14:51,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-30 10:14:51,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-09-30 10:14:51,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-09-30 10:14:51,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-09-30 10:14:51,563 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2018-09-30 10:14:51,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:51,563 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-09-30 10:14:51,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-09-30 10:14:51,564 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-09-30 10:14:51,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-09-30 10:14:51,564 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:51,564 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 1, 1] [2018-09-30 10:14:51,565 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:51,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:51,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1023075588, now seen corresponding path program 14 times [2018-09-30 10:14:51,565 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:51,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:51,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:51,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:14:51,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:51,811 WARN L178 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 10:14:52,047 WARN L178 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-30 10:14:52,317 WARN L178 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 10:14:52,553 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 10:14:53,036 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:53,037 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:14:53,037 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:14:53,055 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:14:53,068 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:14:53,069 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:14:53,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:14:53,076 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 8 treesize of output 7 [2018-09-30 10:14:53,076 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:14:53,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:14:53,090 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:14:53,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:14:53,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:14:53,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:14:53,728 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:14:53,762 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:53,784 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:14:53,784 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2018-09-30 10:14:53,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-30 10:14:53,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-30 10:14:53,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1104, Unknown=0, NotChecked=0, Total=1190 [2018-09-30 10:14:53,785 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 35 states. [2018-09-30 10:14:54,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:54,294 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-09-30 10:14:54,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-30 10:14:54,295 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 31 [2018-09-30 10:14:54,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:54,296 INFO L225 Difference]: With dead ends: 36 [2018-09-30 10:14:54,296 INFO L226 Difference]: Without dead ends: 35 [2018-09-30 10:14:54,297 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=86, Invalid=1104, Unknown=0, NotChecked=0, Total=1190 [2018-09-30 10:14:54,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-30 10:14:54,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-09-30 10:14:54,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-09-30 10:14:54,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-09-30 10:14:54,302 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2018-09-30 10:14:54,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:54,302 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-09-30 10:14:54,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-30 10:14:54,302 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-09-30 10:14:54,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-09-30 10:14:54,303 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:54,303 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 1, 1] [2018-09-30 10:14:54,303 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:54,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:54,304 INFO L82 PathProgramCache]: Analyzing trace with hash 371871806, now seen corresponding path program 15 times [2018-09-30 10:14:54,304 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:54,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:54,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:54,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:14:54,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:54,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:54,865 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:54,866 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:14:54,866 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:14:54,874 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:14:54,894 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-09-30 10:14:54,895 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:14:54,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:14:54,917 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 8 treesize of output 7 [2018-09-30 10:14:54,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:14:54,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:14:54,923 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:14:55,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:14:55,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:14:55,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:14:55,615 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:14:55,638 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:55,658 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:14:55,659 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2018-09-30 10:14:55,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-09-30 10:14:55,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-09-30 10:14:55,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1241, Unknown=0, NotChecked=0, Total=1332 [2018-09-30 10:14:55,660 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 37 states. [2018-09-30 10:14:56,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:56,357 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-09-30 10:14:56,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-30 10:14:56,358 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 33 [2018-09-30 10:14:56,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:56,358 INFO L225 Difference]: With dead ends: 38 [2018-09-30 10:14:56,359 INFO L226 Difference]: Without dead ends: 37 [2018-09-30 10:14:56,360 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=91, Invalid=1241, Unknown=0, NotChecked=0, Total=1332 [2018-09-30 10:14:56,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-30 10:14:56,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-09-30 10:14:56,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-30 10:14:56,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-09-30 10:14:56,364 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2018-09-30 10:14:56,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:56,364 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-09-30 10:14:56,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-09-30 10:14:56,365 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-09-30 10:14:56,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-30 10:14:56,365 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:56,365 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 1, 1] [2018-09-30 10:14:56,366 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:56,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:56,366 INFO L82 PathProgramCache]: Analyzing trace with hash 886521088, now seen corresponding path program 16 times [2018-09-30 10:14:56,366 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:56,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:56,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:56,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:14:56,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:56,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:57,011 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:57,011 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:14:57,011 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:14:57,019 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:14:57,030 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:14:57,030 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:14:57,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:14:57,035 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 8 treesize of output 7 [2018-09-30 10:14:57,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:14:57,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:14:57,043 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:14:57,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:14:57,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:14:57,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:14:57,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:14:57,599 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:14:57,620 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:14:57,620 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2018-09-30 10:14:57,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-09-30 10:14:57,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-09-30 10:14:57,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1386, Unknown=0, NotChecked=0, Total=1482 [2018-09-30 10:14:57,622 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 39 states. [2018-09-30 10:14:58,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:14:58,584 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-09-30 10:14:58,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 10:14:58,584 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 35 [2018-09-30 10:14:58,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:14:58,585 INFO L225 Difference]: With dead ends: 40 [2018-09-30 10:14:58,585 INFO L226 Difference]: Without dead ends: 39 [2018-09-30 10:14:58,586 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=96, Invalid=1386, Unknown=0, NotChecked=0, Total=1482 [2018-09-30 10:14:58,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-30 10:14:58,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-09-30 10:14:58,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-09-30 10:14:58,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-09-30 10:14:58,592 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2018-09-30 10:14:58,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:14:58,593 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-09-30 10:14:58,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-09-30 10:14:58,593 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-09-30 10:14:58,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-09-30 10:14:58,593 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:14:58,594 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 1, 1] [2018-09-30 10:14:58,594 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:14:58,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:14:58,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1543242050, now seen corresponding path program 17 times [2018-09-30 10:14:58,594 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:14:58,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:14:58,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:58,595 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:14:58,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:14:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:14:58,882 WARN L178 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-30 10:14:59,148 WARN L178 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 10:14:59,434 WARN L178 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-30 10:15:00,394 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:00,394 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:15:00,394 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:15:00,402 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:15:00,425 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-09-30 10:15:00,425 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:15:00,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:15:00,430 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 8 treesize of output 7 [2018-09-30 10:15:00,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:15:00,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:15:00,442 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:15:01,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:15:01,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:15:01,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:15:01,011 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:15:01,039 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:01,060 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:15:01,060 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2018-09-30 10:15:01,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-30 10:15:01,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-30 10:15:01,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1539, Unknown=0, NotChecked=0, Total=1640 [2018-09-30 10:15:01,061 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 41 states. [2018-09-30 10:15:01,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:01,811 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-09-30 10:15:01,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-30 10:15:01,811 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 37 [2018-09-30 10:15:01,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:01,812 INFO L225 Difference]: With dead ends: 42 [2018-09-30 10:15:01,812 INFO L226 Difference]: Without dead ends: 41 [2018-09-30 10:15:01,813 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=101, Invalid=1539, Unknown=0, NotChecked=0, Total=1640 [2018-09-30 10:15:01,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-30 10:15:01,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-09-30 10:15:01,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-09-30 10:15:01,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-09-30 10:15:01,819 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2018-09-30 10:15:01,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:01,819 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-09-30 10:15:01,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-30 10:15:01,819 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-09-30 10:15:01,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-09-30 10:15:01,820 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:01,820 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 1, 1] [2018-09-30 10:15:01,820 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:01,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:01,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1291894020, now seen corresponding path program 18 times [2018-09-30 10:15:01,821 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:01,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:01,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:01,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:15:01,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:01,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:02,600 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:02,601 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:15:02,601 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:15:02,609 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:15:02,629 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-09-30 10:15:02,629 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:15:02,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:15:02,642 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 8 treesize of output 7 [2018-09-30 10:15:02,643 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:15:02,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:15:02,650 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:15:03,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:15:03,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:15:03,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:15:03,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:15:03,916 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:03,936 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:15:03,936 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2018-09-30 10:15:03,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-09-30 10:15:03,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-09-30 10:15:03,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1700, Unknown=0, NotChecked=0, Total=1806 [2018-09-30 10:15:03,938 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 43 states. [2018-09-30 10:15:04,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:04,849 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-09-30 10:15:04,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 10:15:04,850 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 39 [2018-09-30 10:15:04,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:04,850 INFO L225 Difference]: With dead ends: 44 [2018-09-30 10:15:04,851 INFO L226 Difference]: Without dead ends: 43 [2018-09-30 10:15:04,852 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=106, Invalid=1700, Unknown=0, NotChecked=0, Total=1806 [2018-09-30 10:15:04,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-09-30 10:15:04,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-09-30 10:15:04,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-09-30 10:15:04,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-09-30 10:15:04,856 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2018-09-30 10:15:04,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:04,856 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-09-30 10:15:04,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-09-30 10:15:04,856 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-09-30 10:15:04,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-30 10:15:04,857 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:04,857 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 1, 1] [2018-09-30 10:15:04,857 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:04,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:04,857 INFO L82 PathProgramCache]: Analyzing trace with hash 264605766, now seen corresponding path program 19 times [2018-09-30 10:15:04,858 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:04,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:04,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:04,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:15:04,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:05,009 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 10:15:05,599 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:05,599 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:15:05,599 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:15:05,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:05,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:05,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:15:05,627 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 8 treesize of output 7 [2018-09-30 10:15:05,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:15:05,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:15:05,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:15:06,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:15:06,570 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:15:06,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:15:06,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:15:06,605 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:06,625 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:15:06,625 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 43 [2018-09-30 10:15:06,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-09-30 10:15:06,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-09-30 10:15:06,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1869, Unknown=0, NotChecked=0, Total=1980 [2018-09-30 10:15:06,626 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 45 states. [2018-09-30 10:15:07,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:07,501 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-09-30 10:15:07,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 10:15:07,502 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 41 [2018-09-30 10:15:07,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:07,503 INFO L225 Difference]: With dead ends: 46 [2018-09-30 10:15:07,503 INFO L226 Difference]: Without dead ends: 45 [2018-09-30 10:15:07,504 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=111, Invalid=1869, Unknown=0, NotChecked=0, Total=1980 [2018-09-30 10:15:07,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-09-30 10:15:07,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-09-30 10:15:07,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-09-30 10:15:07,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-09-30 10:15:07,510 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2018-09-30 10:15:07,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:07,511 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-09-30 10:15:07,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-09-30 10:15:07,511 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-09-30 10:15:07,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-30 10:15:07,511 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:07,512 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 1, 1] [2018-09-30 10:15:07,512 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:07,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:07,512 INFO L82 PathProgramCache]: Analyzing trace with hash 883071752, now seen corresponding path program 20 times [2018-09-30 10:15:07,512 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:07,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:07,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:07,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:07,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:07,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:07,694 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 10:15:08,529 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:08,529 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:15:08,529 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:15:08,543 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:15:08,560 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:15:08,560 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:15:08,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:15:08,566 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 8 treesize of output 7 [2018-09-30 10:15:08,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:15:08,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:15:08,573 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:15:09,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:15:09,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:15:09,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:15:09,622 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:15:09,653 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:09,676 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:15:09,676 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 45 [2018-09-30 10:15:09,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-30 10:15:09,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-30 10:15:09,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=2046, Unknown=0, NotChecked=0, Total=2162 [2018-09-30 10:15:09,677 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 47 states. [2018-09-30 10:15:10,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:10,888 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-09-30 10:15:10,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-30 10:15:10,889 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 43 [2018-09-30 10:15:10,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:10,889 INFO L225 Difference]: With dead ends: 48 [2018-09-30 10:15:10,890 INFO L226 Difference]: Without dead ends: 47 [2018-09-30 10:15:10,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=116, Invalid=2046, Unknown=0, NotChecked=0, Total=2162 [2018-09-30 10:15:10,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-30 10:15:10,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-09-30 10:15:10,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-30 10:15:10,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-09-30 10:15:10,897 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2018-09-30 10:15:10,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:10,897 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-09-30 10:15:10,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-30 10:15:10,897 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-09-30 10:15:10,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-30 10:15:10,898 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:10,898 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 1, 1] [2018-09-30 10:15:10,899 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:10,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:10,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1771569846, now seen corresponding path program 21 times [2018-09-30 10:15:10,899 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:10,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:10,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:10,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:15:10,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:10,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:11,745 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 18 [2018-09-30 10:15:11,883 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:11,884 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:15:11,884 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:15:11,892 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:15:11,920 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-09-30 10:15:11,921 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:15:11,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:15:11,932 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 8 treesize of output 7 [2018-09-30 10:15:11,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:15:11,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:15:11,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:15:13,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:15:13,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:15:13,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:15:13,015 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:15:13,064 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:13,084 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:15:13,085 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2018-09-30 10:15:13,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-09-30 10:15:13,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-09-30 10:15:13,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=2231, Unknown=0, NotChecked=0, Total=2352 [2018-09-30 10:15:13,086 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 49 states. [2018-09-30 10:15:14,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:14,666 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-09-30 10:15:14,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-30 10:15:14,669 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 45 [2018-09-30 10:15:14,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:14,669 INFO L225 Difference]: With dead ends: 50 [2018-09-30 10:15:14,669 INFO L226 Difference]: Without dead ends: 49 [2018-09-30 10:15:14,670 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=121, Invalid=2231, Unknown=0, NotChecked=0, Total=2352 [2018-09-30 10:15:14,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-30 10:15:14,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-09-30 10:15:14,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-09-30 10:15:14,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-09-30 10:15:14,674 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2018-09-30 10:15:14,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:14,675 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-09-30 10:15:14,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-09-30 10:15:14,675 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-09-30 10:15:14,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-09-30 10:15:14,676 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:14,676 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 1, 1] [2018-09-30 10:15:14,676 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:14,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:14,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1671571700, now seen corresponding path program 22 times [2018-09-30 10:15:14,676 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:14,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:14,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:14,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:15:14,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:15,538 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:15,538 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:15:15,538 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:15:15,546 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:15:15,562 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:15:15,563 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:15:15,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:15:15,568 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 8 treesize of output 7 [2018-09-30 10:15:15,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:15:15,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:15:15,577 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:15:17,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:15:17,030 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:15:17,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:15:17,034 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:15:17,067 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:17,087 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:15:17,088 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 49 [2018-09-30 10:15:17,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-09-30 10:15:17,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-09-30 10:15:17,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=2424, Unknown=0, NotChecked=0, Total=2550 [2018-09-30 10:15:17,089 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 51 states. [2018-09-30 10:15:18,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:18,613 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-09-30 10:15:18,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-30 10:15:18,614 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 47 [2018-09-30 10:15:18,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:18,614 INFO L225 Difference]: With dead ends: 52 [2018-09-30 10:15:18,615 INFO L226 Difference]: Without dead ends: 51 [2018-09-30 10:15:18,616 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=126, Invalid=2424, Unknown=0, NotChecked=0, Total=2550 [2018-09-30 10:15:18,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-30 10:15:18,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-09-30 10:15:18,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-09-30 10:15:18,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-09-30 10:15:18,621 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2018-09-30 10:15:18,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:18,621 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-09-30 10:15:18,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-09-30 10:15:18,621 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-09-30 10:15:18,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-09-30 10:15:18,622 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:18,622 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 1, 1] [2018-09-30 10:15:18,622 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:18,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:18,623 INFO L82 PathProgramCache]: Analyzing trace with hash -62633906, now seen corresponding path program 23 times [2018-09-30 10:15:18,623 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:18,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:18,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:18,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:15:18,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:18,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:18,808 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-30 10:15:19,531 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:19,532 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:15:19,532 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:15:19,538 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:15:19,571 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-09-30 10:15:19,571 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:15:19,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:15:19,576 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 8 treesize of output 7 [2018-09-30 10:15:19,576 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:15:19,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:15:19,582 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:15:20,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:15:20,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:15:20,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:15:20,571 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:15:20,609 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:20,628 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:15:20,629 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 51 [2018-09-30 10:15:20,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-30 10:15:20,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-30 10:15:20,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=2625, Unknown=0, NotChecked=0, Total=2756 [2018-09-30 10:15:20,630 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 53 states. [2018-09-30 10:15:21,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:21,811 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-09-30 10:15:21,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-30 10:15:21,816 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 49 [2018-09-30 10:15:21,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:21,817 INFO L225 Difference]: With dead ends: 54 [2018-09-30 10:15:21,817 INFO L226 Difference]: Without dead ends: 53 [2018-09-30 10:15:21,818 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=131, Invalid=2625, Unknown=0, NotChecked=0, Total=2756 [2018-09-30 10:15:21,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-30 10:15:21,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-09-30 10:15:21,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-30 10:15:21,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-09-30 10:15:21,822 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2018-09-30 10:15:21,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:21,822 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-09-30 10:15:21,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-30 10:15:21,822 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-09-30 10:15:21,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-09-30 10:15:21,823 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:21,823 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 1, 1] [2018-09-30 10:15:21,823 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:21,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:21,824 INFO L82 PathProgramCache]: Analyzing trace with hash -61640432, now seen corresponding path program 24 times [2018-09-30 10:15:21,824 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:21,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:21,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:21,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:15:21,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:22,088 WARN L178 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-30 10:15:23,057 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:23,058 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:15:23,058 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:15:23,064 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:15:23,094 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-09-30 10:15:23,094 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:15:23,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:15:23,099 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 8 treesize of output 7 [2018-09-30 10:15:23,099 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:15:23,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:15:23,113 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:15:24,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:15:24,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:15:24,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:15:24,401 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:15:24,439 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:24,459 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:15:24,459 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 53 [2018-09-30 10:15:24,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-09-30 10:15:24,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-09-30 10:15:24,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=2834, Unknown=0, NotChecked=0, Total=2970 [2018-09-30 10:15:24,461 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 55 states. [2018-09-30 10:15:25,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:25,652 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-09-30 10:15:25,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-30 10:15:25,653 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 51 [2018-09-30 10:15:25,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:25,654 INFO L225 Difference]: With dead ends: 56 [2018-09-30 10:15:25,654 INFO L226 Difference]: Without dead ends: 55 [2018-09-30 10:15:25,655 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=136, Invalid=2834, Unknown=0, NotChecked=0, Total=2970 [2018-09-30 10:15:25,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-30 10:15:25,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-09-30 10:15:25,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-09-30 10:15:25,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-09-30 10:15:25,661 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2018-09-30 10:15:25,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:25,661 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-09-30 10:15:25,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-09-30 10:15:25,661 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-09-30 10:15:25,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-30 10:15:25,662 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:25,662 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 1, 1] [2018-09-30 10:15:25,662 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:25,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:25,662 INFO L82 PathProgramCache]: Analyzing trace with hash 893088082, now seen corresponding path program 25 times [2018-09-30 10:15:25,663 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:25,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:25,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:25,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:15:25,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:25,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:25,856 WARN L178 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 10:15:26,811 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:26,812 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:15:26,812 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:15:26,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:26,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:26,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:15:26,869 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 8 treesize of output 7 [2018-09-30 10:15:26,869 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:15:26,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:15:26,884 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:15:27,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:15:27,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:15:27,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:15:27,970 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:15:28,009 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:28,029 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:15:28,029 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 55 [2018-09-30 10:15:28,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-09-30 10:15:28,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-09-30 10:15:28,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=3051, Unknown=0, NotChecked=0, Total=3192 [2018-09-30 10:15:28,030 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 57 states. [2018-09-30 10:15:29,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:29,400 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-09-30 10:15:29,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-30 10:15:29,401 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 53 [2018-09-30 10:15:29,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:29,402 INFO L225 Difference]: With dead ends: 58 [2018-09-30 10:15:29,402 INFO L226 Difference]: Without dead ends: 57 [2018-09-30 10:15:29,403 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=141, Invalid=3051, Unknown=0, NotChecked=0, Total=3192 [2018-09-30 10:15:29,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-30 10:15:29,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-09-30 10:15:29,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-09-30 10:15:29,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-09-30 10:15:29,408 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2018-09-30 10:15:29,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:29,408 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-09-30 10:15:29,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-09-30 10:15:29,408 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-09-30 10:15:29,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-09-30 10:15:29,409 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:29,409 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 1, 1] [2018-09-30 10:15:29,409 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:29,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:29,410 INFO L82 PathProgramCache]: Analyzing trace with hash -735811308, now seen corresponding path program 26 times [2018-09-30 10:15:29,410 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:29,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:29,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:29,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:29,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:29,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:29,640 WARN L178 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-30 10:15:30,572 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:30,573 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:15:30,573 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:15:30,581 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:15:30,597 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:15:30,597 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:15:30,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:15:30,602 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 8 treesize of output 7 [2018-09-30 10:15:30,602 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:15:30,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:15:30,610 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:15:31,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:15:31,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:15:31,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:15:31,745 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:15:31,785 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:31,805 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:15:31,806 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 57 [2018-09-30 10:15:31,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-09-30 10:15:31,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-09-30 10:15:31,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=3276, Unknown=0, NotChecked=0, Total=3422 [2018-09-30 10:15:31,807 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 59 states. [2018-09-30 10:15:33,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:33,050 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-09-30 10:15:33,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-30 10:15:33,051 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 55 [2018-09-30 10:15:33,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:33,051 INFO L225 Difference]: With dead ends: 60 [2018-09-30 10:15:33,052 INFO L226 Difference]: Without dead ends: 59 [2018-09-30 10:15:33,053 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=146, Invalid=3276, Unknown=0, NotChecked=0, Total=3422 [2018-09-30 10:15:33,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-30 10:15:33,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-09-30 10:15:33,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-09-30 10:15:33,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-09-30 10:15:33,057 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2018-09-30 10:15:33,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:33,057 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-09-30 10:15:33,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-09-30 10:15:33,057 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-09-30 10:15:33,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-09-30 10:15:33,058 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:33,058 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 1, 1] [2018-09-30 10:15:33,058 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:33,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:33,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1554937942, now seen corresponding path program 27 times [2018-09-30 10:15:33,058 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:33,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:33,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:33,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:15:33,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:33,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:33,310 WARN L178 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-30 10:15:33,571 WARN L178 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 10:15:33,836 WARN L178 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-30 10:15:34,132 WARN L178 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-30 10:15:34,449 WARN L178 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-30 10:15:35,475 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:35,475 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:15:35,475 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:15:35,484 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:15:35,520 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-09-30 10:15:35,520 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:15:35,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:15:35,525 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 8 treesize of output 7 [2018-09-30 10:15:35,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:15:35,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:15:35,531 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:15:36,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:15:36,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:15:36,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:15:36,767 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:15:36,809 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:36,829 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:15:36,829 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 59 [2018-09-30 10:15:36,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-09-30 10:15:36,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-09-30 10:15:36,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=3509, Unknown=0, NotChecked=0, Total=3660 [2018-09-30 10:15:36,830 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 61 states. [2018-09-30 10:15:38,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:38,236 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-09-30 10:15:38,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-30 10:15:38,237 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 57 [2018-09-30 10:15:38,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:38,238 INFO L225 Difference]: With dead ends: 62 [2018-09-30 10:15:38,238 INFO L226 Difference]: Without dead ends: 61 [2018-09-30 10:15:38,239 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=151, Invalid=3509, Unknown=0, NotChecked=0, Total=3660 [2018-09-30 10:15:38,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-30 10:15:38,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-09-30 10:15:38,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-09-30 10:15:38,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-09-30 10:15:38,243 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2018-09-30 10:15:38,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:38,244 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-09-30 10:15:38,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-09-30 10:15:38,244 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-09-30 10:15:38,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-09-30 10:15:38,245 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:38,245 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 1, 1] [2018-09-30 10:15:38,245 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:38,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:38,245 INFO L82 PathProgramCache]: Analyzing trace with hash -353255656, now seen corresponding path program 28 times [2018-09-30 10:15:38,245 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:38,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:38,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:38,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:15:38,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:39,521 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:39,522 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:15:39,522 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-09-30 10:15:39,531 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:15:39,547 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:15:39,547 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:15:39,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:15:39,552 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 8 treesize of output 7 [2018-09-30 10:15:39,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:15:39,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:15:39,558 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:15:40,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:15:40,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:15:40,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:15:40,871 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:15:40,932 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:40,951 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:15:40,952 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 61 [2018-09-30 10:15:40,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-09-30 10:15:40,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-09-30 10:15:40,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=3750, Unknown=0, NotChecked=0, Total=3906 [2018-09-30 10:15:40,953 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 63 states. [2018-09-30 10:15:42,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:42,715 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-09-30 10:15:42,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-30 10:15:42,715 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 59 [2018-09-30 10:15:42,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:42,716 INFO L225 Difference]: With dead ends: 64 [2018-09-30 10:15:42,716 INFO L226 Difference]: Without dead ends: 63 [2018-09-30 10:15:42,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=156, Invalid=3750, Unknown=0, NotChecked=0, Total=3906 [2018-09-30 10:15:42,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-30 10:15:42,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2018-09-30 10:15:42,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-09-30 10:15:42,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-09-30 10:15:42,721 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2018-09-30 10:15:42,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:42,722 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-09-30 10:15:42,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-09-30 10:15:42,722 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-09-30 10:15:42,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-30 10:15:42,722 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:42,722 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 1, 1] [2018-09-30 10:15:42,723 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:42,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:42,723 INFO L82 PathProgramCache]: Analyzing trace with hash -176267942, now seen corresponding path program 29 times [2018-09-30 10:15:42,723 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:42,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:42,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:42,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:15:42,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:42,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:43,875 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:43,875 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:15:43,875 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:15:43,890 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:15:43,920 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-09-30 10:15:43,920 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:15:43,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:15:43,925 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 8 treesize of output 7 [2018-09-30 10:15:43,925 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:15:43,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:15:43,932 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:15:45,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:15:45,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:15:45,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:15:45,587 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:15:45,632 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:45,653 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:15:45,654 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 63 [2018-09-30 10:15:45,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-09-30 10:15:45,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-09-30 10:15:45,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=3999, Unknown=0, NotChecked=0, Total=4160 [2018-09-30 10:15:45,655 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 65 states. [2018-09-30 10:15:47,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:47,967 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-09-30 10:15:47,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-30 10:15:47,967 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 61 [2018-09-30 10:15:47,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:47,968 INFO L225 Difference]: With dead ends: 66 [2018-09-30 10:15:47,968 INFO L226 Difference]: Without dead ends: 65 [2018-09-30 10:15:47,970 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=161, Invalid=3999, Unknown=0, NotChecked=0, Total=4160 [2018-09-30 10:15:47,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-09-30 10:15:47,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-09-30 10:15:47,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-30 10:15:47,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-09-30 10:15:47,973 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2018-09-30 10:15:47,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:47,974 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-09-30 10:15:47,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-09-30 10:15:47,974 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-09-30 10:15:47,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-09-30 10:15:47,974 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:47,974 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 1, 1] [2018-09-30 10:15:47,975 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:47,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:47,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1889766628, now seen corresponding path program 30 times [2018-09-30 10:15:47,975 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:47,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:47,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:47,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:15:47,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:47,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:49,189 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:49,190 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:15:49,190 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:15:49,199 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:15:49,243 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-09-30 10:15:49,244 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:15:49,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:15:49,267 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 8 treesize of output 7 [2018-09-30 10:15:49,267 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:15:49,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:15:49,281 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:15:51,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:15:51,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:15:51,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:15:51,012 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:15:51,059 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:51,079 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:15:51,079 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 65 [2018-09-30 10:15:51,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-09-30 10:15:51,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-09-30 10:15:51,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=4256, Unknown=0, NotChecked=0, Total=4422 [2018-09-30 10:15:51,080 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 67 states. [2018-09-30 10:15:52,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:52,771 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-09-30 10:15:52,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-30 10:15:52,771 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 63 [2018-09-30 10:15:52,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:52,772 INFO L225 Difference]: With dead ends: 68 [2018-09-30 10:15:52,773 INFO L226 Difference]: Without dead ends: 67 [2018-09-30 10:15:52,774 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=166, Invalid=4256, Unknown=0, NotChecked=0, Total=4422 [2018-09-30 10:15:52,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-30 10:15:52,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-09-30 10:15:52,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-09-30 10:15:52,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-09-30 10:15:52,778 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2018-09-30 10:15:52,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:52,778 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-09-30 10:15:52,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-09-30 10:15:52,779 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-09-30 10:15:52,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-09-30 10:15:52,779 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:52,779 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 1, 1] [2018-09-30 10:15:52,779 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:52,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:52,780 INFO L82 PathProgramCache]: Analyzing trace with hash 705437790, now seen corresponding path program 31 times [2018-09-30 10:15:52,780 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:52,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:52,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:52,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:15:52,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:52,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:54,037 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:54,037 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:15:54,038 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:15:54,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:54,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:15:54,074 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 8 treesize of output 7 [2018-09-30 10:15:54,074 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:15:54,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:15:54,080 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:15:55,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:15:55,939 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:15:55,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:15:55,944 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:15:55,992 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:15:56,011 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:15:56,012 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 67 [2018-09-30 10:15:56,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-09-30 10:15:56,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-09-30 10:15:56,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=4521, Unknown=0, NotChecked=0, Total=4692 [2018-09-30 10:15:56,013 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 69 states. [2018-09-30 10:15:58,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:15:58,569 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-09-30 10:15:58,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-30 10:15:58,569 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 65 [2018-09-30 10:15:58,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:15:58,570 INFO L225 Difference]: With dead ends: 70 [2018-09-30 10:15:58,570 INFO L226 Difference]: Without dead ends: 69 [2018-09-30 10:15:58,572 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=171, Invalid=4521, Unknown=0, NotChecked=0, Total=4692 [2018-09-30 10:15:58,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-30 10:15:58,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-09-30 10:15:58,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-09-30 10:15:58,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-09-30 10:15:58,577 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2018-09-30 10:15:58,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:15:58,577 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-09-30 10:15:58,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-09-30 10:15:58,577 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-09-30 10:15:58,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-09-30 10:15:58,578 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:15:58,578 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 1, 1] [2018-09-30 10:15:58,578 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:15:58,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:15:58,578 INFO L82 PathProgramCache]: Analyzing trace with hash -679115488, now seen corresponding path program 32 times [2018-09-30 10:15:58,579 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:15:58,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:15:58,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:58,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:15:58,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:15:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:15:58,808 WARN L178 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 10:15:59,024 WARN L178 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-30 10:16:00,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:00,517 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:16:00,517 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:16:00,524 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:16:00,546 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:16:00,546 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:16:00,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:16:00,550 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 8 treesize of output 7 [2018-09-30 10:16:00,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:16:00,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:16:00,560 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:16:03,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:16:03,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:16:03,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:16:03,533 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:16:03,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:03,605 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:16:03,605 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 69 [2018-09-30 10:16:03,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-09-30 10:16:03,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-09-30 10:16:03,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=4794, Unknown=0, NotChecked=0, Total=4970 [2018-09-30 10:16:03,606 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 71 states. [2018-09-30 10:16:06,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:06,018 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-09-30 10:16:06,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-30 10:16:06,018 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 67 [2018-09-30 10:16:06,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:06,019 INFO L225 Difference]: With dead ends: 72 [2018-09-30 10:16:06,019 INFO L226 Difference]: Without dead ends: 71 [2018-09-30 10:16:06,020 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=176, Invalid=4794, Unknown=0, NotChecked=0, Total=4970 [2018-09-30 10:16:06,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-09-30 10:16:06,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2018-09-30 10:16:06,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-09-30 10:16:06,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-09-30 10:16:06,025 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2018-09-30 10:16:06,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:06,025 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-09-30 10:16:06,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-09-30 10:16:06,026 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-09-30 10:16:06,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-09-30 10:16:06,026 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:06,026 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 1, 1] [2018-09-30 10:16:06,026 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:06,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:06,027 INFO L82 PathProgramCache]: Analyzing trace with hash 205046114, now seen corresponding path program 33 times [2018-09-30 10:16:06,027 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:06,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:06,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:06,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:16:06,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:06,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:07,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:07,395 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:16:07,395 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:16:07,402 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:16:07,448 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-09-30 10:16:07,448 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:16:07,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:16:07,460 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 8 treesize of output 7 [2018-09-30 10:16:07,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:16:07,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:16:07,475 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:16:09,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:16:09,212 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:16:09,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:16:09,215 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:16:09,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:09,286 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:16:09,286 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 71 [2018-09-30 10:16:09,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-09-30 10:16:09,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-09-30 10:16:09,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=5075, Unknown=0, NotChecked=0, Total=5256 [2018-09-30 10:16:09,287 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 73 states. [2018-09-30 10:16:11,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:11,519 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-09-30 10:16:11,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-30 10:16:11,519 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 69 [2018-09-30 10:16:11,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:11,520 INFO L225 Difference]: With dead ends: 74 [2018-09-30 10:16:11,520 INFO L226 Difference]: Without dead ends: 73 [2018-09-30 10:16:11,521 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=181, Invalid=5075, Unknown=0, NotChecked=0, Total=5256 [2018-09-30 10:16:11,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-09-30 10:16:11,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-09-30 10:16:11,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-09-30 10:16:11,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-09-30 10:16:11,525 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 69 [2018-09-30 10:16:11,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:11,525 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-09-30 10:16:11,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-09-30 10:16:11,525 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-09-30 10:16:11,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-30 10:16:11,526 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:11,526 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 1, 1] [2018-09-30 10:16:11,526 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:11,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:11,526 INFO L82 PathProgramCache]: Analyzing trace with hash -519178972, now seen corresponding path program 34 times [2018-09-30 10:16:11,526 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:11,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:11,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:11,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:16:11,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:11,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:11,788 WARN L178 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 10:16:12,022 WARN L178 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-30 10:16:13,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:13,426 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:16:13,426 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:16:13,434 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:16:13,456 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:16:13,457 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:16:13,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:16:13,461 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 8 treesize of output 7 [2018-09-30 10:16:13,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:16:13,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:16:13,467 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:16:15,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:16:15,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:16:15,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:16:15,519 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:16:15,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:15,596 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:16:15,596 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 73 [2018-09-30 10:16:15,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-09-30 10:16:15,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-09-30 10:16:15,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=5364, Unknown=0, NotChecked=0, Total=5550 [2018-09-30 10:16:15,597 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 75 states. [2018-09-30 10:16:18,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:18,056 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-09-30 10:16:18,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-30 10:16:18,064 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 71 [2018-09-30 10:16:18,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:18,065 INFO L225 Difference]: With dead ends: 76 [2018-09-30 10:16:18,065 INFO L226 Difference]: Without dead ends: 75 [2018-09-30 10:16:18,065 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=186, Invalid=5364, Unknown=0, NotChecked=0, Total=5550 [2018-09-30 10:16:18,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-30 10:16:18,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-09-30 10:16:18,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-09-30 10:16:18,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-09-30 10:16:18,069 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 71 [2018-09-30 10:16:18,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:18,069 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-09-30 10:16:18,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-09-30 10:16:18,069 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-09-30 10:16:18,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-09-30 10:16:18,070 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:18,070 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 1, 1] [2018-09-30 10:16:18,070 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:18,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:18,071 INFO L82 PathProgramCache]: Analyzing trace with hash -714784666, now seen corresponding path program 35 times [2018-09-30 10:16:18,071 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:18,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:18,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:18,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:16:18,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:18,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:18,346 WARN L178 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-30 10:16:19,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:19,858 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:16:19,858 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:16:19,865 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:16:20,181 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-09-30 10:16:20,181 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:16:20,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:16:20,189 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 8 treesize of output 7 [2018-09-30 10:16:20,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:16:20,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:16:20,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:16:22,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:16:22,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:16:22,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:16:22,189 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:16:22,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:22,271 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:16:22,271 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 75 [2018-09-30 10:16:22,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-09-30 10:16:22,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-09-30 10:16:22,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=5661, Unknown=0, NotChecked=0, Total=5852 [2018-09-30 10:16:22,272 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 77 states. [2018-09-30 10:16:25,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:25,001 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-09-30 10:16:25,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-30 10:16:25,002 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 73 [2018-09-30 10:16:25,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:25,003 INFO L225 Difference]: With dead ends: 78 [2018-09-30 10:16:25,003 INFO L226 Difference]: Without dead ends: 77 [2018-09-30 10:16:25,003 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=191, Invalid=5661, Unknown=0, NotChecked=0, Total=5852 [2018-09-30 10:16:25,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-09-30 10:16:25,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2018-09-30 10:16:25,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-09-30 10:16:25,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-09-30 10:16:25,007 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 73 [2018-09-30 10:16:25,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:25,007 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-09-30 10:16:25,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-09-30 10:16:25,007 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-09-30 10:16:25,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-09-30 10:16:25,008 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:25,008 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 1, 1] [2018-09-30 10:16:25,008 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:25,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:25,008 INFO L82 PathProgramCache]: Analyzing trace with hash 286704424, now seen corresponding path program 36 times [2018-09-30 10:16:25,008 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:25,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:25,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:25,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:16:25,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:25,218 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-30 10:16:26,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:26,668 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:16:26,668 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:16:26,675 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:16:26,725 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-09-30 10:16:26,725 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:16:26,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:16:26,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 8 treesize of output 7 [2018-09-30 10:16:26,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:16:26,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:16:26,737 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:16:28,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:16:28,752 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:16:28,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:16:28,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:16:28,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:28,833 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:16:28,833 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 77 [2018-09-30 10:16:28,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-09-30 10:16:28,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-09-30 10:16:28,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=5966, Unknown=0, NotChecked=0, Total=6162 [2018-09-30 10:16:28,834 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 79 states. [2018-09-30 10:16:31,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:31,516 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-09-30 10:16:31,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-30 10:16:31,517 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 75 [2018-09-30 10:16:31,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:31,518 INFO L225 Difference]: With dead ends: 80 [2018-09-30 10:16:31,518 INFO L226 Difference]: Without dead ends: 79 [2018-09-30 10:16:31,518 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 778 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=196, Invalid=5966, Unknown=0, NotChecked=0, Total=6162 [2018-09-30 10:16:31,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-30 10:16:31,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-09-30 10:16:31,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-09-30 10:16:31,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-09-30 10:16:31,522 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 75 [2018-09-30 10:16:31,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:31,523 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-09-30 10:16:31,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-09-30 10:16:31,523 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-09-30 10:16:31,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-09-30 10:16:31,523 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:31,523 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 1, 1] [2018-09-30 10:16:31,524 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:31,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:31,524 INFO L82 PathProgramCache]: Analyzing trace with hash 645045610, now seen corresponding path program 37 times [2018-09-30 10:16:31,524 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:31,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:31,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:31,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:16:31,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:33,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:33,183 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:16:33,183 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:16:33,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:33,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:33,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:16:33,236 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 8 treesize of output 7 [2018-09-30 10:16:33,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:16:33,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:16:33,252 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:16:35,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:16:35,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:16:35,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:16:35,490 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:16:35,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:35,603 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:16:35,603 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 79 [2018-09-30 10:16:35,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-09-30 10:16:35,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-09-30 10:16:35,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=6279, Unknown=0, NotChecked=0, Total=6480 [2018-09-30 10:16:35,604 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 81 states. [2018-09-30 10:16:38,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:38,399 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-09-30 10:16:38,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-30 10:16:38,400 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 77 [2018-09-30 10:16:38,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:38,401 INFO L225 Difference]: With dead ends: 82 [2018-09-30 10:16:38,401 INFO L226 Difference]: Without dead ends: 81 [2018-09-30 10:16:38,402 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=201, Invalid=6279, Unknown=0, NotChecked=0, Total=6480 [2018-09-30 10:16:38,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-09-30 10:16:38,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2018-09-30 10:16:38,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-09-30 10:16:38,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-09-30 10:16:38,405 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 77 [2018-09-30 10:16:38,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:38,406 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-09-30 10:16:38,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-09-30 10:16:38,406 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-09-30 10:16:38,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-09-30 10:16:38,406 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:38,406 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 1, 1] [2018-09-30 10:16:38,406 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:38,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:38,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1413541676, now seen corresponding path program 38 times [2018-09-30 10:16:38,407 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:38,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:38,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:38,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:16:38,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:38,686 WARN L178 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-30 10:16:38,839 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 10:16:40,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:40,384 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:16:40,384 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:16:40,391 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:16:40,415 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:16:40,416 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:16:40,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:16:40,441 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 8 treesize of output 7 [2018-09-30 10:16:40,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:16:40,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:16:40,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:16:42,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:16:42,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:16:42,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:16:42,872 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:16:42,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:42,952 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:16:42,952 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 81 [2018-09-30 10:16:42,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-09-30 10:16:42,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-09-30 10:16:42,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=6600, Unknown=0, NotChecked=0, Total=6806 [2018-09-30 10:16:42,953 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 83 states. [2018-09-30 10:16:46,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:46,519 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-09-30 10:16:46,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-30 10:16:46,519 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 79 [2018-09-30 10:16:46,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:46,520 INFO L225 Difference]: With dead ends: 84 [2018-09-30 10:16:46,520 INFO L226 Difference]: Without dead ends: 83 [2018-09-30 10:16:46,521 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 859 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=206, Invalid=6600, Unknown=0, NotChecked=0, Total=6806 [2018-09-30 10:16:46,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-09-30 10:16:46,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2018-09-30 10:16:46,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-09-30 10:16:46,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-09-30 10:16:46,525 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 79 [2018-09-30 10:16:46,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:46,525 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-09-30 10:16:46,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-09-30 10:16:46,525 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-09-30 10:16:46,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-09-30 10:16:46,525 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:46,525 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 1, 1] [2018-09-30 10:16:46,526 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:46,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:46,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1203886190, now seen corresponding path program 39 times [2018-09-30 10:16:46,526 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:46,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:46,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:46,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:16:46,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:46,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:46,784 WARN L178 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-30 10:16:48,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:48,503 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:16:48,503 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:16:48,511 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:16:48,570 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-09-30 10:16:48,570 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:16:48,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:16:48,578 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 8 treesize of output 7 [2018-09-30 10:16:48,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:16:48,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:16:48,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:16:51,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:16:51,275 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:16:51,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:16:51,278 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:16:51,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:51,360 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:16:51,361 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 83 [2018-09-30 10:16:51,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-09-30 10:16:51,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-09-30 10:16:51,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=6929, Unknown=0, NotChecked=0, Total=7140 [2018-09-30 10:16:51,362 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 85 states. [2018-09-30 10:16:54,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:16:54,741 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-09-30 10:16:54,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-30 10:16:54,741 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 81 [2018-09-30 10:16:54,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:16:54,742 INFO L225 Difference]: With dead ends: 86 [2018-09-30 10:16:54,742 INFO L226 Difference]: Without dead ends: 85 [2018-09-30 10:16:54,743 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=211, Invalid=6929, Unknown=0, NotChecked=0, Total=7140 [2018-09-30 10:16:54,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-30 10:16:54,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-09-30 10:16:54,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-09-30 10:16:54,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-09-30 10:16:54,748 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 81 [2018-09-30 10:16:54,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:16:54,749 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-09-30 10:16:54,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-09-30 10:16:54,749 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-09-30 10:16:54,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-09-30 10:16:54,750 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:16:54,750 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 1, 1] [2018-09-30 10:16:54,750 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:16:54,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:16:54,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1588427056, now seen corresponding path program 40 times [2018-09-30 10:16:54,750 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:16:54,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:16:54,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:54,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:16:54,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:16:54,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:16:56,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:56,803 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:16:56,803 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:16:56,810 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:16:56,838 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:16:56,838 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:16:56,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:16:56,842 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 8 treesize of output 7 [2018-09-30 10:16:56,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:16:56,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:16:56,852 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:16:59,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:16:59,292 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:16:59,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:16:59,296 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:16:59,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:16:59,385 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:16:59,385 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 85 [2018-09-30 10:16:59,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-09-30 10:16:59,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-09-30 10:16:59,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=7266, Unknown=0, NotChecked=0, Total=7482 [2018-09-30 10:16:59,386 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 87 states. [2018-09-30 10:17:03,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:17:03,080 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-09-30 10:17:03,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-30 10:17:03,080 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 83 [2018-09-30 10:17:03,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:17:03,081 INFO L225 Difference]: With dead ends: 88 [2018-09-30 10:17:03,082 INFO L226 Difference]: Without dead ends: 87 [2018-09-30 10:17:03,082 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 944 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=216, Invalid=7266, Unknown=0, NotChecked=0, Total=7482 [2018-09-30 10:17:03,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-30 10:17:03,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2018-09-30 10:17:03,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-09-30 10:17:03,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-09-30 10:17:03,087 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 83 [2018-09-30 10:17:03,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:17:03,087 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-09-30 10:17:03,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-09-30 10:17:03,088 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-09-30 10:17:03,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-09-30 10:17:03,088 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:17:03,088 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 1, 1] [2018-09-30 10:17:03,088 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:17:03,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:17:03,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1765011826, now seen corresponding path program 41 times [2018-09-30 10:17:03,089 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:17:03,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:17:03,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:03,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:17:03,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:03,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:17:03,329 WARN L178 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 10:17:03,558 WARN L178 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-30 10:17:05,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:17:05,241 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:17:05,241 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:17:05,249 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:17:05,309 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-09-30 10:17:05,309 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:17:05,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:17:05,314 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 8 treesize of output 7 [2018-09-30 10:17:05,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:17:05,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:17:05,320 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:17:08,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:17:08,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:17:08,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:17:08,123 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:17:08,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:17:08,215 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:17:08,216 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 87 [2018-09-30 10:17:08,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-09-30 10:17:08,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-09-30 10:17:08,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=7611, Unknown=0, NotChecked=0, Total=7832 [2018-09-30 10:17:08,217 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 89 states. [2018-09-30 10:17:11,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:17:11,377 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-09-30 10:17:11,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-30 10:17:11,378 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 85 [2018-09-30 10:17:11,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:17:11,378 INFO L225 Difference]: With dead ends: 90 [2018-09-30 10:17:11,378 INFO L226 Difference]: Without dead ends: 89 [2018-09-30 10:17:11,379 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=221, Invalid=7611, Unknown=0, NotChecked=0, Total=7832 [2018-09-30 10:17:11,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-09-30 10:17:11,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2018-09-30 10:17:11,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-09-30 10:17:11,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-09-30 10:17:11,382 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 85 [2018-09-30 10:17:11,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:17:11,383 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-09-30 10:17:11,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-09-30 10:17:11,383 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-09-30 10:17:11,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-30 10:17:11,383 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:17:11,383 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 1, 1] [2018-09-30 10:17:11,383 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:17:11,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:17:11,384 INFO L82 PathProgramCache]: Analyzing trace with hash -335716044, now seen corresponding path program 42 times [2018-09-30 10:17:11,384 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:17:11,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:17:11,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:11,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:17:11,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:11,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:17:13,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:17:13,323 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:17:13,323 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:17:13,331 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:17:13,393 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-09-30 10:17:13,393 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:17:13,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:17:13,397 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 8 treesize of output 7 [2018-09-30 10:17:13,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:17:13,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:17:13,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:17:16,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:17:16,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:17:16,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:17:16,081 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:17:16,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:17:16,170 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:17:16,170 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 89 [2018-09-30 10:17:16,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-09-30 10:17:16,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-09-30 10:17:16,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=7964, Unknown=0, NotChecked=0, Total=8190 [2018-09-30 10:17:16,172 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 91 states. [2018-09-30 10:17:20,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:17:20,814 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-09-30 10:17:20,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-30 10:17:20,814 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 87 [2018-09-30 10:17:20,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:17:20,815 INFO L225 Difference]: With dead ends: 92 [2018-09-30 10:17:20,816 INFO L226 Difference]: Without dead ends: 91 [2018-09-30 10:17:20,816 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1033 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=226, Invalid=7964, Unknown=0, NotChecked=0, Total=8190 [2018-09-30 10:17:20,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-09-30 10:17:20,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2018-09-30 10:17:20,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-09-30 10:17:20,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-09-30 10:17:20,820 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 87 [2018-09-30 10:17:20,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:17:20,821 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-09-30 10:17:20,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-09-30 10:17:20,821 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-09-30 10:17:20,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-09-30 10:17:20,821 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:17:20,821 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 1, 1] [2018-09-30 10:17:20,822 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:17:20,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:17:20,822 INFO L82 PathProgramCache]: Analyzing trace with hash -500569994, now seen corresponding path program 43 times [2018-09-30 10:17:20,822 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:17:20,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:17:20,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:20,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:17:20,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:20,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:17:21,114 WARN L178 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-30 10:17:21,351 WARN L178 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 10:17:21,625 WARN L178 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-30 10:17:23,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:17:23,663 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:17:23,663 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:17:23,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:17:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:17:23,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:17:23,703 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 8 treesize of output 7 [2018-09-30 10:17:23,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:17:23,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:17:23,712 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:17:26,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:17:26,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:17:26,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:17:26,497 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:17:26,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:17:26,676 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:17:26,676 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 91 [2018-09-30 10:17:26,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-09-30 10:17:26,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-09-30 10:17:26,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=8325, Unknown=0, NotChecked=0, Total=8556 [2018-09-30 10:17:26,677 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 93 states. [2018-09-30 10:17:31,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:17:31,485 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-09-30 10:17:31,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-30 10:17:31,486 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 89 [2018-09-30 10:17:31,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:17:31,487 INFO L225 Difference]: With dead ends: 94 [2018-09-30 10:17:31,487 INFO L226 Difference]: Without dead ends: 93 [2018-09-30 10:17:31,488 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=231, Invalid=8325, Unknown=0, NotChecked=0, Total=8556 [2018-09-30 10:17:31,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-30 10:17:31,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-09-30 10:17:31,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-09-30 10:17:31,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-09-30 10:17:31,492 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 89 [2018-09-30 10:17:31,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:17:31,492 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-09-30 10:17:31,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-09-30 10:17:31,492 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-09-30 10:17:31,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-09-30 10:17:31,493 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:17:31,493 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 1, 1] [2018-09-30 10:17:31,493 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:17:31,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:17:31,493 INFO L82 PathProgramCache]: Analyzing trace with hash -11425992, now seen corresponding path program 44 times [2018-09-30 10:17:31,493 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:17:31,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:17:31,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:31,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:17:31,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:31,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:17:31,722 WARN L178 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-30 10:17:33,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:17:33,801 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:17:33,801 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:17:33,810 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:17:33,839 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:17:33,839 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:17:33,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:17:33,845 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 8 treesize of output 7 [2018-09-30 10:17:33,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:17:33,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:17:33,853 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:17:36,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:17:36,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:17:36,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:17:36,751 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:17:36,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:17:36,933 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:17:36,934 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 93 [2018-09-30 10:17:36,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-09-30 10:17:36,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-09-30 10:17:36,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=8694, Unknown=0, NotChecked=0, Total=8930 [2018-09-30 10:17:36,935 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 95 states. [2018-09-30 10:17:41,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:17:41,839 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-09-30 10:17:41,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-30 10:17:41,840 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 91 [2018-09-30 10:17:41,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:17:41,841 INFO L225 Difference]: With dead ends: 96 [2018-09-30 10:17:41,841 INFO L226 Difference]: Without dead ends: 95 [2018-09-30 10:17:41,842 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=236, Invalid=8694, Unknown=0, NotChecked=0, Total=8930 [2018-09-30 10:17:41,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-09-30 10:17:41,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-09-30 10:17:41,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-09-30 10:17:41,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-09-30 10:17:41,846 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 91 [2018-09-30 10:17:41,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:17:41,846 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-09-30 10:17:41,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-09-30 10:17:41,846 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-09-30 10:17:41,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-09-30 10:17:41,847 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:17:41,847 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 1, 1] [2018-09-30 10:17:41,847 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:17:41,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:17:41,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1904524666, now seen corresponding path program 45 times [2018-09-30 10:17:41,847 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:17:41,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:17:41,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:41,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:17:41,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:41,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:17:42,037 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-30 10:17:44,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:17:44,176 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:17:44,176 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:17:44,184 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:17:44,306 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-09-30 10:17:44,307 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:17:44,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:17:44,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 8 treesize of output 7 [2018-09-30 10:17:44,312 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:17:44,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:17:44,319 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:17:47,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:17:47,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:17:47,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:17:47,585 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:17:47,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:17:47,679 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:17:47,679 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 95 [2018-09-30 10:17:47,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-09-30 10:17:47,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-09-30 10:17:47,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=9071, Unknown=0, NotChecked=0, Total=9312 [2018-09-30 10:17:47,680 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 97 states. [2018-09-30 10:17:53,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:17:53,020 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-09-30 10:17:53,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-30 10:17:53,020 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 93 [2018-09-30 10:17:53,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:17:53,021 INFO L225 Difference]: With dead ends: 98 [2018-09-30 10:17:53,021 INFO L226 Difference]: Without dead ends: 97 [2018-09-30 10:17:53,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1174 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=241, Invalid=9071, Unknown=0, NotChecked=0, Total=9312 [2018-09-30 10:17:53,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-09-30 10:17:53,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-09-30 10:17:53,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-09-30 10:17:53,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-09-30 10:17:53,026 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 93 [2018-09-30 10:17:53,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:17:53,026 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-09-30 10:17:53,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-09-30 10:17:53,027 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-09-30 10:17:53,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-09-30 10:17:53,027 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:17:53,027 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 1, 1] [2018-09-30 10:17:53,027 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:17:53,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:17:53,028 INFO L82 PathProgramCache]: Analyzing trace with hash 592137020, now seen corresponding path program 46 times [2018-09-30 10:17:53,028 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:17:53,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:17:53,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:53,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:17:53,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:17:53,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:17:53,293 WARN L178 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 10:17:53,500 WARN L178 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-30 10:17:53,725 WARN L178 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 10:17:55,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:17:55,765 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:17:55,765 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:17:55,773 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:17:55,804 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:17:55,804 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:17:55,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:17:55,814 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 8 treesize of output 7 [2018-09-30 10:17:55,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:17:55,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:17:55,822 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:17:59,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:17:59,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:17:59,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:17:59,246 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:17:59,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:17:59,341 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:17:59,341 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 97 [2018-09-30 10:17:59,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-09-30 10:17:59,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-09-30 10:17:59,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=9456, Unknown=0, NotChecked=0, Total=9702 [2018-09-30 10:17:59,342 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 99 states. [2018-09-30 10:18:03,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:18:03,900 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-09-30 10:18:03,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-30 10:18:03,900 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 95 [2018-09-30 10:18:03,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:18:03,902 INFO L225 Difference]: With dead ends: 100 [2018-09-30 10:18:03,902 INFO L226 Difference]: Without dead ends: 99 [2018-09-30 10:18:03,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1223 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=246, Invalid=9456, Unknown=0, NotChecked=0, Total=9702 [2018-09-30 10:18:03,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-30 10:18:03,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2018-09-30 10:18:03,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-09-30 10:18:03,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-09-30 10:18:03,907 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 95 [2018-09-30 10:18:03,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:18:03,908 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-09-30 10:18:03,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-09-30 10:18:03,908 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-09-30 10:18:03,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-09-30 10:18:03,908 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:18:03,908 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 1, 1] [2018-09-30 10:18:03,909 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:18:03,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:18:03,909 INFO L82 PathProgramCache]: Analyzing trace with hash 2107994238, now seen corresponding path program 47 times [2018-09-30 10:18:03,909 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:18:03,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:18:03,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:03,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:18:03,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:03,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:18:06,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:18:06,103 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:18:06,103 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:18:06,111 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:18:06,164 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-09-30 10:18:06,164 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:18:06,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:18:06,192 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 8 treesize of output 7 [2018-09-30 10:18:06,192 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:18:06,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:18:06,247 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:18:10,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:18:10,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:18:10,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:18:10,477 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:18:10,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:18:10,579 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:18:10,580 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 99 [2018-09-30 10:18:10,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-09-30 10:18:10,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-09-30 10:18:10,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=9849, Unknown=0, NotChecked=0, Total=10100 [2018-09-30 10:18:10,581 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 101 states. [2018-09-30 10:18:14,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:18:14,506 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-09-30 10:18:14,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-30 10:18:14,507 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 97 [2018-09-30 10:18:14,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:18:14,508 INFO L225 Difference]: With dead ends: 102 [2018-09-30 10:18:14,508 INFO L226 Difference]: Without dead ends: 101 [2018-09-30 10:18:14,509 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1273 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=251, Invalid=9849, Unknown=0, NotChecked=0, Total=10100 [2018-09-30 10:18:14,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-09-30 10:18:14,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-09-30 10:18:14,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-09-30 10:18:14,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-09-30 10:18:14,513 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 97 [2018-09-30 10:18:14,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:18:14,513 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-09-30 10:18:14,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-09-30 10:18:14,513 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-09-30 10:18:14,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-09-30 10:18:14,514 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:18:14,514 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 1, 1] [2018-09-30 10:18:14,514 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:18:14,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:18:14,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1442099904, now seen corresponding path program 48 times [2018-09-30 10:18:14,515 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:18:14,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:18:14,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:14,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:18:14,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:14,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:18:14,782 WARN L178 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-30 10:18:14,995 WARN L178 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-30 10:18:17,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:18:17,143 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:18:17,143 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:18:17,151 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:18:17,226 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-09-30 10:18:17,226 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:18:17,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:18:17,236 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 8 treesize of output 7 [2018-09-30 10:18:17,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:18:17,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:18:17,242 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:18:20,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:18:20,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:18:20,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:18:20,975 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:18:21,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:18:21,082 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:18:21,082 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 101 [2018-09-30 10:18:21,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-09-30 10:18:21,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-09-30 10:18:21,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=10250, Unknown=0, NotChecked=0, Total=10506 [2018-09-30 10:18:21,083 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 103 states. [2018-09-30 10:18:27,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:18:27,251 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-09-30 10:18:27,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-30 10:18:27,251 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 99 [2018-09-30 10:18:27,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:18:27,252 INFO L225 Difference]: With dead ends: 104 [2018-09-30 10:18:27,252 INFO L226 Difference]: Without dead ends: 103 [2018-09-30 10:18:27,253 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1324 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=256, Invalid=10250, Unknown=0, NotChecked=0, Total=10506 [2018-09-30 10:18:27,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-09-30 10:18:27,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2018-09-30 10:18:27,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-09-30 10:18:27,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-09-30 10:18:27,258 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 99 [2018-09-30 10:18:27,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:18:27,258 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-09-30 10:18:27,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-09-30 10:18:27,259 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-09-30 10:18:27,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-09-30 10:18:27,259 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:18:27,259 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 1, 1] [2018-09-30 10:18:27,260 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:18:27,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:18:27,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1416429954, now seen corresponding path program 49 times [2018-09-30 10:18:27,260 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:18:27,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:18:27,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:27,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:18:27,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:27,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:18:29,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:18:29,904 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:18:29,904 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:18:29,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:18:29,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:18:29,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:18:29,951 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 8 treesize of output 7 [2018-09-30 10:18:29,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:18:29,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:18:29,957 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-30 10:18:33,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-30 10:18:33,793 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:18:33,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 10:18:33,810 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-30 10:18:33,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:18:33,916 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:18:33,917 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 103 [2018-09-30 10:18:33,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-09-30 10:18:33,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-09-30 10:18:33,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=10659, Unknown=0, NotChecked=0, Total=10920 [2018-09-30 10:18:33,918 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 105 states. [2018-09-30 10:18:39,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:18:39,153 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-09-30 10:18:39,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-30 10:18:39,153 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 101 [2018-09-30 10:18:39,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:18:39,155 INFO L225 Difference]: With dead ends: 106 [2018-09-30 10:18:39,155 INFO L226 Difference]: Without dead ends: 105 [2018-09-30 10:18:39,155 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=261, Invalid=10659, Unknown=0, NotChecked=0, Total=10920 [2018-09-30 10:18:39,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-09-30 10:18:39,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2018-09-30 10:18:39,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-09-30 10:18:39,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-09-30 10:18:39,160 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 101 [2018-09-30 10:18:39,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:18:39,161 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-09-30 10:18:39,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-09-30 10:18:39,161 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-09-30 10:18:39,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-09-30 10:18:39,161 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:18:39,162 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 1, 1] [2018-09-30 10:18:39,162 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:18:39,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:18:39,162 INFO L82 PathProgramCache]: Analyzing trace with hash -315445948, now seen corresponding path program 50 times [2018-09-30 10:18:39,162 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:18:39,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:18:39,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:39,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:18:39,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:18:39,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-09-30 10:18:39,370 WARN L186 SmtUtils]: Removed 2 from assertion stack [2018-09-30 10:18:39,370 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-30 10:18:39,375 WARN L206 ceAbstractionStarter]: Timeout [2018-09-30 10:18:39,376 INFO L202 PluginConnector]: Adding new model divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 10:18:39 BoogieIcfgContainer [2018-09-30 10:18:39,376 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 10:18:39,377 INFO L168 Benchmark]: Toolchain (without parser) took 246252.09 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -84.4 MB). Free memory was 1.5 GB in the beginning and 1.0 GB in the end (delta: 444.8 MB). Peak memory consumption was 360.4 MB. Max. memory is 7.1 GB. [2018-09-30 10:18:39,378 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:18:39,378 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.75 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:18:39,378 INFO L168 Benchmark]: Boogie Preprocessor took 24.82 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:18:39,378 INFO L168 Benchmark]: RCFGBuilder took 258.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-30 10:18:39,379 INFO L168 Benchmark]: TraceAbstraction took 245915.26 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -84.4 MB). Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 423.7 MB). Peak memory consumption was 339.3 MB. Max. memory is 7.1 GB. [2018-09-30 10:18:39,380 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.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 46.75 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.82 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 258.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 245915.26 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -84.4 MB). Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 423.7 MB). Peak memory consumption was 339.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 30). Cancelled while BasicCegarLoop was analyzing trace of length 104 with TraceHistMax 51, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 18. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 245.8s OverallTime, 51 OverallIterations, 51 TraceHistogramMax, 96.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 102 SDtfs, 128 SDslu, 2 SDs, 0 SdLazy, 136300 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 80.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3922 GetRequests, 1176 SyntacticMatches, 49 SemanticMatches, 2697 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24696 ImplicationChecksByTransitivity, 138.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=50, 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.2s AutomataMinimizationTime, 50 MinimizatonAttempts, 50 StatesRemovedByMinimization, 50 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 143.6s InterpolantComputationTime, 5197 NumberOfCodeBlocks, 5197 NumberOfCodeBlocksAsserted, 731 NumberOfCheckSat, 5098 ConstructedInterpolants, 0 QuantifiedInterpolants, 5742568 SizeOfPredicates, 49 NumberOfNonLiveVariables, 5390 ConjunctsInSsa, 2793 ConjunctsInUnsatCore, 99 InterpolantComputations, 1 PerfectInterpolantSequences, 0/83300 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/divisibilityWithArray.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_10-18-39-389.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/divisibilityWithArray.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_10-18-39-389.csv Completed graceful shutdown