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-b2fde6a [2018-09-28 09:55:32,873 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-28 09:55:32,875 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-28 09:55:32,887 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-28 09:55:32,887 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-28 09:55:32,889 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-28 09:55:32,890 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-28 09:55:32,892 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-28 09:55:32,894 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-28 09:55:32,895 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-28 09:55:32,896 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-28 09:55:32,897 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-28 09:55:32,898 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-28 09:55:32,900 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-28 09:55:32,905 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-28 09:55:32,906 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-28 09:55:32,909 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-28 09:55:32,914 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-28 09:55:32,916 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-28 09:55:32,918 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-28 09:55:32,922 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-28 09:55:32,925 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-28 09:55:32,927 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-28 09:55:32,929 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-28 09:55:32,930 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-28 09:55:32,931 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-28 09:55:32,932 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-28 09:55:32,934 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-28 09:55:32,935 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-28 09:55:32,936 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-28 09:55:32,936 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-28 09:55:32,937 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-28 09:55:32,939 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-28 09:55:32,939 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-28 09:55:32,940 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-28 09:55:32,942 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-28 09:55:32,942 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-28 09:55:32,967 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-28 09:55:32,967 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-28 09:55:32,968 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-28 09:55:32,968 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-28 09:55:32,969 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-28 09:55:32,969 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-28 09:55:32,970 INFO L133 SettingsManager]: * Use SBE=true [2018-09-28 09:55:32,970 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-28 09:55:32,970 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-28 09:55:32,970 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-28 09:55:32,970 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-28 09:55:32,971 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-28 09:55:32,971 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-28 09:55:32,971 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-28 09:55:32,971 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-28 09:55:32,971 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-28 09:55:32,972 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-28 09:55:32,972 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-28 09:55:32,972 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-28 09:55:32,972 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-28 09:55:32,972 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-28 09:55:32,973 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-28 09:55:32,973 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-28 09:55:32,973 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-28 09:55:32,973 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-28 09:55:32,974 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-28 09:55:32,974 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-28 09:55:32,974 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-28 09:55:32,974 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-28 09:55:32,974 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-28 09:55:33,018 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-28 09:55:33,034 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-28 09:55:33,041 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-28 09:55:33,044 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-28 09:55:33,045 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-28 09:55:33,046 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-28 09:55:33,046 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl' [2018-09-28 09:55:33,102 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-28 09:55:33,105 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-28 09:55:33,106 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-28 09:55:33,106 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-28 09:55:33,106 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-28 09:55:33,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 09:55:33" (1/1) ... [2018-09-28 09:55:33,144 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 09:55:33" (1/1) ... [2018-09-28 09:55:33,150 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-28 09:55:33,150 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-28 09:55:33,150 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-28 09:55:33,153 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-28 09:55:33,154 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-28 09:55:33,154 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-28 09:55:33,154 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-28 09:55:33,166 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 09:55:33" (1/1) ... [2018-09-28 09:55:33,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 09:55:33" (1/1) ... [2018-09-28 09:55:33,167 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 09:55:33" (1/1) ... [2018-09-28 09:55:33,168 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 09:55:33" (1/1) ... [2018-09-28 09:55:33,170 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 09:55:33" (1/1) ... [2018-09-28 09:55:33,177 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 09:55:33" (1/1) ... [2018-09-28 09:55:33,178 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 09:55:33" (1/1) ... [2018-09-28 09:55:33,180 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-28 09:55:33,181 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-28 09:55:33,181 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-28 09:55:33,181 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-28 09:55:33,183 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 09:55: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-28 09:55:33,261 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-09-28 09:55:33,261 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-28 09:55:33,261 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-28 09:55:33,432 INFO L350 CfgBuilder]: Using library mode [2018-09-28 09:55:33,433 INFO L202 PluginConnector]: Adding new model divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.09 09:55:33 BoogieIcfgContainer [2018-09-28 09:55:33,433 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-28 09:55:33,434 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-28 09:55:33,434 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-28 09:55:33,437 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-28 09:55:33,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.09 09:55:33" (1/2) ... [2018-09-28 09:55:33,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aee47d8 and model type divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.09 09:55:33, skipping insertion in model container [2018-09-28 09:55:33,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.09 09:55:33" (2/2) ... [2018-09-28 09:55:33,441 INFO L112 eAbstractionObserver]: Analyzing ICFG divisibilityWithArray.bpl [2018-09-28 09:55:33,450 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-28 09:55:33,458 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-28 09:55:33,509 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-28 09:55:33,510 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-28 09:55:33,510 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-28 09:55:33,511 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-28 09:55:33,511 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-28 09:55:33,511 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-28 09:55:33,511 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-28 09:55:33,511 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-28 09:55:33,512 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-28 09:55:33,527 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-09-28 09:55:33,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-09-28 09:55:33,533 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:55:33,534 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-09-28 09:55:33,536 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:55:33,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:55:33,542 INFO L82 PathProgramCache]: Analyzing trace with hash 29920, now seen corresponding path program 1 times [2018-09-28 09:55:33,544 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:55:33,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:55:33,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:33,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:55:33,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:33,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:55:34,079 WARN L178 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 19 [2018-09-28 09:55:34,155 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-28 09:55:34,157 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-28 09:55:34,157 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-28 09:55:34,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-28 09:55:34,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-28 09:55:34,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-28 09:55:34,176 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2018-09-28 09:55:34,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:55:34,295 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-09-28 09:55:34,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-28 09:55:34,297 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-09-28 09:55:34,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:55:34,309 INFO L225 Difference]: With dead ends: 14 [2018-09-28 09:55:34,309 INFO L226 Difference]: Without dead ends: 7 [2018-09-28 09:55:34,313 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-28 09:55:34,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-28 09:55:34,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2018-09-28 09:55:34,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-09-28 09:55:34,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-09-28 09:55:34,350 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 3 [2018-09-28 09:55:34,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:55:34,350 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-09-28 09:55:34,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-28 09:55:34,350 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-09-28 09:55:34,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-28 09:55:34,351 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:55:34,351 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-09-28 09:55:34,351 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:55:34,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:55:34,352 INFO L82 PathProgramCache]: Analyzing trace with hash 28754210, now seen corresponding path program 1 times [2018-09-28 09:55:34,352 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:55:34,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:55:34,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:34,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:55:34,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:34,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:55:34,761 WARN L178 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2018-09-28 09:55:34,969 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2018-09-28 09:55:35,121 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2018-09-28 09:55:35,123 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-28 09:55:35,123 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:55:35,123 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-28 09:55:35,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:55:35,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:55:35,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:55:35,227 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-28 09:55:35,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:55:35,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:55:35,253 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:55:35,367 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-28 09:55:35,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:55:35,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:55:35,395 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:55:35,447 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-28 09:55:35,471 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:55:35,471 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-09-28 09:55:35,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-28 09:55:35,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-28 09:55:35,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-28 09:55:35,477 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 9 states. [2018-09-28 09:55:35,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:55:35,555 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-09-28 09:55:35,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-28 09:55:35,556 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2018-09-28 09:55:35,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:55:35,557 INFO L225 Difference]: With dead ends: 10 [2018-09-28 09:55:35,557 INFO L226 Difference]: Without dead ends: 9 [2018-09-28 09:55:35,558 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-28 09:55:35,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-28 09:55:35,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-09-28 09:55:35,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-09-28 09:55:35,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-09-28 09:55:35,562 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2018-09-28 09:55:35,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:55:35,562 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-09-28 09:55:35,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-28 09:55:35,563 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-09-28 09:55:35,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-28 09:55:35,563 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:55:35,564 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1] [2018-09-28 09:55:35,564 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:55:35,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:55:35,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1862993124, now seen corresponding path program 2 times [2018-09-28 09:55:35,565 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:55:35,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:55:35,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:35,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:55:35,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:55:36,071 WARN L178 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2018-09-28 09:55:36,233 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-28 09:55:36,234 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:55:36,234 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-28 09:55:36,248 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-28 09:55:36,256 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-28 09:55:36,257 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 09:55:36,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:55:36,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-28 09:55:36,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:55:36,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:55:36,275 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:55:36,398 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-28 09:55:36,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:55:36,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:55:36,414 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:55:36,430 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-28 09:55:36,451 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:55:36,451 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-09-28 09:55:36,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-28 09:55:36,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-28 09:55:36,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-09-28 09:55:36,453 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 11 states. [2018-09-28 09:55:36,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:55:36,520 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-09-28 09:55:36,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-28 09:55:36,521 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2018-09-28 09:55:36,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:55:36,522 INFO L225 Difference]: With dead ends: 12 [2018-09-28 09:55:36,522 INFO L226 Difference]: Without dead ends: 11 [2018-09-28 09:55:36,523 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-09-28 09:55:36,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-28 09:55:36,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-09-28 09:55:36,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-09-28 09:55:36,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-09-28 09:55:36,528 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2018-09-28 09:55:36,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:55:36,528 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-09-28 09:55:36,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-28 09:55:36,528 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-09-28 09:55:36,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-28 09:55:36,529 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:55:36,529 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1] [2018-09-28 09:55:36,529 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:55:36,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:55:36,530 INFO L82 PathProgramCache]: Analyzing trace with hash -664969178, now seen corresponding path program 3 times [2018-09-28 09:55:36,530 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:55:36,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:55:36,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:36,531 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 09:55:36,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:36,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:55:36,910 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-28 09:55:36,911 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:55:36,911 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-28 09:55:36,920 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-28 09:55:36,930 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-09-28 09:55:36,931 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 09:55:36,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:55:36,953 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-28 09:55:36,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:55:36,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:55:36,972 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:55:37,125 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-28 09:55:37,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:55:37,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:55:37,133 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:55:37,186 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-28 09:55:37,207 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:55:37,208 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-09-28 09:55:37,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-28 09:55:37,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-28 09:55:37,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-09-28 09:55:37,209 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 13 states. [2018-09-28 09:55:37,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:55:37,305 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-09-28 09:55:37,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-28 09:55:37,311 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2018-09-28 09:55:37,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:55:37,311 INFO L225 Difference]: With dead ends: 14 [2018-09-28 09:55:37,312 INFO L226 Difference]: Without dead ends: 13 [2018-09-28 09:55:37,312 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-28 09:55:37,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-28 09:55:37,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-09-28 09:55:37,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-09-28 09:55:37,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-09-28 09:55:37,316 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2018-09-28 09:55:37,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:55:37,316 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-09-28 09:55:37,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-28 09:55:37,317 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-09-28 09:55:37,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-28 09:55:37,317 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:55:37,317 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1] [2018-09-28 09:55:37,318 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:55:37,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:55:37,318 INFO L82 PathProgramCache]: Analyzing trace with hash 914748136, now seen corresponding path program 4 times [2018-09-28 09:55:37,318 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:55:37,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:55:37,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:37,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 09:55:37,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:37,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:55:37,712 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2018-09-28 09:55:37,879 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-28 09:55:37,879 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:55:37,879 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-28 09:55:37,894 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-28 09:55:37,905 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-28 09:55:37,906 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 09:55:37,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:55:37,914 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-28 09:55:37,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:55:37,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:55:37,970 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:55:38,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-28 09:55:38,168 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:55:38,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:55:38,173 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:55:38,183 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-28 09:55:38,204 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:55:38,204 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-09-28 09:55:38,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-28 09:55:38,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-28 09:55:38,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-09-28 09:55:38,205 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 15 states. [2018-09-28 09:55:38,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:55:38,359 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-09-28 09:55:38,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-28 09:55:38,360 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 11 [2018-09-28 09:55:38,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:55:38,361 INFO L225 Difference]: With dead ends: 16 [2018-09-28 09:55:38,362 INFO L226 Difference]: Without dead ends: 15 [2018-09-28 09:55:38,363 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-28 09:55:38,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-28 09:55:38,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-09-28 09:55:38,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-09-28 09:55:38,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-09-28 09:55:38,366 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-09-28 09:55:38,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:55:38,367 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-09-28 09:55:38,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-28 09:55:38,367 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-09-28 09:55:38,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-28 09:55:38,368 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:55:38,368 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1] [2018-09-28 09:55:38,368 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:55:38,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:55:38,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1395335894, now seen corresponding path program 5 times [2018-09-28 09:55:38,369 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:55:38,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:55:38,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:38,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 09:55:38,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:55:38,708 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-28 09:55:38,709 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:55:38,709 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-28 09:55:38,724 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-28 09:55:38,735 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-09-28 09:55:38,735 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 09:55:38,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:55:38,746 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-28 09:55:38,746 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:55:38,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:55:38,758 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:55:38,996 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-28 09:55:38,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:55:39,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:55:39,003 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:55:39,014 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-28 09:55:39,036 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:55:39,036 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-09-28 09:55:39,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-28 09:55:39,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-28 09:55:39,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-09-28 09:55:39,037 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 17 states. [2018-09-28 09:55:39,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:55:39,202 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-09-28 09:55:39,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-28 09:55:39,203 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 13 [2018-09-28 09:55:39,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:55:39,204 INFO L225 Difference]: With dead ends: 18 [2018-09-28 09:55:39,204 INFO L226 Difference]: Without dead ends: 17 [2018-09-28 09:55:39,205 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-09-28 09:55:39,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-28 09:55:39,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-09-28 09:55:39,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-09-28 09:55:39,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-09-28 09:55:39,209 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-09-28 09:55:39,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:55:39,209 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-09-28 09:55:39,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-28 09:55:39,209 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-09-28 09:55:39,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-28 09:55:39,210 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:55:39,210 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1] [2018-09-28 09:55:39,210 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:55:39,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:55:39,211 INFO L82 PathProgramCache]: Analyzing trace with hash -887996692, now seen corresponding path program 6 times [2018-09-28 09:55:39,211 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:55:39,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:55:39,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:39,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 09:55:39,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:39,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:55:39,540 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-28 09:55:39,540 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:55:39,541 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-28 09:55:39,548 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-28 09:55:39,558 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-09-28 09:55:39,558 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 09:55:39,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:55:39,565 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-28 09:55:39,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:55:39,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:55:39,588 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:55:39,791 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-28 09:55:39,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:55:39,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:55:39,797 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:55:39,811 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-28 09:55:39,831 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:55:39,832 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-09-28 09:55:39,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-28 09:55:39,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-28 09:55:39,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2018-09-28 09:55:39,833 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 19 states. [2018-09-28 09:55:40,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:55:40,182 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-09-28 09:55:40,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-28 09:55:40,183 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 15 [2018-09-28 09:55:40,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:55:40,184 INFO L225 Difference]: With dead ends: 20 [2018-09-28 09:55:40,184 INFO L226 Difference]: Without dead ends: 19 [2018-09-28 09:55:40,184 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2018-09-28 09:55:40,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-28 09:55:40,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-09-28 09:55:40,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-09-28 09:55:40,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-09-28 09:55:40,188 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-09-28 09:55:40,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:55:40,188 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-09-28 09:55:40,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-28 09:55:40,189 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-09-28 09:55:40,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-28 09:55:40,189 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:55:40,189 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1] [2018-09-28 09:55:40,190 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:55:40,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:55:40,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1333671982, now seen corresponding path program 7 times [2018-09-28 09:55:40,190 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:55:40,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:55:40,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:40,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 09:55:40,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:40,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:55:40,800 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-28 09:55:40,800 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:55:40,800 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-28 09:55:40,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:55:40,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:55:40,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:55:40,848 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-28 09:55:40,849 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:55:40,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:55:40,918 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:55:41,270 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-28 09:55:41,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:55:41,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:55:41,306 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:55:41,323 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-28 09:55:41,344 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:55:41,344 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-09-28 09:55:41,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-28 09:55:41,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-28 09:55:41,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-09-28 09:55:41,346 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 21 states. [2018-09-28 09:55:41,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:55:41,841 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-09-28 09:55:41,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-28 09:55:41,842 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 17 [2018-09-28 09:55:41,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:55:41,843 INFO L225 Difference]: With dead ends: 22 [2018-09-28 09:55:41,843 INFO L226 Difference]: Without dead ends: 21 [2018-09-28 09:55:41,845 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-09-28 09:55:41,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-09-28 09:55:41,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-09-28 09:55:41,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-09-28 09:55:41,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-09-28 09:55:41,851 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2018-09-28 09:55:41,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:55:41,853 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-09-28 09:55:41,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-28 09:55:41,854 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-09-28 09:55:41,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-28 09:55:41,854 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:55:41,854 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1] [2018-09-28 09:55:41,855 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:55:41,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:55:41,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1758521584, now seen corresponding path program 8 times [2018-09-28 09:55:41,855 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:55:41,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:55:41,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:41,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:55:41,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:55:42,265 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-28 09:55:42,266 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:55:42,266 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-28 09:55:42,273 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-28 09:55:42,284 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-28 09:55:42,284 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 09:55:42,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:55:42,290 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-28 09:55:42,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:55:42,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:55:42,298 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:55:42,511 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-28 09:55:42,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:55:42,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:55:42,516 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:55:42,532 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-28 09:55:42,554 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:55:42,554 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-09-28 09:55:42,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-28 09:55:42,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-28 09:55:42,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2018-09-28 09:55:42,556 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 23 states. [2018-09-28 09:55:42,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:55:42,895 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-09-28 09:55:42,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-28 09:55:42,897 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 19 [2018-09-28 09:55:42,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:55:42,897 INFO L225 Difference]: With dead ends: 24 [2018-09-28 09:55:42,898 INFO L226 Difference]: Without dead ends: 23 [2018-09-28 09:55:42,898 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2018-09-28 09:55:42,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-28 09:55:42,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-09-28 09:55:42,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-09-28 09:55:42,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-09-28 09:55:42,902 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2018-09-28 09:55:42,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:55:42,902 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-09-28 09:55:42,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-28 09:55:42,903 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-09-28 09:55:42,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-28 09:55:42,903 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:55:42,903 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1] [2018-09-28 09:55:42,904 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:55:42,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:55:42,904 INFO L82 PathProgramCache]: Analyzing trace with hash 2017095986, now seen corresponding path program 9 times [2018-09-28 09:55:42,904 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:55:42,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:55:42,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:42,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 09:55:42,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:42,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:55:43,305 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-28 09:55:43,305 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:55:43,305 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-28 09:55:43,315 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-28 09:55:43,327 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-09-28 09:55:43,328 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 09:55:43,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:55:43,337 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-28 09:55:43,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:55:43,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:55:43,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:55:43,592 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-28 09:55:43,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:55:43,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:55:43,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:55:43,622 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-28 09:55:43,642 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:55:43,643 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2018-09-28 09:55:43,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-28 09:55:43,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-28 09:55:43,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2018-09-28 09:55:43,644 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 25 states. [2018-09-28 09:55:43,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:55:43,962 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-09-28 09:55:43,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-28 09:55:43,963 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 21 [2018-09-28 09:55:43,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:55:43,964 INFO L225 Difference]: With dead ends: 26 [2018-09-28 09:55:43,964 INFO L226 Difference]: Without dead ends: 25 [2018-09-28 09:55:43,964 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2018-09-28 09:55:43,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-28 09:55:43,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-09-28 09:55:43,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-09-28 09:55:43,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-09-28 09:55:43,970 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2018-09-28 09:55:43,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:55:43,970 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-09-28 09:55:43,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-28 09:55:43,970 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-09-28 09:55:43,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-28 09:55:43,971 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:55:43,971 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1] [2018-09-28 09:55:43,971 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:55:43,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:55:43,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1398993140, now seen corresponding path program 10 times [2018-09-28 09:55:43,971 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:55:43,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:55:43,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:43,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 09:55:43,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:43,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:55:44,548 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-28 09:55:44,548 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:55:44,549 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-28 09:55:44,556 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-28 09:55:44,566 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-28 09:55:44,566 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 09:55:44,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:55:44,571 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-28 09:55:44,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:55:44,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:55:44,578 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:55:44,892 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-28 09:55:44,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:55:44,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:55:44,898 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:55:44,922 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-28 09:55:44,943 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:55:44,943 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2018-09-28 09:55:44,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-09-28 09:55:44,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-09-28 09:55:44,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=636, Unknown=0, NotChecked=0, Total=702 [2018-09-28 09:55:44,947 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 27 states. [2018-09-28 09:55:45,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:55:45,407 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-09-28 09:55:45,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-28 09:55:45,408 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 23 [2018-09-28 09:55:45,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:55:45,409 INFO L225 Difference]: With dead ends: 28 [2018-09-28 09:55:45,409 INFO L226 Difference]: Without dead ends: 27 [2018-09-28 09:55:45,410 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-28 09:55:45,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-28 09:55:45,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-09-28 09:55:45,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-28 09:55:45,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-09-28 09:55:45,415 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2018-09-28 09:55:45,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:55:45,416 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-09-28 09:55:45,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-09-28 09:55:45,416 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-09-28 09:55:45,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-28 09:55:45,417 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:55:45,417 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1] [2018-09-28 09:55:45,417 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:55:45,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:55:45,417 INFO L82 PathProgramCache]: Analyzing trace with hash 107644982, now seen corresponding path program 11 times [2018-09-28 09:55:45,418 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:55:45,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:55:45,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:45,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 09:55:45,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:45,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:55:45,701 WARN L178 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-28 09:55:46,152 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-28 09:55:46,153 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:55:46,153 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-28 09:55:46,160 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-28 09:55:46,220 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-09-28 09:55:46,221 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 09:55:46,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:55:46,226 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-28 09:55:46,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:55:46,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:55:46,233 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:55:46,614 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-28 09:55:46,615 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:55:46,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:55:46,620 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:55:46,638 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-28 09:55:46,659 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:55:46,660 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2018-09-28 09:55:46,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-28 09:55:46,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-28 09:55:46,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2018-09-28 09:55:46,661 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 29 states. [2018-09-28 09:55:47,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:55:47,111 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-09-28 09:55:47,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-28 09:55:47,111 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 25 [2018-09-28 09:55:47,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:55:47,112 INFO L225 Difference]: With dead ends: 30 [2018-09-28 09:55:47,112 INFO L226 Difference]: Without dead ends: 29 [2018-09-28 09:55:47,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2018-09-28 09:55:47,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-28 09:55:47,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-09-28 09:55:47,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-09-28 09:55:47,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-09-28 09:55:47,117 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2018-09-28 09:55:47,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:55:47,117 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-09-28 09:55:47,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-28 09:55:47,117 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-09-28 09:55:47,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-09-28 09:55:47,118 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:55:47,118 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 1, 1] [2018-09-28 09:55:47,118 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:55:47,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:55:47,119 INFO L82 PathProgramCache]: Analyzing trace with hash 367613688, now seen corresponding path program 12 times [2018-09-28 09:55:47,119 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:55:47,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:55:47,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:47,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 09:55:47,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:55:47,696 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-28 09:55:47,696 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:55:47,697 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-28 09:55:47,714 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-28 09:55:47,748 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-09-28 09:55:47,749 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 09:55:47,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:55:47,758 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-28 09:55:47,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:55:47,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:55:47,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:55:48,240 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-28 09:55:48,241 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:55:48,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:55:48,246 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:55:48,265 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-28 09:55:48,286 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:55:48,287 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2018-09-28 09:55:48,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-28 09:55:48,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-28 09:55:48,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=854, Unknown=0, NotChecked=0, Total=930 [2018-09-28 09:55:48,288 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 31 states. [2018-09-28 09:55:48,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:55:48,829 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-09-28 09:55:48,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-28 09:55:48,829 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 27 [2018-09-28 09:55:48,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:55:48,830 INFO L225 Difference]: With dead ends: 32 [2018-09-28 09:55:48,830 INFO L226 Difference]: Without dead ends: 31 [2018-09-28 09:55:48,831 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=76, Invalid=854, Unknown=0, NotChecked=0, Total=930 [2018-09-28 09:55:48,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-28 09:55:48,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-09-28 09:55:48,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-28 09:55:48,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-09-28 09:55:48,836 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2018-09-28 09:55:48,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:55:48,836 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-09-28 09:55:48,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-28 09:55:48,836 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-09-28 09:55:48,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-28 09:55:48,837 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:55:48,837 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 1, 1] [2018-09-28 09:55:48,837 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:55:48,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:55:48,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1089436986, now seen corresponding path program 13 times [2018-09-28 09:55:48,838 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:55:48,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:55:48,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:48,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 09:55:48,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:48,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:55:49,449 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-28 09:55:49,449 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:55:49,449 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-28 09:55:49,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:55:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:55:49,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:55:49,477 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-28 09:55:49,477 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:55:49,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:55:49,480 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:55:49,899 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-28 09:55:49,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:55:49,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:55:49,903 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:55:49,925 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-28 09:55:49,945 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:55:49,945 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2018-09-28 09:55:49,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-09-28 09:55:49,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-09-28 09:55:49,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=975, Unknown=0, NotChecked=0, Total=1056 [2018-09-28 09:55:49,946 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 33 states. [2018-09-28 09:55:50,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:55:50,874 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-09-28 09:55:50,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-28 09:55:50,875 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 29 [2018-09-28 09:55:50,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:55:50,875 INFO L225 Difference]: With dead ends: 34 [2018-09-28 09:55:50,876 INFO L226 Difference]: Without dead ends: 33 [2018-09-28 09:55:50,877 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-28 09:55:50,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-28 09:55:50,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-09-28 09:55:50,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-09-28 09:55:50,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-09-28 09:55:50,882 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2018-09-28 09:55:50,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:55:50,883 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-09-28 09:55:50,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-09-28 09:55:50,883 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-09-28 09:55:50,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-09-28 09:55:50,883 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:55:50,884 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 1, 1] [2018-09-28 09:55:50,884 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:55:50,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:55:50,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1023075588, now seen corresponding path program 14 times [2018-09-28 09:55:50,884 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:55:50,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:55:50,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:50,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:55:50,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:50,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:55:51,125 WARN L178 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-28 09:55:51,365 WARN L178 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-28 09:55:51,645 WARN L178 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-28 09:55:51,929 WARN L178 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-28 09:55:52,486 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-28 09:55:52,486 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:55:52,486 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-28 09:55:52,497 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-28 09:55:52,511 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-28 09:55:52,512 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 09:55:52,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:55:52,519 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-28 09:55:52,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:55:52,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:55:52,528 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:55:53,056 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-28 09:55:53,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:55:53,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:55:53,062 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:55:53,101 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-28 09:55:53,122 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:55:53,122 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2018-09-28 09:55:53,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-28 09:55:53,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-28 09:55:53,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1104, Unknown=0, NotChecked=0, Total=1190 [2018-09-28 09:55:53,123 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 35 states. [2018-09-28 09:55:53,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:55:53,636 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-09-28 09:55:53,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-28 09:55:53,636 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 31 [2018-09-28 09:55:53,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:55:53,637 INFO L225 Difference]: With dead ends: 36 [2018-09-28 09:55:53,637 INFO L226 Difference]: Without dead ends: 35 [2018-09-28 09:55:53,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=86, Invalid=1104, Unknown=0, NotChecked=0, Total=1190 [2018-09-28 09:55:53,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-28 09:55:53,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-09-28 09:55:53,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-09-28 09:55:53,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-09-28 09:55:53,643 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2018-09-28 09:55:53,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:55:53,643 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-09-28 09:55:53,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-28 09:55:53,643 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-09-28 09:55:53,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-09-28 09:55:53,644 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:55:53,644 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 1, 1] [2018-09-28 09:55:53,644 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:55:53,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:55:53,645 INFO L82 PathProgramCache]: Analyzing trace with hash 371871806, now seen corresponding path program 15 times [2018-09-28 09:55:53,645 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:55:53,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:55:53,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:53,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 09:55:53,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:53,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:55:54,200 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-28 09:55:54,200 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:55:54,200 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-28 09:55:54,208 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-28 09:55:54,227 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-09-28 09:55:54,228 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 09:55:54,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:55:54,241 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-28 09:55:54,241 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:55:54,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:55:54,248 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:55:54,931 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-28 09:55:54,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:55:54,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:55:54,937 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:55:54,960 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-28 09:55:54,982 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:55:54,983 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2018-09-28 09:55:54,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-09-28 09:55:54,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-09-28 09:55:54,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1241, Unknown=0, NotChecked=0, Total=1332 [2018-09-28 09:55:54,984 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 37 states. [2018-09-28 09:55:55,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:55:55,851 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-09-28 09:55:55,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-28 09:55:55,851 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 33 [2018-09-28 09:55:55,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:55:55,852 INFO L225 Difference]: With dead ends: 38 [2018-09-28 09:55:55,852 INFO L226 Difference]: Without dead ends: 37 [2018-09-28 09:55:55,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=91, Invalid=1241, Unknown=0, NotChecked=0, Total=1332 [2018-09-28 09:55:55,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-28 09:55:55,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-09-28 09:55:55,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-28 09:55:55,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-09-28 09:55:55,857 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2018-09-28 09:55:55,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:55:55,858 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-09-28 09:55:55,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-09-28 09:55:55,858 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-09-28 09:55:55,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-28 09:55:55,859 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:55:55,860 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 1, 1] [2018-09-28 09:55:55,860 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:55:55,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:55:55,860 INFO L82 PathProgramCache]: Analyzing trace with hash 886521088, now seen corresponding path program 16 times [2018-09-28 09:55:55,860 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:55:55,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:55:55,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:55,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 09:55:55,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:55:56,103 WARN L178 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-28 09:55:56,340 WARN L178 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-28 09:55:56,589 WARN L178 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-28 09:55:57,224 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-28 09:55:57,225 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:55:57,225 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-28 09:55:57,231 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-28 09:55:57,242 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-28 09:55:57,242 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 09:55:57,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:55:57,247 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-28 09:55:57,247 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:55:57,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:55:57,260 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:55:57,904 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-28 09:55:57,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:55:57,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:55:57,909 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:55:57,937 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-28 09:55:57,957 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:55:57,957 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2018-09-28 09:55:57,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-09-28 09:55:57,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-09-28 09:55:57,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1386, Unknown=0, NotChecked=0, Total=1482 [2018-09-28 09:55:57,959 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 39 states. [2018-09-28 09:55:58,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:55:58,707 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-09-28 09:55:58,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-28 09:55:58,707 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 35 [2018-09-28 09:55:58,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:55:58,708 INFO L225 Difference]: With dead ends: 40 [2018-09-28 09:55:58,708 INFO L226 Difference]: Without dead ends: 39 [2018-09-28 09:55:58,709 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=96, Invalid=1386, Unknown=0, NotChecked=0, Total=1482 [2018-09-28 09:55:58,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-28 09:55:58,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-09-28 09:55:58,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-09-28 09:55:58,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-09-28 09:55:58,716 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2018-09-28 09:55:58,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:55:58,716 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-09-28 09:55:58,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-09-28 09:55:58,717 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-09-28 09:55:58,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-09-28 09:55:58,717 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:55:58,717 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 1, 1] [2018-09-28 09:55:58,718 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:55:58,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:55:58,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1543242050, now seen corresponding path program 17 times [2018-09-28 09:55:58,718 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:55:58,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:55:58,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:58,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 09:55:58,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:55:58,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:55:58,985 WARN L178 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-28 09:55:59,716 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-28 09:55:59,716 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:55:59,716 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-28 09:55:59,723 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-28 09:55:59,743 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-09-28 09:55:59,744 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 09:55:59,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:55:59,748 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-28 09:55:59,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:55:59,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:55:59,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:56:00,545 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-28 09:56:00,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:56:00,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:56:00,556 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:56:00,661 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-28 09:56:00,682 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:56:00,682 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2018-09-28 09:56:00,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-28 09:56:00,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-28 09:56:00,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1539, Unknown=0, NotChecked=0, Total=1640 [2018-09-28 09:56:00,684 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 41 states. [2018-09-28 09:56:01,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:01,522 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-09-28 09:56:01,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-28 09:56:01,523 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 37 [2018-09-28 09:56:01,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:01,523 INFO L225 Difference]: With dead ends: 42 [2018-09-28 09:56:01,523 INFO L226 Difference]: Without dead ends: 41 [2018-09-28 09:56:01,524 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=101, Invalid=1539, Unknown=0, NotChecked=0, Total=1640 [2018-09-28 09:56:01,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-28 09:56:01,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-09-28 09:56:01,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-09-28 09:56:01,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-09-28 09:56:01,530 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2018-09-28 09:56:01,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:01,530 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-09-28 09:56:01,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-28 09:56:01,530 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-09-28 09:56:01,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-09-28 09:56:01,531 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:01,531 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 1, 1] [2018-09-28 09:56:01,531 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:01,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:01,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1291894020, now seen corresponding path program 18 times [2018-09-28 09:56:01,532 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:01,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:01,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:01,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 09:56:01,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:01,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:02,444 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-28 09:56:02,445 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:56:02,445 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-28 09:56:02,452 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-28 09:56:02,474 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-09-28 09:56:02,474 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 09:56:02,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:56:02,484 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-28 09:56:02,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:56:02,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:56:02,487 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:56:03,189 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-28 09:56:03,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:56:03,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:56:03,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:56:03,219 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-28 09:56:03,239 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:56:03,239 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2018-09-28 09:56:03,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-09-28 09:56:03,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-09-28 09:56:03,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1700, Unknown=0, NotChecked=0, Total=1806 [2018-09-28 09:56:03,240 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 43 states. [2018-09-28 09:56:04,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:04,184 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-09-28 09:56:04,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-28 09:56:04,184 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 39 [2018-09-28 09:56:04,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:04,185 INFO L225 Difference]: With dead ends: 44 [2018-09-28 09:56:04,186 INFO L226 Difference]: Without dead ends: 43 [2018-09-28 09:56:04,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=106, Invalid=1700, Unknown=0, NotChecked=0, Total=1806 [2018-09-28 09:56:04,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-09-28 09:56:04,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-09-28 09:56:04,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-09-28 09:56:04,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-09-28 09:56:04,190 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2018-09-28 09:56:04,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:04,191 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-09-28 09:56:04,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-09-28 09:56:04,191 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-09-28 09:56:04,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-28 09:56:04,192 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:04,192 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 1, 1] [2018-09-28 09:56:04,192 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:04,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:04,192 INFO L82 PathProgramCache]: Analyzing trace with hash 264605766, now seen corresponding path program 19 times [2018-09-28 09:56:04,192 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:04,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:04,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:04,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 09:56:04,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:04,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:04,844 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-28 09:56:04,844 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:56:04,844 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-28 09:56:04,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:56:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:04,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:56:04,877 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-28 09:56:04,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:56:04,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:56:04,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:56:05,878 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-28 09:56:05,878 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:56:05,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:56:05,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:56:05,943 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-28 09:56:05,964 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:56:05,964 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 43 [2018-09-28 09:56:05,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-09-28 09:56:05,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-09-28 09:56:05,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1869, Unknown=0, NotChecked=0, Total=1980 [2018-09-28 09:56:05,965 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 45 states. [2018-09-28 09:56:06,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:06,885 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-09-28 09:56:06,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-28 09:56:06,886 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 41 [2018-09-28 09:56:06,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:06,886 INFO L225 Difference]: With dead ends: 46 [2018-09-28 09:56:06,886 INFO L226 Difference]: Without dead ends: 45 [2018-09-28 09:56:06,888 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-28 09:56:06,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-09-28 09:56:06,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-09-28 09:56:06,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-09-28 09:56:06,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-09-28 09:56:06,895 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2018-09-28 09:56:06,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:06,895 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-09-28 09:56:06,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-09-28 09:56:06,895 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-09-28 09:56:06,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-28 09:56:06,896 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:06,896 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 1, 1] [2018-09-28 09:56:06,896 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:06,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:06,897 INFO L82 PathProgramCache]: Analyzing trace with hash 883071752, now seen corresponding path program 20 times [2018-09-28 09:56:06,897 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:06,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:06,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:06,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:56:06,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:06,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:07,731 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-28 09:56:07,731 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:56:07,731 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-28 09:56:07,740 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-28 09:56:07,754 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-28 09:56:07,754 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 09:56:07,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:56:07,760 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-28 09:56:07,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:56:07,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:56:07,766 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:56:08,599 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-28 09:56:08,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:56:08,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:56:08,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:56:08,635 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-28 09:56:08,658 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:56:08,658 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 45 [2018-09-28 09:56:08,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-28 09:56:08,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-28 09:56:08,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=2046, Unknown=0, NotChecked=0, Total=2162 [2018-09-28 09:56:08,659 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 47 states. [2018-09-28 09:56:09,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:09,825 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-09-28 09:56:09,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-28 09:56:09,826 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 43 [2018-09-28 09:56:09,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:09,827 INFO L225 Difference]: With dead ends: 48 [2018-09-28 09:56:09,827 INFO L226 Difference]: Without dead ends: 47 [2018-09-28 09:56:09,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=116, Invalid=2046, Unknown=0, NotChecked=0, Total=2162 [2018-09-28 09:56:09,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-28 09:56:09,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-09-28 09:56:09,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-28 09:56:09,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-09-28 09:56:09,834 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2018-09-28 09:56:09,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:09,834 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-09-28 09:56:09,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-28 09:56:09,834 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-09-28 09:56:09,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-28 09:56:09,836 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:09,836 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 1, 1] [2018-09-28 09:56:09,836 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:09,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:09,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1771569846, now seen corresponding path program 21 times [2018-09-28 09:56:09,836 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:09,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:09,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:09,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 09:56:09,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:09,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:10,785 WARN L178 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 18 [2018-09-28 09:56:10,922 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-28 09:56:10,922 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:56:10,922 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-28 09:56:10,930 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-28 09:56:10,970 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-09-28 09:56:10,970 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 09:56:10,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:56:10,983 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-28 09:56:10,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:56:10,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:56:10,990 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:56:11,937 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-28 09:56:11,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:56:11,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:56:11,945 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:56:11,977 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-28 09:56:11,997 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:56:11,997 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2018-09-28 09:56:11,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-09-28 09:56:11,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-09-28 09:56:11,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=2231, Unknown=0, NotChecked=0, Total=2352 [2018-09-28 09:56:11,998 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 49 states. [2018-09-28 09:56:13,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:13,261 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-09-28 09:56:13,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-28 09:56:13,264 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 45 [2018-09-28 09:56:13,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:13,265 INFO L225 Difference]: With dead ends: 50 [2018-09-28 09:56:13,265 INFO L226 Difference]: Without dead ends: 49 [2018-09-28 09:56:13,266 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=121, Invalid=2231, Unknown=0, NotChecked=0, Total=2352 [2018-09-28 09:56:13,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-28 09:56:13,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-09-28 09:56:13,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-09-28 09:56:13,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-09-28 09:56:13,271 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2018-09-28 09:56:13,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:13,271 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-09-28 09:56:13,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-09-28 09:56:13,271 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-09-28 09:56:13,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-09-28 09:56:13,272 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:13,272 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 1, 1] [2018-09-28 09:56:13,273 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:13,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:13,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1671571700, now seen corresponding path program 22 times [2018-09-28 09:56:13,273 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:13,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:13,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:13,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 09:56:13,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:13,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:13,562 WARN L178 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-28 09:56:13,814 WARN L178 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-28 09:56:14,110 WARN L178 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-28 09:56:14,420 WARN L178 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-28 09:56:14,731 WARN L178 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-28 09:56:15,506 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-28 09:56:15,506 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:56:15,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 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-28 09:56:15,513 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-28 09:56:15,528 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-28 09:56:15,528 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 09:56:15,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:56:15,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-28 09:56:15,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:56:15,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:56:15,543 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:56:16,745 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-28 09:56:16,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:56:16,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:56:16,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:56:16,783 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-28 09:56:16,803 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:56:16,803 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 49 [2018-09-28 09:56:16,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-09-28 09:56:16,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-09-28 09:56:16,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=2424, Unknown=0, NotChecked=0, Total=2550 [2018-09-28 09:56:16,805 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 51 states. [2018-09-28 09:56:18,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:18,323 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-09-28 09:56:18,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-28 09:56:18,324 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 47 [2018-09-28 09:56:18,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:18,325 INFO L225 Difference]: With dead ends: 52 [2018-09-28 09:56:18,325 INFO L226 Difference]: Without dead ends: 51 [2018-09-28 09:56:18,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=126, Invalid=2424, Unknown=0, NotChecked=0, Total=2550 [2018-09-28 09:56:18,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-28 09:56:18,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-09-28 09:56:18,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-09-28 09:56:18,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-09-28 09:56:18,331 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2018-09-28 09:56:18,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:18,331 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-09-28 09:56:18,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-09-28 09:56:18,332 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-09-28 09:56:18,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-09-28 09:56:18,332 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:18,332 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 1, 1] [2018-09-28 09:56:18,333 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:18,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:18,333 INFO L82 PathProgramCache]: Analyzing trace with hash -62633906, now seen corresponding path program 23 times [2018-09-28 09:56:18,333 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:18,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:18,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:18,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 09:56:18,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:18,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:19,205 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-28 09:56:19,205 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:56:19,205 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-28 09:56:19,212 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-28 09:56:19,235 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-09-28 09:56:19,236 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 09:56:19,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:56:19,240 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-28 09:56:19,241 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:56:19,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:56:19,249 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:56:20,165 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-28 09:56:20,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:56:20,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:56:20,170 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:56:20,203 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-28 09:56:20,223 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:56:20,224 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 51 [2018-09-28 09:56:20,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-28 09:56:20,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-28 09:56:20,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=2625, Unknown=0, NotChecked=0, Total=2756 [2018-09-28 09:56:20,225 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 53 states. [2018-09-28 09:56:21,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:21,650 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-09-28 09:56:21,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-28 09:56:21,650 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 49 [2018-09-28 09:56:21,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:21,651 INFO L225 Difference]: With dead ends: 54 [2018-09-28 09:56:21,651 INFO L226 Difference]: Without dead ends: 53 [2018-09-28 09:56:21,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=131, Invalid=2625, Unknown=0, NotChecked=0, Total=2756 [2018-09-28 09:56:21,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-28 09:56:21,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-09-28 09:56:21,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-28 09:56:21,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-09-28 09:56:21,657 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2018-09-28 09:56:21,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:21,657 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-09-28 09:56:21,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-28 09:56:21,657 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-09-28 09:56:21,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-09-28 09:56:21,658 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:21,658 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 1, 1] [2018-09-28 09:56:21,658 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:21,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:21,658 INFO L82 PathProgramCache]: Analyzing trace with hash -61640432, now seen corresponding path program 24 times [2018-09-28 09:56:21,658 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:21,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:21,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:21,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 09:56:21,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:21,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:21,925 WARN L178 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-28 09:56:22,158 WARN L178 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-28 09:56:23,147 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-28 09:56:23,147 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:56:23,147 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-28 09:56:23,155 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-28 09:56:23,186 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-09-28 09:56:23,187 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 09:56:23,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:56:23,191 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-28 09:56:23,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:56:23,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:56:23,200 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:56:24,191 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-28 09:56:24,192 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:56:24,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:56:24,203 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:56:24,246 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-28 09:56:24,266 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:56:24,266 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 53 [2018-09-28 09:56:24,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-09-28 09:56:24,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-09-28 09:56:24,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=2834, Unknown=0, NotChecked=0, Total=2970 [2018-09-28 09:56:24,268 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 55 states. [2018-09-28 09:56:25,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:25,500 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-09-28 09:56:25,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-28 09:56:25,500 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 51 [2018-09-28 09:56:25,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:25,501 INFO L225 Difference]: With dead ends: 56 [2018-09-28 09:56:25,501 INFO L226 Difference]: Without dead ends: 55 [2018-09-28 09:56:25,503 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-28 09:56:25,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-28 09:56:25,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-09-28 09:56:25,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-09-28 09:56:25,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-09-28 09:56:25,507 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2018-09-28 09:56:25,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:25,507 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-09-28 09:56:25,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-09-28 09:56:25,507 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-09-28 09:56:25,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-28 09:56:25,508 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:25,508 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 1, 1] [2018-09-28 09:56:25,509 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:25,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:25,509 INFO L82 PathProgramCache]: Analyzing trace with hash 893088082, now seen corresponding path program 25 times [2018-09-28 09:56:25,509 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:25,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:25,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:25,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 09:56:25,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:25,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:25,763 WARN L178 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-28 09:56:26,894 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-28 09:56:26,895 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:56:26,895 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-28 09:56:26,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:56:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:26,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:56:26,934 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-28 09:56:26,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:56:26,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:56:26,985 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:56:28,027 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-28 09:56:28,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:56:28,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:56:28,045 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:56:28,086 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-28 09:56:28,108 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:56:28,108 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 55 [2018-09-28 09:56:28,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-09-28 09:56:28,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-09-28 09:56:28,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=3051, Unknown=0, NotChecked=0, Total=3192 [2018-09-28 09:56:28,110 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 57 states. [2018-09-28 09:56:29,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:29,408 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-09-28 09:56:29,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-28 09:56:29,408 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 53 [2018-09-28 09:56:29,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:29,409 INFO L225 Difference]: With dead ends: 58 [2018-09-28 09:56:29,409 INFO L226 Difference]: Without dead ends: 57 [2018-09-28 09:56:29,411 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=141, Invalid=3051, Unknown=0, NotChecked=0, Total=3192 [2018-09-28 09:56:29,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-28 09:56:29,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-09-28 09:56:29,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-09-28 09:56:29,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-09-28 09:56:29,416 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2018-09-28 09:56:29,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:29,416 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-09-28 09:56:29,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-09-28 09:56:29,416 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-09-28 09:56:29,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-09-28 09:56:29,417 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:29,417 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 1, 1] [2018-09-28 09:56:29,417 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:29,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:29,417 INFO L82 PathProgramCache]: Analyzing trace with hash -735811308, now seen corresponding path program 26 times [2018-09-28 09:56:29,417 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:29,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:29,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:29,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:56:29,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:29,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:29,674 WARN L178 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-28 09:56:29,895 WARN L178 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-28 09:56:30,188 WARN L178 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-28 09:56:31,267 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-28 09:56:31,267 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:56:31,267 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-28 09:56:31,275 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-28 09:56:31,292 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-28 09:56:31,292 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 09:56:31,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:56:31,298 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-28 09:56:31,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:56:31,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:56:31,304 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:56:32,548 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-28 09:56:32,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:56:32,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:56:32,553 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:56:32,592 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-28 09:56:32,612 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:56:32,612 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 57 [2018-09-28 09:56:32,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-09-28 09:56:32,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-09-28 09:56:32,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=3276, Unknown=0, NotChecked=0, Total=3422 [2018-09-28 09:56:32,614 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 59 states. [2018-09-28 09:56:33,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:33,914 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-09-28 09:56:33,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-28 09:56:33,915 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 55 [2018-09-28 09:56:33,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:33,916 INFO L225 Difference]: With dead ends: 60 [2018-09-28 09:56:33,916 INFO L226 Difference]: Without dead ends: 59 [2018-09-28 09:56:33,917 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=146, Invalid=3276, Unknown=0, NotChecked=0, Total=3422 [2018-09-28 09:56:33,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-28 09:56:33,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-09-28 09:56:33,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-09-28 09:56:33,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-09-28 09:56:33,921 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2018-09-28 09:56:33,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:33,921 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-09-28 09:56:33,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-09-28 09:56:33,921 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-09-28 09:56:33,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-09-28 09:56:33,921 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:33,921 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 1, 1] [2018-09-28 09:56:33,922 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:33,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:33,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1554937942, now seen corresponding path program 27 times [2018-09-28 09:56:33,922 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:33,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:33,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:33,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 09:56:33,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:35,042 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-28 09:56:35,042 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:56:35,042 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-28 09:56:35,050 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-28 09:56:35,084 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-09-28 09:56:35,084 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 09:56:35,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:56:35,089 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-28 09:56:35,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:56:35,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:56:35,096 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:56:36,572 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-28 09:56:36,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:56:36,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:56:36,579 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:56:36,621 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-28 09:56:36,641 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:56:36,641 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 59 [2018-09-28 09:56:36,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-09-28 09:56:36,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-09-28 09:56:36,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=3509, Unknown=0, NotChecked=0, Total=3660 [2018-09-28 09:56:36,642 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 61 states. [2018-09-28 09:56:38,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:38,060 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-09-28 09:56:38,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-28 09:56:38,061 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 57 [2018-09-28 09:56:38,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:38,062 INFO L225 Difference]: With dead ends: 62 [2018-09-28 09:56:38,062 INFO L226 Difference]: Without dead ends: 61 [2018-09-28 09:56:38,063 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=151, Invalid=3509, Unknown=0, NotChecked=0, Total=3660 [2018-09-28 09:56:38,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-28 09:56:38,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-09-28 09:56:38,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-09-28 09:56:38,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-09-28 09:56:38,067 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2018-09-28 09:56:38,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:38,067 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-09-28 09:56:38,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-09-28 09:56:38,068 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-09-28 09:56:38,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-09-28 09:56:38,068 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:38,068 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 1, 1] [2018-09-28 09:56:38,069 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:38,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:38,069 INFO L82 PathProgramCache]: Analyzing trace with hash -353255656, now seen corresponding path program 28 times [2018-09-28 09:56:38,069 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:38,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:38,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:38,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 09:56:38,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:39,129 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-28 09:56:39,129 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:56:39,130 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) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-28 09:56:39,138 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-28 09:56:39,156 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-28 09:56:39,156 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 09:56:39,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:56:39,161 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-28 09:56:39,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:56:39,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:56:39,179 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:56:40,465 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-28 09:56:40,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:56:40,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:56:40,469 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:56:40,512 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-28 09:56:40,532 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:56:40,532 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 61 [2018-09-28 09:56:40,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-09-28 09:56:40,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-09-28 09:56:40,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=3750, Unknown=0, NotChecked=0, Total=3906 [2018-09-28 09:56:40,533 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 63 states. [2018-09-28 09:56:42,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:42,558 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-09-28 09:56:42,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-28 09:56:42,559 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 59 [2018-09-28 09:56:42,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:42,560 INFO L225 Difference]: With dead ends: 64 [2018-09-28 09:56:42,560 INFO L226 Difference]: Without dead ends: 63 [2018-09-28 09:56:42,561 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=156, Invalid=3750, Unknown=0, NotChecked=0, Total=3906 [2018-09-28 09:56:42,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-28 09:56:42,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2018-09-28 09:56:42,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-09-28 09:56:42,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-09-28 09:56:42,564 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2018-09-28 09:56:42,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:42,565 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-09-28 09:56:42,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-09-28 09:56:42,565 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-09-28 09:56:42,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-28 09:56:42,565 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:42,565 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 1, 1] [2018-09-28 09:56:42,566 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:42,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:42,566 INFO L82 PathProgramCache]: Analyzing trace with hash -176267942, now seen corresponding path program 29 times [2018-09-28 09:56:42,566 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:42,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:42,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:42,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 09:56:42,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:42,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:42,819 WARN L178 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-28 09:56:43,902 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-28 09:56:43,902 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:56:43,902 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-28 09:56:43,911 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-28 09:56:43,943 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-09-28 09:56:43,943 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 09:56:43,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:56:43,952 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-28 09:56:43,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:56:43,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:56:43,960 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:56:45,329 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-28 09:56:45,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:56:45,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:56:45,334 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:56:45,381 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-28 09:56:45,401 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:56:45,401 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 63 [2018-09-28 09:56:45,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-09-28 09:56:45,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-09-28 09:56:45,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=3999, Unknown=0, NotChecked=0, Total=4160 [2018-09-28 09:56:45,402 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 65 states. [2018-09-28 09:56:47,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:47,880 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-09-28 09:56:47,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-28 09:56:47,881 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 61 [2018-09-28 09:56:47,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:47,882 INFO L225 Difference]: With dead ends: 66 [2018-09-28 09:56:47,882 INFO L226 Difference]: Without dead ends: 65 [2018-09-28 09:56:47,883 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=161, Invalid=3999, Unknown=0, NotChecked=0, Total=4160 [2018-09-28 09:56:47,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-09-28 09:56:47,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-09-28 09:56:47,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-28 09:56:47,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-09-28 09:56:47,888 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2018-09-28 09:56:47,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:47,888 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-09-28 09:56:47,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-09-28 09:56:47,888 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-09-28 09:56:47,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-09-28 09:56:47,889 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:47,889 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 1, 1] [2018-09-28 09:56:47,889 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:47,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:47,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1889766628, now seen corresponding path program 30 times [2018-09-28 09:56:47,889 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:47,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:47,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:47,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 09:56:47,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:47,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:48,156 WARN L178 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-28 09:56:48,312 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-28 09:56:49,382 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-28 09:56:49,382 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:56:49,382 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-28 09:56:49,392 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-28 09:56:49,441 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-09-28 09:56:49,441 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 09:56:49,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:56:49,467 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-28 09:56:49,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:56:49,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:56:49,471 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:56:50,949 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-28 09:56:50,949 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:56:50,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:56:50,954 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:56:51,001 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-28 09:56:51,023 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:56:51,023 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 65 [2018-09-28 09:56:51,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-09-28 09:56:51,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-09-28 09:56:51,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=4256, Unknown=0, NotChecked=0, Total=4422 [2018-09-28 09:56:51,024 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 67 states. [2018-09-28 09:56:52,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:52,887 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-09-28 09:56:52,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-28 09:56:52,888 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 63 [2018-09-28 09:56:52,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:52,889 INFO L225 Difference]: With dead ends: 68 [2018-09-28 09:56:52,889 INFO L226 Difference]: Without dead ends: 67 [2018-09-28 09:56:52,890 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=166, Invalid=4256, Unknown=0, NotChecked=0, Total=4422 [2018-09-28 09:56:52,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-28 09:56:52,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-09-28 09:56:52,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-09-28 09:56:52,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-09-28 09:56:52,897 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2018-09-28 09:56:52,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:52,897 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-09-28 09:56:52,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-09-28 09:56:52,897 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-09-28 09:56:52,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-09-28 09:56:52,898 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:52,898 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 1, 1] [2018-09-28 09:56:52,898 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:52,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:52,900 INFO L82 PathProgramCache]: Analyzing trace with hash 705437790, now seen corresponding path program 31 times [2018-09-28 09:56:52,900 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:52,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:52,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:52,901 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 09:56:52,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:52,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:53,075 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-28 09:56:54,161 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-28 09:56:54,161 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:56:54,161 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-28 09:56:54,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:56:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:54,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:56:54,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-28 09:56:54,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:56:54,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:56:54,194 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:56:55,728 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-28 09:56:55,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:56:55,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:56:55,733 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:56:55,784 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-28 09:56:55,804 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:56:55,804 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 67 [2018-09-28 09:56:55,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-09-28 09:56:55,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-09-28 09:56:55,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=4521, Unknown=0, NotChecked=0, Total=4692 [2018-09-28 09:56:55,805 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 69 states. [2018-09-28 09:56:58,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:56:58,589 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-09-28 09:56:58,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-28 09:56:58,590 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 65 [2018-09-28 09:56:58,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:56:58,591 INFO L225 Difference]: With dead ends: 70 [2018-09-28 09:56:58,591 INFO L226 Difference]: Without dead ends: 69 [2018-09-28 09:56:58,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=171, Invalid=4521, Unknown=0, NotChecked=0, Total=4692 [2018-09-28 09:56:58,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-28 09:56:58,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-09-28 09:56:58,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-09-28 09:56:58,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-09-28 09:56:58,596 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2018-09-28 09:56:58,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:56:58,597 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-09-28 09:56:58,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-09-28 09:56:58,597 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-09-28 09:56:58,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-09-28 09:56:58,597 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:56:58,597 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 1, 1] [2018-09-28 09:56:58,598 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:56:58,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:56:58,598 INFO L82 PathProgramCache]: Analyzing trace with hash -679115488, now seen corresponding path program 32 times [2018-09-28 09:56:58,598 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:56:58,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:56:58,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:58,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:56:58,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:56:58,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:56:59,880 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-28 09:56:59,881 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:56:59,881 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-28 09:56:59,888 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-28 09:56:59,908 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-28 09:56:59,908 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 09:56:59,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:56:59,913 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-28 09:56:59,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:56:59,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:56:59,926 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:57:03,193 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-28 09:57:03,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:57:03,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:57:03,199 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:57:03,251 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-28 09:57:03,272 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:57:03,272 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 69 [2018-09-28 09:57:03,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-09-28 09:57:03,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-09-28 09:57:03,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=4794, Unknown=0, NotChecked=0, Total=4970 [2018-09-28 09:57:03,273 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 71 states. [2018-09-28 09:57:05,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:57:05,508 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-09-28 09:57:05,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-28 09:57:05,509 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 67 [2018-09-28 09:57:05,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:57:05,509 INFO L225 Difference]: With dead ends: 72 [2018-09-28 09:57:05,510 INFO L226 Difference]: Without dead ends: 71 [2018-09-28 09:57:05,510 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=176, Invalid=4794, Unknown=0, NotChecked=0, Total=4970 [2018-09-28 09:57:05,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-09-28 09:57:05,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2018-09-28 09:57:05,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-09-28 09:57:05,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-09-28 09:57:05,514 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2018-09-28 09:57:05,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:57:05,514 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-09-28 09:57:05,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-09-28 09:57:05,515 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-09-28 09:57:05,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-09-28 09:57:05,515 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:57:05,515 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 1, 1] [2018-09-28 09:57:05,515 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:57:05,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:57:05,516 INFO L82 PathProgramCache]: Analyzing trace with hash 205046114, now seen corresponding path program 33 times [2018-09-28 09:57:05,516 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:57:05,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:57:05,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:05,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 09:57:05,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:05,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:57:05,760 WARN L178 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-28 09:57:07,069 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-28 09:57:07,070 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:57:07,070 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-28 09:57:07,076 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-28 09:57:07,151 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-09-28 09:57:07,152 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 09:57:07,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:57:07,167 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-28 09:57:07,167 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:57:07,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:57:07,178 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:57:08,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-28 09:57:08,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:57:08,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:57:08,972 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:57:09,024 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-28 09:57:09,044 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:57:09,044 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 71 [2018-09-28 09:57:09,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-09-28 09:57:09,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-09-28 09:57:09,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=5075, Unknown=0, NotChecked=0, Total=5256 [2018-09-28 09:57:09,045 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 73 states. [2018-09-28 09:57:11,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:57:11,090 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-09-28 09:57:11,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-28 09:57:11,091 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 69 [2018-09-28 09:57:11,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:57:11,092 INFO L225 Difference]: With dead ends: 74 [2018-09-28 09:57:11,092 INFO L226 Difference]: Without dead ends: 73 [2018-09-28 09:57:11,093 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=181, Invalid=5075, Unknown=0, NotChecked=0, Total=5256 [2018-09-28 09:57:11,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-09-28 09:57:11,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-09-28 09:57:11,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-09-28 09:57:11,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-09-28 09:57:11,097 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 69 [2018-09-28 09:57:11,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:57:11,097 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-09-28 09:57:11,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-09-28 09:57:11,097 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-09-28 09:57:11,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-28 09:57:11,098 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:57:11,098 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 1, 1] [2018-09-28 09:57:11,098 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:57:11,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:57:11,098 INFO L82 PathProgramCache]: Analyzing trace with hash -519178972, now seen corresponding path program 34 times [2018-09-28 09:57:11,099 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:57:11,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:57:11,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:11,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 09:57:11,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:11,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:57:11,348 WARN L178 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-28 09:57:12,856 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-28 09:57:12,857 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:57:12,857 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-28 09:57:12,864 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-28 09:57:12,888 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-28 09:57:12,888 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 09:57:12,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:57:12,893 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-28 09:57:12,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:57:12,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:57:12,900 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:57:14,702 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-28 09:57:14,702 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:57:14,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:57:14,708 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:57:14,764 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-28 09:57:14,786 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:57:14,786 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 73 [2018-09-28 09:57:14,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-09-28 09:57:14,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-09-28 09:57:14,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=5364, Unknown=0, NotChecked=0, Total=5550 [2018-09-28 09:57:14,787 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 75 states. [2018-09-28 09:57:17,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:57:17,182 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-09-28 09:57:17,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-28 09:57:17,182 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 71 [2018-09-28 09:57:17,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:57:17,183 INFO L225 Difference]: With dead ends: 76 [2018-09-28 09:57:17,183 INFO L226 Difference]: Without dead ends: 75 [2018-09-28 09:57:17,184 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=186, Invalid=5364, Unknown=0, NotChecked=0, Total=5550 [2018-09-28 09:57:17,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-28 09:57:17,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-09-28 09:57:17,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-09-28 09:57:17,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-09-28 09:57:17,187 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 71 [2018-09-28 09:57:17,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:57:17,188 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-09-28 09:57:17,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-09-28 09:57:17,188 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-09-28 09:57:17,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-09-28 09:57:17,188 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:57:17,188 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 1, 1] [2018-09-28 09:57:17,189 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:57:17,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:57:17,189 INFO L82 PathProgramCache]: Analyzing trace with hash -714784666, now seen corresponding path program 35 times [2018-09-28 09:57:17,189 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:57:17,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:57:17,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:17,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 09:57:17,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:17,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:57:18,835 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-28 09:57:18,835 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:57:18,835 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-28 09:57:18,842 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-28 09:57:19,089 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-09-28 09:57:19,089 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 09:57:19,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:57:19,094 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-28 09:57:19,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:57:19,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:57:19,100 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:57:20,998 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-28 09:57:20,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:57:21,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:57:21,003 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:57:21,059 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-28 09:57:21,080 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:57:21,080 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 75 [2018-09-28 09:57:21,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-09-28 09:57:21,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-09-28 09:57:21,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=5661, Unknown=0, NotChecked=0, Total=5852 [2018-09-28 09:57:21,081 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 77 states. [2018-09-28 09:57:23,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:57:23,915 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-09-28 09:57:23,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-28 09:57:23,916 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 73 [2018-09-28 09:57:23,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:57:23,917 INFO L225 Difference]: With dead ends: 78 [2018-09-28 09:57:23,917 INFO L226 Difference]: Without dead ends: 77 [2018-09-28 09:57:23,918 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=191, Invalid=5661, Unknown=0, NotChecked=0, Total=5852 [2018-09-28 09:57:23,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-09-28 09:57:23,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2018-09-28 09:57:23,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-09-28 09:57:23,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-09-28 09:57:23,921 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 73 [2018-09-28 09:57:23,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:57:23,922 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-09-28 09:57:23,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-09-28 09:57:23,922 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-09-28 09:57:23,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-09-28 09:57:23,922 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:57:23,922 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 1, 1] [2018-09-28 09:57:23,922 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:57:23,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:57:23,923 INFO L82 PathProgramCache]: Analyzing trace with hash 286704424, now seen corresponding path program 36 times [2018-09-28 09:57:23,923 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:57:23,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:57:23,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:23,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 09:57:23,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:57:25,479 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-28 09:57:25,479 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:57:25,479 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-28 09:57:25,486 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-28 09:57:25,538 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-09-28 09:57:25,538 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 09:57:25,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:57:25,543 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-28 09:57:25,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:57:25,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:57:25,549 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:57:27,864 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-28 09:57:27,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:57:27,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:57:27,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:57:27,925 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-28 09:57:27,945 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:57:27,945 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 77 [2018-09-28 09:57:27,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-09-28 09:57:27,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-09-28 09:57:27,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=5966, Unknown=0, NotChecked=0, Total=6162 [2018-09-28 09:57:27,946 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 79 states. [2018-09-28 09:57:30,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:57:30,465 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-09-28 09:57:30,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-28 09:57:30,466 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 75 [2018-09-28 09:57:30,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:57:30,467 INFO L225 Difference]: With dead ends: 80 [2018-09-28 09:57:30,467 INFO L226 Difference]: Without dead ends: 79 [2018-09-28 09:57:30,468 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 778 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=196, Invalid=5966, Unknown=0, NotChecked=0, Total=6162 [2018-09-28 09:57:30,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-28 09:57:30,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-09-28 09:57:30,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-09-28 09:57:30,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-09-28 09:57:30,471 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 75 [2018-09-28 09:57:30,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:57:30,472 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-09-28 09:57:30,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-09-28 09:57:30,472 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-09-28 09:57:30,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-09-28 09:57:30,472 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:57:30,473 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 1, 1] [2018-09-28 09:57:30,473 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:57:30,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:57:30,473 INFO L82 PathProgramCache]: Analyzing trace with hash 645045610, now seen corresponding path program 37 times [2018-09-28 09:57:30,473 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:57:30,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:57:30,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:30,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 09:57:30,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:30,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:57:30,682 WARN L178 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-28 09:57:32,199 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-28 09:57:32,199 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:57:32,200 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-28 09:57:32,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:57:32,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:57:32,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:57:32,247 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-28 09:57:32,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:57:32,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:57:32,255 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:57:34,653 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-28 09:57:34,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:57:34,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:57:34,658 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:57:34,718 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-28 09:57:34,738 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:57:34,738 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 79 [2018-09-28 09:57:34,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-09-28 09:57:34,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-09-28 09:57:34,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=6279, Unknown=0, NotChecked=0, Total=6480 [2018-09-28 09:57:34,739 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 81 states. [2018-09-28 09:57:37,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:57:37,513 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-09-28 09:57:37,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-28 09:57:37,513 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 77 [2018-09-28 09:57:37,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:57:37,514 INFO L225 Difference]: With dead ends: 82 [2018-09-28 09:57:37,514 INFO L226 Difference]: Without dead ends: 81 [2018-09-28 09:57:37,515 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=201, Invalid=6279, Unknown=0, NotChecked=0, Total=6480 [2018-09-28 09:57:37,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-09-28 09:57:37,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2018-09-28 09:57:37,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-09-28 09:57:37,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-09-28 09:57:37,520 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 77 [2018-09-28 09:57:37,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:57:37,520 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-09-28 09:57:37,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-09-28 09:57:37,520 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-09-28 09:57:37,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-09-28 09:57:37,521 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:57:37,521 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 1, 1] [2018-09-28 09:57:37,521 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:57:37,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:57:37,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1413541676, now seen corresponding path program 38 times [2018-09-28 09:57:37,521 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:57:37,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:57:37,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:37,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:57:37,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:37,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:57:39,394 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-28 09:57:39,395 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:57:39,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 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-28 09:57:39,403 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-28 09:57:39,429 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-28 09:57:39,429 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 09:57:39,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:57:39,450 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-28 09:57:39,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:57:39,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:57:39,487 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:57:41,722 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-28 09:57:41,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:57:41,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:57:41,727 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:57:41,787 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-28 09:57:41,807 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:57:41,807 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 81 [2018-09-28 09:57:41,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-09-28 09:57:41,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-09-28 09:57:41,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=6600, Unknown=0, NotChecked=0, Total=6806 [2018-09-28 09:57:41,809 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 83 states. [2018-09-28 09:57:45,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:57:45,373 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-09-28 09:57:45,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-28 09:57:45,374 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 79 [2018-09-28 09:57:45,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:57:45,375 INFO L225 Difference]: With dead ends: 84 [2018-09-28 09:57:45,375 INFO L226 Difference]: Without dead ends: 83 [2018-09-28 09:57:45,376 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 859 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=206, Invalid=6600, Unknown=0, NotChecked=0, Total=6806 [2018-09-28 09:57:45,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-09-28 09:57:45,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2018-09-28 09:57:45,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-09-28 09:57:45,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-09-28 09:57:45,379 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 79 [2018-09-28 09:57:45,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:57:45,379 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-09-28 09:57:45,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-09-28 09:57:45,380 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-09-28 09:57:45,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-09-28 09:57:45,380 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:57:45,380 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 1, 1] [2018-09-28 09:57:45,380 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:57:45,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:57:45,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1203886190, now seen corresponding path program 39 times [2018-09-28 09:57:45,381 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:57:45,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:57:45,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:45,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 09:57:45,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:57:45,655 WARN L178 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-28 09:57:47,274 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-28 09:57:47,274 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:57:47,275 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-28 09:57:47,281 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-28 09:57:47,342 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-09-28 09:57:47,343 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 09:57:47,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:57:47,352 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-28 09:57:47,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:57:47,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:57:47,370 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:57:49,962 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-28 09:57:49,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:57:49,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:57:49,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:57:50,033 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-28 09:57:50,053 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:57:50,053 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 83 [2018-09-28 09:57:50,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-09-28 09:57:50,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-09-28 09:57:50,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=6929, Unknown=0, NotChecked=0, Total=7140 [2018-09-28 09:57:50,055 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 85 states. [2018-09-28 09:57:53,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:57:53,612 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-09-28 09:57:53,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-28 09:57:53,613 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 81 [2018-09-28 09:57:53,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:57:53,614 INFO L225 Difference]: With dead ends: 86 [2018-09-28 09:57:53,614 INFO L226 Difference]: Without dead ends: 85 [2018-09-28 09:57:53,615 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=211, Invalid=6929, Unknown=0, NotChecked=0, Total=7140 [2018-09-28 09:57:53,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-28 09:57:53,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-09-28 09:57:53,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-09-28 09:57:53,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-09-28 09:57:53,619 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 81 [2018-09-28 09:57:53,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:57:53,619 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-09-28 09:57:53,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-09-28 09:57:53,620 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-09-28 09:57:53,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-09-28 09:57:53,620 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:57:53,620 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 1, 1] [2018-09-28 09:57:53,620 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:57:53,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:57:53,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1588427056, now seen corresponding path program 40 times [2018-09-28 09:57:53,621 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:57:53,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:57:53,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:53,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 09:57:53,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:57:53,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:57:55,482 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-28 09:57:55,482 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:57:55,482 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-28 09:57:55,489 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-28 09:57:55,517 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-28 09:57:55,517 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 09:57:55,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:57:55,523 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-28 09:57:55,523 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:57:55,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:57:55,534 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:57:57,950 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-28 09:57:57,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:57:57,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:57:57,954 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:57:58,023 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-28 09:57:58,043 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:57:58,043 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 85 [2018-09-28 09:57:58,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-09-28 09:57:58,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-09-28 09:57:58,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=7266, Unknown=0, NotChecked=0, Total=7482 [2018-09-28 09:57:58,044 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 87 states. [2018-09-28 09:58:01,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:58:01,723 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-09-28 09:58:01,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-28 09:58:01,724 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 83 [2018-09-28 09:58:01,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:58:01,725 INFO L225 Difference]: With dead ends: 88 [2018-09-28 09:58:01,725 INFO L226 Difference]: Without dead ends: 87 [2018-09-28 09:58:01,725 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 944 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=216, Invalid=7266, Unknown=0, NotChecked=0, Total=7482 [2018-09-28 09:58:01,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-28 09:58:01,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2018-09-28 09:58:01,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-09-28 09:58:01,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-09-28 09:58:01,730 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 83 [2018-09-28 09:58:01,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:58:01,731 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-09-28 09:58:01,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-09-28 09:58:01,731 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-09-28 09:58:01,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-09-28 09:58:01,731 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:58:01,732 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 1, 1] [2018-09-28 09:58:01,732 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:58:01,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:58:01,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1765011826, now seen corresponding path program 41 times [2018-09-28 09:58:01,732 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:58:01,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:58:01,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:58:01,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 09:58:01,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:58:01,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:58:01,916 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-28 09:58:03,825 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-28 09:58:03,825 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:58:03,825 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-28 09:58:03,834 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-28 09:58:03,878 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-09-28 09:58:03,878 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 09:58:03,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:58:03,883 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-28 09:58:03,884 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:58:03,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:58:03,892 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:58:06,400 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-28 09:58:06,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:58:06,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:58:06,406 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:58:06,477 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-28 09:58:06,497 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:58:06,497 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 87 [2018-09-28 09:58:06,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-09-28 09:58:06,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-09-28 09:58:06,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=7611, Unknown=0, NotChecked=0, Total=7832 [2018-09-28 09:58:06,499 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 89 states. [2018-09-28 09:58:09,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:58:09,677 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-09-28 09:58:09,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-28 09:58:09,678 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 85 [2018-09-28 09:58:09,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:58:09,679 INFO L225 Difference]: With dead ends: 90 [2018-09-28 09:58:09,679 INFO L226 Difference]: Without dead ends: 89 [2018-09-28 09:58:09,679 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=221, Invalid=7611, Unknown=0, NotChecked=0, Total=7832 [2018-09-28 09:58:09,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-09-28 09:58:09,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2018-09-28 09:58:09,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-09-28 09:58:09,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-09-28 09:58:09,684 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 85 [2018-09-28 09:58:09,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:58:09,684 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-09-28 09:58:09,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-09-28 09:58:09,684 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-09-28 09:58:09,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-28 09:58:09,685 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:58:09,685 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 1, 1] [2018-09-28 09:58:09,685 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:58:09,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:58:09,685 INFO L82 PathProgramCache]: Analyzing trace with hash -335716044, now seen corresponding path program 42 times [2018-09-28 09:58:09,685 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:58:09,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:58:09,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:58:09,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 09:58:09,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:58:09,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:58:09,925 WARN L178 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-28 09:58:11,715 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-28 09:58:11,715 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:58:11,716 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-28 09:58:11,723 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-28 09:58:11,785 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-09-28 09:58:11,785 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 09:58:11,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:58:11,790 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-28 09:58:11,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:58:11,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:58:11,796 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:58:14,698 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-28 09:58:14,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:58:14,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:58:14,702 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:58:14,771 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-28 09:58:14,791 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:58:14,792 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 89 [2018-09-28 09:58:14,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-09-28 09:58:14,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-09-28 09:58:14,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=7964, Unknown=0, NotChecked=0, Total=8190 [2018-09-28 09:58:14,793 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 91 states. [2018-09-28 09:58:19,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:58:19,363 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-09-28 09:58:19,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-28 09:58:19,364 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 87 [2018-09-28 09:58:19,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:58:19,365 INFO L225 Difference]: With dead ends: 92 [2018-09-28 09:58:19,365 INFO L226 Difference]: Without dead ends: 91 [2018-09-28 09:58:19,366 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1033 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=226, Invalid=7964, Unknown=0, NotChecked=0, Total=8190 [2018-09-28 09:58:19,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-09-28 09:58:19,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2018-09-28 09:58:19,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-09-28 09:58:19,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-09-28 09:58:19,369 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 87 [2018-09-28 09:58:19,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:58:19,370 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-09-28 09:58:19,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-09-28 09:58:19,370 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-09-28 09:58:19,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-09-28 09:58:19,370 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:58:19,370 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 1, 1] [2018-09-28 09:58:19,370 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:58:19,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:58:19,371 INFO L82 PathProgramCache]: Analyzing trace with hash -500569994, now seen corresponding path program 43 times [2018-09-28 09:58:19,371 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:58:19,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:58:19,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:58:19,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 09:58:19,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:58:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:58:19,666 WARN L178 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-28 09:58:19,920 WARN L178 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-28 09:58:20,183 WARN L178 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-28 09:58:20,465 WARN L178 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-28 09:58:22,410 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-28 09:58:22,410 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:58:22,410 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-28 09:58:22,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:58:22,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:58:22,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:58:22,450 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-28 09:58:22,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:58:22,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:58:22,456 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:58:25,545 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-28 09:58:25,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:58:25,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:58:25,552 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:58:25,622 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-28 09:58:25,643 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:58:25,643 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 91 [2018-09-28 09:58:25,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-09-28 09:58:25,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-09-28 09:58:25,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=8325, Unknown=0, NotChecked=0, Total=8556 [2018-09-28 09:58:25,645 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 93 states. [2018-09-28 09:58:30,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:58:30,440 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-09-28 09:58:30,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-28 09:58:30,441 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 89 [2018-09-28 09:58:30,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:58:30,442 INFO L225 Difference]: With dead ends: 94 [2018-09-28 09:58:30,442 INFO L226 Difference]: Without dead ends: 93 [2018-09-28 09:58:30,443 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=231, Invalid=8325, Unknown=0, NotChecked=0, Total=8556 [2018-09-28 09:58:30,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-28 09:58:30,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-09-28 09:58:30,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-09-28 09:58:30,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-09-28 09:58:30,447 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 89 [2018-09-28 09:58:30,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:58:30,447 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-09-28 09:58:30,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-09-28 09:58:30,448 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-09-28 09:58:30,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-09-28 09:58:30,448 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:58:30,448 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 1, 1] [2018-09-28 09:58:30,448 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:58:30,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:58:30,449 INFO L82 PathProgramCache]: Analyzing trace with hash -11425992, now seen corresponding path program 44 times [2018-09-28 09:58:30,449 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:58:30,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:58:30,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:58:30,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:58:30,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:58:30,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:58:30,721 WARN L178 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-28 09:58:32,674 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-28 09:58:32,674 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:58:32,675 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-28 09:58:32,682 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-28 09:58:32,711 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-28 09:58:32,711 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 09:58:32,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:58:32,719 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-28 09:58:32,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:58:32,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:58:32,726 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:58:35,961 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-28 09:58:35,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:58:35,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:58:35,965 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:58:36,038 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-28 09:58:36,058 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:58:36,058 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 93 [2018-09-28 09:58:36,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-09-28 09:58:36,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-09-28 09:58:36,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=8694, Unknown=0, NotChecked=0, Total=8930 [2018-09-28 09:58:36,059 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 95 states. [2018-09-28 09:58:40,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:58:40,953 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-09-28 09:58:40,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-28 09:58:40,954 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 91 [2018-09-28 09:58:40,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:58:40,954 INFO L225 Difference]: With dead ends: 96 [2018-09-28 09:58:40,955 INFO L226 Difference]: Without dead ends: 95 [2018-09-28 09:58:40,955 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=236, Invalid=8694, Unknown=0, NotChecked=0, Total=8930 [2018-09-28 09:58:40,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-09-28 09:58:40,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-09-28 09:58:40,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-09-28 09:58:40,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-09-28 09:58:40,960 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 91 [2018-09-28 09:58:40,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:58:40,961 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-09-28 09:58:40,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-09-28 09:58:40,961 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-09-28 09:58:40,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-09-28 09:58:40,961 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:58:40,961 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 1, 1] [2018-09-28 09:58:40,962 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:58:40,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:58:40,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1904524666, now seen corresponding path program 45 times [2018-09-28 09:58:40,962 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:58:40,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:58:40,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:58:40,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 09:58:40,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:58:40,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:58:41,143 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-28 09:58:43,142 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-28 09:58:43,142 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:58:43,142 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-28 09:58:43,151 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-28 09:58:43,250 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-09-28 09:58:43,250 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 09:58:43,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:58:43,260 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-28 09:58:43,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:58:43,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:58:43,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:58:46,504 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-28 09:58:46,505 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:58:46,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:58:46,509 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:58:46,584 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-28 09:58:46,604 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:58:46,604 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 95 [2018-09-28 09:58:46,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-09-28 09:58:46,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-09-28 09:58:46,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=9071, Unknown=0, NotChecked=0, Total=9312 [2018-09-28 09:58:46,605 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 97 states. [2018-09-28 09:58:51,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:58:51,952 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-09-28 09:58:51,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-28 09:58:51,953 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 93 [2018-09-28 09:58:51,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:58:51,954 INFO L225 Difference]: With dead ends: 98 [2018-09-28 09:58:51,954 INFO L226 Difference]: Without dead ends: 97 [2018-09-28 09:58:51,954 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1174 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=241, Invalid=9071, Unknown=0, NotChecked=0, Total=9312 [2018-09-28 09:58:51,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-09-28 09:58:51,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-09-28 09:58:51,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-09-28 09:58:51,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-09-28 09:58:51,959 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 93 [2018-09-28 09:58:51,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:58:51,960 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-09-28 09:58:51,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-09-28 09:58:51,960 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-09-28 09:58:51,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-09-28 09:58:51,960 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:58:51,960 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 1, 1] [2018-09-28 09:58:51,961 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:58:51,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:58:51,961 INFO L82 PathProgramCache]: Analyzing trace with hash 592137020, now seen corresponding path program 46 times [2018-09-28 09:58:51,961 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:58:51,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:58:51,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:58:51,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 09:58:51,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:58:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:58:52,208 WARN L178 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-28 09:58:52,443 WARN L178 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-28 09:58:52,682 WARN L178 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-28 09:58:52,951 WARN L178 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-28 09:58:55,112 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-28 09:58:55,112 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:58:55,112 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-28 09:58:55,119 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-28 09:58:55,151 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-28 09:58:55,151 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 09:58:55,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:58:55,158 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-28 09:58:55,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:58:55,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:58:55,170 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:58:58,306 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-28 09:58:58,307 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:58:58,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:58:58,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:58:58,388 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-28 09:58:58,408 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:58:58,408 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 97 [2018-09-28 09:58:58,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-09-28 09:58:58,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-09-28 09:58:58,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=9456, Unknown=0, NotChecked=0, Total=9702 [2018-09-28 09:58:58,409 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 99 states. [2018-09-28 09:59:02,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:59:02,891 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-09-28 09:59:02,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-28 09:59:02,892 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 95 [2018-09-28 09:59:02,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:59:02,893 INFO L225 Difference]: With dead ends: 100 [2018-09-28 09:59:02,893 INFO L226 Difference]: Without dead ends: 99 [2018-09-28 09:59:02,894 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1223 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=246, Invalid=9456, Unknown=0, NotChecked=0, Total=9702 [2018-09-28 09:59:02,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-28 09:59:02,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2018-09-28 09:59:02,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-09-28 09:59:02,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-09-28 09:59:02,899 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 95 [2018-09-28 09:59:02,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:59:02,899 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-09-28 09:59:02,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-09-28 09:59:02,899 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-09-28 09:59:02,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-09-28 09:59:02,900 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:59:02,900 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 1, 1] [2018-09-28 09:59:02,900 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:59:02,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:59:02,900 INFO L82 PathProgramCache]: Analyzing trace with hash 2107994238, now seen corresponding path program 47 times [2018-09-28 09:59:02,901 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:59:02,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:59:02,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:59:02,901 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 09:59:02,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:59:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:59:03,084 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-28 09:59:05,362 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-28 09:59:05,362 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:59:05,362 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-28 09:59:05,369 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-28 09:59:05,451 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-09-28 09:59:05,451 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 09:59:05,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:59:05,482 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-28 09:59:05,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:59:05,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:59:05,553 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:59:10,090 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-28 09:59:10,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:59:10,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:59:10,098 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:59:10,297 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-28 09:59:10,318 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:59:10,318 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 99 [2018-09-28 09:59:10,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-09-28 09:59:10,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-09-28 09:59:10,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=9849, Unknown=0, NotChecked=0, Total=10100 [2018-09-28 09:59:10,320 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 101 states. [2018-09-28 09:59:14,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:59:14,067 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-09-28 09:59:14,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-28 09:59:14,068 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 97 [2018-09-28 09:59:14,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:59:14,069 INFO L225 Difference]: With dead ends: 102 [2018-09-28 09:59:14,069 INFO L226 Difference]: Without dead ends: 101 [2018-09-28 09:59:14,069 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1273 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=251, Invalid=9849, Unknown=0, NotChecked=0, Total=10100 [2018-09-28 09:59:14,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-09-28 09:59:14,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-09-28 09:59:14,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-09-28 09:59:14,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-09-28 09:59:14,074 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 97 [2018-09-28 09:59:14,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:59:14,074 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-09-28 09:59:14,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-09-28 09:59:14,075 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-09-28 09:59:14,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-09-28 09:59:14,075 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:59:14,075 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 1, 1] [2018-09-28 09:59:14,075 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:59:14,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:59:14,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1442099904, now seen corresponding path program 48 times [2018-09-28 09:59:14,076 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:59:14,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:59:14,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:59:14,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 09:59:14,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:59:14,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:59:16,575 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-28 09:59:16,575 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:59:16,575 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-28 09:59:16,583 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-28 09:59:16,662 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-09-28 09:59:16,662 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-28 09:59:16,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:59:16,667 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-28 09:59:16,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:59:16,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:59:16,673 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:59:20,074 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-28 09:59:20,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:59:20,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:59:20,085 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:59:20,294 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-28 09:59:20,314 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:59:20,314 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 101 [2018-09-28 09:59:20,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-09-28 09:59:20,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-09-28 09:59:20,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=10250, Unknown=0, NotChecked=0, Total=10506 [2018-09-28 09:59:20,315 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 103 states. [2018-09-28 09:59:26,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:59:26,467 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-09-28 09:59:26,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-28 09:59:26,468 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 99 [2018-09-28 09:59:26,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:59:26,469 INFO L225 Difference]: With dead ends: 104 [2018-09-28 09:59:26,469 INFO L226 Difference]: Without dead ends: 103 [2018-09-28 09:59:26,470 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1324 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=256, Invalid=10250, Unknown=0, NotChecked=0, Total=10506 [2018-09-28 09:59:26,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-09-28 09:59:26,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2018-09-28 09:59:26,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-09-28 09:59:26,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-09-28 09:59:26,475 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 99 [2018-09-28 09:59:26,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:59:26,475 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-09-28 09:59:26,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-09-28 09:59:26,475 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-09-28 09:59:26,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-09-28 09:59:26,476 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:59:26,476 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 1, 1] [2018-09-28 09:59:26,476 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:59:26,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:59:26,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1416429954, now seen corresponding path program 49 times [2018-09-28 09:59:26,477 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:59:26,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:59:26,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:59:26,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-28 09:59:26,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:59:26,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:59:28,843 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-28 09:59:28,843 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-28 09:59:28,843 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-28 09:59:28,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:59:28,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:59:28,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-28 09:59:28,884 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-28 09:59:28,884 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:59:28,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:59:28,891 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-09-28 09:59:32,688 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-28 09:59:32,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-28 09:59:32,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-28 09:59:32,694 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-09-28 09:59:32,773 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-28 09:59:32,793 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-28 09:59:32,793 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 103 [2018-09-28 09:59:32,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-09-28 09:59:32,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-09-28 09:59:32,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=10659, Unknown=0, NotChecked=0, Total=10920 [2018-09-28 09:59:32,795 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 105 states. [2018-09-28 09:59:38,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-28 09:59:38,146 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-09-28 09:59:38,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-28 09:59:38,147 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 101 [2018-09-28 09:59:38,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-28 09:59:38,148 INFO L225 Difference]: With dead ends: 106 [2018-09-28 09:59:38,148 INFO L226 Difference]: Without dead ends: 105 [2018-09-28 09:59:38,149 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=261, Invalid=10659, Unknown=0, NotChecked=0, Total=10920 [2018-09-28 09:59:38,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-09-28 09:59:38,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2018-09-28 09:59:38,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-09-28 09:59:38,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-09-28 09:59:38,154 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 101 [2018-09-28 09:59:38,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-28 09:59:38,154 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-09-28 09:59:38,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-09-28 09:59:38,154 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-09-28 09:59:38,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-09-28 09:59:38,155 INFO L367 BasicCegarLoop]: Found error trace [2018-09-28 09:59:38,155 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 1, 1] [2018-09-28 09:59:38,155 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-28 09:59:38,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-28 09:59:38,156 INFO L82 PathProgramCache]: Analyzing trace with hash -315445948, now seen corresponding path program 50 times [2018-09-28 09:59:38,156 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-28 09:59:38,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-28 09:59:38,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:59:38,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-28 09:59:38,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-28 09:59:38,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-28 09:59:38,344 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 18 Received shutdown request... [2018-09-28 09:59:39,855 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-28 09:59:39,860 WARN L206 ceAbstractionStarter]: Timeout [2018-09-28 09:59:39,860 INFO L202 PluginConnector]: Adding new model divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.09 09:59:39 BoogieIcfgContainer [2018-09-28 09:59:39,860 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-28 09:59:39,861 INFO L168 Benchmark]: Toolchain (without parser) took 246758.66 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -51.4 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 284.8 MB). Peak memory consumption was 233.4 MB. Max. memory is 7.1 GB. [2018-09-28 09:59:39,862 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-28 09:59:39,862 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.13 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-28 09:59:39,862 INFO L168 Benchmark]: Boogie Preprocessor took 26.76 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-28 09:59:39,862 INFO L168 Benchmark]: RCFGBuilder took 252.13 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-28 09:59:39,863 INFO L168 Benchmark]: TraceAbstraction took 246426.24 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -51.4 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 263.6 MB). Peak memory consumption was 212.2 MB. Max. memory is 7.1 GB. [2018-09-28 09:59:39,864 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 47.13 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.76 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 252.13 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 246426.24 ms. Allocated memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: -51.4 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 263.6 MB). Peak memory consumption was 212.2 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 PredicateComparison was comparing new predicate (quantifier-free) to 43 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 246.3s OverallTime, 51 OverallIterations, 51 TraceHistogramMax, 97.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 102 SDtfs, 128 SDslu, 2 SDs, 0 SdLazy, 136300 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 81.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3922 GetRequests, 1176 SyntacticMatches, 49 SemanticMatches, 2697 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24696 ImplicationChecksByTransitivity, 137.3s 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.0s SatisfiabilityAnalysisTime, 142.1s 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-28_09-59-39-872.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-28_09-59-39-872.csv Completed graceful shutdown